Slice-level signaling in video bitstreams including sub-pictures
By introducing the concept of sub-pictures and optimizing signaling notifications, the problem of improper sub-picture constraint design in video encoding and decoding is solved, improving the efficiency and quality of video encoding and decoding, and ensuring the correctness of reference picture resampling and temporal filtering.
Patent Information
- Application Number
- CN202080069924.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2019-10-02
- Filing Date
- 2020-10-09
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2040-10-09
AI Technical Summary
Existing video encoding and decoding technologies suffer from problems when processing sub-images, such as improper constraint design, excessively large signaling notification syntax elements leading to overflow, non-rectangular sub-image representation, inconsistent interaction between reference image resampling and sub-image, and improper handling of cross-sub-image sample points in temporal filtering.
By introducing the concept of sub-images, limiting their shape and position, using cropping and replacement methods to handle motion vectors and sample point positions that exceed the sub-image's range, signaling information to the sub-image, controlling loop filtering operations, ensuring the rectangularity and consistency of the sub-images, optimizing temporal filter processing, limiting the interaction between sub-images and other tools, and improving the signaling method of syntax elements.
This solves the problem of improper sub-image constraint design, avoids overflow and non-rectangular representation, improves the efficiency and quality of video encoding and decoding, and ensures the correctness of reference image resampling and temporal filtering.
Smart Images

Figure CN114556952B_ABST
Abstract
Description
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application is filed in order to timely claim the priority and benefits of International Patent Application No. PCT / CN2019 / 109809 filed on October 2, 2019, in accordance with applicable patent laws and / or the Paris Convention. For all legal purposes, the entire disclosure of the above application is incorporated by reference as part of the disclosure of this application. Technical Field
[0003] This document deals with video and image encoding and decoding techniques. Background Art
[0004] Digital video accounts for the largest use of bandwidth on the Internet and other digital communications networks. As the number of connected user devices capable of receiving and displaying video increases, bandwidth demand for digital video usage is expected to continue to grow. Summary of the invention
[0005] The disclosed techniques may be used by video or image decoder or encoder embodiments in which sub-picture based encoding or decoding is performed.
[0006] In one example aspect, a method of video processing is disclosed. The method includes: performing conversion between a video including one or more pictures and a bitstream representation of the video. The bitstream representation is required to conform to a format rule, the format rule specifying that each picture is encoded and decoded into one or more slices, and wherein the format rule prohibits samples in the picture from being overlapped by any of the one or more slices.
[0007] In another example aspect, a method of video processing is disclosed. The method includes: for conversion between a picture of a video and a bitstream representation of the video, determining a manner of signaling information of one or more slices in the picture according to a rule associated with a number of slices or a number of bricks in the picture. The method also includes performing the conversion based on the determination.
[0008] In another example aspect, a method of video processing is disclosed. The method includes: performing conversion between a picture of a video and a bitstream representation of the video according to a rule. The picture is encoded and decoded into one or more slices in the bitstream representation, and the rule specifies whether or how to include addresses of the slices of the picture in the bitstream representation.
[0009] In another example aspect, a method of video processing is disclosed. The method includes: for conversion between a picture of a video and a bitstream representation of the video, based on the number of slices or the number of tiles in the picture, determining whether a syntax element is included in the bitstream representation, the syntax element indicating that a filtering operation accessing samples on multiple tiles in the picture is enabled. The method also includes performing the conversion based on the determination.
[0010] In another example aspect, a method of video processing is disclosed. The method includes performing conversion between a picture of a video and a bitstream representation of the video, wherein the picture includes one or more sub-pictures, and wherein a number of the one or more sub-pictures is indicated by a syntax element as the bitstream representation.
[0011] In another example aspect, a method of video processing is disclosed. The method includes performing conversion between a picture of a video including one or more sub-pictures and a bitstream representation of the video. The bitstream representation conforms to a format rule that specifies that information about the sub-picture is included in the bitstream representation based on at least one of: (1) one or more angular positions of the sub-picture, or (2) dimensions of the sub-picture.
[0012] In another example aspect, a method of video processing is disclosed. The method includes: for conversion between a picture of a video and a bitstream representation of the video, due to the picture being divided into one or more sub-pictures, determining to enable a reference picture resampling tool. The method also includes performing the conversion based on the determination.
[0013] In another example aspect, a method of video processing is disclosed. The method includes: performing conversion between a video including a video picture and a bitstream representation of the video, the video picture including one or more sub-pictures, the sub-picture including one or more slices. The bitstream representation conforms to a format rule that specifies that for a sub-picture and a slice, if an index identifying the sub-picture is included in a header of the slice, then an address field of the slice indicates an address of a slice in the sub-picture.
[0014] In another example aspect, a method of video processing is disclosed. The method includes: for a video block in a first video region of a video, determining whether a position of a temporal motion vector predictor for a conversion between a bitstream representation of the video block and a current video block using an affine mode is within a second video region; and performing the conversion based on the determination.
[0015] In another example aspect, another video processing method is disclosed. The method includes: for a video block in a first video region of a video, determining whether a location for obtaining integer samples in a reference picture for a conversion between a bitstream representation of the video block and a current video block is within a second video region, wherein during the conversion, the reference picture is not used in an interpolation process; and performing the conversion based on the determination.
[0016] In another example aspect, another method of video processing is disclosed. The method includes: for a video block in a first video region of a video, determining whether a location for obtaining a reconstructed luma sample value for a conversion between a bitstream representation of the video block and a current video block is within a second video region; and performing the conversion based on the determination.
[0017] In another example aspect, another method of video processing is disclosed. The method includes: for a video block in a first video region of a video, determining whether a location of a check for splitting, depth derivation, or split flag signaling for the video block performed during a conversion between a bitstream representation of the video block and a current video block is within a second video region; and performing the conversion based on the determination.
[0018] In another example aspect, another method of video processing is disclosed. The method includes: performing conversion between a video including one or more video pictures and a codec representation of the video, the video picture including one or more video blocks, wherein the codec representation complies with codec syntax requirements, i.e., the conversion does not use sub-picture encoding / decoding and dynamic resolution conversion encoding / decoding tools or reference picture resampling tools within the video unit.
[0019] In another example aspect, another method of video processing is disclosed. The method includes: performing conversion between a video including one or more video pictures and a codec representation of the video, the video picture including one or more video blocks, wherein the codec representation complies with a codec syntax requirement that a first syntax element subpic_grid_idx[i][j] is not greater than a second syntax element max_subpics_minus1.
[0020] In yet another example aspect, the above method may be implemented by a video encoder apparatus comprising a processor.
[0021] In yet another example aspect, the above method may be implemented by a video decoder device comprising a processor.
[0022] In yet another example aspect, the methods may be implemented in the form of processor-executable instructions and stored on a computer-readable program medium.
[0023] These and other aspects are described further in this document. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] Figure 1 Examples of temporal motion vector prediction (TMVP) and region constraints in sub-block TMVP are shown.
[0025] Figure 2 An example of a hierarchical motion estimation scheme is shown.
[0026] Figure 3 is a block diagram of an example of a hardware platform for implementing the techniques described in this document.
[0027] Figure 4 is a flow chart of an example method for video processing.
[0028] Figure 5 An example of a picture with 18 by 12 luma CTUs is shown, which is partitioned into 12 slices and 3 raster scan strips (informative).
[0029] Figure 6 An example of a picture with 18 by 12 luma CTUs is shown, which is partitioned into 24 slices and 9 rectangular strips (informative).
[0030] Figure 7 An example of a picture is shown which is partitioned into 4 slices, 11 tiles and 4 rectangular strips (informative).
[0031] Figure 8 is a block diagram illustrating an example video processing system in which the various techniques disclosed herein may be implemented.
[0032] Fig. 9 is a block diagram illustrating an example video encoding and decoding system.
[0033] Fig.10 is a block diagram illustrating an encoder according to some embodiments of the present disclosure.
[0034] Fig.11 is a block diagram illustrating a decoder according to some embodiments of the present disclosure.
[0035] Fig.12 is a flow representation of a method for video processing according to the present technology.
[0036] Fig.13 is a flow representation of another method for video processing according to the present technology.
[0037] Fig.14 is a flow representation of another method for video processing according to the present technology.
[0038] Fig.15 is a flow representation of another method for video processing according to the present technology.
[0039] Fig.16 is a flow representation of another method for video processing according to the present technology.
[0040] Fig.17 is a flow representation of another method for video processing according to the present technology.
[0041] Fig.18 is a flow representation of another method for video processing according to the present technology.
[0042] Fig.19 is a flow chart of another method for video processing according to the present technology. DETAILED DESCRIPTION
[0043] This document provides various techniques that can be used by a decoder of an image or video bitstream to improve the quality of a decompressed or decoded digital video or image. For brevity, the term "video" is used herein to include both a sequence of pictures (traditionally referred to as video) and individual images. In addition, a video encoder may also implement these techniques during the encoding process in order to reconstruct a decoded frame for further encoding.
[0044] The section titles used in this document are for ease of understanding and do not limit the embodiments and techniques to the corresponding sections. Thus, the embodiments of one section can be combined with the embodiments of other sections.
[0045] 1. Summary
[0046] This document is related to video codec technology. Specifically, it is related to palette codecs using base color based representation in video codecs. It can be applied to existing video codec standards (such as HEVC) or standards to be finalized (Universal Video Codec). It may also be applicable to future video codec standards or video codecs.
[0047] 2. Preliminary Discussion
[0048] Video codec standards have evolved primarily through the development of the well-known ITU-T and ISO / IEC standards. ITU-T produced H.261 and H.263, ISO / IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced H.262 / MPEG-2 Video and H.264 / MPEG-4 Advanced Video Codec (AVC) and H.265 / HEVC standards [1,2]. Starting with H.262, video codec standards are based on a hybrid video codec structure that utilizes temporal prediction plus transform codec. In order to explore future video codec technologies beyond HEVC, VCEG and MPEG jointly established the Joint Video Exploration Team (JVET) in 2015. Since then, JVET has adopted many new methods and introduced them into a reference software called the "Joint Exploration Model" (JEM). In April 2018, the Joint Video Experts Team (JVET) between VCEG (Q6 / 16) and ISO / IEC JTC1SC29 / WG11 (MPEG) was created to work on the VVC standard with the goal of a 50% bitrate reduction compared to HEVC.
[0049] 2.1 TMVP in VVC and Area Constraints in Sub-Block TMVP
[0050] Figure 1 FIG. 4 illustrates example area constraints in TMVP and sub-block TMVP. In TMVP and sub-block TMVP, Figure 1 As shown, the constrained time-domain MV can only be obtained from the columns of collocated CTUs plus 4×4 blocks.
[0051] 2.2 Example pictures
[0052] In some embodiments, a sub-picture based encoding and decoding technique based on a flexible slicing method may be implemented. An overview of the sub-picture based encoding and decoding technique includes the following:
[0053] (1) Pictures can be divided into sub-pictures.
[0054] (2) An indication in the SPS indicating the existence of a sub-picture and other sequence-level information of the sub-picture.
[0055] (3) Whether a sub-picture is considered as a picture during the decoding process (excluding the loop filtering operation) can be controlled by the bitstream.
[0056] (4) Whether to disable loop filtering across sub-picture boundaries can be controlled by the bitstream of each sub-picture. The DBF, SAO, and ALF processes are updated to control loop filtering operations across sub-picture boundaries.
[0057] (5) For simplicity, the width, height, horizontal offset and vertical offset of the sub-picture are signaled in units of luma samples in the SPS. The sub-picture boundaries are constrained to be slice boundaries.
[0058] (6) Slightly update the coding_tree_unit() syntax to specify that sub-pictures are treated as pictures during the decoding process (excluding loop filtering operations), and update the decoding process to the following:
[0059] -Derivation process for (advanced) temporal luminance motion vector prediction
[0060] - Bilinear interpolation process of brightness samples
[0061] - Luminance sample point 8-tap interpolation filtering process
[0062] - Chroma sample interpolation process
[0063] (7) The sub-picture ID is explicitly specified in the SPS and included in the slice group header to enable the sub-picture sequence to be extracted without changing the VCL NAL unit.
[0064] (8) An output sub-picture set (OSPS) is proposed to specify the standard extraction and consistency points of sub-pictures and their sets.
[0065] 2.3 Example images in general video codecs
[0066] Sequence Parameter Set RBSP Syntax
[0067]
[0068] subpics_present_flag equal to 1 indicates that sub-picture parameters are currently present in the SPS RBSP syntax. subpics_present_flag equal to 0 indicates that sub-picture parameters are currently not present in the SPS RBSP syntax.
[0069] NOTE 2 – When the bitstream is the result of a sub-bitstream extraction process and contains only a subset of the sub-pictures of the input bitstream of the sub-bitstream extraction process, it may be necessary to set the value of subpics_present_flag equal to 1 in the RBSP of the SPS.
[0070] max_subpics_minus1 plus 1 specifies the maximum number of subpictures that may be present in the CVS. max_subpics_minus1 shall be in the range 0 to 254. The value 255 is reserved for future use by ITU-T|ISO / IEC.
[0071] subpic_grid_col_width_minus1 plus 1 specifies the width of each element of the sub-picture identifier grid in units of 4 samples. The length of the syntax element is Ceil(Log2(pic_width_max_in_luma_samples / 4)) bits.
[0072] The variable NumSubPicGridCols is derived as follows:
[0073] NumSubPicGridCols=(pic_width_max_in_luma_samples+subpic_grid_col_width_minus1*4+3) /
[0074] (subpic_grid_col_width_minus1*4+4) (7-5)
[0075] subpic_grid_row_height_minus1 plus 1 specifies the height of each element in the sub-picture identifier grid in units of 4 samples. The length of the syntax element is Ceil(Log2(pic_height_max_in_luma_samples / 4)) bits.
[0076] The variable NumSubPicGridRows is derived as follows:
[0077] NumSubPicGridRows=(pic_height_max_in_luma_samples+subpic_grid_row_height_minus1*4+3) / (subpic_grid_row_height_minus1*4+4) (7-6)
[0078] subpic_grid_idx[i][j] specifies the sub-picture index of the grid position (i, j). The length of the syntax element is Ceil(Log2(max_subpics_minus1+1)) bits.
[0079] The variables SubPicTop[subpic_grid_idx[i][j]], SubPicLeft[subpic_grid_idx[i][j]], SubPicWidth[subpic_grid_idx[i][j]], SubPicHeight[subpic_grid_idx[i][j]], and NumSubPics are derived as follows:
[0080]
[0081]
[0082] subpic_treated_as_pic_flag[i] equal to 1 specifies that the i-th subpicture of each codec picture in the CVS is to be treated as a picture in the decoding process that does not include loop filtering operations. subpic_treated_as_pic_flag[i] equal to 0 specifies that the i-th subpicture of each codec picture in the CVS is not to be treated as a picture in the decoding process that does not include loop filtering operations. When not present, the value of subpic_aged_as_pic_flag[i] is inferred to be equal to 0.
[0083] loop_filter_across_subpic_enabled_flag[i] equal to 1 specifies that loop filtering operations can be performed on the boundary of the i-th subpic in each coded picture in the CVS.
[0084] loop_filter_cross_subic_enabled_flag[i] equal to 0 specifies that no loop filtering operation is performed on the boundary of the i-th sub-picture of each codec picture in the CVS. When not present, the value of loop_filter_across_subpic_enabled_pic_flag[i] is inferred to be equal to 1.
[0085] Bitstream conformance requires that the following constraints apply:
[0086] - For any two sub-pictures subpicA and subpicB, when the index of subpicA is less than the index of subpicB, any codec NAL unit of subPicA shall follow any codec NAL unit of subPicB in decoding order.
[0087] - The shape of the sub-pictures shall be such that, when each sub-picture is decoded, its entire left border and its entire top border are formed by the picture borders, or by the borders of previously decoded sub-pictures.
[0088] For ctbAddrRs in the range from 0 to PicSizeInCtbsY-1 (inclusive), the list CtbToSubPicIdx[ctbAddrRs] specifies the conversion from CTB addresses in the picture raster scan to sub-picture indices, derived as follows:
[0089]
[0090]
[0091] num_bricks_in_slice_minus1, when present, specifies the number of bricks in the slice minus 1. The value of num_bricks_in_slice_minus1 should be in the range 0 to NumBricksInPic-1, inclusive. When rect_slice_flag is equal to 0 and single_brick_per_slice_flag is equal to 1, the value of num_bricks_in_slice_minus1 is inferred to be equal to 0. When single_brick_per_slice_flag is equal to 1, the value of num_bricks_in_slice_minus1 is inferred to be equal to 0.
[0092] The variables NumBricksInCurrSlice, which specifies the number of bricks in the current strip, and SliceBrickIdx[i], which specifies the brick index of the i-th brick in the current strip, are derived as follows:
[0093]
[0094] The variables SubPicIdx, SubPicLeftBoundaryPos, SubPicTopBoundaryPos, SubPicRightBoundaryPos, and SubPicBotBoundaryPos are derived as follows:
[0095]
[0096] …
[0097] Derivation process of temporal luminance motion vector prediction
[0098] The inputs to this process are:
[0099] - the luma position (xCb, yCb) of the top left sample of the current luma codec block relative to the top left luma sample of the current picture,
[0100] - variable cbWidth, specifies the width of the current codec block in luminance samples,
[0101] - variable cbHeight, specifies the height of the current codec block in luminance samples,
[0102] - Reference index refIdxLX, where X is 0 or 1.
[0103] The output of this process is:
[0104] -1 / 16 fractional sample accuracy motion vector prediction mvLXCol,
[0105] -Availability flag availableFlagLXCol.
[0106] The variable currCb specifies the current luma codec block at luma position (xCb, yCb).
[0107] The variables mvLXCol and availableFlagLXCol are exported as follows:
[0108] - If slice_temporal_mvp_enabled_flag is equal to 0 or (cbWidth*cbHeight) is less than or equal to 32, both components of mvLXCol are set equal to 0 and availableFlagLXCol is set equal to 0.
[0109] - Otherwise (slice_temporal_mvp_enabled_flag is equal to 1), the following ordered steps are applied:
[0110] 1. The right bottom collocation motion vector and the bottom and right boundary sample positions are derived as follows:
[0111] xColBr=xCb+cbWidth (8-421)
[0112] yColBr=yCb+cbHeight (8-422)
[0113] rightBoundaryPos=subpic_treated_as_pic_flag[SubPicIdx]?
[0114] SubPicRightBoundaryPos:pic_width_in_luma_samples-1 (8-423)
[0115] botBoundaryPos=subpic_treated_as_pic_flag[SubPicIdx]?
[0116] SubPicBotBoundaryPos:pic_height_in_luma_samples-1 (8-424)
[0117] - If yCb>>CtbLog2SizeY is equal to yColBr>>CtbLog2SizeY, yColBr is less than or equal to botBoundaryPos, and xColBr is less than or equal to rightBoundaryPos, then the following applies:
[0118] - The variable colCb specifies the luma codec block that covers the modified position given by ((xColBr>>3)<<3, (yColBr>>3)<<3) within the collocated picture specified by ColPic.
[0119] - The luma position (xColCb, yColCb) is set equal to the top left sample of the collocated luma codec block specified by colCb relative to the top left luma sample of the collocated picture specified by ColPic.
[0120] - Call the derivation process of the collocated motion vector specified in clause 8.5.2.12 with currCb, colCb, (xColCb, yColCb), refIdxLX and sbFlag set equal to 0 as input and the output assigned to mvLXCol and availableFlagLXCol.
[0121] Otherwise, both components of mvLXCol are set equal to 0 and availableFlagLXCol is set equal to 0.
[0122] …
[0123] Luminance sample bilinear interpolation process
[0124] The inputs to this process are:
[0125] - Luminance position in full sample units (xInt L ,yInt L ),
[0126] - Luma position in fractional samples (xFrac L ,yFrac L ),
[0127] - Luminance reference sample array refPicLX L .
[0128] The output of this process is the predicted luminance sample value predSampleLX L
[0129] The variables shift1, shift2, shift3, shift4, offset1, offset2, and offset3 are derived as follows:
[0130] shift1=BitDepth Y -6 (8-453)
[0131] offset1=1<<(shift1-1) (8-454)
[0132] shift2=4 (8-455)
[0133] offset2=1<<(shift2-1) (8-456)
[0134] shift3=10-BitDepth Y (8-457)
[0135] shift4=BitDepth Y -10 (8-458)
[0136] offset4=1<<(shift4-1) (8-459)
[0137] The variable picW is set equal to pic_width_in_luma_samples, and the variable picH is set equal to pic_height_in_luma_samples.
[0138] Table 8-10 specifies that p is equal to xFrac L or yFrac L Luma interpolation filter coefficient fb for each 1 / 16 fractional sample position L [p].
[0139] For i = 0..1, the brightness position in units of full samples (xInt i ,yInt i ) is exported as follows:
[0140] - If subpic_treated_as_pic_flag[SubPicIdx] is equal to 1, the following applies:
[0141] xInt i =Clip3(SubPicLeftBoundaryPos,SubPicRightBoundaryPos,xInt L +i) (8-460)
[0142] yInt i =Clip3(SubPicTopBoundaryPos,SubPicBotBoundaryPos,yInt L +i) (8-461)
[0143] - Otherwise (subpic_aged_as_pic_flag[SubPicIdx] is equal to 0), the following applies:
[0144] xInt i =Clip3(0,picW-1,sps_ref_wraparound_enabled_flag?
[0145] ClipH((sps_ref_wraparound_offset_minus1+1)*MinCbSizeY,picW,(xInt L +i)): (8-462)
[0146] xInt L +i)
[0147] yInt i =Clip3(0,picH-1,yInt L +i) (8-463)
[0148] …
[0149] The process of deriving sub-block-based temporal merge candidates
[0150] The inputs to this process are:
[0151] - the luma position (xCb, yCb) of the top left sample of the current luma codec block relative to the top left luma sample of the current picture,
[0152] - variable cbWidth, specifies the width of the current codec block in luminance samples,
[0153] - The variable cbHeight specifies the height of the current codec block in luma samples.
[0154] - the availability flag of the neighboring codec unit availableFlagA1,
[0155] - The reference index of the neighborhood codec unit refIdxLXA1, where X is 0 or 1,
[0156] - The prediction list of the neighboring codec unit uses the flag predFlagLXA1, where X is 0 or 1,
[0157] - The motion vector mvLXA1 of the neighborhood codec with 1 / 16 fractional sample accuracy, where X is 0 or 1.
[0158] The output of this process is:
[0159] -Availability flag availableFlagSbCol,
[0160] - the number of luma codec sub-blocks in the horizontal direction numSbX and the vertical direction numSbY,
[0161] - reference indices refIdxL0SbCol and refIdxL1SbCol,
[0162] - Luma motion vectors mvL0SbCol[xSbIdx][ySbIdx] and mvL1SbCol[xSbIdx][ySbIdx] with 1 / 16 fractional sample accuracy, where xSbIdx=0..numSbX-1, ySbIdx=0..numSbY-1,
[0163] - The prediction list utilizes the flags predFlagL0SbCol[xSbIdx][ySbIdx] and predFlagL1SbCol[xSbIdx][ySbIdx], where xSbIdx=0..numSbX-1, ySbIdx=0..numSbY-1.
[0164] The availability flag availableFlagSbCol is derived as follows.
[0165] - If one or more of the following conditions are true, availableFlagSbCol is set equal to 0.
[0166] -slice_temporal_mvp_enabled_flag is equal to 0.
[0167] -sps_sbtmvp_enabled_flag is equal to 0.
[0168] -cbWidth is less than 8.
[0169] -cbHeight is less than 8.
[0170] - Otherwise, the following sequential steps apply:
[0171] 1. The position of the top left sample point (xCtb, yCtb) of the luma codec tree block containing the current codec block and the position of the bottom right center sample point (xCtr, yCtr) of the current luma codec block are derived as follows:
[0172] xCtb=(xCb>>CtuLog2Size)< <CtuLog2Size (8-542)
[0173] yCtb=(yCb>>CtuLog2Size)< <CtuLog2Size (8-543)
[0174] xCtr=xCb+(cbWidth / 2) (8-544)
[0175] yCtr=yCb+(cbHeight / 2) (8-545)
[0176] 2. The luma position (xColCtrCb, yColCtrCb) is set equal to the top left sample of the collocated luma codec block covering the position given by (xCtr, yCtr) inside ColPic, relative to the top left luma sample of the collocated picture specified by ColPic.
[0177] 3. Call the sub-block based temporal Merge basic motion data derivation process specified in clause 8.5.5.4, where the position (xCtb, yCtb), the position (xColCtrCb, yColCtrCb), the availability flag availableFlagA1 and the prediction list using the flag predFlagLXA1 and the reference index refIdxLXA1 and the motion vector mvLXA1 (where X is 0 and 1) are used as inputs, and the motion vector ctrMvLX and the prediction list of the collocated block using the flag ctrPredFlagLX (where X is 0 and 1) and the temporal motion vector tempMv are used as outputs.
[0178] 4. The variable availableFlagSbCol is exported as follows:
[0179] - If both ctrPredFlagL0 and ctrPredFlagL1 are equal to 0, availableFlagSbCol is set equal to 0.
[0180] - Otherwise, availableFlagSbCol is set equal to 1.
[0181] When availableFlagSbCol is equal to 1, the following applies:
[0182] - The variables numSbX, numSbY, sbWidth, sbHeight and refIdxLXSbCol are derived as follows:
[0183] numSbX=cbWidth>>3 (8-546)
[0184] numSbY=cbHeight>>3 (8-547)
[0185] sbWidth=cbWidth / numSbX (8-548)
[0186] sbHeight=cbHeight / numSbY (8-549)
[0187] refIdxLXSbCol=0 (8-550)
[0188] - For xSbIdx=0..numSbX-1 and ySbIdx=0..numSbY-1, the motion vector mvLXSbCol[xSbIdx][ySbIdx] and the prediction list are derived using the flag predFlagLXSbCol[xSbIdx][ySbIdx] as follows:
[0189] -Specify the luma position (xSb, ySb) of the top left sample of the current codec sub-block relative to the top left luma sample of the current picture as follows:
[0190] xSb=xCb+xSbIdx*sbWidth+sbWidth / 2 (8-551)
[0191] ySb=yCb+ySbIdx*sbHeight+sbHeight / 2 (8-552)
[0192] - The position (xColSb, yColSb) of the collocated sub-block inside ColPic is derived as follows.
[0193] - Apply the following:
[0194] yColSb=Clip3(yCtb,
[0195] Min(CurPicHeightInSamplesY-1,yCtb+(1< <CtbLog2SizeY)-1), (8-553)
[0196] ySb+(tempMv[1]>>4))
[0197] - If subpic_treated_as_pic_flag[SubPicIdx] is equal to 1, the following applies:
[0198] xColSb=Clip3(xCtb,
[0199] Min(SubPicRightBoundaryPos,xCtb+(1< <CtbLog2SizeY)+3), (8-554)
[0200] xSb+(tempMv[0]>>4))
[0201] - Otherwise (subpic_treated_as_pic_flag[SubPicIdx] is equal to 0), the following applies:
[0202] xColSb=Clip3(xCtb,
[0203] Min(CurPicWidthInSamplesY-1,xCtb+(1< <CtbLog2SizeY)+3), (8-555)
[0204] xSb+(tempMv[0]>>4))
[0205] …
[0206] The export process of basic motion data of temporal merge based on sub-blocks
[0207] The inputs to this process are:
[0208] - The position of the top left sample of the luma codec tree block containing the current codec block (xCtb, yCtb),
[0209] - The position of the top left sample of the collocated luma codec block covering the bottom right center sample (xColCtrCb, yColCtrCb).
[0210] - the availability flag of the neighboring codec unit availableFlagA1,
[0211] - the reference index of the neighborhood codec unit refIdxLXA1,
[0212] - The prediction list of the neighboring codec unit uses the flag predFlagLXA1,
[0213] - Motion vector mvLXA1 of the neighborhood codec unit with 1 / 16 fractional sample accuracy.
[0214] The output of this process is:
[0215] - motion vectors ctrMvL0 and ctrMvL1,
[0216] - The prediction list uses the flags ctrPredFlagL0 and ctrPredFlagL1,
[0217] - Temporal motion vector tempMv.
[0218] The variable tempMv is set as follows:
[0219] tempMv[0]=0 (8-558)
[0220] tempMv[1]=0 (8-559) The variable currPic specifies the current picture.
[0221] When availableFlagA1 is equal to TRUE, the following applies:
[0222] - tempMv is set equal to mvL0A1 if all of the following are true:
[0223] -predFlagL0A1 is equal to 1,
[0224] -DiffPicOrderCnt(ColPic, RefPicList[0][refIdxL0 A1]) is equal to 0,
[0225] – Otherwise, tempMv is set equal to mvL1A1 if all of the following are true:
[0226] -slice_type equals B,
[0227] -predFlagL1A1 is equal to 1,
[0228] - DiffPicOrderCnt(ColPic, RefPicList[1][refIdxL1A1]) is equal to 0. The position (xColCb, yColCb) of the collocated block inside ColPic is derived as follows.
[0229] - Apply the following:
[0230] yColCb=Clip3(yCtb,
[0231] Min(CurPicHeightInSamplesY-1,yCtb+(1< <CtbLog2SizeY)-1), (8-560)
[0232] yColCtrCb+(tempMv[1]>>4))
[0233] - If subpic_treated_as_pic_flag[SubPicIdx] is equal to 1, the following applies:
[0234] xColCb=Clip3(xCtb,
[0235] Min(SubPicRightBoundaryPos,xCtb+(1< <CtbLog2SizeY)+3), (8-561)
[0236] xColCtrCb+(tempMv[0]>>4))
[0237] - Otherwise (subpic_treated_as_pic_flag[SubPicIdx] is equal to 0, the following applies:
[0238] xColCb=Clip3(xCtb,
[0239] Min(CurPicWidthInSamplesY-1,xCtb+(1< <CtbLog2SizeY)+3), (8-562)
[0240] xColCtrCb+(tempMv[0]>>4))
[0241] …
[0242] Luminance sample interpolation filtering process
[0243] The inputs to this process are:
[0244] - Luminance position in full sample units (xInt L ,yInt L ),
[0245] - Luma position in fractional samples (xFrac L ,yFrac L ),
[0246] - Luminance position in full sample units (xSbInt L ,ySbInt L ), specifies the top left sample of the limit block for reference sample filling relative to the top left luma sample of the reference picture,
[0247] - Luminance reference sample array refPicLX L ,
[0248] - half-sample interpolation filter index hpelIfIdx,
[0249] -Variable sbWidth, specifies the width of the current sub-block,
[0250] -Variable sbHeight specifies the height of the current sub-block.
[0251] - Luma position (xSB, ySB), specifies the top left sample of the current sub-block relative to the top left luma sample of the current picture,
[0252] The output of this process is the predicted luminance sample value predSampleLX L
[0253] The variables shift1, shift2, and shift3 are derived as follows:
[0254] - Set the variable shift1 to be equal to Min(4, BitDepth Y-8), the variable shift2 is set to 6, and the variable shift3 is set to Max(2,14-BitDepth Y ).
[0255] -The variable picW is set equal to pic_width_in_luma_samples and the variable picH is set equal to pic_height_in_luma_samples.
[0256] p is equal to xFrac L or yFrac L The luma interpolation filter coefficient f for each 1 / 16 fractional sample position L [p] is exported as follows:
[0257] - If MotionModelIdc[xSb][ySb] is greater than 0, and sbWidth and sbHeight are both equal to 4, then the brightness interpolation filter coefficient f L [p] is specified in Table 8-12.
[0258] - Otherwise, the luma interpolation filter coefficients f specified in Table 8-11 depend on hpelIfIdx L [p].
[0259] For i = 0..7, the luminance position in units of full samples (xInt i ,yInt i ) is exported as follows:
[0260] - If subpic_treated_as_pic_flag[SubPicIdx] is equal to 1, then the following shall apply:
[0261] xInt i =Clip3(SubPicLeftBoundaryPos,SubPicRightBoundaryPos,xInt L +i-3)(8-771)
[0262] yInt i =Clip3(SubPicTopBoundaryPos,SubPicBotBoundaryPos,yInt L +i-3)(8-772)
[0263] - Otherwise (subpic_treated_as_pic_flag[SubPicIdx] is equal to 0), the following applies:
[0264] xInt i=Clip3(0,picW-1,sps_ref_wraparound_enabled_flag?
[0265] ClipH((sps_ref_wraparound_offset_minus1+1)*MinCbSizeY,picW,xInt L +i-3): (8-773)
[0266] xInt L +i-3)
[0267] yInt i =Clip3(0,picH-1,yInt L +i-3) (8-774)
[0268] …
[0269] Chroma Sample Interpolation Process
[0270] The inputs to this process are:
[0271] - Chroma position in units of full samples (xInt C ,yInt C ),
[0272] - Chroma position in 1 / 32 fractional samples (xFrac C ,yFrac C ),
[0273] - Chroma position (xSbIntC, ySbIntC) in full sample units, specifying the top left sample of the limit block for reference sample filling relative to the top left chroma sample of the reference picture,
[0274] -Variable sbWidth, specifies the width of the current sub-block,
[0275] -Variable sbHeight specifies the height of the current sub-block.
[0276] - Chroma reference sample array refPicLX C .
[0277] The output of this process is the predicted chrominance sample value predSampleLX C
[0278] The variables shift1, shift2, and shift3 are derived as follows:
[0279] - Set the variable shift1 to be equal to Min(4, BitDepth C-8), the variable shift2 is set to 6, and the variable shift3 is set to Max(2,14-BitDepth C ).
[0280] -Variable picW C Set equal to pic_width_in_luma_samples / SubWidthC, variable picH C Set equal to pic_height_in_luma_samples / SubHeightC.
[0281] Table 8-13 specifies that p is equal to xFrac C or yFrac C The chroma interpolation filter coefficient f for each 1 / 32 fractional sample position C [p].
[0282] The variable xOffset is set equal to (sps_ref_wraparound_offset_minus1+1)*MinCbSizeY) / SubWidthC.
[0283] For i = 0..3, the chrominance position in units of all samples (xInt i ,yInt i ) is exported as follows:
[0284] - If subpic_treated_as_pic_flag[SubPicIdx] is equal to 1, the following applies:
[0285] xInt i =Clip3(SubPicLeftBoundaryPos / SubWidthC,SubPicRightBoundaryPos / SubWidthC,xInt L +i) (8-785)
[0286] yInt i =Clip3(SubPicTopBoundaryPos / SubHeightC,SubPicBotBoundaryPos / SubHeightC,yInt L +i) (8-786)
[0287] - Otherwise (subpic_treated_as_pic_flag[SubPicIdx] is equal to 0), the following applies:
[0288] xInt i=Clip3(0,picW C -1,sps_ref_wraparound_enabled_flag? ClipH(xOffset,picW C ,xInt C +i-1):(8-787)
[0289] xInt C +i-1)
[0290] yInt i =Clip3(0,picH C -1,yInt C +i-1) (8-788)
[0291] 2.4 Example encoder-only GOP-based time-domain filter
[0292] In some embodiments, an encoder-only temporal filter may be implemented. Filtering is performed on the codec side as a preprocessing step. Source pictures before and after the selected picture to be encoded and decoded are read, and a block-based motion compensation method relative to the selected picture is applied to these source pictures. The samples in the selected picture are temporally filtered using the motion compensated sample values.
[0293] The overall filter strength is set depending on the temporal sublayer of the selected picture and the QP. Only pictures at temporal sublayers 0 and 1 are filtered, with layer 0 pictures filtered by a stronger filter than layer 1 pictures. The per-sample filter strength is adjusted depending on the difference between the sample value in the selected picture and the collocated sample in the motion compensated picture, so that small differences between the motion compensated picture and the selected picture are filtered more strongly than larger differences.
[0294] GOP-based temporal filter
[0295] The temporal filter is introduced directly after reading the picture and before encoding. The following are the steps described in more detail.
[0296] Operation 1: Read the image from the codec
[0297] Operation 2: If the picture is low enough in the codec hierarchy, it is filtered before encoding and decoding. Otherwise, the picture is encoded without filtering. RA pictures with POC% 8 == 0 and LD pictures with POC% 4 == 0 are filtered. AI pictures are never filtered.
[0298] The overall filter strength is set according to the following equation for RA.
[0299]
[0300] Where n is the number of images read.
[0301] For the LD case, use s o (n) = 0.95.
[0302] Operation 3: Read two pictures before and / or after the selected picture (hereinafter referred to as the original picture). In edge cases, such as if it is the first picture or close to the last picture, only the available pictures are read.
[0303] Operation 4: For each 8x8 image block, estimate the motion of the previous and next images relative to the original image.
[0304] A hierarchical motion estimation scheme is used, and Figure 2 Layers L0, L1 and L2 are shown in FIG. By comparing all read images and original images (e.g. Figure 2 The subsampled image is generated by averaging each 2×2 block of L1 in . The same subsampling method is used to derive L2 from L1.
[0305] Figure 2 An example of different layers of hierarchical motion estimation is shown. L0 is the original resolution. L1 is a subsampled version of L0. L2 is a subsampled version of L1.
[0306] First, motion estimation is performed for each 16x16 block in L2. The squared difference is calculated for each selected motion vector, and the motion vector corresponding to the smallest difference is selected. The selected motion vector is then used as the initial value when estimating the motion in L1. The same operation is then performed for estimating the motion in L0. As a final step, sub-pixel motion is estimated for each 8x8 block by using an interpolation filter on L0.
[0307] The VTM 6-tap interpolation filter can be used:
[0308]
[0309] Operation 5: Apply motion compensation to the pictures before and after the original picture according to the best matching motion of each block, for example, so that the sample coordinates of the original picture in each block have the best matching coordinates in the reference picture.
[0310] Operation 6: The samples of the luma and chroma channels are processed one by one, as described in the following steps.
[0311] Operation 7: Calculate the new sample value I using the following formula n .
[0312]
[0313] Among them Io is the sample value of the original sample point, I r (i) is the intensity of the corresponding sample point of motion compensated picture i, w r (i,a) is the weight of motion compensated picture i when the number of available motion compensated pictures is a.
[0314] In the brightness channel, the weight w r (i,a) is defined as follows:
[0315]
[0316] in
[0317] s l =0.4
[0318]
[0319]
[0320] For all other cases of i and a: s r (i,a)=0.3
[0321] σ l (QP) = 3*(QP-10)
[0322] ΔI(i)=I r (i)-I o
[0323] For the chroma channel, the weight w r (i,a) is defined as follows:
[0324]
[0325] where s c =0.55 and σ c =30
[0326] Operation 8: Apply the filter to the current sample. The resulting sample values are stored separately.
[0327] Operation 9: Encode the filtered picture.
[0328] 2.5 Example Image Segmentation (Slices, Bricks, Strips)
[0329] In some embodiments, a picture is divided into one or more slice rows and one or more slice columns.A slice is a sequence of CTUs covering a rectangular area of a picture.
[0330] A slice is divided into one or more bricks, each brick consisting of multiple CTU rows within the slice.
[0331] A slice that is not split into multiple bricks is also called a brick. However, a brick that is a proper subset of a slice is not called a slice.
[0332] A strip contains multiple slices of a picture or multiple tiles of a slice.
[0333] A sub-picture contains one or more strips that together cover a rectangular area of the picture.
[0334] Two modes of strips are supported, namely, raster scan strip mode and rectangular strip mode. In raster scan strip mode, a strip contains a sequence of slices in a slice raster scan of a picture. In rectangular strip mode, a strip contains multiple bricks of a picture that together form a rectangular region of a picture. The bricks within a rectangular strip are in the order of the brick raster scan of the strip.
[0335] Figure 5 An example of raster scan stripe partitioning of a picture is shown, where the picture is divided into 12 slices and 3 raster scan stripes.
[0336] Figure 6 An example of rectangular strip partitioning of a picture is shown, where the picture is divided into 24 slices (6 slice columns and 4 slice rows) and 9 rectangular strips.
[0337] Figure 7 An example of a picture partitioned into slices, bricks, and rectangular strips is shown, where the picture is divided into 4 slices (2 slice columns and 2 slice rows), 11 bricks (the top left slice contains 1 brick, the top right slice contains 5 bricks, the bottom left slice contains 2 bricks, and the bottom right slice contains 3 bricks), and 4 rectangular strips.
[0338] Picture Parameter Set RBSP Syntax
[0339]
[0340]
[0341]
[0342]
[0343] single_tile_in_pic_flag equal to 1 specifies that there is only one slice in each picture referencing the PPS. single_tile_in_pic_flag equal to 0 specifies that there is more than one slice in each picture referencing the PPS.
[0344] Note – If there is no further brick division within a slice, then the entire slice is called a brick. When a picture contains only a single slice without further brick division, then it is called a single brick.
[0345] Bitstream conformance requires that the value of single_tile_in_pic_flag should be the same for all PPSs referenced by a coded or decoded picture in a CVS.
[0346] uniform_tile_spacing_flag equal to 1 specifies that the slice column boundaries and likewise the slice row boundaries are uniformly distributed across the picture and is signaled using the syntax elements tile_cols_width_minus1 and tile_rows_height_minus1. Uniform_tile_spacing_flag equal to 0 specifies that the slice column boundaries and likewise the slice row boundaries may or may not be uniformly distributed across the picture and is signaled using the syntax elements num_tile_columns_minus1 and num_tile_rows_minus1 and the list of syntax elements tile_column_width_minus1[i] and tile_row_height_minus1[i]. When not present, the value of uniform_tile_spacing_flag is inferred to be equal to 1.
[0347] tile_cols_width_minus1 plus 1 specifies the width of slice columns other than the rightmost slice column of a picture in CTB units when uniform_tile_spacing_flag is equal to 1. The value of tile_cols_width_minus1 should be in the range of 0 to PicWidthInCtbsY-1, inclusive. When not present, the value of tile_cols_width_minus1 is inferred to be equal to PicWidthInCtbsY-1.
[0348] tile_rows_height_minus1 plus 1 specifies the height of the slice rows other than the bottom slice row of the picture in CTB units when uniform_tile_spacing_flag is equal to 1. The value of tile_rows_height_minus1 should be in the range of 0 to PicHeightInCtbsY-1, inclusive. When not present, the value of tile_rows_height_minus1 is inferred to be equal to PicHeightInCtbsY-1.
[0349] num_tile_columns_minus1 plus 1 specifies the number of tile columns used to partition a picture when unique_tile_spacing_flag is equal to 0. The value of num_tile_columns_minus1 should be in the range 0 to PicWidthInCtbsY-1, inclusive. If single_tile_in_pic_flag is equal to 1, the value of num_tile_columns_minus1 is inferred to be equal to 0. Otherwise, when uniform_tile_spacing_flag is equal to 1, the value of num_tile_columns_minus1 is inferred as specified in clause 6.5.1.
[0350] num_tile_rows_minus1 plus 1 specifies the number of tile rows used to partition a picture when uniform_tile_spacing_flag is equal to 0. The value of num_tile_rows_minus1 should be in the range 0 to PicHeightInCtbsY-1, inclusive. If single_tile_in_pic_flag is equal to 1, the value of num_tile_rows_minus1 is inferred to be equal to 0. Otherwise, when uniform_tile_spacing_flag is equal to 1, the value of num_tile_rows_minus1 is inferred as specified in clause 6.5.1.
[0351] The variable NumTilesInPic is set equal to (num_tile_columns_minus1+1)*(num_tile_rows_minus1+1).
[0352] When single_tile_in_pic_flag is equal to 0, NumTilesInPic should be greater than 1.
[0353] tile_column_width_minus1[i] plus 1 specifies the width of the i-th tile column in units of CTBs.
[0354] tile_row_height_minus1[i] plus 1 specifies the height of the i-th tile row in CTB units.
[0355] brick_splitting_present_flag equal to 1 specifies that one or more slices of the picture referencing the PPS may be split into two or more bricks. brick_splitting_present_flag equal to 0 specifies that none of the slices of the picture referencing the PPS may be split into two or more bricks.
[0356] num_tiles_in_pic_minus1 plus 1 specifies the number of tiles in each picture that references the PPS. The value of num_tiles_in_pic_minus1 shall be equal to NumTilesInPic – 1. When not present, the value of num_tiles_in_pic_minus1 is inferred to be equal to NumTilesInPic - 1.
[0357] brick_split_flag[i] equal to 1 specifies that the i-th slice is split into two or more bricks. brick_split_flag[i] equal to 0 specifies that the i-th slice is not split into two or more bricks. When not present, the value of brick_split_flag[i] is inferred to be equal to 0. In some embodiments, the PPS parsing dependency on the SPS is introduced by adding the syntax condition "if (RowHeight[i]>1)" (e.g., similarly for uniform_brick_spacing_flag[i]).
[0358] uniform_brick_spacing_flag[i] equal to 1 specifies that the horizontal brick borders are uniformly spaced across the i-th slice and is signaled using the syntax element brick_height_minus1[i]. uniform_brick_spacing_flag[i] equal to 0 specifies that the horizontal brick borders may or may not be uniformly spaced across the i-th slice and is signaled using the syntax element num_brick_rows_minus2[i] and the list of syntax elements brick_row_height_minus1[i][j]. When not present, the value of uniform_brick_spacing_flag[i] is inferred to be equal to 1.
[0359] brick_height_minus1[i] plus 1 specifies the height of the brick row other than the bottom brick in the i-th slice in CTB units when uniform_brick_spacing_flag[i] is equal to 1. When present, the value of brick_height_minus1 should be in the range 0 to RowHeight[i]-2, inclusive. When not present, the value of brick_height_minus1[i] is inferred to be equal to RowHeight[i]-1.
[0360] num_brick_rows_minus2[i] plus 2 specifies the number of bricks used to split the i-th slice when unique_brick_spacing_flag[i] is equal to 0. When present, the value of num_brick_rows_minus2[i] shall be in the range 0 to RowHeight[i]–2, inclusive. If brick_split_flag[i] is equal to 0, then the value of num_brick_rows_minus2[i] is inferred to be equal to -1. Otherwise, when uniform_brick_spacing_flag[i] is equal to 1, then the value of num_brick_rows_minus2[i] is inferred as specified in 6.5.1.
[0361] brick_row_height_minus1[i][j] plus 1 specifies the height of the j-th brick in the i-th slice in CTBs when uniform_tile_spacing_flag is equal to 0.
[0362] The following variables are derived, and the values of num_tile_columns_minus1 and num_tile_rows_minus1 are inferred when uniform_tile_spacing_flag is equal to 1, and the value of num_brick_rows_minus2[i] is inferred by invoking the CTB raster and brick scan conversion process specified in clause 6.5.1 when uniform_brick_spacing_flag[i] is equal to 1 for each i in the range from 0 to NumTilesInPic-1, inclusive:
[0363] – For j in the range 0 to num_tile_rows_minus1 (inclusive), the list RowHeight[j] specifies the height of the j-th tile row in CTBs,
[0364] – For ctbAddrRs in the range from 0 to PicSizeInCtbsY–1 (inclusive), the list CtbAddrRsToBs[ctbAddrRs] specifies the conversion from CTB addresses in the CTB raster scan of the picture to CTB addresses in the brick scan,
[0365] – For ctbAddrB in the range from 0 to PicSizeInCtbsY–1 (inclusive), the list CtbAddrBsToRs[ctbAddrBs] specifies the conversion from CTB addresses in the brick scan to CTB addresses in the CTB raster scan of the picture,
[0366] – For ctbAddrB in the range from 0 to PicSizeInCtbsY–1 (inclusive), the list BrickId[ctbAddrBs] specifies the conversion from CTB addresses in the brick scan to brick IDs,
[0367] – For BrickIdx in the range from 0 to NumBricksInPic–1 (inclusive), the list NumCtusInBrick[brickIdx] specifies the conversion from brick index to the number of CTUs in the brick,
[0368] – For BrickIdx in the range from 0 to NumBricksInPic–1 (inclusive), the list FirstCtbAddrBs[brickIdx] specifies the translation from the brick ID to the CTB address in the brick scan of the first CTB in the brick.
[0369] single_brick_per_slice_flag equal to 1 specifies that each slice referencing this PPS includes one brick. single_brick_per_slice_flag equal to 0 specifies that a slice referencing this PPS may include more than one brick. When not present, the value of single_brick_per_slice_flag is inferred to be equal to 1.
[0370] rect_slice_flag equal to 0 specifies that the bricks in each slice are in raster scan order and that the slice information is not signaled in the PPS. rect_slice_flag equal to 1 specifies that the bricks within each slice cover a rectangular area of the picture and that the slice information is signaled in the PPS. When brick_splitting_present_flag is equal to 1, the value of rect_slice_flag shall be equal to 1. When not present, rect_slice_flag is inferred to be equal to 1.
[0371] num_slices_in_pic_minus1 plus 1 specifies the number of slices in each picture that references the PPS. The value of num_slices_in_pic_minus1 should be in the range of 0 to NumBricksInPic–1, inclusive. When not present and single_brick_per_slice_flag is equal to 1, the value of num_slices_in_pic_minus1 is inferred to be equal to NumBricksInPic-1.
[0372] bottom_right_brick_idx_length_minus1 plus 1 specifies the number of bits used to represent the syntax element bottom_right_brick_idx_delta[i]. The value of bottom_right_brick_idx_length_minus1 should be in the range of 0 to Ceil(Log2(NumBricksInPic))-1, inclusive.
[0373] bottom_right_brick_idx_delta[i] specifies the difference between the brick index of the brick located at the bottom right corner of the i-th slice and the brick index of the bottom right corner of the (i–1)-th slice when i is greater than 0. bottom_right_brick_idx_delta[0] specifies the brick index of the bottom right corner of the 0th slice. When single_brick_per_slice_flag is equal to 1, the value of bottom_right_brick_idx_delta[i] is inferred to be equal to 1. The value of BottomRightBrickIdx[num_slices_in_pic_minus1] is inferred to be equal to NumBricksInPic–1. The length of the bottom_right_brick_idx_delta[i] syntax element is bottom_right_brick_idx_length_minus1+1 bits.
[0374] brick_idx_delta_sign_flag[i] equal to 1 indicates a positive sign of bottom_right_brick_idx_delta[i]. brick_idx_delta_sign_flag[i] equal to 0 indicates a negative sign of bottom_right_brick_idx_delta[i].
[0375] Bitstream conformance requires that a slice should consist of a contiguous sequence of multiple complete slices or complete bricks of only one slice.
[0376] The variables TopLeftBrickIdx[i], BottomRightBrickIdx[i], NumBricksInSlice[i], and BricksToSliceMap[j], specifying the brick index of the brick located at the top left corner of the i-th stripe, the brick index of the brick located at the bottom right corner of the i-th stripe, the number of bricks in the i-th stripe, and the brick-to-strip mapping, are derived as follows:
[0377]
[0378] General Stripe Header Semantics
[0379] When present, the value of each of the slice header syntax elements slice_pic_parameter_set_id, non_reference_picture_flag, colour_plane_id, slice_pic_order_cnt_lsb, recovery_poc_cnt, no_output_of_prior_pics_flag, pic_output_flag and slice_temporal_mvp_enabled_flag shall be the same in all slice headers of a coded picture.
[0380] The variable CuQpDeltaVal, which specifies the difference between the luma quantizer parameter of the codec unit containing cu_qp_delta_abs and its prediction, is set equal to 0. The variable CuQpOffset Cb 、CuQpOffset Cr and CuQpOffset CbCr , specifies when determining the Qp′ of the codec unit containing cu_chroma_qp_offset_flag Cb , Qp′ Cr and Qp′ CbCr The corresponding values of the quantization parameters are the values to be used, all set equal to 0.
[0381] slice_pic_parameter_set_id specifies the value of pps_pic_parameter_set_id of the PPS being used. The value of slice_pic_parameter_set_id should be in the range of 0 to 63 (inclusive).
[0382] Bitstream conformance requires that the value of the TemporalId of the current picture should be greater than or equal to the value of the TemporalId of the PPS whose pps_pic_parameter_set_id is equal to slice_pic_parameter_set_id.
[0383] slice_address specifies the slice address of the slice. When not present, the value of slice_address is inferred to be equal to 0.
[0384] If rect_slice_flag is equal to 0, the following applies:
[0385] -The strip address is the brick ID, as specified in equation (7-59).
[0386] - The length of slice_address is Ceil(Log2(NumBricksInPic)) bits.
[0387] -slice_address value should be in the range of 0 to NumBricksInPic–1 (inclusive).
[0388] Otherwise (rect_slice_flag is equal to 1), the following applies:
[0389] - StripeAddress is the stripe ID of the stripe.
[0390] -The length of slice_address is signalled_slice_id_length_minus1+1 bits.
[0391] - If signalled_slice_id_flag is equal to 0, the value of slice_address shall be in the range of 0 to num_slices_in_pic_minus1, inclusive. Otherwise, the value of slice_address shall be in the range of 0 to 2. (signalled _slice_id_length_minus1+1) -1 range (inclusive).
[0392] Bitstream conformance requires that the following constraints apply:
[0393] - The value of slice_address shall not be equal to the value of slice_address of any other codec slice NAL unit of the same codec picture.
[0394] - When rect_slice_flag is equal to 0, the slices of the picture shall be in ascending order of their slice_address values.
[0395] - The shape of the strips of a picture should be such that each tile, when decoded, has its entire left border and its entire top border constituted by the picture border or by the border of the previously decoded tile(s).
[0396] num_bricks_in_slice_minus1, when present, specifies the number of bricks in the slice minus 1. The value of num_bricks_in_slice_minus1 should be in the range 0 to NumBricksInPic-1, inclusive. When rect_slice_flag is equal to 0 and single_brick_per_slice_flag is equal to 1, the value of num_bricks_in_slice_minus1 is inferred to be equal to 0. When single_brick_per_slice_flag is equal to 1, the value of num_bricks_in_slice_minus1 is inferred to be equal to 0.
[0397] The variables NumBricksInCurrSlice, which specifies the number of bricks in the current strip, and SliceBrickIdx[i], which specifies the brick index of the i-th brick in the current strip, are derived as follows:
[0398]
[0399] The variables SubPicIdx, SubPicLeftBoundaryPos, SubPicTopBoundaryPos, SubPicRightBoundaryPos, and SubPicBotBoundaryPos are derived as follows:
[0400]
[0401]
[0402] 3. Examples of technical problems solved by the disclosed embodiments
[0403] (1) There are some designs that may violate the sub-image constraints.
[0404] A. The TMVP among the candidates of affine construction may obtain the MV in the collocated picture which is outside the range of the current sub-picture.
[0405] B. When deriving the gradients in bidirectional optical flow (BDOF) and predicted refined optical flow (PROF), two extended rows and two extended columns of integer reference samples need to be obtained. These reference samples may be outside the range of the current sub-picture.
[0406] C. When deriving chroma residual scaling factors in luma-mapped chroma scaling (LMCS), the accessed reconstructed luma samples may be outside the range of the current sub-picture.
[0407] D. When deriving luma intra prediction modes, reference samples for intra prediction, reference samples for CCLM, neighbor block availability for spatial neighbor candidates for Merge / AMVP / CIIP / IBC / LMCS, quantization parameters, CABAC initialization process, ctxInc derivation using left and above syntax elements, and ctxInc of syntax element mtt_split_cu_vertical_flag, the neighbor blocks may be outside the range of the current sub-picture. The representation of sub-pictures may result in sub-pictures with incomplete CTUs. CTU segmentation and CU partitioning processes may need to take into account incomplete CTUs.
[0408] (2) The syntax elements signaled regarding sub-pictures can be arbitrarily large, which may cause overflow problems.
[0409] (3) The representation of sub-images may result in non-rectangular sub-images.
[0410] (4) Currently, sub-pictures and sub-picture grids are defined in units of 4 samples. Also, the length of the syntax element depends on the picture height divided by 4. However, since currently pic_width_in_luma_samples and pic_height_in_luma_samples should be integer multiples of Max(8, MinCbSizeY), it may be necessary to define the sub-picture grid in units of 8 samples.
[0411] (5) It may be necessary to limit the SPS syntax, pic_width_max_in_luma_samples and pic_height_max_in_luma_samples to no less than 8.
[0412] (6) The interaction between reference picture resampling / scalability and sub-pictures is not considered in the current design.
[0413] (7) In time domain filtering, samples across different sub-pictures may be required.
[0414] (8) When a slice is signaled, in some cases it is possible to infer information without signaling.
[0415] (9) It is possible that all defined stripes may not cover the entire picture or sub-picture.
[0416] 4. Example Techniques and Implementations
[0417] The following detailed list should be regarded as examples to explain the general concept. These items should not be interpreted narrowly. In addition, these items can be combined in any way. Hereinafter, a time-domain filter is used to represent a filter that requires samples in other pictures. Max(x, y) returns the larger one of x and y. Min(x, y) returns the smaller one of x and y.
[0418] 1. Assume that the top-left corner coordinates of the required sub-picture are (xTL, yTL), and the bottom-right coordinates of the required sub-picture are (xBR, yBR). Then, the position (named position RB) in the picture to obtain the time-domain MV predictor to generate an affine motion candidate (e.g., the constructed affine Merge candidate) must be within the required sub-picture.
[0419] a. In one example, the required sub-picture is the sub-picture covering the current block.
[0420] b. In one example, if the position RB with coordinates (x, y) is outside the required sub-picture, the time-domain MV predictor is regarded as unavailable.
[0421] i. In one example, if x > xBR, the position RB is outside the required sub-picture.
[0422] ii. In one example, if y > yBR, the position RB is outside the required sub-picture.
[0423] iii. In one example, if x < xTL, the position RB is outside the required sub-picture.
[0424] iv. In one example, if y < yTL, the position RB is outside the required sub-picture.
[0425] c. In one example, if the position RB is outside the required sub-picture, a replacement for RB is utilized.
[0426] i. Alternatively, in addition, the replacement position should be within the required sub-picture.
[0427] d. In one example, the position RB is clipped to be within the required sub-picture.
[0428] i. In one example, x is clipped to x = Min(x, xBR).
[0429] ii. In one example, y is clipped to y = Min(y, yBR).
[0430] iii. In one example, x is clipped to x = Max(x, xTL).
[0431] iv. In one example, y is clipped to y = Max(y, yTL).
[0432] e. In one example, the position RB may be the bottom right position within the corresponding block of the current block in the collocated picture.
[0433] f. The proposed method can be used in other codecs that need to access motion information from a picture different from the current picture.
[0434] g. In one example, whether the above method is applied (e.g., the location RB must be in the required sub-picture (e.g., as required by 1.a and / or 1.b)) may depend on one or more syntax elements signaled in the VPS / DPS / SPS / PPS / APS / slice header / slice group header. For example, the syntax element may be subpic_treated_as_pic_flag[SubPicIdx], where SubPicIdx is the sub-picture index of the sub-picture covering the current block.
[0435] 2. Assuming that the coordinates of the top left corner of the desired sub-image are (xTL, yTL), and the coordinates of the bottom right corner of the desired sub-image are (xBR, yBR), the position (named as position S) for obtaining integer samples in the reference not used in the interpolation process must be in the desired sub-image.
[0436] a. In one example, the desired sub-picture is the sub-picture covering the current block.
[0437] b. In one example, if the position S with coordinates (x, y) is outside the desired sub-picture, the reference sample is considered unavailable.
[0438] i. In one example, if x>xBR, then position S is outside the desired sub-picture.
[0439] ii. In one example, if y>yBR, then position S is outside the desired sub-picture.
[0440] iii. In one example, if x < xTL, then the position S is outside the desired sub-picture.
[0441] iv. In one example, if y<yTL, then position S is outside the desired sub-picture.
[0442] c. In one example, position S is cropped to be within the desired sub-picture.
[0443] i. In one example, x is clipped to x=Min(x, xBR).
[0444] ii. In one example, y is clipped to y=Min(y, yBR).
[0445] iii. In one example, x is clipped to x=Max(x, xTL).
[0446] iv. In one example, y is clipped to y=Max(y, yTL).
[0447] d. In one example, whether position S must be in a required sub-picture (e.g., as required by 2.a and / or 2.b) may depend on one or more syntax elements signaled in the VPS / DPS / SPS / PPS / APS / slice header / slice group header. For example, the syntax element may be subpic_treated_as_pic_flag[SubPicIdx], where SubPicIdx is the sub-picture index of the sub-picture covering the current block.
[0448] e. In one example, the acquired integer samples are used to generate gradients in BDOF and / or PORF.
[0449] 3. Assuming that the left top corner coordinates of the desired sub-image are (xTL, yTL), and the right bottom coordinates of the desired sub-image are (xBR, yBR), the position for obtaining the reconstructed luminance sample value (named as position R) can be in the desired sub-image.
[0450] a. In one example, the desired sub-picture is the sub-picture covering the current block.
[0451] b. In one example, if the position R with coordinates (x, y) is outside the desired sub-picture, the reference sample is considered unavailable.
[0452] i. In one example, if x>xBR, then position R is outside the desired sub-picture.
[0453] ii. In one example, if y>yBR, then position R is outside the desired sub-picture.
[0454] iii. In one example, if x < xTL, the position R is outside the desired sub-picture.
[0455] iv. In one example, if y<yTL, the position R is outside the desired sub-picture.
[0456] c. In one example, position R is cropped to be within the desired sub-picture.
[0457] i. In one example, x is clipped to x=Min(x, xBR).
[0458] ii. In one example, y is clipped to y=Min(y, yBR).
[0459] iii. In one example, x is clipped to x = Max(x, xTL).
[0460] iv. In one example, y is clipped to y = Max(y, yTL).
[0461] d. In one example, whether the position R must be within the desired sub - picture (e.g., as required in 4.a and / or 4.b) may depend on one or more syntax elements signaled in the VPS / DPS / SPS / PPS / APS / slice - header / picture - group - header. For example, the syntax element may be subpic_treated_as_pic_flag[SubPicIdx], where SubPicIdx is the sub - picture index of the sub - picture covering the current block.
[0462] e. In one example, the obtained luma samples are used to derive the scaling factor(s) of the chrominance component(s) in LMCS.
[0463] 4. Assuming that the top - left coordinates of the desired sub - picture are (xTL, yTL) and the bottom - right coordinates of the desired sub - picture are (xBR, yBR), then the picture boundary check BT / TT / QT partitioning, BT / TT / QT depth derivation, and / or the position (named position N) signaled by the CU partitioning flag must be within the desired sub - picture.
[0464] a. In one example, the desired sub - picture is the sub - picture covering the current block.
[0465] b. In one example, if the position N with coordinates (x, y) is outside the desired sub - picture, the reference samples are considered unavailable.
[0466] i. In one example, if x > xBR, then the position N is outside the desired sub - picture.
[0467] ii. In one example, if y > yBR, then the position N is outside the desired sub - picture.
[0468] iii. In one example, if x < xTL, then the position N is outside the desired sub - picture.
[0469] iv. In one example, if y < yTL, then the position N is outside the desired sub - picture.
[0470] c. In one example, the position N is clipped to be within the desired sub - picture.
[0471] i. In one example, x is clipped to x = Min(x, xBR).
[0472] ii. In one example, y is clipped to y = Min(y, yBR).
[0473] iii. In one example, x is clipped to x=Max(x, xTL).
[0474] d. In one example, y is clipped to y = Max(y, yTL). In one example, whether position N must be in a required sub-picture (e.g., as required by 5.a and / or 5.b) may depend on one or more syntax elements signaled in the VPS / DPS / SPS / PPS / APS / slice header / slice group header. For example, the syntax element may be subpic_treated_as_pic_flag[SubPicIdx], where SubPicIdx is the sub-picture index of the sub-picture covering the current block.
[0475] 5. The history-based motion vector prediction (HMVP) table can be reset before decoding a new sub-picture in a picture.
[0476] a. In one example, the HMVP table for IBC codec can be reset
[0477] b. In one example, the HMVP table for inter-frame coding and decoding can be reset
[0478] c. In one example, the HMVP table for intra-frame coding and decoding can be reset
[0479] 6. Sub-picture syntax elements may be defined in units of N samples (eg, N=8, 32, etc.).
[0480] a. In one example, the width of each element of the sub-picture identifier grid is in units of N samples.
[0481] b. In one example, the height of each element of the sub-picture identifier grid is in units of N samples.
[0482] c. In one example, N is set to the width and / or height of the CTU.
[0483] 7. The syntax elements of picture width and picture height may be restricted to be no less than K (K>=8).
[0484] a. In one example, you may want to limit the image width to no less than 8.
[0485] b. In one example, you may need to limit the image height to no less than 8.
[0486] 8. The conforming bitstream should satisfy: enabling sub-picture coding and adaptive resolution conversion (ARC) / dynamic resolution conversion (DRC) / reference picture resampling (RPR) for a video unit (e.g., sequence) is not allowed.
[0487] a. In one example, the signaling notification for enabling sub-picture coding can be performed without allowing ARC / DRC / RPR.
[0488] i. In one example, when sub-pictures are enabled, such as subpics_present_flag equal to 1, pic_width_in_luma_samples is equal to max_width_in_luma_samples for all pictures where this SPS is active.
[0489] b. Alternatively, both sub-picture coding and ARC / DRC / RPR may be enabled for one video unit (eg, sequence).
[0490] i. In one example, the conforming bitstream should satisfy that the downsampled sub-picture due to ARC / DRC / RPR should still be in the form of K CTUs in width and M CTUs in height, where K and M are both integers.
[0491] ii. In one example, the consistency bitstream should satisfy: for sub-pictures that are not located at the picture boundary (e.g., the right boundary and / or the bottom boundary), the downsampled sub-pictures due to ARC / DRC / RPR should still be in the form of a width of K CTUs and a height of M CTUs, where K and M are both integers.
[0492] iii. In one example, the CTU size can be adaptively changed based on the picture resolution.
[0493] 1) In one example, the maximum CTU size may be signaled in the SPS. For each picture with a lower resolution, the CTU size may be changed accordingly based on the reduced resolution.
[0494] 2) In one example, the CTU size may be signaled in the SPS and PPS and / or sub-picture level.
[0495] 9. The syntax elements subpic_grid_col_width_minus1 and subpic_grid_row_height_minus1 may be constrained.
[0496] a. In one example, subpic_grid_col_width_minus1 must not be greater than (or must be less than) T1.
[0497] b. In one example, subpic_grid_row_height_minus1 must not be greater than (or must be less than) T2.
[0498] c. In one example, in a conforming bitstream, subpic_grid_col_width_minus1 and / or subpic_grid_row_height_minus1 must follow constraints such as bullet 3.a or 3.b.
[0499] d. In one example, T1 in 3.a and / or T2 in 3.b may depend on a profile / level / tier of a video codec standard.
[0500] e. In one example, T1 in 3.a may depend on the picture width.
[0501] i. For example, T1 is equal to pic_width_max_in_luma_samples / 4 or pic_width_max_in_luma_samples / 4+Off. Off can be 1, 2, -1, -2, etc.
[0502] f. In one example, T2 in 3.b may depend on the picture width.
[0503] i. For example, T2 is equal to pic_height_max_in_luma_samples / 4 or pic_height_max_in_luma_samples / 4-1+Off. Off can be 1, 2, -1, -2, etc.
[0504] 10. The constraint is that the boundary between two sub-pictures must be the boundary between two CTUs.
[0505] a. In other words, a CTU cannot be covered by more than one sub-picture.
[0506] b. In one example, the unit of subpic_grid_col_width_minus1 can be CTU width (such as 32, 64, 128) instead of 4 in VVC. The sub-picture grid width should be (subpic_grid_col_width_minus1+1)*CTU width.
[0507] c. In one example, the unit of subpic_grid_col_height_minus1 can be CTU height (such as 32, 64, 128) instead of 4 in VVC. The sub-picture grid height should be (subpic_grid_col_height_minus1+1)*CTU height.
[0508] d. In one example, in a conforming bitstream, if the sub-picture method is applied, the constraints must be satisfied.
[0509] 11. The constraint is that the shape of the sub-image must be a rectangle.
[0510] a. In one example, in a conforming bitstream, if the sub-picture method is applied, the constraints must be satisfied.
[0511] b. A sub-picture may contain only rectangular slices. For example, in a conforming bitstream, if the sub-picture method is applied, the constraints must be met.
[0512] 12. The constraint is that two sub-images cannot overlap.
[0513] a. In one example, in a conforming bitstream, if the sub-picture method is applied, the constraints must be satisfied.
[0514] b. Alternatively, the two sub-pictures may overlap each other.
[0515] 13. The constraint is that any position in the image must be covered by one and only one sub-image.
[0516] a. In one example, in a conforming bitstream, if the sub-picture method is applied, the constraints must be satisfied.
[0517] b. Alternatively, a sample may not belong to any sub-picture.
[0518] c. Alternatively, a sample may belong to more than one sub-picture.
[0519] 14. It may be constrained that the sub-pictures defined in the SPS mapped to each resolution presented in the same sequence should obey the above constraints in position and / or size.
[0520] a. In one example, the width and height of a sub-picture defined in an SPS that maps to a resolution presented in the same sequence should be an integer multiple of N (such as 8, 16, 32) luma samples.
[0521] b. In one example, a sub-picture may be defined for a layer and the sub-picture may be mapped to other layers.
[0522] i. For example, a sub-picture may be defined for the layer with the highest resolution in the sequence.
[0523] ii. For example, a sub-picture may be defined for the layer with the lowest resolution in the sequence.
[0524] iii. It may be signaled in the SPS / VPS / PPS / slice header for which layer the sub-picture is defined.
[0525] c. In one example, when both sub-pictures and different resolutions are applied, all resolutions (eg, width and / or height) may be integer multiples of a given resolution.
[0526] d. In one example, the width and / or height of a sub-picture defined in an SPS may be an integer multiple (eg, M) of the CTU size.
[0527] e. Alternatively, sub-pictures and different resolutions in a sequence may not be allowed simultaneously.
[0528] 15. Sub-images may only be applied to one (or some) layers
[0529] a. In one example, the sub-pictures defined in the SPS may only be applied to the layer with the highest resolution in the sequence.
[0530] b. In one example, the sub-picture defined in the SPS may only apply to the layer with the lowest temporal id in the sequence.
[0531] c. One or more syntax elements in SPS / VPS / PPS may indicate which layer(s) a sub-picture may be applied to.
[0532] d. One or more syntax elements in SPS / VPS / PPS may be used to indicate which layer(s) a sub-picture cannot be applied to.
[0533] 16. In one example, the location and / or dimensions of the sub-picture may be signaled without using subpic_grid_idx.
[0534] a. In one example, the top left position of the sub-picture may be signaled.
[0535] b. In one example, the bottom right position of the sub-picture may be signaled.
[0536] c. In one example, the width of the sub-picture may be signaled.
[0537] d. In one example, the height of the sub-picture may be signaled.
[0538] 17. For the time domain filter, when performing time domain filtering of samples, only samples in the same sub-picture to which the current sample belongs can be used. The required samples may be in the same picture to which the current sample belongs, or in other pictures.
[0539] 18. In one example, whether and / or how to apply a partitioning method (such as QT, horizontal BT, vertical BT, horizontal TT, vertical TT, or no partitioning, etc.) may depend on whether the current block (or partition) crosses one or more boundaries of a sub-picture.
[0540] a. In one example, when picture boundaries are replaced by sub-picture boundaries, the picture boundary processing method for segmentation in VVC can also be applied.
[0541] b. In one example, whether to parse a syntax element (e.g., a flag) indicating a partitioning method (such as QT, horizontal BT, vertical BT, horizontal TT, vertical TT, or no partitioning, etc.) may depend on whether the current block (or partition) crosses one or more boundaries of a sub-picture.
[0542] 19. Instead of dividing a picture into multiple sub-pictures, each of which is independently encoded and decoded, it is proposed to divide the picture into at least two sub-region sets, the first set includes multiple sub-pictures, and the second set includes all remaining samples.
[0543] a. In one example, the samples in the second set are not in any sub-picture.
[0544] b. Alternatively, furthermore, the second set may be encoded / decoded based on the information of the first set.
[0545] c. In one example, a default value may be used to mark whether a sample point / MxK sub-region belongs to the second set.
[0546] i. In one example, the default value may be set equal to (max_subpics_minus1+K), where K is an integer greater than 1.
[0547] ii. A default value may be assigned to subpic_grid_idx[i][j] to indicate that the grid belongs to the second set.
[0548] 20. It is proposed that the syntax element subpic_grid_idx[i][j] cannot be greater than max_subpics_minus1.
[0549] a. For example, the constraint is that in a conforming bitstream, subpic_grid_idx[i][j] cannot be greater than max_subpics_minus1.
[0550] b. For example, the codeword used to encode and decode subpic_grid_idx[i][j] cannot be greater than max_subpics_minus1.
[0551] 21. It is proposed that any integer from 0 to max_subpics_minus1 must be equal to at least one subpic_grid_idx[i][j].
[0552] 22. The IBC virtual buffer may be reset before decoding a new sub-picture within a picture.
[0553] a. In one example, all samples in the IBC virtual buffer may be reset to -1.
[0554] 23. The palette entry list can be reset before decoding a new sub-picture in a picture.
[0555] a. In one example, PredictorPaletteSize may be set equal to 0 before decoding a new sub-picture in a picture.
[0556] 24. Whether to signal the information of the stripes (eg, the number of stripes and / or the range of the stripes) may depend on the number of slices and / or the number of bricks.
[0557] a. In one example, if the number of tiles in a picture is 1, num_slices_in_pic_minus1 is not signaled and is inferred to be 0.
[0558] b. In one example, if the number of tiles in a picture is 1, information of the slices (eg, the number of slices and / or the range of the slices) may not be signaled.
[0559] c. In one example, if the number of bricks in a picture is 1, the number of slices can be inferred to be 1. And, the slice covers the entire picture. In one example, if the number of bricks in a picture is 1, single_brick_per_slice_flag is not signaled and is inferred to be 1.
[0560] i. Alternatively, if the number of bricks in the picture is 1, single_brick_per_slice_flag must be 1.
[0561] d. The exemplary grammar design is as follows:
[0562]
[0563]
[0564] 25. Whether slice_address is signaled may be separate from whether the slice is signaled to be rectangular (eg, whether rect_slice_flag is equal to 0 or 1).
[0565] a. An exemplary grammar design is as follows:
[0566] if([[rect_slice_flag||]]NumBricksInPic>1) slice_address u(v)
[0567] 26. Whether slice_address is signaled may depend on the number of slices when the slices are signaled as rectangular.
[0568]
[0569] 27. Whether num_bricks_in_slice_minus1 is signaled may depend on slice_address and / or the number of bricks in the picture.
[0570] a. An exemplary grammar design is as follows:
[0571]
[0572] 28. Whether loop_filter_across_bricks_enabled_flag is signaled may depend on the number of slices and / or the number of bricks.
[0573] a. In one example, if the number of bricks is less than 2, loop_filter_across_bricks_enabled_flag is not signaled.
[0574] b. The exemplary grammar design is as follows:
[0575]
[0576] 29. Bitstream conformance requires that all slices of a picture must cover the entire picture.
[0577] a. This requirement must be met when the signaling notification slice is rectangular (for example, rect_slice_flag is equal to 1).
[0578] 30. Bitstream conformance requires that all slices of a sub-picture must cover the entire sub-picture.
[0579] a. This requirement must be met when the signaling notification slice is rectangular (for example, rect_slice_flag is equal to 1).
[0580] 31. Bitstream conformance requires that a slice cannot overlap with more than one sub-picture.
[0581] 32. Bitstream conformance requires that a slice cannot overlap with more than one sub-picture.
[0582] 33. Bitstream conformance requires that a tile cannot overlap more than one sub-picture.
[0583] In the following discussion, a basic unit block (BUB) with dimensions of CW×CH is a rectangular area. For example, a BUB may be a codec tree block (CTB).
[0584] 34. In one example, the number of sub-pictures (denoted as N) may be signaled.
[0585] a. If sub-pictures are used (eg, subpics_present_flag is equal to 1), the conforming bitstream may require that at least two sub-pictures be present in a picture.
[0586] b. Alternatively, N minus d (ie, Nd) may be signaled, where d is an integer such as 0, 1 or 2.
[0587] c. For example, Nd may be encoded using a fixed length codec (eg, u(x)).
[0588] i. In one example, x may be a fixed number such as 8.
[0589] ii. In one example, x or x-dx may be signaled before signaling Nd, where dx is an integer such as 0, 1 or 2. The signaled x may not be greater than the maximum value in the conforming bitstream.
[0590] iii. In one example, x can be exported on the fly.
[0591] 1) For example, x can be derived as a function of the total number of BUBs in the picture (denoted as M). For example, x=Ceil(log2(M+d0))+d1, where d0 and d1 are two integers, such as -2, -1, 0, 1, 2, etc.
[0592] 2) M can be derived as M = Ceiling (W / CW) × Ceiling (H / CH), where W and H represent the width and height of the image, and CW and CH represent the width and height of the BUB.
[0593] d. For example, Nd may be encoded or decoded using a unary code or a truncated unary code.
[0594] e. In one example, the maximum allowed value of Nd may be a fixed number.
[0595] i. Alternatively, the maximum value of Nd allowed can be derived as a function of the total number of BUBs in the picture, denoted as M. For example, x=Ceil(log2(M+d0))+d1, where d0 and d1 are two integers, such as -2, -1, 0, 1, 2, etc.
[0596] 35. In one example, a sub-picture may be signaled by one or more of its selected position (eg, top left / top right / bottom left / bottom right position) and / or an indication of its width and / or its height.
[0597] a. In one example, the top left position of a sub-picture may be signaled at a granularity of a basic unit block (BUB) of dimension CW×CH.
[0598] i. For example, the column index (denoted as Col) of the BUB according to the top left BUB of the sub-picture may be signaled.
[0599] 1) For example, Col-d can be signaled, where d is an integer such as 0, 1 or 2.
[0600] a) Alternatively, d may be equal to Col of the previously coded sub-picture plus d1, where d1 is an integer such as -1, 0 or 1.
[0601] b) The symbol of Col-d may be signaled.
[0602] ii. For example, the row index (denoted as Row) of the BUB according to the top left BUB of the sub-picture may be signaled.
[0603] 1) For example, Row-d can be signaled, where d is an integer such as 0, 1 or 2.
[0604] a) Alternatively, d may be equal to the Row of the previously coded sub-picture plus d1, where d1 is an integer such as -1, 0 or 1.
[0605] b) The symbol of Row-d may be signaled.
[0606] iii. The row / column index (denoted as Row) mentioned above may be represented in a codec tree block (CTB) unit, for example, the x or y coordinate relative to the top left position of the picture may be divided by the CTB size and signaled.
[0607] iv. In one example, whether to signal the position of a sub-picture may depend on the sub-picture index.
[0608] 1) In one example, for the first sub-picture within a picture, the top left position may not be signaled.
[0609] a) Alternatively, furthermore, the top left position may be inferred to be, for example, (0, 0).
[0610] 2) In one example, for the last sub-picture within a picture, the top left position may not be signaled.
[0611] a) The left top position can be inferred depending on the information of the previously signaled sub-picture.
[0612] b. In one example, the indication of the width / height / selected position of the sub-picture may be signaled using truncated unary / truncated binary / unary / fixed length / Kth EG codec (eg, K=0, 1, 2, 3).
[0613] c. In one example, the width of a sub-picture may be signaled at a granularity of a BUB of dimension CW×CH.
[0614] i. For example, the number of columns of BUBs in a sub-picture (denoted as W) may be signaled.
[0615] ii. For example, Wd may be signaled, where d is an integer such as 0, 1 or 2.
[0616] 1) Alternatively, d may be equal to W of the previously coded sub-picture plus d1, where d1 is an integer such as -1, 0 or 1.
[0617] 2) The sign of Wd may be signaled.
[0618] d. In one example, the height of the sub-picture may be signaled at the granularity of a BUB of dimension CW×CH.
[0619] i. For example, the number of rows of BUBs in a sub-picture (denoted as H) may be signaled.
[0620] ii. For example, Hd can be signaled, where d is an integer such as 0, 1 or 2.
[0621] 1) Alternatively, d may be equal to H of the previously coded sub-picture plus d1, where d1 is an integer such as -1, 0 or 1.
[0622] 2) The symbol of Hd can be signaled.
[0623] e. In one example, Col-d may be encoded using a fixed length codec (eg, u(x)).
[0624] i. In one example, x may be a fixed number such as 8.
[0625] ii. In one example, x or x-dx may be signaled before Col-d is signaled, where dx is an integer such as 0, 1 or 2. The signaled x may not be greater than the maximum value in the conforming bitstream.
[0626] iii. In one example, x can be exported on the fly.
[0627] 1) For example, x can be derived as a function of the total number of BUB columns in the picture, denoted as M. For example, x=Ceil(log2(M+d0))+d1, where d0 and d1 are two integers, such as -2, -1, 0, 1, 2, etc.
[0628] 2) M can be derived as M=Ceiling(W / CW), where W represents the width of the image and CW represents the width of the BUB.
[0629] f. In one example, a fixed length codec (eg, u(x)) may be used to encode and decode Row-d.
[0630] i. In one example, x may be a fixed number such as 8.
[0631] ii. In one example, x or x-dx may be signaled before signaling Row-d, where dx is an integer such as 0, 1, or 2. The signaled x may not be greater than the maximum value in the conforming bitstream.
[0632] iii. In one example, x can be exported on the fly.
[0633] 1) For example, x can be derived as a function of the total number of BUB rows in the picture, denoted as M. For example, x=Ceil(log2(M+d0))+d1, where d0 and d1 are two integers, such as -2, -1, 0, 1, 2, etc.
[0634] 2) M can be derived as M=Ceiling(H / CH), where H represents the height of the picture and CH represents the height of the BUB.
[0635] g. In one example, Wd may be encoded using a fixed length codec (eg, u(x)).
[0636] i. In one example, x may be a fixed number such as 8.
[0637] ii. In one example, x or x-dx may be signaled before signaling Wd, where dx is an integer such as 0, 1, or 2. The signaled x may not be greater than the maximum value in the conforming bitstream.
[0638] iii. In one example, x can be exported on the fly.
[0639] 1) For example, x can be derived as a function of the total number of BUB columns in the picture, denoted as M. For example, x=Ceil(log2(M+d0))+d1, where d0 and d1 are two integers, such as -2, -1, 0, 1, 2, etc.
[0640] 2) M can be derived as M=Ceiling(W / CW), where W represents the width of the image and CW represents the width of the BUB.
[0641] h. In one example, a fixed length codec (eg, u(x)) may be used to encode Hd.
[0642] i. In one example, x may be a fixed number such as 8.
[0643] ii. In one example, x or x-dx may be signaled before signaling Hd, where dx is an integer such as 0, 1, or 2. The signaled x may not be greater than the maximum value in the conforming bitstream.
[0644] iii. In one example, x can be exported on the fly.
[0645] 1) For example, x can be derived as a function of the total number of BUB rows in the picture, denoted as M. For example, x=Ceil(log2(M+d0))+d1, where d0 and d1 are two integers, such as -2, -1, 0, 1, 2, etc.
[0646] 2) M can be derived as M=Ceiling(H / CH), where H represents the height of the picture and CH represents the height of the BUB.
[0647] i. Col-d and / or Row-d may be signaled for all sub-pictures.
[0648] i. Alternatively, Col-d and / or Row-d may not be signaled for all sub-pictures.
[0649] 1) If the number of sub-pictures is less than 2 (equal to 1), col-d and / or row-d may not be signaled.
[0650] 2) For example, Col-d and / or Row-d may not be signaled for the first sub-picture (eg, the sub-picture index (or sub-picture ID) is equal to 0).
[0651] a) When they are not signaled, they can be inferred to be 0.
[0652] 3) For example, Col-d and / or Row-d may not be signaled for the last sub-picture (eg, the sub-picture index (or sub-picture ID) is equal to NumSubPics-1).
[0653] a) When they are not signaled, they can be inferred depending on the position and dimensions of the sub-pictures that have been signaled.
[0654] j. Wd and / or Hd may be signaled for all sub-pictures.
[0655] i. Alternatively, Wd and / or Hd may not be signaled for all sub-pictures.
[0656] 1) If the number of sub-pictures is less than 2 (equal to 1), Wd and / or Hd may not be signaled.
[0657] 2) For example, Wd and / or Hd may not be signaled for the last sub-picture (eg, the sub-picture index (or sub-picture ID) is equal to NumSubPics-1).
[0658] a) When they are not signaled, they can be inferred depending on the position and dimensions of the sub-pictures that have been signaled.
[0659] k. In the above bullet points, a BUB may be a codec tree block (CTB).
[0660] 36. In one example, the information of the sub-picture should be signaled after the information of the CTB size (eg log2_ctu_size_minus5) has been signaled.
[0661] 37. subpic_treated_as_pic_flag[i] may not be signaled for each sub-picture. Instead, one subpic_treated_as_pic_flag is signaled to control whether the sub-picture is treated as a picture for all sub-pictures.
[0662] 38. loop_filter_across_subpic_enabled_flag[i] may not be signaled for each sub-picture. Instead, one loop_filter_across_subpic_enabled_flag is signaled to control whether the loop filter can be applied across sub-pictures of all sub-pictures.
[0663] 39. subpic_treated_as_pic_flag[i] (subpic_aged_as_pic_flag) and / or loop_filter_across_subpic_enabled_flag[i] (loop_filter_across_subpic_enabled_flag) may be signaled conditionally.
[0664] a. In one example, if the number of sub-pictures is less than 2 (equal to 1), subpic_treated_as_pic_flag[i] and / or loop_filter_across_subpic_enabled_flag[i] may not be signaled.
[0665] 40. When using sub-pictures, RPR can be applied.
[0666] a. In one example, when sub-pictures are used, the scaling ratios in the RPR may be constrained to a limited set, such as {1:1, 1:2 and / or 2:1} or {1:1, 1:2 and / or 2:1, 1:4 and / or 4:1}, {1:1, 1:2 and / or 2:1, 1:4 and / or 4:1, 1:8 and / or 8:1}.
[0667] b. In one example, if the resolutions of picture A and picture B are different, the CTB size of picture A and the CTB size of picture B may be different.
[0668] c. In one example, assuming that a sub-image SA of dimensions SAW×SAH is in image A, and a sub-image SB of dimensions SBW×SBH is in image B, SA corresponds to SB, and the scaling ratio between images A and B is Rw and Rh in the horizontal and vertical directions, then
[0669] i. SAW / SBW or SBW / SAW should be equal to Rw.
[0670] ii. SAH / SBH or SBH / SAH should be equal to Rh.
[0671] 41. When sub-pictures are used (eg, sub_pics_present_flag is true), the sub-picture index (or sub-picture ID) may be signaled in the slice header, and the slice address is broken out as an address within the sub-picture rather than the address of the entire picture.
[0672] 5. Examples
[0673] In the following examples, newly added text is displayed in bold italics, and deleted text is marked with "[[ ]]".
[0674] 5.1 Example 1: Constraints on Sub-Pictures of Affine-Constructed Merge Candidates
[0675] 8.5.5.6 Derivation process of constructed affine control point motion vector Merge candidates
[0676] The inputs to this process are:
[0677] - Luma position (xCb, yCb), specifies the top left sample of the current luma codec block relative to the top left luma sample of the current picture,
[0678] - Two variables cbWidth and cbHeight, specifying the width and height of the current brightness codec block,
[0679] -Availability flags availableA0, availableA1, availableA2, availableB0, availableB1, availableB2, availableB3,
[0680] - Sample point positions (xNbA0, yNbA0), (xNbA1, yNbA1), (xNbA2, yNbA2), (xNbB0, yNbB0), (xNbB1, yNbB1), (xNbB2, yNbB2) and (xNbB3, yNbB3).
[0681] The output of this process is:
[0682] - The availability flag availableFlagConstK of the constructed affine control point motion vector Merge candidate, where K = 1..6,
[0683] - reference index refIdxLXConstK, where K=1..6, X is 0 or 1,
[0684] - Prediction list uses flag predFlagLXConstK, where K = 1..6, X is 0 or 1,
[0685] - affine motion model index motionModelIdcConstK, where K = 1..6,
[0686] - Bidirectional prediction weight index bcwIdxConstK, where K = 1..6,
[0687] - Constructed affine control point motion vector cpMvLXConstK[cpIdx], where cpIdx=0..2, K=1..6, and X is 0 or 1.
[0688] …
[0689] The fourth (juxtaposed right bottom) control point motion vector cpMvLXCorner[3], reference index refIdxLXCorner[3], prediction list utilization flag predFlagLXCorner[3] and availability flag availableFlagCorner[3], where X is 0 and 1, is derived as follows:
[0690] - The reference index refIdxLXCorner[3] of the temporal Merge candidate is set equal to 0, where X is 0 or 1.
[0691] - The variables mvLXCol and availableFlagLXCol, where X is 0 or 1, are derived as follows:
[0692] If slice_temporal_mvp_enabled_flag is equal to 0, both components of mvLXCol are set equal to 0 and availableFlagLXCol is set equal to 0.
[0693] - Otherwise (slice_temporal_mvp_enabled_flag is equal to 1), the following applies:
[0694] xColBr=xCb+cbWidth (8-601)
[0695] yColBr=yCb+cbHeight (8-602)
[0696]
[0697] - If yCb>>CtbLog2SizeY is equal to yColBr>>CtbLog2SizeY,
[0698] - The variable colCb specifies the luma codec block that covers the modified position given by ((xColBr>>3)<<3, (yColBr>>3)<<3) within the collocated picture specified by ColPic.
[0699] - The luma position (xColCb, yColCb) is set equal to the top left sample of the collocated luma codec block specified by colCb relative to the top left luma sample of the collocated picture specified by ColPic.
[0700] - Invoke the derivation process of the collocated motion vector specified in clause 8.5.2.12 with currCb, colCb, (xColCb, yColCb), refIdxLXCorner[3] and sbFlag set equal to 0 as input and the output assigned to mvLXCol and availableFlagLXCol.
[0701] Otherwise, both components of mvLXCol are set equal to 0 and availableFlagLXCol is set equal to 0.
[0702] …
[0703] 5.2 Example 2: Constraints on Sub-Pictures of Affine-Constructed Merge Candidates
[0704] 8.5.5.6 Derivation process of constructed affine control point motion vector Merge candidates
[0705] The inputs to this process are:
[0706] - Luma position (xCb, yCb), specifies the top left sample of the current luma codec block relative to the top left luma sample of the current picture,
[0707] -Two variables cbWidth and cbHeight, specify the width and height of the current brightness codec block,
[0708] -Availability flags availableA0, availableA1, availableA2, availableB0, availableB1, availableB2, availableB3,
[0709] - Sample point positions (xNbA0, yNbA0), (xNbA1, yNbA1), (xNbA2, yNbA2), (xNbB0, yNbB0), (xNbB1, yNbB1), (xNbB2, yNbB2) and (xNbB3, yNbB3).
[0710] The output of this process is:
[0711] - The availability flag availableFlagConstK of the constructed affine control point motion vector Merge candidate, where K = 1..6,
[0712] - reference index refIdxLXConstK, where K=1..6, X is 0 or 1,
[0713] - Prediction list uses flag predFlagLXConstK, where K = 1..6, X is 0 or 1,
[0714] - affine motion model index motionModelIdcConstK, where K = 1..6,
[0715] - Bidirectional prediction weight index bcwIdxConstK, where K = 1..6,
[0716] - Constructed affine control point motion vector cpMvLXConstK[cpIdx], where cpIdx=0..2, K=1..6, and X is 0 or 1.
[0717] …
[0718] The fourth (juxtaposed right bottom) control point motion vector cpMvLXCorner[3], reference index refIdxLXCorner[3], prediction list utilization flag predFlagLXCorner[3] and availability flag availableFlagCorner[3], where X is 0 and 1, is derived as follows:
[0719] -The reference index refIdxLXCorner[3] of the temporal Merge candidate, where X is 0 or 1, is set equal to 0.
[0720] - The variables mvLXCol and availableFlagLXCol, where X is 0 or 1, are derived as follows:
[0721] If slice_temporal_mvp_enabled_flag is equal to 0, both components of mvLXCol are set equal to 0 and availableFlagLXCol is set equal to 0.
[0722] - Otherwise (slice_temporal_mvp_enabled_flag is equal to 1), the following applies:
[0723] xColBr=xCb+cbWidth (8-601)
[0724] yColBr=yCb+cbHeight (8-602)
[0725]
[0726]
[0727] - If yCb>>CtbLog2SizeY equals yColBr>>CtbLog2SizeY, [[yColBr is less than pic_height_in_luma_samples, xColBr is less than pic_width_in_luma_samples, then the following applies]]:
[0728] - The variable colCb specifies the luma codec block that covers the modified position given by ((xColBr>>3)<<3, (yColBr>>3)<<3) within the collocated picture specified by ColPic.
[0729] - The luma position (xColCb, yColCb) is set equal to the top left sample of the collocated luma codec block specified by colCb relative to the top left luma sample of the collocated picture specified by ColPic.
[0730] - Invoke the derivation process of the collocated motion vector specified in clause 8.5.2.12 with currCb, colCb, (xColCb, yColCb), refIdxLXCorner[3] and sbFlag set equal to 0 as input and the output assigned to mvLXCol and availableFlagLXCol.
[0731] Otherwise, both components of mvLXCol are set equal to 0 and availableFlagLXCol is set equal to 0.
[0732] …
[0733] 5.3 Example 3: Obtaining integer samples under sub-image constraints
[0734] 8.5.6.3.3 Luminance integer sample acquisition process
[0735] The inputs to this process are:
[0736] – Luminance position in full sample units (xInt L ,yInt L ),
[0737] - Luminance reference sample array refPicLX L ,
[0738] The output of this process is the predicted luminance sample value predSampleLX L
[0739] The variable shift is set equal to Max(2,14-BitDepth Y ).
[0740] The variable picW is set equal to pic_width_in_luma_samples, and the variable picH is set equal to pic_height_in_luma_samples.
[0741] The luminance position (xInt, yInt) in units of full samples is derived as follows:
[0742]
[0743] xInt=Clip3(0,picW-1,sps_ref_wraparound_enabled_flag? (8-782)
[0744] ClipH((sps_ref_wraparound_offset_minus1+1)*MinCbSizeY,picW,xInt L ):xInt L )
[0745] yInt=Clip3(0,picH-1,yInt L ) (8-783)
[0746] Predicted brightness sample value predSampleLX L The export is as follows:
[0747] predSampleLX L =refPicLX L [xInt][yInt]< <shift3 (8-784)
[0748] 5.4 Example 4: Derivation of the variable invAvgLuma in the chrominance residual scaling of LMCS
[0749] 8.7.5.3 Image reconstruction of chrominance samples using the luminance-dependent chrominance residual scaling process
[0750] The inputs to this process are:
[0751] - the chroma position (xCurr, yCurr) of the top left chroma sample of the current chroma transform block relative to the top left chroma sample of the current picture,
[0752] - variable nCurrSw, specifies the width of the chroma transform block,
[0753] - variable nCurrSh, specifies the height of the chroma transform block,
[0754] - variable tuCbfChroma, specifies the codec block flag of the current chroma transform block,
[0755] - (nCurrSw)x(nCurrSh) array predSamples, specifies the chroma prediction samples of the current block,
[0756] - (nCurrSw)x(nCurrSh) array resSamples, specifies the chroma residual samples of the current block,
[0757] The output of this process is the reconstructed chrominance picture sample array recSamples.
[0758] The variable sizeY is set equal to Min(CtbSizeY, 64).
[0759] For i = 0..nCurrSw-1, j = 0..nCurrSh-1, the reconstructed chrominance picture samples recSamples are derived as follows:
[0760] -…
[0761] - Otherwise, the following applies:
[0762] -…
[0763] - The variable currPic specifies the array of reconstructed luma samples in the current picture.
[0764] - For the export of the variable varScale, the following sequential steps apply:
[0765] 1. The variable invAvgLuma is derived as follows:
[0766] - The array recLuma[i] (where i=0..(2*sizeY-1)) and the variable cnt are derived as follows:
[0767] -The variable cnt is set equal to 0.
[0768]
[0769] - When availL is equal to TRUE, the array recLuma[i] (where i=0..sizeY-1) is set equal to (where i=0..sizeY-1), cnt is set equal to sizeY.
[0770] - When availT is equal to true, the array recLuma[cnt+i] (where i=0..sizeY–1) is set equal to (where i=0..sizeY-1), and cnt is set equal to (cnt+sizeY).
[0771] -The variable invAvgLuma is derived as follows:
[0772] - If cnt is greater than 0, the following applies:
[0773]
[0774] - Otherwise (cnt is equal to 0), the following applies:
[0775] invAvgLuma=1<<(BitDepth Y –1) (8-1014)
[0776] 5.5 Embodiment 5: Example of defining sub-picture elements in units of N samples other than 4 samples (such as N=8 or 32)
[0777] 7.4.3.3 Sequence parameter set RBSP semantics
[0778] subpic_grid_col_width_minus1 plus 1 specifies The width of each element of the sub-picture identifier grid is in units of samples. The length of the syntax element is Bit.
[0779] The variable NumSubPicGridCols is derived as follows:
[0780]
[0781] subpic_grid_row_height_minus1 plus 1 specifies the height of each element in the sub-picture identifier grid in units of 4 samples. The length of the syntax element is Bit.
[0782] The variable NumSubPicGridRows is derived as follows:
[0783]
[0784] 7.4.7.1 General Stripe Header Semantics
[0785] The variables SubPicIdx, SubPicLeftBoundaryPos, SubPicTopBoundaryPos, SubPicRightBoundaryPos, and SubPicBotBoundaryPos are derived as follows:
[0786]
[0787] 5.6 Example 6: Limiting the image width and image height to be equal to or greater than 8
[0788] 7.4.3.3 Sequence parameter set RBSP semantics
[0789] Specifies the maximum width (in luma samples) of each decoded picture that references the SPS. pic_width_max_in_luma_samples shall not be equal to 0 and shall be [[MinCbSizeY]] An integer multiple of .
[0790] Specifies the maximum height (in luma samples) of each decoded picture that references the SPS. pic_height_max_in_luma_samples shall not be equal to 0 and shall be [[MinCbSizeY]] An integer multiple of .
[0791] 5.7 Example 7: Sub-picture boundary check for signaling of BT / TT / QT partitioning, BT / TT / QT depth derivation and / or CU partitioning flag
[0792] 6.4.2 Allowed binary partitioning procedures
[0793] The variable allowBtSplit is exported as follows:
[0794] -…
[0795] - Otherwise, if all of the following conditions are true, allowBtSplit is set equal to FALSE
[0796] -btSplit equals SPLIT_BT_VER
[0797] -y0+cbHeight is greater than [[pic_height_in_luma_samples]]
[0798] - Otherwise, if all of the following are true, allowBtSplit is set equal to false
[0799] -btSplit equals SPLIT_BT_VER
[0800] -cbHeight is greater than MaxTbSizeY
[0801] -x0+cbWidth is greater than [[pic_height_in_luma_samples]]
[0802] - Otherwise, if all of the following are true, allowBtSplit is set equal to false
[0803] -btSplit equals SPLIT_BT_HOR
[0804] -cbWidth is greater than MaxTbSizeY
[0805] -y0+cbHeight is greater than [[pic_height_in_luma_samples]]
[0806] - Otherwise, if all of the following are true, allowBtSplit is set equal to false
[0807] -x0+cbWidth is greater than [[pic_width_in_luma_samples]]
[0808] -y0+cbHeight is greater than [[pic_height_in_luma_samples]]
[0809] -cbWidth is greater than minQtSize
[0810] - Otherwise, if all of the following are true, allowBtSplit is set equal to false
[0811] -btSplit equals SPLIT_BT_HOR
[0812] -x0+cbWidth is greater than [[pic_width_in_luma_samples]]
[0813] -y0+cbHeight is less than or equal to[[pic_height_in_luma_samples]]
[0814] 6.4.2 Allowable ternary partitioning processes
[0815] The variable allowTtSplit is exported as follows:
[0816] - allowTtSplit is set equal to false if one or more of the following conditions are true:
[0817] -cbSize is less than or equal to 2*MinTtSizeY
[0818] -cbWidth is greater than Min(MaxTbSizeY, maxTtSize)
[0819] -cbHeight is greater than Min(MaxTbSizeY, maxTtSize)
[0820] -mttDepth is greater than or equal to maxMttDepth
[0821] -x0+cbWidth is greater than [[pic_width_in_luma_samples]]
[0822] -y0+cbHeight is greater than [[pic_height_in_luma_samples]]
[0823] -treeType is equal to DUAL_TREE_CHROMA, and (cbWidth / SubWidthC)*(cbHeight / SubHeightC) is less than or equal to 32.
[0824] -treeType is equal to DUAL_TREE_CHROMA, and modeType is equal to MODE_TYPE_INTRA.
[0825] - Otherwise, allowTtSplit is set equal to true.
[0826] 7.3.8.2 Codec Tree Unit Syntax
[0827]
[0828] 7.3.8.4 Codec Tree Syntax
[0829]
[0830]
[0831] 5.8 Example 8: Example of defining a sub-image
[0832]
[0833]
[0834]
[0835] 5.9 Example 9: Example of defining a sub-image
[0836]
[0837]
[0838] 5.10 Example 10: Example of defining a sub-image
[0839]
[0840]
[0841] 5.11 Example 11: Example of defining a sub-image
[0842]
[0843]
[0844]
[0845] Figure 3 is a block diagram of a video processing device 300. The device 300 can be used to implement one or more methods described herein. The device 300 can be implemented in a smartphone, a tablet, a computer, an Internet of Things (IoT) receiver, etc. The device 300 may include one or more processors 302, one or more memories 304, and video processing hardware 306. The processor(s) 302 may be configured to implement one or more methods described in this document. The memory(s) 304 may be used to store data and code for implementing the methods and techniques described herein. The video processing hardware 306 may be used to implement some of the techniques described in this document in hardware circuits.
[0846] Figure 4 4 is a flow chart of a method 400 for processing a video. The method 400 includes determining, for a video block in a first video region of the video, whether a location of a temporal motion vector predictor is within a second video region using an affine mode for a conversion between a bitstream representation of the video block and a current video block (402), and performing a conversion based on the determination (404).
[0847] In some embodiments, the following solution may be implemented as a preferred solution.
[0848] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 1).
[0849] 1. A method of video processing, comprising: determining, for a video block in a first video region of a video, whether a position of a temporal motion vector predictor is within a second video region using an affine mode for a conversion between a bitstream representation of the video block and a current video block; and performing conversion based on the determination.
[0850] 2. The method according to solution 1, wherein the video block is covered by the first area and the second area.
[0851] 3. The method according to any of the solutions 1-2, wherein if the position of the temporal motion vector predictor is outside the second video region, the temporal motion vector predictor is marked as unavailable and not used in the conversion.
[0852] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (eg, item 2).
[0853] 4. A method of video processing, comprising: for a video block in a first video region of a video, determining whether a position of an integer sample point in a reference picture obtained for a conversion between a bitstream representation of the video block and a current video block is within a second video region, wherein during the conversion, the reference picture is not used for an interpolation process; and performing the conversion based on the determination.
[0854] 5. The method according to solution 4, wherein the video block is covered by the first area and the second area.
[0855] 6. The method according to any of the solutions 4-5, wherein if the location of the sample is outside the second video area, the sample is marked as unavailable and is not used in the conversion.
[0856] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 3).
[0857] 7. A method of video processing, comprising: for a video block in a first video region of a video, determining whether a location for obtaining a reconstructed luminance sample value for a conversion between a bitstream representation of the video block and a current video block is within a second video region; and performing conversion based on the determination.
[0858] 8. The method according to solution 7, wherein the brightness sample is covered by the first area and the second area.
[0859] 9. The method according to any of the solutions 7-8, wherein if the location of the luma sample is outside the second video region, the luma sample is marked as unavailable and is not used in the conversion.
[0860] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 4).
[0861] 10. A method of video processing, comprising: for a video block in a first video region of a video, determining whether a location of a check for splitting, depth derivation, or split flag signaling notification for the video block performed during a conversion between a bitstream representation of the video block and a current video block is within a second video region; and performing the conversion based on the determination.
[0862] 11. The method according to solution 10, wherein the location is covered by a first area and a second area.
[0863] 12. The method according to any of the solutions 10-11, wherein if the position is outside the second video area, the luma sample is marked as unavailable and not used in the conversion.
[0864] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 8).
[0865] 13. A method for video processing, comprising: performing a conversion between a video including one or more video pictures and a codec representation of the video, the one or more video pictures including one or more video blocks; wherein the codec representation complies with codec syntax requirements, and the conversion does not use sub-picture encoding / decoding and dynamic resolution conversion encoding / decoding tools or reference picture resampling tools within a video unit.
[0866] 14. The method according to solution 13, wherein a video unit corresponds to a sequence of one or more video pictures.
[0867] 15. A method according to any one of solutions 13-14, wherein the dynamic resolution conversion encoding / decoding tool includes an adaptive resolution conversion encoding / decoding tool.
[0868] 16. A method according to any of solutions 13-14, wherein the dynamic resolution conversion encoding / decoding tool includes a dynamic resolution conversion encoding / decoding tool.
[0869] 17. The method according to any of solutions 13-16, wherein the codec representation indicates that the video unit complies with codec syntax requirements.
[0870] 18. The method of solution 17, wherein the codec representation indicates that the video unit uses sub-picture codec.
[0871] 19. The method of solution 17, wherein the codec representation indicates that the video unit uses a dynamic resolution conversion encoding / decoding tool or a reference picture resampling tool.
[0872] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 10).
[0873] 20. The method according to any one of solutions 1-19, wherein the second video region comprises a video sub-picture, and wherein a boundary of the second video region and a boundary of the further video region are also boundaries between two codec tree units.
[0874] 21. The method according to any one of solutions 1-19, wherein the second video region comprises a video sub-picture, and wherein a boundary of the second video region and a boundary of the further video region are also boundaries between two codec tree units.
[0875] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., Item 11).
[0876] 22. The method according to any of the solutions 1-21, wherein the first video area and the second video area have a rectangular shape.
[0877] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 12).
[0878] 23. The method of any of solutions 1-22, wherein the first video area and the second video area are non-overlapping.
[0879] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., Item 13).
[0880] 24. The method according to any of the solutions 1-23, wherein the video picture is divided into video regions such that a pixel in the video picture is covered by one and only one video region.
[0881] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., Item 15).
[0882] 25. The method according to any of the solutions 1-24, wherein the video picture is divided into a first video region and a second video region due to the video picture being in a specific layer of a video sequence.
[0883] The following solution can be implemented with the additional techniques described in the items listed in the previous sections (e.g., item 10).
[0884] 26. A method of video processing, comprising: performing conversion between a video comprising one or more video pictures and a codec representation of the video, wherein the one or more video pictures comprise one or more video blocks, wherein the codec representation complies with a codec syntax requirement and a first syntax element subpic_grid_idx[i][j] is not greater than a second syntax element max_subpics_minus1.
[0885] 27. The method of solution 26, wherein the codeword representing the first syntax element is not greater than the codeword representing the second syntax element.
[0886] 28. The method according to any one of solutions 1-27, wherein the first video region comprises a video sub-picture.
[0887] 29. The method according to any one of solutions 1-28, wherein the second video area comprises a video sub-picture.
[0888] 30. A method according to any of solutions 1 to 29, wherein converting comprises encoding the video into a codec representation.
[0889] 31. A method according to any of solutions 1 to 29, wherein the conversion comprises decoding the codec representation to generate pixel values of the video.
[0890] 32. A video decoding device, comprising a processor, wherein the processor is configured to implement the method described in one or more of solutions 1 to 31.
[0891] 33. A video encoding device, comprising a processor configured to implement the method described in one or more of solutions 1 to 31.
[0892] 34. A computer program product having computer code stored thereon, which, when executed by a processor, causes the processor to implement the method described in any one of solutions 1 to 31.
[0893] 35. A method, apparatus or system described in this document.
[0894] Figure 8 800 is a block diagram illustrating an example video processing system 800 in which various techniques disclosed herein may be implemented. Various implementations may include some or all of the components of system 800. System 800 may include an input 802 for receiving video content. The video content may be received in a raw or uncompressed format (e.g., 8 or 10 bit multi-component pixel values), or may be received in a compressed or encoded format. Input 802 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interfaces include wired interfaces (such as Ethernet, passive optical networks (PONs), etc.) and wireless interfaces (such as Wi-Fi or cellular interfaces).
[0895] System 800 may include a codec component 804, which may implement various codecs or coding methods described in this document. Codec component 804 may reduce the average bit rate of the video from input 802 to the output of codec component 804 to generate a codec representation of the video. Therefore, codec technology is sometimes referred to as video compression or video transcoding technology. As represented by component 806, the output of codec component 804 may be stored or sent via the connected communication. The bitstream (or codec) representation of the storage or transmission of the video received at input 802 may be used by component 808 to generate pixel values or displayable video, which may be sent to display interface 810. The process of generating user-visible video from the bitstream representation is sometimes referred to as video decompression. In addition, although some video processing operations are referred to as "codec" operations or tools, it should be understood that codec tools or operations are used at the encoder, and corresponding decoding tools or operations opposite to the codec results are performed by the decoder.
[0896] Examples of peripheral bus interfaces or display interfaces may include Universal Serial Bus (USB) or High Definition Multimedia Interface (HDMI) or DisplayPort, etc. Examples of storage interfaces include SATA (Serial Advanced Technology Attachment), PCI, IDE interfaces, etc. The technology described in this document may be implemented in various electronic devices, such as mobile phones, laptop computers, smart phones, or other devices capable of performing digital data processing and / or video display.
[0897] Fig. 9 is a block diagram illustrating an example video coding system 100 that may utilize the techniques of this disclosure.
[0898] like Fig. 9 As shown, the video coding system 100 may include a source device 110 and a destination device 120. The source device 110 generates encoded video data, and the source device 110 may be referred to as a video encoding device. The destination device 120 may decode the encoded video data generated by the source device 110, and the destination device 120 may be referred to as a video decoding device.
[0899] Source device 110 may include a video source 112 , a video encoder 114 , and an input / output (I / O) interface 116 .
[0900] The video source 112 may include a source such as a video capture device, an interface for receiving video data from a video content provider, and / or a computer graphics system for generating video data, or a combination of these sources. The video data may include one or more pictures. The video encoder 114 encodes the video data from the video source 112 to generate a bit stream. The bit stream may include a sequence of bits that form a codec representation of the video data. The bit stream may include a codec picture and associated data. The codec picture is a codec representation of the picture. The associated data may include a sequence parameter set, a picture parameter set, and other grammatical structures. The I / O interface 116 may include a modulator / demodulator (modem) and / or a transmitter. The encoded video data may be directly sent to the destination device 120 via the network 130a via the I / O interface 116. The encoded video data may also be stored on a storage medium / server 130b for access by the destination device 120.
[0901] Destination device 120 may include an I / O interface 126 , a video decoder 124 , and a display device 122 .
[0902] The I / O interface 126 may include a receiver and / or a modem. The I / O interface 126 may obtain the encoded video data from the source device 110 or the storage medium / server 130b. The video decoder 124 may decode the encoded video data. The display device 122 may display the decoded video data to the user. The display device 122 may be integrated with the destination device 120, or may be external to the destination device 120 configured to interface with an external display device.
[0903] The video encoder 114 and the video decoder 124 may operate according to a video compression standard such as the High Efficiency Video Codec (HEVC) standard, the Versatile Video Codec (VVC) standard, and other current and / or future standards.
[0904] Fig.10 is a block diagram illustrating an example of a video encoder 200, which may Fig. 9 The video encoder 114 in the system 100 is shown.
[0905] Video encoder 200 may be configured to perform any or all of the techniques of this disclosure. Fig.10 In the example of , video encoder 200 includes multiple functional components. The techniques described in this disclosure can be shared between the various components of video encoder 200. In some examples, a processor can be configured to perform any or all of the techniques described in this disclosure.
[0906] The functional components of the video encoder 200 may include a segmentation unit 201, a prediction unit 202, which may include a mode selection unit 203, a motion estimation unit 204, a motion compensation unit 205 and an intra-frame prediction unit 206, a residual generation unit 207, a transform unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transform unit 211, a reconstruction unit 212, a buffer 213 and an entropy coding unit 214.
[0907] In other examples, the video encoder 200 may include more, fewer, or different functional components. In one example, the prediction unit 202 may include an intra block copy (IBC) unit. The IBC unit may perform prediction in an IBC mode, where at least one reference picture is a picture where the current video block is located.
[0908] Furthermore, some components such as the motion estimation unit 204 and the motion compensation unit 205 may be highly integrated, but for the purpose of explanation, they are not shown in FIG. Figure 5 In the example, they are shown separately.
[0909] The partitioning unit 201 may partition a picture into one or more video blocks. The video encoder 200 and the video decoder 300 may support various video block sizes.
[0910] The mode selection unit 203 may select one of the intra or inter coding modes, for example, based on the error result, and provide the resulting intra or inter coding block to the residual generation unit 207 to generate residual block data, and provide the resulting intra or inter coding block to the reconstruction unit 212 to reconstruct the coding block for use as a reference picture. In some examples, the mode selection unit 203 may select a combination of intra and inter prediction (CIIP) modes, where the prediction is based on an inter prediction signal and an intra prediction signal. In the case of inter prediction, the mode selection unit 203 may also select a resolution of the motion vector for the block (e.g., sub-pixel or integer pixel precision).
[0911] In order to perform inter-frame prediction on the current video block, the motion estimation unit 204 may generate motion information of the current video block by comparing the current video block with one or more reference frames from the buffer 213. The motion compensation unit 205 may determine a predicted video block of the current video block based on the motion information and decoded samples of pictures from the buffer 213 other than the picture associated with the current video block.
[0912] Motion estimation unit 204 and motion compensation unit 205 may perform different operations on the current video block, eg, depending on whether the current video block is an I slice, a P slice, or a B slice.
[0913] In some examples, the motion estimation unit 204 may perform unidirectional prediction on the current video block, and the motion estimation unit 204 may search for a reference video block of the current video block in the reference pictures of list 0 or list 1. The motion estimation unit 204 may then generate a reference index indicating a reference picture in list 0 or list 1, which list 0 or list 1 contains the reference video block and a motion vector indicating a spatial displacement between the current video block and the reference video block. The motion estimation unit 204 may output the reference index, the prediction direction indicator, and the motion vector as motion information of the current video block. The motion compensation unit 205 may generate a predicted video block of the current block based on the reference video block indicated by the motion information of the current video block.
[0914] In other examples, the motion estimation unit 204 may perform bidirectional prediction on the current video block, and the motion estimation unit 204 may search for a reference video block of the current video block in the reference pictures in list 0, and may also search for another reference video block of the current video block in the reference pictures in list 1. Then, the motion estimation unit 204 may generate a reference index indicating the reference pictures containing the reference video blocks in list 0 and list 1, and a motion vector indicating a spatial displacement between the reference video block and the current video block. The motion estimation unit 204 may output the reference index and the motion vector of the current video block as the motion information of the current video block. The motion compensation unit 205 may generate a predicted video block of the current video block based on the reference video block indicated by the motion information of the current video block.
[0915] In some examples, motion estimation unit 204 may output the full set of motion information for use in a decoding process of a decoder.
[0916] In some examples, motion estimation unit 204 may not output a full set of motion information for the current video. Instead, motion estimation unit 204 may reference motion information of another video block to signal the motion information of the current video block. For example, motion estimation unit 204 may determine that the motion information of the current video block is sufficiently similar to the motion information of a neighboring video block.
[0917] In one example, motion estimation unit 204 may indicate in a syntax structure associated with the current video block a value that indicates to video decoder 300 that the current video block has the same motion information as another video block.
[0918] In another example, the motion estimation unit 204 may identify another video block and a motion vector difference (MVD) in a syntax structure associated with the current video block. The motion vector difference indicates the difference between the motion vector of the current video block and the motion vector of the indicated video block. The video decoder 300 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.
[0919] As described above, the video encoder 200 may predictively signal motion vectors. Two examples of predictive signaling techniques that may be implemented by the video encoder 200 include Advanced Motion Vector Prediction (AMVP) and Merge mode signaling.
[0920] The intra prediction unit 206 may perform intra prediction on the current video block. When the intra prediction unit 206 performs intra prediction on the current video block, the intra prediction unit 206 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include a predicted video block and various syntax elements.
[0921] The residual generation unit 207 may generate residual data for the current video block by subtracting (e.g., indicated by a minus sign) the predicted video block(s) of the current video block from the current video block. The residual data for the current video block may include residual video blocks corresponding to different sample components of the samples in the current video block.
[0922] In other examples, for the current video block, for example in skip mode, there may be no residual data for the current video block, and the residual generation unit 207 may not perform a subtraction operation.
[0923] Transform processing unit 208 may generate one or more transform coefficient video blocks for a current video block by applying one or more transforms to a residual video block associated with the current video block.
[0924] After transform processing unit 208 generates a transform coefficient video block associated with the current video block, quantization unit 209 may quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values associated with the current video block.
[0925] The inverse quantization unit 210 and the inverse transform unit 211 may apply inverse quantization and inverse transform to the transform coefficient video block, respectively, to reconstruct the residual video block from the transform coefficient video block. The reconstruction unit 212 may add the reconstructed residual video block to the corresponding samples of one or more prediction video blocks generated by the prediction unit 202 to generate a reconstructed video block associated with the current block to be stored in the buffer 213.
[0926] After the reconstruction unit 212 reconstructs the video block, a loop filtering operation may be performed to reduce video block artifacts in the video block.
[0927] The entropy encoding unit 214 may receive data from other functional components of the video encoder 200. When the entropy encoding unit 214 receives the data, the entropy encoding unit 214 may perform one or more entropy encoding operations to generate entropy-encoded data and output a bitstream including the entropy-encoded data.
[0928] Fig.11 is a block diagram illustrating an example of a video decoder 300, which may be Fig. 9 The video decoder 124 in the system 100 is shown.
[0929] Video decoder 300 may be configured to perform any or all of the techniques of this disclosure. Fig.11 In the example of , video decoder 300 includes multiple functional components. The techniques described in this disclosure can be shared between the various components of video decoder 300. In some examples, a processor can be configured to perform any or all of the techniques described in this disclosure.
[0930] exist Fig.11 In the example of FIG. 3 , the video decoder 300 includes an entropy decoding unit 301, a motion compensation unit 302, an intra-frame prediction unit 303, an inverse quantization unit 304, an inverse transform unit 305, a reconstruction unit 306, and a buffer 307. In some examples, the video decoder 300 may perform operations generally similar to those performed with respect to the video encoder 200 (e.g., Fig.10 ) is the opposite of the encoding stage described in .
[0931] The entropy decoding unit 301 may retrieve an encoded bitstream. The encoded bitstream may include entropy-encoded video data (e.g., encoded blocks of video data). The entropy decoding unit 301 may decode the entropy-encoded video data, and the motion compensation unit 302 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information from the entropy-decoded video data. The motion compensation unit 302 may determine such information, for example, by performing AMVP and Merge modes.
[0932] The motion compensation unit 302 may generate a motion compensated block, possibly performing interpolation based on an interpolation filter. An identifier of an interpolation filter to be used with sub-pixel precision may be included in the syntax element.
[0933] The motion compensation unit 302 may use the interpolation filter used by the video encoder 200 during encoding of the video block to calculate interpolation of sub-integer pixels of the reference block. The motion compensation unit 302 may determine the interpolation filter used by the video encoder 200 according to the received syntax information and use the interpolation filter to generate a prediction block.
[0934] The motion compensation unit 302 may use some syntax information to determine the size of blocks used to encode (one or more) frames and / or (one or more) slices of the encoded video sequence, partitioning information describing how each macroblock of a picture of the encoded video sequence is partitioned, a mode indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter-frame coded block, and other information used to decode the encoded video sequence.
[0935] The intra prediction unit 303 may use, for example, an intra prediction mode received in the bitstream to form a prediction block from spatially adjacent blocks. The inverse quantization unit 304 inversely quantizes, i.e., dequantizes, the quantized video block coefficients provided in the bitstream and decoded by the entropy decoding unit 301. The inverse transform unit 305 applies an inverse transform.
[0936] The reconstruction unit 306 may add the residual block to the corresponding prediction block generated by the motion compensation unit 302 or the intra prediction unit 303 to form a decoded block. If necessary, a deblocking filter may also be applied to filter the decoded block to remove block artifacts. The decoded video block is then stored in a buffer 307, which provides reference blocks for subsequent motion compensation / intra prediction and also generates a decoded video for presentation on a display device.
[0937] Fig.12 1 is a flow representation of a method for video processing according to the present technology. The method 1200 includes, at operation 1210, performing a conversion between a video including one or more pictures and a bitstream representation of the video. The bitstream representation is required to comply with a format rule that specifies that each picture is encoded and decoded into one or more slices. The format rule prohibits samples in a picture from being overlapped by any of the one or more slices.
[0938] In some embodiments, a picture includes a plurality of sub-pictures, and the format rule further specifies that a plurality of slices of a sub-picture of the picture cover the entire sub-picture. In some embodiments, the bitstream representation includes a syntax element indicating that the plurality of slices have a rectangular shape. In some embodiments, a slice overlaps at most one sub-picture of the picture. In some embodiments, a slice of a video overlaps at most one sub-picture of a picture. In some embodiments, a tile of a video overlaps at most one sub-picture of a picture.
[0939] Fig.13 13 is a flow representation of a method for video processing according to the present technology. The method 1300 includes, at operation 1310, for conversion between a picture of a video and a bitstream representation of the video, determining a manner of signaling information of one or more slices in the picture according to a rule associated with a number of slices or a number of bricks in the picture. The method 1300 includes, at operation 1320, performing the conversion based on the determination.
[0940] In some embodiments, the information of one or more stripes of the picture includes at least the number of one or more stripes or the range of one or more stripes. In some embodiments, the rule specifies that if the number of bricks in the picture is 1, the information of one or more stripes in the picture is excluded in the bitstream representation. In some embodiments, the number of one or more stripes in the picture is considered to be 1. In some embodiments, the strip covers the entire picture. In some embodiments, the number of bricks per strip is considered to be 1.
[0941] Fig.14 14 is a flow diagram of a method for video processing according to the present technology. The method 1400 includes, at operation 1410, performing a conversion between a picture of a video and a bitstream representation of the video according to a rule. In the bitstream representation, the picture is encoded and decoded into one or more slices. The rule specifies whether or how to include the address of the slice of the picture in the bitstream representation.
[0942] In some embodiments, the rule specifies that the signaling of the address of the stripe is independent of the signaling of whether the stripe has a rectangular shape. In some embodiments, the rule specifies that if the stripe is a rectangular shape, the signaling of the address of the stripe depends on the number of stripes in the picture. In some embodiments, whether to signal the number of bricks in the stripe is based at least in part on the address of the stripe. In some embodiments, whether to signal the number of bricks in the stripe is also based on the number of bricks in the picture.
[0943] Fig.15 is a flow representation of a method for video processing according to the present technology. Method 1500 includes, at operation 1510, for conversion between a picture of a video and a bitstream representation of the video, determining whether a syntax element is included in the bitstream representation based on the number of slices or the number of bricks in the picture, the syntax element indicating that a filtering operation that accesses samples on multiple bricks in the picture is enabled. Method 1500 includes, at operation 1520, performing the conversion based on the determination. In some embodiments, if the number of bricks in the picture is less than 2, the syntax element is excluded in the bitstream representation.
[0944] Fig.16 16 is a flow diagram of a method for video processing according to the present technology. The method 1600 includes, at operation 1610, performing a conversion between a picture of a video and a bitstream representation of the video. The picture includes one or more sub-pictures, and the number of the one or more sub-pictures is indicated by a syntax element in the bitstream representation.
[0945] In some embodiments, the number of multiple sub-pictures is represented as N, and the syntax element includes a value of (Nd), N and d are integers. In some embodiments, d is 0, 1, or 2. In some embodiments, the value of (Nd) is encoded and decoded using a unary encoding and decoding scheme or a truncated unary encoding and decoding scheme. In some embodiments, the value of (Nd) is encoded and decoded to have a fixed length using a fixed length encoding and decoding scheme. In some embodiments, the fixed length is 8 bits. In some embodiments, the fixed length is represented as x-dx, and x and dx are positive integers. x is equal to or less than the maximum value determined based on the consistency rule, and dx is 0, 1, or 2. In some embodiments, x-dx is signaled. In some embodiments, the fixed length is determined based on the number of basic unit blocks in the picture. In some embodiments, the fixed length is represented as x, the number of basic unit blocks is represented as M, and x=Ceil(log2(M+d0))+d1, d0 and d1 are integers.
[0946] In some embodiments, the maximum value of (Nd) is predetermined. In some embodiments, the maximum value of (Nd) is determined based on the number of basic unit blocks in the picture. In some embodiments, the number of basic unit blocks in the picture is represented as M, M is an integer, and the maximum value of Nd is Md. In some embodiments, the basic unit block includes a slice. In some embodiments, the basic unit block includes a codec tree unit. In some embodiments, at least one of d0 or d1 is -2, -1, 0, 1, or 2.
[0947] Fig.17 is a flow representation of a method for video processing according to the present technology. The method 1700 includes, at operation 1710, performing a conversion between a picture of a video including one or more sub-pictures and a bitstream representation of the video. The bitstream representation conforms to a format rule that specifies that information about the sub-picture is included in the bitstream representation based on at least one of: (1) one or more angular positions of the sub-picture, or (2) dimensions of the sub-picture.
[0948] In some embodiments, the format rules further specify that information about the sub-picture is positioned after information about the size of the codec treeblock in the bitstream representation. In some embodiments, the granularity of the blocks in the sub-picture is used to signal one or more angular positions of the sub-picture in the bitstream representation. In some embodiments, the block comprises a basic unit block or a codec treeblock.
[0949] In some embodiments, the index of the block is used to indicate the angular position of the sub-picture. In some embodiments, the index comprises a column index or a row index. In some embodiments, the index of the block is represented as I, and the value of (Id) is signaled in the bitstream representation, d is 0, 1 or 2. In some embodiments, d is determined based on the index of the previously coded sub-picture and another integer d1, d1 is equal to -1, 0 or 1. In some embodiments, the sign of (Id) is signaled in the bitstream representation.
[0950] In some embodiments, whether to signal the position of the sub-picture in the bitstream representation is based on the index of the sub-picture. In some embodiments, if the sub-picture is the first sub-picture in the picture, the position of the sub-picture is omitted in the bitstream representation. In some embodiments, the top left position of the sub-picture is determined to be (0, 0). In some embodiments, if the sub-picture is the last sub-picture in the picture, the position of the sub-picture is omitted in the bitstream representation. In some embodiments, the top left position of the sub-picture is determined based on information about a previously converted sub-picture. In some embodiments, the information about the sub-picture includes the top left position and dimensions of the sub-picture. The information is encoded and decoded using a truncated unary encoding and decoding scheme, a truncated binary encoding and decoding scheme, a unary encoding and decoding scheme, a fixed length encoding and decoding scheme, or a Kth EG encoding and decoding scheme.
[0951] In some embodiments, the granularity of the blocks in the sub-picture is used to signal the dimensions of the sub-picture in the bitstream representation. In some embodiments, the dimensions include the width or height of the sub-picture. In some embodiments, the dimensions are represented as the number of columns or rows of blocks in the sub-picture. In some embodiments, the number of columns or rows of blocks is represented as I, and the value of (Id) is signaled in the bitstream representation, d is 0, 1 or 2. In some embodiments, d is determined based on the dimensions of the blocks of the previously encoded sub-picture and another integer d1, d1 is equal to -1, 0 or 1. In some embodiments, the sign of (Id) is signaled in the bitstream representation.
[0952] In some embodiments, the value of (Id) is encoded and decoded to have a fixed length using a fixed length encoding and decoding scheme. In some embodiments, the fixed length is 8 bits. In some embodiments, the fixed length is represented as x-dx, where x and dx are positive integers. x is equal to or less than the maximum value determined based on the consistency rule, and dx is 0, 1, or 2. In some embodiments, the fixed length is determined based on the number of basic unit blocks in the picture. In some embodiments, the fixed length is represented as x, the number of basic unit blocks is represented as M, and x=Ceil(log2(M+d0))+d1, d0 and d1 are integers. In some embodiments, at least one of d0 or d1 is -2, -1, 0, 1, or 2. In some embodiments, (Id) is signaled for all sub-pictures of the picture. In some embodiments, (Id) is signaled for a subset of sub-pictures of the picture. In some embodiments, if the number of sub-pictures is equal to 1, the value of (Id) is omitted in the bitstream representation. In some embodiments, if the sub-picture is the first sub-picture of the picture, the value of (Id) is omitted in the bitstream representation. In some embodiments, the value of (Id) is determined to be 0. In some embodiments, if the sub-picture is the last sub-picture in the picture, the value of (Id) is omitted in the bitstream representation. In some embodiments, the value of (Id) is determined based on information about previously converted sub-pictures.
[0953] In some embodiments, a single syntax element is conditionally included in the bitstream representation to indicate whether all sub-pictures of a picture are processed as a picture. In some embodiments, a single syntax element is conditionally included in the bitstream representation to indicate whether, for all sub-pictures, a loop filter is applied to a sub-picture of a picture. In some embodiments, if the number of sub-pictures of a picture is equal to 1, the single syntax element is omitted in the bitstream representation.
[0954] Fig.18 18 is a flow diagram of a method for video processing according to the present technology. The method 1800 includes, at operation 1810, for conversion between a picture of a video and a bitstream representation of the video, determining to enable a reference picture resampling tool due to the picture being divided into one or more sub-pictures. The method 1800 also includes, at operation 1820, performing the conversion based on the determination.
[0955] In some embodiments, the scaling ratio used in the reference picture resampling codec is determined based on a set of ratios. In some embodiments, the set of ratios includes at least one of: {1:1, 1:2}, {1:1, 2:1}, {1:1, 1:2, 1:4}, {1:1, 1:2, 4:1}, {1:1, 2:1, 1:4}, {1:1, 2:1, 4:1}, {1:1, 1:2, 1:4, 1:8}, {1:1, 1:2, 1:4, 8:1}, {1:1, 1:2, 4:1, 1:8}, {1:1, 1:2, 4:1, 8:1}, {1:1, 2:1, 1:4, 1:8}, {1:1, 2:1, 1:4, 8:1}, {1:1, 2:1, 1:4, 8:1}, or {1:1, 2:1, 4:1, 8:1}. In some embodiments, if the resolution of the picture is different from the resolution of the second picture, the size of the codec tree block of the picture is different from the size of the codec tree block of the second picture. In some embodiments, the dimensions of the sub-picture of the picture are SAW×SAH, and the dimensions of the sub-picture of the second picture of the video are SBW×SBH. The scaling ratio between the picture and the second picture is Rw and Rh in the horizontal direction and the vertical direction. SAW / SBW or SBW / SAW is equal to Rw, and SAH / SBH or SBH / SAH is equal to Rh.
[0956] Fig.19 is a flow representation of a method for video processing according to the present technology. The method 1900 includes, at operation 1910, performing a conversion between a video including a video picture and a bitstream representation of the video, the video picture including one or more sub-pictures, the one or more sub-pictures including one or more slices. The bitstream representation conforms to a format rule that specifies that for a sub-picture and a slice, if an index identifying the sub-picture is included in a header of the slice, then an address field of the slice indicates an address of a slice in the sub-picture.
[0957] In some embodiments, the conversion generates a video from a bitstream representation. In some embodiments, the conversion generates a bitstream representation from a video.
[0958] Some embodiments of the disclosed technology include making a decision or determining to enable a video processing tool or mode. In an example, when a video processing tool or mode is enabled, the encoder will use or implement the tool or mode in the processing of a video block, but will not necessarily modify the resulting bitstream based on the use of the tool or mode. In other words, when a video processing tool or mode is enabled based on a decision or determination, the conversion from a video block to a bitstream representation of a video will use the video processing tool or mode. In another example, when a video processing tool or mode is enabled, a decoder will process the bitstream knowing that the bitstream has been modified based on the video processing tool or mode. In other words, the conversion from the bitstream representation of a video to a video block will be performed using a video processing tool or mode enabled based on a decision or determination.
[0959] Some embodiments of the disclosed technology include making a decision or determination to disable a video processing tool or mode. In an example, when the video processing tool or mode is disabled, the encoder will not use the tool or mode in the conversion of video blocks to a bitstream representation of the video. In another example, when the video processing tool or mode is disabled, the decoder will process the bitstream knowing that the bitstream has not been modified using the video processing tool or mode enabled based on the decision or determination.
[0960] The disclosed and other schemes, examples, embodiments, modules and functional operations described in this document can be implemented in digital electronic circuits or in computer software, firmware or hardware (including the structures disclosed in this document and the equivalent of their structures), or in a combination of one or more thereof. The disclosed and other embodiments can be implemented as one or more computer program products, for example, one or more computer program instruction modules encoded on a computer-readable medium, for execution by a data processing device or for controlling the operation of the data processing device. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a material component that affects a machine-readable propagable signal, or a combination of one or more thereof. The term "data processing device" covers all devices, equipment and machines for processing data, including, for example, a programmable processor, a computer or multiple processors or computers. In addition to hardware, the device may also include code that creates an execution environment for the computer program in question, for example, code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more thereof. A propagation signal is an artificially generated signal, such as a machine-generated electrical signal, an optical signal or an electromagnetic signal, which is generated to encode information for transmission to a suitable receiver device.
[0961] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that stores other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple collaborative files (e.g., a file storing a portion of one or more modules, subroutines, or codes). A computer program can be deployed to execute on one computer or on multiple computers, which are located at one site or distributed across multiple sites and interconnected by a communication network.
[0962] The processes and logic flows described in this document may be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows may also be performed by, and the device may be implemented as, a special purpose logic circuit such as an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
[0963] Processors suitable for the execution of computer programs include, for example, both general-purpose and special-purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, the processor will receive instructions and data from a read-only memory or a random access memory or both. The necessary elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include one or more large-capacity storage devices (such as magnetic, magneto-optical disks or optical disks) for storing data, or be operably coupled to receive data from one or more large-capacity storage devices (such as magnetic, magneto-optical disks or optical disks) or transfer data to one or more large-capacity storage devices (such as magnetic, magneto-optical disks or optical disks), or both. However, a computer does not need to have such a device. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, such as semiconductor memory devices (such as EPROM, EEPROM and flash memory devices), disks (such as internal hard disks or removable disks), magneto-optical disks, and CD ROM and DVD-ROM disks. Processors and memories can be supplemented by special logic circuits, or incorporated into special logic circuits.
[0964] Although this patent document contains many details, these details should not be interpreted as limitations on any subject matter or the scope of protection that can be claimed, but as descriptions of the features of specific embodiments of specific technologies. In this patent document, certain features described in the context of separate embodiments can also be implemented in combination in a single embodiment. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments respectively or in various suitable sub-combinations. In addition, although the features can be described as working in certain combinations as described above and even initially required, one or more features from the claimed combination can be removed from the combination in some cases, and the claimed combination can be directed to a variation of a sub-combination or a sub-combination.
[0965] Similarly, although operations are depicted in a particular order in the drawings, this should not be understood as requiring that such operations be performed in the particular order shown or in the sequential order shown, or that all of the operations shown be performed, in order to achieve the desired results. Furthermore, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.
[0966] Only a few implementations and examples are described, and other implementations, enhancements, and variations may be made based on what is described and illustrated in this patent document.
Claims
1. A video processing method, comprising: For conversion between a picture of a video and a bitstream of the video, segmenting the picture into one or more slices and one or more sub-pictures according to bitstream consistency requirements; as well as performing said converting based at least on said segmentation, wherein the bitstream conformance requirement specifies that the union of the one or more slices covers the entire picture, The bitstream includes a first syntax element indicating the number of the one or more sub-pictures, the number of the one or more sub-pictures is denoted as N, and the value of the first syntax element is denoted as (N-1), where N is an integer, wherein the allowed maximum value of the first syntax element for the picture is a fixed value, wherein a sub-picture of the one or more sub-pictures is indicated by including the following syntax elements in the bitstream: a second syntax element indicating a horizontal position of a top left codec tree block (CTB) of the sub-picture in units of CtbSizeY, a third syntax element indicating a vertical position of a top left CTB of the sub-picture in units of CtbSizeY, a fourth syntax element indicating a width of the sub-picture in units of CtbSizeY, and a fifth syntax element indicating a height of the sub-picture in units of CtbSizeY, and Wherein, CtbSizeY represents the size of the codec tree block.
2. The method according to claim 1, wherein A sixth syntax element is included in the bitstream to indicate whether the one or more slices have a rectangular shape.
3. The method according to claim 1 or 2, wherein: The bitstream conformance requirement further specifies that a union of the one or more sub-pictures resulting from partitioning of the picture covers the entire picture.
4. The method according to claim 3, wherein: A sub-picture of the one or more sub-pictures is divided into one or more slices, The bitstream conformance requirement further specifies that a union of the one or more slices resulting from the partitioning of the sub-picture covers the entire sub-picture.
5. The method according to claim 3, wherein A slice of the picture overlaps with at most one sub-picture of the picture.
6. The method according to claim 3, wherein: A slice of the picture overlaps with at most one sub-picture of the picture.
7. The method according to claim 1 or 2, wherein: The converting includes encoding the picture into the bitstream.
8. The method according to claim 1 or 2, wherein: The converting includes decoding the picture from the bitstream.
9. An apparatus for processing video data, comprising a processor and a non-transitory memory with instructions thereon, wherein: The instructions, when executed by the processor, cause the processor to: For conversion between a picture of a video and a bitstream of the video, segmenting the picture into one or more slices and one or more sub-pictures according to bitstream consistency requirements; as well as performing said converting based at least on said segmentation, wherein the bitstream conformance requirement specifies that the union of the one or more slices covers the entire picture, The bitstream includes a first syntax element indicating the number of the one or more sub-pictures, the number of the one or more sub-pictures is denoted as N, and the value of the first syntax element is denoted as (N-1), where N is an integer, wherein the allowed maximum value of the first syntax element for the picture is a fixed value, wherein a sub-picture of the one or more sub-pictures is indicated by including the following syntax elements in the bitstream: a second syntax element indicating a horizontal position of a top left codec tree block (CTB) of the sub-picture in units of CtbSizeY, a third syntax element indicating a vertical position of a top left CTB of the sub-picture in units of CtbSizeY, a fourth syntax element indicating a width of the sub-picture in units of CtbSizeY, and a fifth syntax element indicating a height of the sub-picture in units of CtbSizeY, and Wherein, CtbSizeY represents the size of the codec tree block.
10. The device according to claim 9, wherein A sixth syntax element is included in the bitstream to indicate whether the one or more slices have a rectangular shape.
11. The device according to claim 9 or 10, wherein: The bitstream conformance requirement further specifies that a union of the one or more sub-pictures resulting from partitioning of the picture covers the entire picture.
12. The device according to claim 11, wherein A sub-picture of the one or more sub-pictures is divided into one or more slices, The bitstream conformance requirement further specifies that a union of the one or more slices resulting from the partitioning of the sub-picture covers the entire sub-picture.
13. The device according to claim 11, wherein A slice of the picture overlaps with at most one sub-picture of the picture.
14. The device according to claim 11, wherein A slice of the picture overlaps with at most one sub-picture of the picture.
15. A non-transitory computer-readable storage medium storing instructions that cause a processor to: For conversion between a picture of a video and a bitstream of the video, segmenting the picture into one or more slices and one or more sub-pictures according to bitstream consistency requirements; and performing said converting based at least on said segmentation, in, The bitstream conformance requirement specifies that the union of the one or more slices covers the entire picture, The bitstream includes a first syntax element indicating the number of the one or more sub-pictures, the number of the one or more sub-pictures is denoted as N, and the value of the first syntax element is denoted as (N-1), where N is an integer, wherein the allowed maximum value of the first syntax element for the picture is a fixed value, wherein a sub-picture of the one or more sub-pictures is indicated by including the following syntax elements in the bitstream: a second syntax element indicating a horizontal position of a top left codec tree block (CTB) of the sub-picture in units of CtbSizeY, a third syntax element indicating a vertical position of a top left CTB of the sub-picture in units of CtbSizeY, a fourth syntax element indicating a width of the sub-picture in units of CtbSizeY, and a fifth syntax element indicating a height of the sub-picture in units of CtbSizeY, and Wherein, CtbSizeY represents the size of the codec tree block.
16. The non-transitory computer-readable storage medium of claim 15, wherein: A sixth syntax element is included in the bitstream to indicate whether the one or more slices have a rectangular shape.
17. The non-transitory computer-readable storage medium according to claim 15 or 16, wherein: The bitstream conformance requirement further specifies that a union of the one or more sub-pictures resulting from partitioning of the picture covers the entire picture.
18. The non-transitory computer-readable storage medium of claim 17, wherein: A sub-picture of the one or more sub-pictures is divided into one or more slices, The bitstream conformance requirement further specifies that a union of the one or more slices resulting from the partitioning of the sub-picture covers the entire sub-picture.
19. The non-transitory computer-readable storage medium of claim 17, wherein: A slice of the picture overlaps with at most one sub-picture of the picture.
20. A method for storing a bitstream of a video, the method comprising: For a picture of a video, split the picture into one or more slices and one or more sub-pictures according to bitstream consistency requirements; generating the bitstream based at least on the segmentation; as well as storing the bitstream in a non-transitory computer-readable recording medium, wherein the bitstream conformance requirement specifies that the union of the one or more slices covers the entire picture, The bitstream includes a first syntax element indicating the number of the one or more sub-pictures, the number of the one or more sub-pictures is denoted as N, and the value of the first syntax element is denoted as (N-1), where N is an integer, wherein the allowed maximum value of the first syntax element for the picture is a fixed value, wherein a sub-picture of the one or more sub-pictures is indicated by including the following syntax elements in the bitstream: a second syntax element indicating a horizontal position of a top left codec tree block (CTB) of the sub-picture in units of CtbSizeY, a third syntax element indicating a vertical position of a top left CTB of the sub-picture in units of CtbSizeY, a fourth syntax element indicating a width of the sub-picture in units of CtbSizeY, and a fifth syntax element indicating a height of the sub-picture in units of CtbSizeY, and Wherein, CtbSizeY represents the size of the codec tree block.
Citation Information
Patent Citations
Bitstream conformance test in video coding
CN104662914A
Method and apparatus for encoding and decoding video using picture division information
CN109076216A
Video encoding and decoding of foreground and background wherein picture is divided into slice
CN1593065A
Method, device, and computer program for coding and decoding a picture
GB201908535D0
Video coding and decoding
US20030112867A1
Cited By
Controlling deblocking filtering at different levels in coded video
US12301799B2
Merge with motion vector differencing in affine mode
US12348761B2
Prediction refinement for affine merge and affine motion vector prediction mode
US12388989B2
Syntax signaling in sub-block merge mode
US12413714B2
Prediction refinement for affine merge and affine motion vector prediction mode
US12513291B2
