Syntax for signaling video subpictures
Patent Information
- Application Number
- IN202247037344
- Authority / Receiving Office
- IN · IN
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2019-12-27
- Filing Date
- 2022-06-29
- Publication Date
- 2026-07-31
- Estimated Expiration
- 2040-12-27
AI Technical Summary
Current designs for subpicture signaling in Versatile Video Coding (VVC) face limitations such as a maximum of 256 subpictures per picture, redundancy in syntax elements, and inefficiencies in signaling subpicture IDs, leading to increased bitstream complexity and parsing dependencies.
Modifying the coding of sps_num_subpics_minus1 to ue(v) to allow more than 256 subpictures, conditioning syntax element signaling based on subpicture presence flags, and redefining syntax elements to enable explicit signaling of subpicture IDs in either the Sequence Parameter Set (SPS) or Picture Parameter Set (PPS), independent of parsing dependencies.
Enhances the flexibility and efficiency of subpicture signaling, reducing redundancy and bitstream complexity, allowing for more than 256 subpictures and improving parsing independence.
Abstract
Description
TECHNICAL FIELD
[002] This patent document relates to image and video coding and decoding.BACKGROUND
[003] Digital video accounts for the largest bandwidth use on the internet and other digitalcommunication networks. As the number of connected user devices capable of receiving anddisplaying video increases, it is expected that the bandwidth demand for digital video usage willcontinue to grow.SUMMARY
[004] The present document discloses methods, devices and systems for subpicture signaling thatcan be used by video encoders and decoders for video encoding and decoding, respectively.
[005] In one example aspect, a video processing method is disclosed. The method includesperforming a conversion between a video comprising a picture and a bitstream of the video,wherein a number of subpictures in the picture is signaled in a sequence parameter set (SPS) ofthe bitstream as a field whose bitwidth is based on a value of the number of subpictures, andwherein the field is an unsigned integer 0-th order exponential Golomb (Exp-Golomb) codedsyntax element with a left bit first.
[006] In another example aspect, a video processing method is disclosed. The method includesperforming a conversion between a video and a bitstream of a video, wherein the bitstreamconforms to a format rule, and wherein the format rule specifies that a first syntax element, whichindicates whether a picture of the video can be partitioned, is conditionally included in a pictureparameter set (PPS) of the bitstream based on values of a second syntax element, which indicateswhether identifiers of subpictures are signaled in the PPS, and a third syntax element, whichindicates, in the PPS, a number of the subpictures.
[007] In yet another example aspect, a video processing method is disclosed. The method includesperforming a conversion between a video and a bitstream of a video, wherein the bitstreamconforms to a format rule, and wherein the format rule specifies that a first syntax element, whichindicates whether a picture of the video can be partitioned, is included in a picture parameter set(PPS) of the bitstream before a set of syntax elements, in the PPS, indicative of identifiers ofsubpictures the picture.
[008] In yet another example aspect, a video processing method is disclosed. The method includesperforming a conversion between a video region of a video and a bitstream of the video, whereinthe bitstream conforms to a format rule, wherein the format rule specifies that a first syntax elementindicating whether information of subpicture identifiers is included in parameter sets of thebitstream is conditionally included in a sequence parameter set (SPS) based on a value of a secondsyntax element indicating whether information of subpictures is included in the SPS.
[009] In yet another example aspect, a video processing method is disclosed. The method includesperforming a conversion between a picture of a video and a bitstream of the video, wherein thebitstream conforms to a format rule, wherein the format rule specifies a mapping betweenidentifiers of one or more subpictures of the picture and the one or more subpictures is not includedin a picture header of the picture, and wherein the format rule further specifies that the identifiersof the one or more subpictures are derived based on syntax elements in a sequence parameter set(SPS) and a picture parameter set (PPS) referred to by the picture.
[0010] In yet another example aspect, a video processing method is disclosed. The methodincludes performing a conversion between a video and a bitstream of the video, wherein thebitstream conforms to a format rule, and wherein the format rule specifies that, when a value of afirst syntax element indicates that a mapping between the identifiers of subpictures and one ormore subpictures of a picture is explicitly signaled for the one or more subpictures, the mappingis signaled either in a sequence parameter set (SPS) or a picture parameter set (PPS).
[0011] In yet another example aspect, a video processing method is disclosed. The methodincludes performing a conversion between a video and a bitstream of a video, wherein the bitstreamconforms to a format rule, and wherein the format rule specifies that signaling a length ofidentifiers of subpictures in a sequence parameter set (SPS) is not based on a value of a syntaxelement indicative of whether the identifiers are signaled in the SPS.
[0012] In yet another example aspect, a video processing method is disclosed. The methodincludes performing a conversion between a video and a bitstream of a video, wherein the bitstreamconforms to a format rule, and wherein the format rule specifies that signaling a length ofidentifiers of subpictures in a picture parameter set (PPS) due to a syntax element indicating thatthe identifiers are explicitly signaled in the PPS.
[0013] In yet another example aspect, a video processing method is disclosed. The methodincludes performing a conversion between a video and a bitstream of a video, wherein the bitstreamconforms to a format rule, wherein the format rule specifies that a first syntax element signaled ina sequence parameter set (SPS) of the bitstream is indicative of a length of identifiers of subpicturesin the SPS, and wherein the signaling of the first syntax element is independent of a value of asecond syntax element that is indicative of explicit signaling of the identifiers of the subpicturesin the SPS or a picture parameter set (PPS).
[0014] In yet another example aspect, a video encoder apparatus is disclosed. The video encodercomprises a processor configured to implement above-described methods.
[0015] In yet another example aspect, a video decoder apparatus is disclosed. The video decodercomprises a processor configured to implement above-described methods.
[0016] In yet another example aspect, a computer readable medium having code stored thereon isdisclose. The code embodies one of the methods described herein in the form of processorexecutablecode.
[0017] These, and other, features are described throughout the present document.BRIEF DESCRIPTION OF DRAWINGS
[0018] FIG. 1 shows an example of partitioning a picture with luma coding tree units (CTUs).
[0019] FIG. 2 shows another example of partitioning a picture with luma CTUs.
[0020] FIG. 3 shows an example partitioning of a picture.
[0021] FIG. 4 shows another example partitioning of a picture.
[0022] FIG. 5 is a block diagram of an example video processing system in which disclosedtechniques may be implemented.
[0023] FIG. 6 is a block diagram of an example hardware platform used for video processing.
[0024] FIG. 7 is a block diagram that illustrates a video coding system in accordance with someembodiments of the present disclosure.
[0025] FIG. 8 is a block diagram that illustrates an encoder in accordance with some embodimentsof the present disclosure.
[0026] FIG. 9 is a block diagram that illustrates a decoder in accordance with some embodimentsof the present disclosure.
[0027] FIGS. 10-12 show flowcharts for example methods of video processing.DETAILED DESCRIPTION
[0028] Section headings are used in the present document for ease of understanding and do notlimit the applicability of techniques and embodiments disclosed in each section only to that section.Furthermore, H.266 terminology is used in some description only for ease of understanding andnot for limiting scope of the disclosed techniques. As such, the techniques described herein areapplicable to other video codec protocols and designs also.1. Summary
[0029] This document is related to video coding technologies. Specifically, it is about signaling ofsubpictures, tiles, and slices. The ideas may be applied individually or in various combination, toany video coding standard or non-standard video codec that supports multi-layer video coding,e.g., the being-developed Versatile Video Coding (VVC).2. AbbreviationsAPS Adaptation Parameter SetAU Access UnitAUD Access Unit DelimiterAVC Advanced Video CodingCLVS Coded Layer Video SequenceCPB Coded Picture BufferCRA Clean Random AccessCTU Coding Tree UnitCVS Coded Video SequenceDPB Decoded Picture BufferDPS Decoding Parameter SetEOB End Of BitstreamEOS End Of SequenceGDR Gradual Decoding RefreshHEVC High Efficiency Video CodingHRD Hypothetical Reference DecoderIDR Instantaneous Decoding RefreshJEM Joint Exploration ModelMCTS Motion-Constrained Tile SetsNAL Network Abstraction LayerOLS Output Layer SetPH Picture HeaderPPS Picture Parameter SetPTL Profile, Tier and LevelPU Picture UnitRBSP Raw Byte Sequence PayloadSEI Supplemental Enhancement InformationSPS Sequence Parameter SetSVC Scalable Video CodingVCL Video Coding LayerVPS Video Parameter SetVTM VVC Test ModelVUI Video Usability InformationVVC Versatile Video Coding3. Initial Discussion
[0030] Video coding standards have evolved primarily through the development of the wellknownITU-T and ISO / IEC standards. The ITU-T produced H.261 and H.263, ISO / IEC producedMPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262 / MPEG-2Video and H.264 / MPEG-4 Advanced Video Coding (AVC) and H.265 / HEVC standards. SinceH.262, the video coding standards are based on the hybrid video coding structure wherein temporalprediction plus transform coding are utilized. To explore the future video coding technologiesbeyond HEVC, the Joint Video Exploration Team (JVET) was founded by VCEG and MPEGjointly in 2015. Since then, many new methods have been adopted by JVET and put into thereference software named Joint Exploration Model (JEM). The JVET meeting is concurrently heldonce every quarter, and the new coding standard is targeting at 50% bitrate reduction as comparedto HEVC. The new video coding standard was officially named as Versatile Video Coding (VVC)in the April 2018 JVET meeting, and the first version of VVC test model (VTM) was released atthat time. As there are continuous effort contributing to VVC standardization, new codingtechniques are being adopted to the VVC standard in every JVET meeting. The VVC workingdraft and test model VTM are then updated after every meeting. The VVC project is now aimingfor technical completion (FDIS) at the July 2020 meeting.3.1. Picture partitioning schemes in HEVC
[0031] HEVC includes four different picture partitioning schemes, namely regular slices,dependent slices, tiles, and Wavefront Parallel Processing (WPP), which may be applied forMaximum Transfer Unit (MTU) size matching, parallel processing, and reduced end-to-end delay.
[0032] Regular slices are similar as in H.264 / AVC. Each regular slice is encapsulated in its ownNAL unit, and in-picture prediction (intra sample prediction, motion information prediction,coding mode prediction) and entropy coding dependency across slice boundaries are disabled.Thus a regular slice can be reconstructed independently from other regular slices within the samepicture (though there may still have interdependencies due to loop filtering operations).
[0033] The regular slice is the only tool that can be used for parallelization that is also available,in virtually identical form, in H.264 / AVC. Regular slices based parallelization does not requiremuch inter-processor or inter-core communication (except for inter-processor or inter-core datasharing for motion compensation when decoding a predictively coded picture, which is typicallymuch heavier than inter-processor or inter-core data sharing due to in-picture prediction). However,for the same reason, the use of regular slices can incur substantial coding overhead due to the bitcost of the slice header and due to the lack of prediction across the slice boundaries. Further,regular slices (in contrast to the other tools mentioned below) also serve as the key mechanism forbitstream partitioning to match MTU size requirements, due to the in-picture independence ofregular slices and that each regular slice is encapsulated in its own NAL unit. In many cases, thegoal of parallelization and the goal of MTU size matching place contradicting demands to the slicelayout in a picture. The realization of this situation led to the development of the parallelizationtools mentioned below.
[0034] Dependent slices have short slice headers and allow partitioning of the bitstream attreeblock boundaries without breaking any in-picture prediction. Basically, dependent slicesprovide fragmentation of regular slices into multiple NAL units, to provide reduced end-to-enddelay by allowing a part of a regular slice to be sent out before the encoding of the entire regularslice is finished.
[0035] In WPP, the picture is partitioned into single rows of coding tree blocks (CTBs). Entropydecoding and prediction are allowed to use data from CTBs in other partitions. Parallel processingis possible through parallel decoding of CTB rows, where the start of the decoding of a CTB rowis delayed by two CTBs, so to ensure that data related to a CTB above and to the right of the subjectCTB is available before the subject CTB is being decoded. Using this staggered start (whichappears like a wavefront when represented graphically), parallelization is possible with up to asmany processors / cores as the picture contains CTB rows. Because in-picture prediction betweenneighboring treeblock rows within a picture is permitted, the required inter-processor / inter-corecommunication to enable in-picture prediction can be substantial. The WPP partitioning does notresult in the production of additional NAL units compared to when it is not applied, thus WPP isnot a tool for MTU size matching. However, if MTU size matching is required, regular slices canbe used with WPP, with certain coding overhead.
[0036] Tiles define horizontal and vertical boundaries that partition a picture into tile columns androws. Tile column runs from the top of a picture to the bottom of the picture. Likewise, tile rowruns from the left of the picture to the right of the picture. The number of tiles in a picture can bederived simply as number of tile columns multiply by number of tile rows.
[0037] The scan order of CTBs is changed to be local within a tile (in the order of a CTB rasterscan of a tile), before decoding the top-left CTB of the next tile in the order of tile raster scan of apicture. Similar to regular slices, tiles break in-picture prediction dependencies as well as entropydecoding dependencies. However, they do not need to be included into individual NAL units (sameas WPP in this regard); hence tiles cannot be used for MTU size matching. Each tile can beprocessed by one processor / core, and the inter-processor / inter-core communication required forin-picture prediction between processing units decoding neighboring tiles is limited to conveyingthe shared slice header in cases a slice is spanning more than one tile, and loop filtering relatedsharing of reconstructed samples and metadata. When more than one tile or WPP segment isincluded in a slice, the entry point byte offset for each tile or WPP segment other than the first onein the slice is signaled in the slice header.
[0038] For simplicity, restrictions on the application of the four different picture partitioningschemes have been specified in HEVC. A given coded video sequence cannot include both tilesand wavefronts for most of the profiles specified in HEVC. For each slice and tile, either or bothof the following conditions must be fulfilled: 1) all coded treeblocks in a slice belong to the sametile; 2) all coded treeblocks in a tile belong to the same slice. Finally, a wavefront segment containsexactly one CTB row, and when WPP is in use, if a slice starts within a CTB row, it must end inthe same CTB row.
[0039] A recent amendment to HEVC is specified in the JCT-VC output document JCTVCAC1005,J. Boyce, A. Ramasubramonian, R. Skupin, G. J. Sullivan, A. Tourapis, Y.-K. Wang(editors), "HEVC Additional Supplemental Enhancement Information (Draft 4)," Oct. 24, 2017,publicly available herein: http: / / phenix.intevry.fr / jct / doc_end_user / documents / 29_Macau / wg11 / JCTVC-AC1005-v2.zip. With thisamendment included, HEVC specifies three MCTS-related SEI messages, namely temporalMCTSs SEI message, MCTSs extraction information set SEI message, and MCTSs extractioninformation nesting SEI message.
[0040] The temporal MCTSs SEI message indicates existence of MCTSs in the bitstream andsignals the MCTSs. For each MCTS, motion vectors are restricted to point to full-sample locationsinside the MCTS and to fractional-sample locations that require only full-sample locations insidethe MCTS for interpolation, and the usage of motion vector candidates for temporal motion vectorprediction derived from blocks outside the MCTS is disallowed. This way, each MCTS may beindependently decoded without the existence of tiles not included in the MCTS.
[0041] The MCTSs extraction information sets SEI message provides supplemental informationthat can be used in the MCTS sub-bitstream extraction (specified as part of the semantics of theSEI message) to generate a conforming bitstream for an MCTS set. The information consists of anumber of extraction information sets, each defining a number of MCTS sets and containing RBSPbytes of the replacement VPSs, SPSs, and PPSs to be used during the MCTS sub-bitstreamextraction process. When extracting a sub-bitstream according to the MCTS sub-bitstreamextraction process, parameter sets (VPSs, SPSs, and PPSs) need to be rewritten or replaced, sliceheaders need to be slightly updated because one or all of the slice address related syntax elements(including first_slice_segment_in_pic_flag and slice_segment_address) typically would need tohave different values.3.2. Partitioning of pictures in VVC
[0042] In VVC, A picture is divided into one or more tile rows and one or more tile columns. Atile is a sequence of CTUs that covers a rectangular region of a picture. The CTUs in a tile arescanned in raster scan order within that tile.
[0043] A slice consists of an integer number of complete tiles or an integer number of consecutivecomplete CTU rows within a tile of a picture.
[0044] Two modes of slices are supported, namely the raster-scan slice mode and the rectangularslice mode. In the raster-scan slice mode, a slice contains a sequence of complete tiles in a tileraster scan of a picture. In the rectangular slice mode, a slice contains either a number of completetiles that collectively form a rectangular region of the picture or a number of consecutive completeCTU rows of one tile that collectively form a rectangular region of the picture. Tiles within arectangular slice are scanned in tile raster scan order within the rectangular region correspondingto that slice.
[0045] A subpicture contains one or more slices that collectively cover a rectangular region of apicture.
[0046] FIG. 1 shows an example of raster-scan slice partitioning of a picture, where the picture isdivided into 12 tiles and 3 raster-scan slices.
[0047] FIG. 2 shows an example of rectangular slice partitioning of a picture, where the picture isdivided into 24 tiles (6 tile columns and 4 tile rows) and 9 rectangular slices.
[0048] FIG. 3 shows an example of a picture partitioned into tiles and rectangular slices, wherethe picture is divided into 4 tiles (2 tile columns and 2 tile rows) and 4 rectangular slices.
[0049] FIG. 4 shows an example of subpicture partitioning of a picture, where a picture ispartitioned into 18 tiles, 12 on the left-hand side each covering one slice of 4 by 4 CTUs and 6tiles on the right-hand side each covering 2 vertically-stacked slices of 2 by 2 CTUs, altogetherresulting in 24 slices and 24 subpictures of varying dimensions (each slice is a subpicture).3.3. Signalling of subpictures, tiles, and slices in VVC
[0050] In the latest VVC draft text, information of subpictures, includes subpicture layout (i.e., thenumber of subpictures for each picture and the position and size of each picture) and othersequence-level subpicture information, is signaled in the SPS. The order of subpictures signaledin the SPS defines the subpicture index. A list of subpicture IDs, one for each subpicture, may beexplicitly signaled, e.g., in the SPS or in the PPS.
[0051] Tiles in VVC are conceptually the same as in HEVC, i.e., each picture is partitioned intotile columns and tile rows, but with different syntax in the PPS for signaling of tiles.
[0052] In VVC, the slice mode is also signaled in the PPS. When the slice mode is the rectangularslice mode, the slice layout (i.e., the number of slices for each picture and the position and size ofeach slice) for each picture is signaled in the PPS. The order of the rectangular slices within apicture signaled in the PPS defines the picture-level slice index. The subpicture-level slice indexis defined as the order of the slices within a subpicture in increasing order of the their picture-levelslice indices. The positions and sizes of the rectangular slices are signaled / derived based on eitherthe subpicture positions and sizes that are signaled in the SPS (when each subpicture contains onlyone slice), or based on the tile positions and sizes that are signaled in the PPS (when a subpicturemay contain more than one slice). When the slice mode is the raster-scan slice mode, similarly asin HEVC, the layout of slices within a picture is signaled in the slices themselves, with differentdetails.
[0053] The SPS, PPS, and slice header syntax and semantics in the latest VVC draft text that aremost relevant to the inventions herein are as follows.7.3.2.3 Sequence parameter set RBSP syntaxseq_parameter_set_rbsp( ) { Descriptor...subpics_present_flag u(1)if( subpics_present_flag ) {sps_num_subpics_minus1 u(8)for( i = 0; i <= sps_num_subpics_minus1; i++ ) {subpic_ctu_top_left_x[ i ] u(v)subpic_ctu_top_left_y[ i ] u(v)subpic_width_minus1[ i ] u(v)subpic_height_minus1[ i ] u(v)subpic_treated_as_pic_flag[ i ] u(1)loop_filter_across_subpic_enabled_flag[ i ] u(1)}}sps_subpic_id_present_flag u(1)if( sps_subpics_id_present_flag ) {sps_subpic_id_signalling_present_flag u(1)if( sps_subpics_id_signalling_present_flag ) {sps_subpic_id_len_minus1 ue(v)for( i = 0; i <= sps_num_subpics_minus1; i++ )sps_subpic_id[ i ] u(v)}}...}7.4.3.3 Sequence parameter set RBSP semantics...subpics_present_flag equal to 1 specifies that subpicture parameters are present in in the SPS RBSPsyntax. subpics_present_flag equal to 0 specifies that subpicture parameters are not present in the SPSRBSP syntax.NOTE 2 - When a bitstream is the result of a sub-bitstream extraction process and contains only a subsetof the subpictures of the input bitstream to the sub-bitstream extraction process, it might be required toset the value of subpics_present_flag equal to 1 in the RBSP of the SPSs.sps_num_subpics_minus1 plus 1 specifies the number of subpictures. sps_num_subpics_minus1 shall bein the range of 0 to 254. When not present, the value of sps_num_subpics_minus1 is inferred to be equal to0.subpic_ctu_top_left_x[ i ] specifies horizontal position of top left CTU of i-th subpicture in unit ofCtbSizeY. The length of the syntax element isCeil( Log2( pic_width_max_in_luma_samples / CtbSizeY ) ) bits. When not present, the value ofsubpic_ctu_top_left_x[ i ] is inferred to be equal to 0.subpic_ctu_top_left_y[ i ] specifies vertical position of top left CTU of i-th subpicture in unit of CtbSizeY.The length of the syntax element is Ceil( Log2( pic_height_max_in_luma_samples / CtbSizeY ) ) bits.When not present, the value of subpic_ctu_top_left_y[ i ] is inferred to be equal to 0.subpic_width_minus1[ i ] plus 1 specifies the width of the i-th subpicture in units of CtbSizeY. The lengthof the syntax element is Ceil( Log2( pic_width_max_in_luma_samples / CtbSizeY ) ) bits. When notpresent, the value of subpic_width_minus1[ i ] is inferred to be equal toCeil( pic_width_max_in_luma_samples / CtbSizeY ) - 1.subpic_height_minus1[ i ] plus 1 specifies the height of the i-th subpicture in units of CtbSizeY. Thelength of the syntax element is Ceil( Log2( pic_height_max_in_luma_samples / CtbSizeY ) ) bits. Whennot present, the value of subpic_height_minus1[ i ] is inferred to be equal toCeil( pic_height_max_in_luma_samples / CtbSizeY ) - 1.subpic_treated_as_pic_flag[ i ] equal to 1 specifies that the i-th subpicture of each coded picture in theCLVS is treated as a picture in the decoding process excluding in-loop filtering operations.subpic_treated_as_pic_flag[ i ] equal to 0 specifies that the i-th subpicture of each coded picture in theCLVS is not treated as a picture in the decoding process excluding in-loop filtering operations. When notpresent, the value of subpic_treated_as_pic_flag[ i ] is inferred to be equal to 0.loop_filter_across_subpic_enabled_flag[ i ] equal to 1 specifies that in-loop filtering operations may beperformed across the boundaries of the i-th subpicture in each coded picture in the CLVS.loop_filter_across_subpic_enabled_flag[ i ] equal to 0 specifies that in-loop filtering operations are notperformed across the boundaries of the i-th subpicture in each coded picture in the CLVS. When not present,the value of loop_filter_across_subpic_enabled_pic_flag[ i ] is inferred to be equal to 1.It is a requirement of bitstream conformance that the following constraints apply:- For any two subpictures subpicA and subpicB, when the subpicture index of subpicA is less than thatof subpicB, any coded slice NAL unit of subPicA shall precede any coded slice NAL unit of subPicBin decoding order.- The shapes of the subpictures shall be such that each subpicture, when decoded, shall have its entireleft boundary and entire top boundary consisting of picture boundaries or consisting of boundaries ofpreviously decoded subpictures.sps_subpic_id_present_flag equal to 1 specifies that subpicture ID mapping is present in the SPS.sps_subpic_id_present_flag equal to 0 specifies that subpicture ID mapping is not present in the SPS.sps_subpic_id_signalling_present_flag equal to 1 specifies that subpicture ID mapping is signalled in theSPS. sps_subpic_id_signalling_present_flag equal to 0 specifies that subpicture ID mapping is not signalledin the SPS. When not present, the value of sps_subpic_id_signalling_present_flag is inferred to be equal to0.sps_subpic_id_len_minus1 plus 1 specifies the number of bits used to represent the syntax elementsps_subpic_id[ i ]. The value of sps_ subpic_id_len_minus1 shall be in the range of 0 to 15, inclusive.sps_subpic_id[ i ] specifies that subpicture ID of the i-th subpicture. The length of the sps_subpic_id[ i ]syntax element is sps_subpic_id_len_minus1 + 1 bits. When not present, and whensps_subpic_id_present_flag equal to 0, the value of sps_subpic_id[ i ] is inferred to be equal to i, for each iin the range of 0 to sps_num_subpics_minus1, inclusive...7.3.2.4 Picture parameter set RBSP syntaxpic_parameter_set_rbsp( ) { Descriptor...mixed_nalu_types_in_pic_flag u(1)pps_subpic_id_signalling_present_flag u(1)if( pps_subpics_id_signalling_present_flag ) {pps_num_subpics_minus1 ue(v)pps_subpic_id_len_minus1 ue(v)for( i = 0; i <= pps_num_subpic_minus1; i++ )pps_subpic_id[ i ] u(v)}no_pic_partition_flag u(1)if( !no_pic_partition_flag ) {pps_log2_ctu_size_minus5 u(2)num_exp_tile_columns_minus1 ue(v)num_exp_tile_rows_minus1 ue(v)for( i = 0; i <= num_exp_tile_columns_minus1; i++ )tile_column_width_minus1[ i ] ue(v)for( i = 0; i <= num_exp_tile_rows_minus1; i++ )tile_row_height_minus1[ i ] ue(v)rect_slice_flag u(1)if( rect_slice_flag )single_slice_per_subpic_flag u(1)if( rect_slice_flag && !single_slice_per_subpic_flag ) {num_slices_in_pic_minus1 ue(v)tile_idx_delta_present_flag u(1)for( i = 0; i < num_slices_in_pic_minus1; i++ ) {slice_width_in_tiles_minus1[ i ] ue(v)slice_height_in_tiles_minus1[ i ] ue(v)if( slice_width_in_tiles_minus1[ i ] = = 0 &&slice_height_in_tiles_minus1[ i ] = = 0 ) {num_slices_in_tile_minus1[ i ] ue(v)numSlicesInTileMinus1 = num_slices_in_tile_minus1[ i ]for( j = 0; j < numSlicesInTileMinus1; j++ )slice_height_in_ctu_minus1[ i++ ] ue(v)}if( tile_idx_delta_present_flag && i < num_slices_in_pic_minus1 )tile_idx_delta[ i ] se(v)}}loop_filter_across_tiles_enabled_flag u(1)loop_filter_across_slices_enabled_flag u(1)}... u(1)}7.4.3.4 Picture parameter set RBSP semantics...pps_subpic_id_signalling_present_flag equal to 1 specifies that subpicture ID mapping is signalled in thePPS. pps_subpic_id_signalling_present_flag equal to 0 specifies that subpicture ID mapping is notsignalled in the PPS. When sps_subpic_id_present_flag is 0 or sps_subpic_id_signalling_present_flag isequal to 1, pps_subpic_id_signalling_present_flag shall be equal to 0.pps_num_subpics_minus1 plus 1 specifies the number of subpictures in the coded pictures referring tothe PPS.It is a requirement of bitstream conformance that the value of pps_num_subpic_minus1 shall be equal tosps_num_subpics_minus1.pps_subpic_id_len_minus1 plus 1 specifies the number of bits used to represent the syntax elementpps_subpic_id[ i ]. The value of pps_ subpic_id_len_minus1 shall be in the range of 0 to 15, inclusive.It is a requirement of bitstream conformance that the value of pps_subpic_id_len_minus1 shall be the samefor all PPSs that are referred to by coded pictures in a CLVS.pps_subpic_id[ i ] specifies the subpicture ID of the i-th subpicture. The length of the pps_subpic_id[ i ]syntax element is pps_subpic_id_len_minus1 + 1 bits.no_pic_partition_flag equal to 1 specifies that no picture partitioning applied to each picture referring tothe PPS. no_pic_partition_flag equal to 0 specifies each picture referring to the PPS may be partitioned intomore than one tile or slice.It is a requirement of bitstream conformance that the value of no_pic_partition_flag shall be the same forall PPSs that are referred to by coded pictures within a CLVS.It is a requirement of bitstream conformance that the value of no_pic_partition_flag shall not be equal to 1when the value of sps_num_subpics_minus1 + 1 is greater than 1.pps_log2_ctu_size_minus5 plus 5 specifies the luma coding tree block size of each CTU.pps_log2_ctu_size_minus5 shall be equal to sps_log2_ctu_size_minus5.num_exp_tile_columns_minus1 plus 1 specifies the number of explicitly provided tile column widths.The value of num_exp_tile_columns_minus1 shall be in the range of 0 to PicWidthInCtbsY - 1, inclusive.When no_pic_partition_flag is equal to 1, the value of num_exp_tile_columns_minus1 is inferred to beequal to 0.num_exp_tile_rows_minus1 plus 1 specifies the number of explicitly provided tile row heights. The valueof num_exp_tile_rows_minus1 shall be in the range of 0 to PicHeightInCtbsY - 1, inclusive. Whenno_pic_partition_flag is equal to 1, the value of num_tile_rows_minus1 is inferred to be equal to 0.tile_column_width_minus1[ i ] plus 1 specifies the width of the i-th tile column in units of CTBs for i inthe range of 0 to num_exp_tile_columns_minus1 - 1, inclusive.tile_column_width_minus1[ num_exp_tile_columns_minus1 ] is used to derive the width of the tilecolumns with index greater than or equal to num_exp_tile_columns_minus1 as specified in clause 6.5.1.When not present, the value of tile_column_width_minus1[ 0 ] is inferred to be equal toPicWidthInCtbsY - 1.tile_row_height_minus1[ i ] plus 1 specifies the height of the i-th tile row in units of CTBs for i in therange of 0 to num_exp_tile_rows_minus1 - 1, inclusive.tile_row_height_minus1[ num_exp_tile_rows_minus1 ] is used to derive the height of the tile rows withindex greater than or equal to num_exp_tile_rows_minus1 as specified in clause 6.5.1. When not present,the value of tile_row_height_minus1[ 0 ] is inferred to be equal to PicHeightInCtbsY - 1.rect_slice_flag equal to 0 specifies that tiles within each slice are in raster scan order and the sliceinformation is not signalled in PPS. rect_slice_flag equal to 1 specifies that tiles within each slice cover arectangular region of the picture and the slice information is signalled in the PPS. When not present,rect_slice_flag is inferred to be equal to 1. When subpics_present_flag is equal to 1, the value ofrect_slice_flag shall be equal to 1.single_slice_per_subpic_flag equal to 1 specifies that each subpicture consists of one and only onerectangular slice. single_slice_per_subpic_flag equal to 0 specifies that each subpicture may consist one ormore rectangular slices. When subpics_present_flag is equal to 0, single_slice_per_subpic_flag shall beequal to 0. When single_slice_per_subpic_flag is equal to 1, num_slices_in_pic_minus1 is inferred to beequal to sps_num_subpics_minus1.num_slices_in_pic_minus1 plus 1 specifies the number of rectangular slices in each picture referring tothe PPS. The value of num_slices_in_pic_minus1 shall be in the range of 0 to MaxSlicesPerPicture - 1,inclusive, where MaxSlicesPerPicture is specified in Annex A. When no_pic_partition_flag is equal to 1,the value of num_slices_in_pic_minus1 is inferred to be equal to 0.tile_idx_delta_present_flag equal to 0 specifies that tile_idx_delta values are not present in the PPS andthat all rectangular slices in pictures referring to the PPS are specified in raster order according to theprocess defined in clause 6.5.1. tile_idx_delta_present_f lag equal to 1 specifies that tile_idx_delta valuesmay be present in the PPS and that all rectangular slices in pictures referring to the PPS are specified in theorder indicated by the values of tile_idx_delta.slice_width_in_tiles_minus1[ i ] plus 1 specifies the width of the i-th rectangular slice in units of tilecolumns. The value of slice_width_in_tiles_minus1[ i ] shall be in the range of 0 to NumTileColumns - 1,inclusive. When not present, the value of slice_width_in_tiles_minus1[ i ] is inferred as specified in clause6.5.1.slice_height_in_tiles_minus1[ i ] plus 1 specifies the height of the i-th rectangular slice in units of tilerows. The value of slice_height_in_tiles_minus1[ i ] shall be in the range of 0 to NumTileRows - 1,inclusive. When not present, the value of slice_height_in_tiles_minus1[ i ] is inferred as specified in clause6.5.1.num_slices_in_tile_minus1[ i ] plus 1 specifies the number of slices in the current tile for the case wherethe i-th slice contains a subset of CTU rows from a single tile. The value of num_slices_in_tile_minus1[ i ]shall be in the range of 0 to RowHeight[ tileY ] - 1, inclusive, where tileY is the tile row index containingthe i-th slice. When not present, the value of num_slices_in_tile_minus1[ i ] is inferred to be equal to 0.slice_height_in_ctu_minus1[ i ] plus 1 specifies the height of the i-th rectangular slice in units of CTUrows for the case where the i-th slice contains a subset of CTU rows from a single tile. The value ofslice_height_in_ctu_minus1[ i ] shall be in the range of 0 to RowHeight[ tileY ] - 1, inclusive, where tileYis the tile row index containing the i-th slice.tile_idx_delta[ i ] specifies the difference in tile index between the i-th rectangular slice and the ( i + 1 )-th rectangular slice. The value of tile_idx_delta[ i ] shall be in the range of -NumTilesInPic + 1 toNumTilesInPic - 1, inclusive. When not present, the value of tile_idx_delta[ i ] is inferred to be equal to 0.In all other cases, the value of tile_idx_delta[ i ] shall not be equal to 0.loop_filter_across_tiles_enabled_flag equal to 1 specifies that in-loop filtering operations may beperformed across tile boundaries in pictures referring to the PPS. loop_filter_across_tiles_enabled_flagequal to 0 specifies that in-loop filtering operations are not performed across tile boundaries in picturesreferring to the PPS. The in-loop filtering operations include the deblocking filter, sample adaptive offsetfilter, and adaptive loop filter operations. When not present, the value ofloop_filter_across_tiles_enabled_flag is inferred to be equal to 1.loop_filter_across_slices_enabled_flag equal to 1 specifies that in-loop filtering operations may beperformed across slice boundaries in pictures referring to the PPS. loop_filter_across_slice_enabled_flagequal to 0 specifies that in-loop filtering operations are not performed across slice boundaries in picturesreferring to the PPS. The in-loop filtering operations include the deblocking filter, sample adaptive offsetfilter, and adaptive loop filter operations. When not present, the value ofloop_filter_across_slices_enabled_flag is inferred to be equal to 0....7.3.7.1 General slice header syntaxslice_header( ) { Descriptor...if( subpics_present_flag )slice_subpic_id u(v)if( rect_slice_flag | | NumTilesInPic > 1 )slice_address u(v)if( !rect_slice_flag && NumTilesInPic > 1 )num_tiles_in_slice_minus1 ue(v)slice_type ue(v)...}7.4.8.1 General slice header semantics...slice_subpic_id specifies the subpicture identifier of the subpicture that contains the slice. Ifslice_subpic_id is present, the value of the variable SubPicIdx is derived to be such thatSubpicIdList[ SubPicIdx ] is equal to slice_subpic_id. Otherwise (slice_subpic_id is not present), thevariable SubPicIdx is derived to be equal to 0. The length of slice_subpic_id, in bits, is derived as follows:- If sps_subpic_id_signalling_present_flag is equal to 1, the length of slice_subpic_id is equal tosps_subpic_id_len_minus1 + 1.- Otherwise, if ph_subpic_id_signalling_present_flag is equal to 1, the length of slice_subpic_id is equalto ph_subpic_id_len_minus1 + 1.- Otherwise, if pps_subpic_id_signalling_present_flag is equal to 1, the length of slice_subpic_id is equalto pps_subpic_id_len_minus1 + 1.- Otherwise, the length of slice_subpic_id is equal to Ceil( Log2 ( sps_num_subpics_minus1 + 1 ) ).slice_address specifies the slice address of the slice. When not present, the value of slice_address is inferredto be equal to 0.If rect_slice_flag is equal to 0, the following applies:- The slice address is the raster scan tile index.- The l ength of slice_address is Ceil( Log2 ( NumTilesInPic ) ) bits.- The value of slice_address shall be in the range of 0 to NumTilesInPic - 1, inclusive.Otherwise (rect_slice_flag is equal to 1), the following applies:- The slice address is the slice index of the slice within the SubPicIdx-th subpicture.- The length of slice_address is Ceil( Log2( NumSlicesInSubpic[ SubPicIdx ] ) ) bits.- The value of slice_address shall be in the range of 0 to NumSlicesInSubpic[ SubPicIdx ] - 1, inclusive.It is a requirement of bitstream conformance that the following constraints apply:- If rect_slice_flag is equal to 0 or subpics_present_flag is equal to 0, the value of slice_address shall notbe equal to the value of slice_address of any other coded slice NAL unit of the same coded picture.- Otherwise, the pair of slice_subpic_id and slice_address values shall not be equal to the pair ofslice_subpic_id and slice_address values of any other coded slice NAL unit of the same coded picture.- When rect_slice_flag is equal to 0, the slices of a picture shall be in increasing order of theirslice_address values.- The shapes of the slices of a picture shall be such that each CTU, when decoded, shall have its entireleft boundary and entire top boundary consisting of a picture boundary or consisting of boundaries ofpreviously decoded CTU(s).num_tiles_in_slice_minus1 plus 1, when present, specifies the number of tiles in the slice. The value ofnum_tiles_in_slice_minus1 shall be in the range of 0 to NumTilesInPic - 1, inclusive.The variable NumCtuInCurrSlice, which specifies the number of CTUs in the current slice, and the listCtbAddrInCurrSlice[ i ], for i ranging from 0 to NumCtuInCurrSlice - 1, inclusive, specifying the pictureraster scan address of the i-th CTB within the slice, are derived as follows:if( rect_slice_flag ) {picLevelSliceIdx = SliceSubpicToPicIdx[ SubPicIdx ][ slice_address ]NumCtuInCurrSlice = NumCtuInSlice[ picLevelSliceIdx ]for( i = 0; i < NumCtuInCurrSlice; i++ )CtbAddrInCurrSlice[ i ] = CtbAddrInSlice[ picLevelSliceIdx ][ i ] (115)} else {NumCtuInCurrSlice = 0for( tileIdx = slice_address; tileIdx <= slice_address + num_tiles_in_slice_minus1[ i ];tileIdx++ ) {tileX = tileIdx % NumTileColumnstileY = tileIdx / NumTileColumnsfor( ctbY = tileRowBd[ tileY ]; ctbY < tileRowBd[ tileY + 1 ]; ctbY++ ) {for( ctbX = tileColBd[ tileX ]; ctbX < tileColBd[ tileX + 1 ]; ctbX++ ) {CtbAddrInCurrSlice[ NumCtuInCurrSlice ] = ctbY * PicWidthInCtb + ctbXNumCtuInCurrSlice++}}}}The variables SubPicLeftBoundaryPos, SubPicTopBoundaryPos, SubPicRightBoundaryPos, andSubPicBotBoundaryPos are derived as follows:if( subpic_treated_as_pic_flag[ SubPicIdx ] ) {SubPicLeftBoundaryPos = subpic_ctu_top_left_x[ SubPicIdx ] * CtbSizeYSubPicRightBoundaryPos = Min( pic_width_max_in_luma_samples - 1,( subpic_ctu_top_left_x[ SubPicIdx ] + subpic_width_minus1[ SubPicIdx ] + 1 ) * CtbSizeY- 1)SubPicTopBoundaryPos = subpic_ctu_top_left_y[ SubPicIdx ] *CtbSizeY (116)SubPicBotBoundaryPos = Min( pic_height_max_in_luma_samples - 1,( subpic_ctu_top_left_y[ SubPicIdx ] + subpic_height_minus1[ SubPicIdx ] + 1 ) * CtbSizeY- 1)}...4. Examples of technical problems solved by solutions herein
[0054] The existing designs for signalling of subpictures, tiles, and slices in VVC have thefollowing problems:1) The coding of sps_num_subpics_minus1 is u(8), which disallows more than 256subpictures per picture. However, in certain applications, the maximum number ofsubpictures per picture may need to be greater than 256.2) It is allowed to have subpics_present_flag equal to 0 and sps_subpic_id_present_flag equalto 1. However, this does not makes sense as subpics_present_flag equal to 0 means that theCLVS has no information on subpictures at all.3) A list of subpicture IDs may be signalled in picture headers (PHs), one for each of thesubpictures. However, when the list of subpicture IDs is signalled in PHs, and when asubset of the subpictures is extracted from the bitstream, all the PHs would all need to bechanged. This is undesirable.4) Currently when subpicture IDs are indicated to be explicitly signalled, bysps_subpic_id_present_flag (or the name of the syntax element is changed tosubpic_ids_explicitly_signalled_flag) equal to 1, subpicture IDs may be not signalledanywhere. This is problematic as subpicture IDs need to be explicitly signalled in eitherthe SPS or the PPS when subpicture IDs are indicated to be explicitly signalled.5) When subpicture IDs are not explicitly signalled, the slice header syntax elementslice_subpic_id still need to be signalled as long as subpics_present_flag is equal to 1,including when sps_num_subpics_minus1 is equal to 0. However, the length ofslice_subpic_id is currently specified as Ceil( Log2 ( sps_num_subpics_minus1 + 1 ) ) bits,which would be 0 bits when sps_num_subpics_minus1 is equal to 0. This is problematic,as the length of any present syntax elements cannot be 0 bits.6) The subpicture layout, including the number of subpictures and their sizes and positions,keeps unchanging for the entire CLVS. Even when the subpicture IDs are not explicitlysignalled in the SPS or the PPS, the subpicture ID length still needs to be signalled, for thesubpicture ID syntax element in slice headers.7) Whenever rect_slice_flag is equal to 1, the syntax element slice_address is signalled in theslice header and specifies the slice index within the subpicture containing the slice,including when the number of slices within the subpicture (i.e.,NumSlicesInSubpic[ SubPicIdx ]) is equal to 1. However, currently, when rect_slice_flagis equal to 1, the length of slice_address is specified to beCeil( Log2( NumSlicesInSubpic[ SubPicIdx ] ) ) bits, which would be 0 bits whenNumSlicesInSubpic[ SubPicIdx ] is equal to 1. This is problematic, as the length of anypresent syntax elements cannot be 0 bits.8) There is reundancy between the syntax elements no_pic_partition_flag andpps_num_subpics_minus1, although the latest VVC text has the following constraint:When sps_num_subpics_minus1 is greater than 0, the value of no_pic_partition_flag shallbe equal to 1.5. Example embodiments and solutions
[0055] To solve the above problems, and others, methods as summarized below are disclosed. Theinventions should be considered as examples to explain the general concepts and should not beinterpreted in a narrow way. Furthermore, these inventions can be applied individually orcombined in any manner.
[0056] To solve the first problem, change the coding of sps_num_subpics_minus1 from u(8) toue(v), to enable more than 256 subpictures per picture.a. Furthermore, the value of sps_num_subpics_minus1 is restricted to be in the rangeof 0 to Ceil( pic_width_max_in_luma_samples ÷ CtbSizeY ) *Ceil( pic_height_max_in_luma_samples ÷ CtbSizeY ) - 1, inclusive.b. Furthermore, the number of subpictures per picture is further restricted in thedefinition of levels.2) To solve the second problem, condition the signalling of the syntax elementsps_subpic_id_present_flag on "if( subpics_present_flag )", i.e., the syntax elementsps_subpic_id_present_flag is not signalled when subpics_present_flag is equal to 0, andinfer the value of sps_subpic_id_present_flag to be equal to 0 when it is not present.a. Alternatively, the syntax element sps_subpic_id_present_flag is still signalledwhen subpics_present_flag is equal to 0, but the value is required to be equal to 0when subpics_present_flag is equal to 0.b. Furthermore, the names of the syntax elements subpics_present_flag andsps_subpic_id_present_flag are changed to be subpic_info_present_flag andsubpic_ids_explicitly_signalled_flag, respectively.3) To solve the third problem, the signalling of subpicture IDs in the PH syntax is removed.Consequently, the list SubpicIdList[ i ], for i in the range of 0 to sps_num_subpics_minus1,inclusive, is derived as follows:for( i = 0; i <= sps_num_subpics_minus1; i++ )if( subpic_ids_explicitly_signalled_flag )SubpicIdList[ i ] = subpic_ids_in_pps_flag ? pps_subpic_id[ i ] :sps_subpic_id[ i ]elseSubpicIdList[ i ] = i4) To solve the fourth problem, subpicture IDs are signalled either in the SPS or in the PPSwhen subpictures are indicated to be explicitly signalled.a. This is realized by add the following constraint: Ifsubpic_ids_explicitly_signalled_flag is 0 or subpic_ids_in_sps_flag is equal to 1,subpic_ids_in_pps_flag shall be equal to 0. Otherwise(subpic_ids_explicitly_signalled_flag is 1 and subpic_ids_in_sps_flag is equal to0), subpic_ids_in_pps_flag shall be equal to 1.5) To solve the fifth and sixth problems, the length of subpicture IDs is signalled in the SPSregardless of the value of the SPS flag sps_subpic_id_present_flag (or renamed tosubpic_ids_explicitly_signalled_flag), although the length may also be signalled in the PPSwhen subpicture IDs are explicitly signalled in the PPS to avoid parsing dependency ofPPS on SPS. In this case, the length also specifies the length of the subpicture IDs in theslice headers, even subpicture IDs are not explicitly signalled in the SPS or PPS.Consequently, the length of the slice_subpic_id, when present, is also specified by thesubpicture ID length signalled in the SPS.6) Alternatively, to solve the fifth and sixth problems, a flag is added to the SPS syntax, thevalue of 1 for which to specify the existence of the subpicture ID length in the SPS syntax.This flag is present is independent of the value of the flag indicating whether subpictureIDs are explicitly signalled in the SPS or PPS. The value of this flag may be equal to either1 or 0 when subpic_ids_explicitly_signalled_flag is equal to 0, but the value of flag mustbe equal to 1 when when subpic_ids_explicitly_signalled_flag is equal to 1. When this flagis equal to 0, i.e., the subpicture length is not present, the length of slice_subpic_id isspecified to be Max( Ceil( Log2 ( sps_num_subpics_minus1 + 1 ) ), 1 ) bits (as opposed tobe Ceil( Log2 ( sps_num_subpics_minus1 + 1 ) ) bits in the latest VVC draft text).a. Alternatively, this flag is present only when subpic_ids_explicitly_signalled_flagis equal to 0, and when subpic_ids_explicitly_signalled_flag is equal to 1 the valueof this flag is inferred to be equal to 1.7) To solve the seventh problem, when rect_slice_flag is equal to 1, the length ofslice_address is specified to be Max( Ceil( Log2( NumSlicesInSubpic[ SubPicIdx ] ) ), 1 )bits.a. Alternatively, further more, when rect_slice_flag is equal to 0, the length ofslice_address is specified to Max( Ceil( Log2 ( NumTilesInPic ) ), 1 ) bits, asopposed to be Ceil( Log2 ( NumTilesInPic ) ) bits.8) To solve the eighth problem, condition the signalling of no_pic_partition_flag on"if( subpic_ids_in_pps_flag && pps_num_subpics_minus1 > 0 )", and add the followinginference: When not present, the value of no_pic_partition_flag is inferred to be equal to1.a. Alternatively, move the subpicture ID syntax (all the four syntax elements) afterthe tile and slice syntax in the PPS, e.g., immediately before the syntax elemententropy_coding_sync_enabled_flag, and then condition the signalling ofpps_num_subpics_minus1 on "if( no_pic_partition_flag )".6. EmbodimentsBelow are some example embodiments for all the invention aspects except item 8 summarizedabove in Section 5, which can be applied to the VVC specification. The changed texts are basedon the latest VVC text in JVET-P2001-v14. Most relevant parts that have been added or modifiedare shown in underline, bolded and italicized text, and the most relevant removed parts arehighlighted in enclosed in bolded double brackets, e.g., [[a]] indicates that "a" has been removed..There are some other changes that are editorial in nature and thus not highlighted.6.1. First embodiment7.3.2.3 Sequence parameter set RBSP syntaxseq_parameter_set_rbsp( ) { Descriptor...sps_log2_ctu_size_minus5 u(2)subpic_info_present_flag u(1)if( subpic_info_present_flag ) {sps_num_subpics_minus1 ue(v)for( i = 0; i <= sps_num_subpics_minus1; i++ ) {subpic_ctu_top_left_x[ i ] u(v)subpic_ctu_top_left_y[ i ] u(v)subpic_width_minus1[ i ] u(v)subpic_height_minus1[ i ] u(v)subpic_treated_as_pic_flag[ i ] u(1)loop_filter_across_subpic_enabled_flag[ i ] u(1)}sps_subpic_id_len_minus1 ue(v)subpic_ids_explicitly_signalled_flag u(1)if( subpic_ids_explicitly_signalled_flag ) {subpic_ids_in_sps_flag u(1)if( subpic_ids_in_sps_flag )for( i = 0; i <= sps_num_subpics_minus1; i++ )sps_subpic_id[ i ] u(v)}}...}7.4.3.3 Sequence parameter set RBSP semantics...subpic_info_present_flag equal to 1 specifies that subpicture information is present.subpic_info_present_flag equal to 0 specifies that subpicture information is not present. The values ofsps_ref_pic_resampling_enabled_flag and subpic_info_present_flag shall not be both equal to 1.NOTE 2 - When a bitstream is the result of a sub-bitstream extraction process and contains only a subsetof the subpictures of the input bitstream to the sub-bitstream extraction process, it might be required toset the value of subpic_info_present_flag equal to 1 in the SPSs.sps_num_subpics_minus1 plus 1 specifies the number of subpictures. The value ofsps_num_subpics_minus1 shall be in the range of 0 toCeil( pic_width_max_in_luma_samples ÷ CtbSizeY ) *Ceil( pic_height_max_in_luma_samples ÷ CtbSizeY ) - 1, inclusive. Noet that the maximum number ofsubpictures can be further restricted in the level definitions. When not present, the value ofsps_num_subpics_minus1 is inferred to be equal to 0.subpic_ctu_top_left_x[ i ] specifies horizontal position of top left CTU of i-th subpicture in unit ofCtbSizeY. The length of the syntax element isCeil( Log2( pic_width_max_in_luma_samples / CtbSizeY ) ) bits. When not present, the value ofsubpic_ctu_top_left_x[ i ] is inferred to be equal to 0.subpic_ctu_top_left_y[ i ] specifies vertical position of top left CTU of i-th subpicture in unit of CtbSizeY.The length of the syntax element is Ceil( Log2( pic_height_max_in_luma_samples / CtbSizeY ) ) bits.When not present, the value of subpic_ctu_top_left_y[ i ] is inferred to be equal to 0.subpic_width_minus1[ i ] plus 1 specifies the width of the i-th subpicture in units of CtbSizeY. The lengthof the syntax element is Ceil( Log2( pic_width_max_in_luma_samples / CtbSizeY ) ) bits. When notpresent, the value of subpic_width_minus1[ i ] is inferred to be equal toCeil( pic_width_max_in_luma_samples / CtbSizeY ) - 1.subpic_height_minus1[ i ] plus 1 specifies the height of the i-th subpicture in units of CtbSizeY. Thelength of the syntax element is Ceil( Log2( pic_height_max_in_luma_samples / CtbSizeY ) ) bits. Whennot present, the value of subpic_height_minus1[ i ] is inferred to be equal toCeil( pic_height_max_in_luma_samples / CtbSizeY ) - 1.subpic_treated_as_pic_flag[ i ] equal to 1 specifies that the i-th subpicture of each coded picture in theCLVS is treated as a picture in the decoding process excluding in-loop filtering operations.subpic_treated_as_pic_flag[ i ] equal to 0 specifies that the i-th subpicture of each coded picture in theCLVS is not treated as a picture in the decoding process excluding in-loop filtering operations. When notpresent, the value of subpic_treated_as_pic_flag[ i ] is inferred to be equal to 0.loop_filter_across_subpic_enabled_flag[ i ] equal to 1 specifies that in-loop filtering operations may beperformed across the boundaries of the i-th subpicture in each coded picture in the CLVS.loop_filter_across_subpic_enabled_flag[ i ] equal to 0 specifies that in-loop filtering operations are notperformed across the boundaries of the i-th subpicture in each coded picture in the CLVS. When not present,the value of loop_filter_across_subpic_enabled_pic_flag[ i ] is inferred to be equal to 1.It is a requirement of bitstream conformance that the following constraints apply:- For any two subpictures subpicA and subpicB, when the subpicture index of subpicA is less than thatof subpicB, any coded slice NAL unit of subPicA shall precede any coded slice NAL unit of subPicBin decoding order.- The shapes of the subpictures shall be such that each subpicture, when decoded, shall have its entireleft boundary and entire top boundary consisting of picture boundaries or consisting of boundaries ofpreviously decoded subpictures.sps_subpic_id_len_minus1 plus 1 specifies the number of bits used to represent the explicitly signalledsubpicture IDs as well as the slice_subpic_id syntax element in the slice header. The value ofsps_subpic_id_len_minus1 shall be in the range of 0 to 15, inclusive.subpic_ids_explicitly_signalled_flag equal to 1 specifies that a set of subpicture ID, one for eachsubpicture, is explicitly signalled for each subpicture either in the SPS or the PPS.subpic_ids_explicitly_signalled_flag equal to 0 specifies that no subpicture IDs are explicitly signalledin the SPS or the PPS. When not present, the value of subpic_ids_explicitly_signalled_flag is inferred tobe equal to 0.subpic_ids_in_sps_flag equal to 1 specifies that a subpicture ID for each subpicture is explicitly signalledin the SPS. subpic_ids_in_sps_flag equal to 0 specifies that no subpicture IDs are signalled in the SPS.When not present, the value of subpic_ids_in_sps_flag is inferred to be equal to 0.sps_subpic_id[ i ] specifies the subpicture ID of the i-th subpicture. The length of the sps_subpic_id[ i ]syntax element is sps_subpic_id_len_minus1 + 1 bits....7.3.2.4 Picture parameter set RBSP syntaxpic_parameter_set_rbsp( ) { Descriptor...mixed_nalu_types_in_pic_flag u(1)subpic_ids_in_pps_flag u(1)if( subpic_ids_in_pps_flag ) {pps_num_subpics_minus1 ue(v)pps_subpic_id_len_minus1 ue(v)for( i = 0; i <= pps_num_subpic_minus1; i++ )pps_subpic_id[ i ] u(v)}no_pic_partition_flag u(1)if( !no_pic_partition_flag ) {pps_log2_ctu_size_minus5 u(2)num_exp_tile_columns_minus1 ue(v)num_exp_tile_rows_minus1 ue(v)for( i = 0; i <= num_exp_tile_columns_minus1; i++ )tile_column_width_minus1[ i ] ue(v)for( i = 0; i <= num_exp_tile_rows_minus1; i++ )tile_row_height_minus1[ i ] ue(v)if( NumTilesInPic > 1 )rect_slice_flag u(1)if( rect_slice_flag )single_slice_per_subpic_flag u(1)if( rect_slice_flag && !single_slice_per_subpic_flag ) {num_slices_in_pic_minus1 ue(v)tile_idx_delta_present_flag u(1)for( i = 0; i < num_slices_in_pic_minus1; i++ ) {slice_width_in_tiles_minus1[ i ] ue(v)slice_height_in_tiles_minus1[ i ] ue(v)if( slice_width_in_tiles_minus1[ i ] = = 0 &&slice_height_in_tiles_minus1[ i ] = = 0 ) {num_slices_in_tile_minus1[ i ] ue(v)for( j = 0; j < num_slices_in_tile_minus1[ i ]; j++ )slice_height_in_ctu_minus1[ i++ ] ue(v)}if( tile_idx_delta_present_flag && i < num_slices_in_pic_minus1 )tile_idx_delta[ i ] se(v)}}loop_filter_across_tiles_enabled_flag u(1)loop_filter_across_slices_enabled_flag u(1)}...}7.4.3.4 Picture parameter set RBSP semantics...subpic_ids_in_pps_flag equal to 1 specifies that a subpicture ID for each subpicture is explicitly signalledin the PPS. subpic_ids_in_pps_flag equal to 0 specifies that no subpicture IDs are signalled in the PPS.If subpic_ids_explicitly_signalled_flag is 0 or subpic_ids_in_sps_flag is equal to 1,subpic_ids_in_pps_flag shall be equal to 0. Otherwise (subpic_ids_explicitly_signalled_flag is 1 andsubpic_ids_in_sps_flag is equal to 0), subpic_ids_in_pps_flag shall be equal to 1.pps_num_subpics_minus1 shall be equal to sps_num_subpics_minus1.pps_subpic_id_len_minus1 shall be equal to sps_subpic_id_len_minus1.pps_subpic_id[ i ] specifies the subpicture ID of the i-th subpicture. The length of the pps_subpic_id[ i ]syntax element is pps_subpic_id_len_minus1 + 1 bits.The list SubpicIdList[ i ], for i in the range of 0 to sps_num_subpics_minus1, inclusive, is derived asfollows:for( i = 0; i <= sps_num_subpics_minus1; i++ )if( subpic_ids_explicitly_signalled_flag )SubpicIdList[ i ] = subpic_ids_in_pps_flag ? pps_subpic_id[ i ] : sps_subpic_id[ i ](76)elseSubpicIdList[ i ] = iIt is a requirement of bitstream conformance that, for any i and j in the range of 0 tosps_num_subpics_minus1, inclusive, when i is less than j, SubpicIdList[ i ] shall be less thanSubpicIdList[ j ]....rect_slice_flag equal to 0 specifies that tiles within each slice are in raster scan order and the sliceinformation is not signalled in PPS. rect_slice_flag equal to 1 specifies that tiles within each slice cover arectangular region of the picture and the slice information is signalled in the PPS. When not present,rect_slice_flag is inferred to be equal to 1. When subpic_info_present_flag is equal to 1, the value ofrect_slice_flag shall be equal to 1.single_slice_per_subpic_flag equal to 1 specifies that each subpicture consists of one and only onerectangular slice. single_slice_per_subpic_flag equal to 0 specifies that each subpicture may consist one ormore rectangular slices. When subpic_info_present_flag is equal to 0, single_slice_per_subpic_flag shallbe equal to 0. When single_slice_per_subpic_flag is equal to 1, num_slices_in_pic_minus1 is inferred tobe equal to sps_num_subpics_minus1....7.3.7.1 General slice header syntaxslice_header( ) { Descriptor...if( subpic_info_present_flag )slice_subpic_id u(v)if( rect_slice_flag | | NumTilesInPic > 1 )slice_address u(v)if( !rect_slice_flag && NumTilesInPic > 1 )num_tiles_in_slice_minus1 ue(v)slice_type ue(v)...}7.4.8.1 General slice header semantics...slice_subpic_id specifies the subpicture ID of the subpicture that contains the slice. The length ofslice_subpic_id is sps_subpic_id_len_minus1 + 1 bits.When not present, the value of slice_subpic_id is inferred to be equal to 0.The variable SubPicIdx is derived to be the value such that SubpicIdList[ SubPicIdx ] is equal toslice_subpic_id.slice_address specifies the slice address of the slice. When not present, the value of slice_address is inferredto be equal to 0.If rect_slice_flag is equal to 0, the following applies:- The slice address is the raster scan tile index.- The length of slice_address is Ceil( Log2 ( NumTilesInPic ) ) bits.- The value of slice_address shall be in the range of 0 to NumTilesInPic - 1, inclusive.Otherwise (rect_slice_flag is equal to 1), the following applies:- The slice address is the subpicture-level slice index of the slice.- The length of slice_address is Max( Ceil( Log2( NumSlicesInSubpic[ SubPicIdx ] ) ), 1 ) bits.- The value of slice_address shall be in the range of 0 to NumSlicesInSubpic[ SubPicIdx ] - 1, inclusive.It is a requirement of bitstream conformance that the following constraints apply:- If rect_slice_flag is equal to 0 or subpic_info_present_flag is equal to 0, the value of slice_addressshall not be equal to the value of slice_address of any other coded slice NAL unit of the same codedpicture.- Otherwise, the pair of slice_subpic_id and slice_address values shall not be equal to the pair ofslice_subpic_id and slice_address values of any other coded slice NAL unit of the same coded picture.- When rect_slice_flag is equal to 0, the slices of a picture shall be in increasing order of theirslice_address values.- The shapes of the slices of a picture shall be such that each CTU, when decoded, shall have its entireleft boundary and entire top boundary consisting of a picture boundary or consisting of boundaries ofpreviously decoded CTU(s)....
[0057] FIG. 5 is a block diagram showing an example video processing system 500 in whichvarious techniques disclosed herein may be implemented. Various implementations may includesome or all of the components of the system 500. The system 500 may include input 502 forreceiving 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 in a compressed or encoded format. The input502 may represent a network interface, a peripheral bus interface, or a storage interface. Examplesof network interface include wired interfaces such as Ethernet, passive optical network (PON), etc.and wireless interfaces such as Wi-Fi or cellular interfaces.
[0058] The system 500 may include a coding component 504 that may implement the variouscoding or encoding methods described in the present document. The coding component 504 mayreduce the average bitrate of video from the input 502 to the output of the coding component 504to produce a coded representation of the video. The coding techniques are therefore sometimescalled video compression or video transcoding techniques. The output of the coding component504 may be either stored, or transmitted via a communication connected, as represented by thecomponent 506. The stored or communicated bitstream (or coded) representation of the videoreceived at the input 502 may be used by the component 508 for generating pixel values ordisplayable video that is sent to a display interface 510. The process of generating user-viewablevideo from the bitstream representation is sometimes called video decompression. Furthermore,while certain video processing operations are referred to as "coding" operations or tools, it will beappreciated that the coding tools or operations are used at an encoder and corresponding decodingtools or operations that reverse the results of the coding will be performed by a decoder.
[0059] Examples of a peripheral bus interface or a display interface may include universal serialbus (USB) or high definition multimedia interface (HDMI) or Displayport, and so on. Examplesof storage interfaces include SATA (serial advanced technology attachment), PCI, IDE interface,and the like. The techniques described in the present document may be embodied in variouselectronic devices such as mobile phones, laptops, smartphones or other devices that are capableof performing digital data processing and / or video display.
[0060] FIG. 6 is a block diagram of a video processing apparatus 600. The apparatus 600 may beused to implement one or more of the methods described herein. The apparatus 600 may beembodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. Theapparatus 600 may include one or more processors 602, one or more memories 604 and videoprocessing hardware 606. The processor(s) 602 may be configured to implement one or moremethods described in the present document. The memory (memories) 604 may be used for storingdata and code used for implementing the methods and techniques described herein. The videoprocessing hardware 606 may be used to implement, in hardware circuitry, some techniquesdescribed in the present document. In some embodiments, the hardware 606 may be partly orentirely within the processors 602, e.g., a graphics processor.
[0061] FIG. 7 is a block diagram that illustrates an example video coding system 100 that mayutilize the techniques of this disclosure.
[0062] As shown in FIG. 7, video coding system 100 may include a source device 110 and adestination device 120. Source device 110 generates encoded video data which may be referred toas a video encoding device. Destination device 120 may decode the encoded video data generatedby source device 110 which may be referred to as a video decoding device.
[0063] Source device 110 may include a video source 112, a video encoder 114, and aninput / output (I / O) interface 116.
[0064] Video source 112 may include a source such as a video capture device, an interface toreceive video data from a video content provider, and / or a computer graphics system for generatingvideo data, or a combination of such sources. The video data may comprise one or more pictures.Video encoder 114 encodes the video data from video source 112 to generate a bitstream. Thebitstream may include a sequence of bits that form a coded representation of the video data. Thebitstream may include coded pictures and associated data. The coded picture is a codedrepresentation of a picture. The associated data may include sequence parameter sets, pictureparameter sets, and other syntax structures. I / O interface 116 may include amodulator / demodulator (modem) and / or a transmitter. The encoded video data may be transmitteddirectly to destination device 120 via I / O interface 116 through network 130a. The encoded videodata may also be stored onto a storage medium / server 130b for access by destination device 120.
[0065] Destination device 120 may include an I / O interface 126, a video decoder 124, and adisplay device 122.
[0066] I / O interface 126 may include a receiver and / or a modem. I / O interface 126 may acquireencoded video data from the source device 110 or the storage medium / server 130b. Video decoder124 may decode the encoded video data. Display device 122 may display the decoded video datato a user. Display device 122 may be integrated with the destination device 120, or may be externalto destination de vice 120 which be configured to interface with an external display device.
[0067] Video encoder 114 and video decoder 124 may operate according to a video compressionstandard, such as the High Efficiency Video Coding (HEVC) standard, Versatile VideoCoding(VVM) standard and other current and / or further standards.
[0068] FIG. 8 is a block diagram illustrating an example of video encoder 200, which may bevideo encoder 114 in the system 100 illustrated in FIG. 7.
[0069] Video encoder 200 may be configured to perform any or all of the techniques of thisdisclosure. In the example of FIG. 8, video encoder 200 includes a plurality of functionalcomponents. The techniques described in this disclosure may be shared among the variouscomponents of video encoder 200. In some examples, a processor may be configured to performany or all of the techniques described in this disclosure.
[0070] The functional components of video encoder 200 may include a partition unit 201, apredication unit 202 which may include a mode select unit 203, a motion estimation unit 204, amotion compensation unit 205 and an intra prediction unit 206, a residual generation unit 207, atransform unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transformunit 211, a reconstruction unit 212, a buffer 213, and an entropy encoding unit 214.
[0071] In other examples, video encoder 200 may include more, fewer, or different functionalcomponents. In an example, predication unit 202 may include an intra block copy(IBC) unit. TheIBC unit may perform predication in an IBC mode in which at least one reference picture is apicture where the current video block is located.
[0072] Furthermore, some components, such as motion estimation unit 204 and motioncompensation unit 205 may be highly integrated, but are represented in the example of FIG. 8separately for purposes of explanation.
[0073] Partition unit 201 may partition a picture into one or more video blocks. Video encoder 200and video decoder 300 may support various video block sizes.
[0074] Mode select unit 203 may select one of the coding modes, intra or inter, e.g., based on errorresults, and provide the resulting intra- or inter-coded block to a residual generation unit 207 togenerate residual block data and to a reconstruction unit 212 to reconstruct the encoded block foruse as a reference picture. In some example, Mode select unit 203 may select a combination ofintra and inter predication (CIIP) mode in which the predication is based on an inter predicationsignal and an intra predication signal. Mode select unit 203 may also select a resolution for amotion vector (e.g., a sub-pixel or integer pixel precision) for the block in the case of interpredication.
[0075] To perform inter prediction on a current video block, motion estimation unit 204 maygenerate motion information for the current video block by comparing one or more referenceframes from buffer 213 to the current video block. Motion compensation unit 205 may determinea predicted video block for the current video block based on the motion information and decodedsamples of pictures from buffer 213 other than the picture associated with the current video block.
[0076] Motion estimation unit 204 and motion compensation unit 205 may perform differentoperations for a current video block, for example, depending on whether the current video blockis in an I slice, a P slice, or a B slice.
[0077] In some examples, motion estimation unit 204 may perform uni-directional prediction forthe current video block, and motion estimation unit 204 may search reference pictures of list 0 orlist 1 for a reference video block for the current video block. Motion estimation unit 204 may thengenerate a reference index that indicates the reference picture in list 0 or list 1 that contains thereference video block and a motion vector that indicates a spatial displacement between the currentvideo block and the reference video block. Motion estimation unit 204 may output the referenceindex, a prediction direction indicator, and the motion vector as the motion information of thecurrent video block. Motion compensation unit 205 may generate the predicted video block of thecurrent block based on the reference video block indicated by the motion information of the currentvideo block.
[0078] In other examples, motion estimation unit 204 may perform bi-directional prediction forthe current video block, motion estimation unit 204 may search the reference pictures in list 0 fora reference video block for the current video block and may also search the reference pictures inlist 1 for another reference video block for the current video block. Motion estimation unit 204may then generate reference indexes that indicate the reference pictures in list 0 and list 1containing the reference video blocks and motion vectors that indicate spatial displacementsbetween the reference video blocks and the current video block. Motion estimation unit 204 mayoutput the reference indexes and the motion vectors of the current video block as the motioninformation of the current video block. Motion compensation unit 205 may generate the predictedvideo block of the current video block based on the reference video blocks indicated by the motioninformation of the current video block.
[0079] In some examples, motion estimation unit 204 may output a full set of motion informationfor decoding processing of a decoder.
[0080] In some examples, motion estimation unit 204 may do not output a full set of motioninformation for the current video. Rather, motion estimation unit 204 may signal the motioninformation of the current video block with reference to the motion information of another videoblock. For example, motion estimation unit 204 may determine that the motion information of thecurrent video block is sufficiently similar to the motion information of a neighboring video block.
[0081] In one example, motion estimation unit 204 may indicate, in a syntax structure associatedwith the current video block, a value that indicates to the video decoder 300 that the current videoblock has the same motion information as the another video block.
[0082] In another example, motion estimation unit 204 may identify, in a syntax structureassociated with the current video block, another video block and a motion vector difference (MVD).The motion vector difference indicates a difference between the motion vector of the current videoblock and the motion vector of the indicated video block. The video decoder 300 may use themotion vector of the indicated video block and the motion vector difference to determine themotion vector of the current video block.
[0083] As discussed above, video encoder 200 may predictively signal the motion vector. Twoexamples of predictive signaling techniques that may be implemented by video encoder 200include advanced motion vector predication (AMVP) and merge mode signaling.
[0084] Intra prediction unit 206 may perform intra prediction on the current video block. Whenintra prediction unit 206 performs intra prediction on the current video block, intra prediction unit206 may generate prediction data for the current video block based on decoded samples of othervideo blocks in the same picture. The prediction data for the current video block may include apredicted video block and various syntax elements.
[0085] Residual generation unit 207 may generate residual data for the current video block bysubtracting (e.g., indicated by the minus sign) the predicted video block(s) of the current videoblock from the current video block. The residual data of the current video block may includeresidual video blocks that correspond to different sample components of the samples in the currentvideo block.
[0086] In other examples, there may be no residual data for the current video block for the currentvideo block, for example in a skip mode, and residual generation unit 207 may not perform thesubtracting operation.
[0087] Transform processing unit 208 may generate one or more transform coefficient videoblocks for the current video block by applying one or more transforms to a residual video blockassociated with the current video block.
[0088] After transform processing unit 208 generates a transform coefficient video blockassociated with the current video block, quantization unit 209 may quantize the transformcoefficient video block associated with the current video block based on one or more quantizationparameter (QP) values associated with the current video block.
[0089] Inverse quantization unit 210 and inverse transform unit 211 may apply inversequantization and inverse transforms to the transform coefficient video block, respectively, toreconstruct a residual video block from the transform coefficient video block. Reconstruction unit212 may add the reconstructed residual video block to corresponding samples from one or morepredicted video blocks generated by the predication unit 202 to produce a reconstructed videoblock associated with the current block for storage in the buffer 213.
[0090] After reconstruction unit 212 reconstructs the video block, loop filtering operation may beperformed reduce video blocking artifacts in the video block.
[0091] Entropy encoding unit 214 may receive data from other functional components of thevideo encoder 200. When entropy encoding unit 214 receives the data, entropy encoding unit 214may perform one or more entropy encoding operations to generate entropy encoded data and outputa bitstream that includes the entropy encoded data.
[0092] FIG. 9 is a block diagram illustrating an example of video decoder 300 which may be videodecoder 114 in the system 100 illustrated in FIG. 7.
[0093] The video decoder 300 may be configured to perform any or all of the techniques of thisdisclosure. In the example of FIG. 8, the video decoder 300 includes a plurality of functionalcomponents. The techniques described in this disclosure may be shared among the variouscomponents of the video decoder 300. In some examples, a processor may be configured toperform any or all of the techniques described in this disclosure.
[0094] In the example of FIG. 9, video decoder 300 includes an entropy decoding unit 301, amotion compensation unit 302, an intra prediction unit 303, an inverse quantization unit 304,aninverse transformation unit 305 , and a reconstruction unit 306 and a buffer 307. Video decoder300 may, in some examples, perform a decoding pass generally reciprocal to the encoding passdescribed with respect to video encoder 200 (FIG. 8).
[0095] Entropy decoding unit 301 may retrieve an encoded bitstream. The encoded bitstream mayinclude entropy coded video data (e.g., encoded blocks of video data). Entropy decoding unit 301may decode the entropy coded video data, and from the entropy decoded video data, motioncompensation unit 302 may determine motion information including motion vectors, motionvector precision, reference picture list indexes, and other motion information. Motioncompensation unit 302 may, for example, determine such information by performing the AMVPand merge mode.
[0096] Motion compensation unit 302 may produce motion compensated blocks, possiblyperforming interpolation based on interpolation filters. Identifiers for interpolation filters to beused with sub-pixel precision may be included in the syntax elements.
[0097] Motion compensation unit 302 may use interpolation filters as used by video encoder 20during encoding of the video block to calculate interpolated values for sub-integer pixels of areference block. Motion compensation unit 302 may determine the interpolation filters used byvideo encoder 200 according to received syntax information and use the interpolation filters toproduce predictive blocks.
[0098] Motion compensation unit 302 may uses some of the syntax information to determine sizesof blocks used to encode frame(s) and / or slice(s) of the encoded video sequence, partitioninformation that describes how each macroblock of a picture of the encoded video sequence ispartitioned, modes indicating how each partition is encoded, one or more reference frames (andreference frame lists) for each inter-encoded block, and other information to decode the encodedvideo sequence.
[0099] Intra prediction unit 303 may use intra prediction modes for example received in thebitstream to form a prediction block from spatially adjacent blocks. Inverse quantization unit 303inverse quantizes, i.e., de-quantizes, the quantized video block coefficients provided in thebitstream and decoded by entropy decoding unit 301. Inverse transform unit 303 applies an inversetransform.
[00100] Reconstruction unit 306 may sum the residual blocks with the corresponding predictionblocks generated by motion compensation unit 202 or intra-prediction unit 303 to form decodedblocks. If desired, a deblocking filter may also be applied to filter the decoded blocks in order toremove blockiness artifacts. The decoded video blocks are then stored in buffer 307, whichprovides reference blocks for subsequent motion compensation / intra predication and also producesdecoded video for presentation on a display device.
[00101] FIGS. 10-12 show example methods that can implement the technical solution describedabove in, for example, the embodiments shows in FIGS. 5-9.
[00102] FIG. 10 shows a flowchart for an example method 1000 of video processing. The method1000 includes, at operation 1010, performing a conversion between a video and a bitstream of avideo, the bitstream conforming to a format rule that specifies that signaling a length of identifiersof subpictures in a sequence parameter set (SPS) is not based on a value of a syntax elementindicative of whether the identifiers are signaled in the SPS.
[00103] FIG. 11 shows a flowchart for an example method 1100 of video processing. The method1100 includes, at operation 1110, performing a conversion between a video and a bitstream of avideo, the bitstream conforming to a format rule that specifies that signaling a length of identifiersof subpictures in a picture parameter set (PPS) due to a syntax element indicating that theidentifiers are explicitly signaled in the PPS.
[00104] FIG. 12 shows a flowchart for an example method 1200 of video processing. The method1200 includes, at operation 1210, performing a conversion between a video and a bitstream of avideo, the bitstream conforming to a format rule that specifies that a first syntax element signaledin a sequence parameter set (SPS) of the bitstream is indicative of a length of identifiers ofsubpictures in the SPS, and the signaling of the first syntax element being independent of a valueof a second syntax element that is indicative of explicit signaling of the identifiers of thesubpictures in the SPS or a picture parameter set (PPS).
[00105] A listing of solutions preferred by some embodiments is provided next.
[00106] A1. A method of video processing, comprising performing a conversion between a videocomprising a picture and a bitstream of the video, wherein a number of subpictures in the pictureis signaled in a sequence parameter set (SPS) of the bitstream as a field whose bitwidth is basedon a value of the number of subpictures, and wherein the field is an unsigned integer 0-th orderexponential Golomb (Exp-Golomb) coded syntax element with a left bit first.
[00107] A2. The method of solution A1, wherein the value of the field is restricted to be in a rangefrom zero to a maximum value that is based on a maximum width of the picture in luma samplesand a maximum height of the picture in luma samples.
[00108] A3. The method of solution A2, wherein the maximum value is equal to an integer numberof coding tree blocks that fit within the picture.
[00109] A4. The method of solution A1, wherein the number of subpictures is restricted based ona coding level associated with the bitstream.
[00110] A5. A method of video processing, comprising performing a conversion between a videoand a bitstream of a video, wherein the bitstream conforms to a format rule, and wherein the formatrule specifies that a first syntax element, which indicates whether a picture of the video can bepartitioned, is conditionally included in a picture parameter set (PPS) of the bitstream based onvalues of a second syntax element, which indicates whether identifiers of subpictures are signaledin the PPS, and a third syntax element, which indicates, in the PPS, a number of the subpictures.
[00111] A6. The method of solution A5, wherein the first syntax element is no_pic_partition_flag,the second syntax element is subpic_ids_in_pps_flag, and the third syntax element ispps_num_subpics_minus1.
[00112] A7. The method of solution A5 or A6, wherein the first syntax element is excluded fromthe PPS and inferred to indicate that no picture partitioning is applied to each picture referring tothe PPS.
[00113] A8. The method of solution A5 or A6, wherein the first syntax element is not signaled inthe PPS and inferred to be equal to one.
[00114] A9. The method of solution A5 or A6, wherein the second syntax element is signaled afterone or more tile and / or slice syntax elements in the PPS.
[00115] A10. A method of video processing, comprising performing a conversion between a videoand a bitstream of a video, wherein the bitstream conforms to a format rule, and wherein the formatrule specifies that a first syntax element, which indicates whether a picture of the video can bepartitioned, is included in a picture parameter set (PPS) of the bitstream before a set of syntaxelements, in the PPS, indicative of identifiers of subpictures the picture.
[00116] A11. The method of solution A10, wherein a second syntax element, which indicates anumber of the subpictures, is conditionally included in the set of syntax elements based on valuesof the first syntax element.
[00117] A12. The method of any of solutions A1 to A11, wherein the conversion comprisesdecoding the video from the bitstream.
[00118] A13. The method of any of solutions A1 to A11, wherein the conversion comprisesencoding the video into the bitstream.
[00119] A14. A method of storing a bitstream representing a video to a computer-readablerecording medium, comprising generating a bitstream from a video according to a methoddescribed in any one or more of solutions A1 to A11; and writing the bitstream to the computerreadablerecording medium.
[00120] A15. A video processing apparatus comprising a processor configured to implement amethod recited in any one or more of solutions A1 to A14.
[00121] A16. A computer-readable medium having instructions stored thereon, the instructions,when executed, causing a processor to implement a method recited in any one or more of solutionsA1 to A14.
[00122] A17. A computer readable medium that stores the bitstream generated according to anyone or more of solutions A1 to A14.
[00123] A18. A video processing apparatus for storing a bitstream, wherein the video processingapparatus is configured to implement a method recited in any one or more of solutions A1 to A14.
[00124] Another listing of solutions preferred by some embodiments is provided next.
[00125] B1. A method of video processing, comprising performing a conversion between a videoregion of a video and a bitstream of the video, wherein the bitstream conforms to a format rule,wherein the format rule specifies that a first syntax element indicating whether information ofsubpicture identifiers is included in parameter sets of the bitstream is conditionally included in asequence parameter set (SPS) based on a value of a second syntax element indicating whetherinformation of subpictures is included in the SPS.
[00126] B2. The method of solution B1, wherein the format rule further specifies that the value ofthe second syntax element is zero, which indicates that the information of the subpictures is omittedfrom the SPS and consequently each of the video regions associated with the SPS is not split intomultiple subpictures, and based on the value being zero, the first syntax element is omitted fromthe SPS.
[00127] B3. The method of solution B1 or B2, wherein the first syntax element issubpic_ids_explicitly_signalled_flag, and the second syntax element is subpic_info_present_flag.
[00128] B4. The method of solutions B1 or B3, wherein the format rule further specifies that thefirst syntax element is included in the SPS with a zero value in case that the value of the first syntaxelement is zero.
[00129] B5. The method of any of solutions B1 to B4, wherein the video region is a video picture.
[00130] B6. A method of video processing, comprising performing a conversion between a pictureof a video and a bitstream of the video, wherein the bitstream conforms to a format rule, whereinthe format rule specifies a mapping between identifiers of one or more subpictures of the pictureand the one or more subpictures is not included in a picture header of the picture, and wherein theformat rule further specifies that the identifiers of the one or more subpictures are derived basedon syntax elements in a sequence parameter set (SPS) and a picture parameter set (PPS) referredto by the picture.
[00131] B7. The method of solution B6, wherein a flag in the SPS takes a first value to indicatethat the identifiers of the one or more subpictures are derived based on syntax elements in the PPSor a second value to indicate that the identifiers of the one or more subpictures are derived basedon the syntax elements in the SPS.
[00132] B8. The method of solution B7, wherein the flag corresponds to a subpic_ids_in_pps_flagfield, the first value is one and the second value is zero.
[00133] B9. The method of solution B6, wherein the identifiers (denoted SubpicIdList[i]) arederived as followsfor( i = 0; i <= sps_num_subpics_minus1; i++ )if( subpic_ids_explicitly_signalled_flag )SubpicIdList[i] = subpic_ids_in_pps_flag ? pps_subpic_id[i] sps_subpic_id[i]elseSubpicIdList[i] = i.
[00134] B10. A method of video processing, comprising performing a conversion between a videoand a bitstream of the video, wherein the bitstream conforms to a format rule, and wherein theformat rule specifies that, when a value of a first syntax element indicates that a mapping betweenthe identifiers of subpictures and one or more subpictures of a picture is explicitly signaled for theone or more subpictures, the mapping is signaled either in a sequence parameter set (SPS) or apicture parameter set (PPS).
[00135] B11. The method of solution B10, wherein the first syntax element issubpic_ids_explicitly_signalled_flag.
[00136] B12. The method of solution B11, wherein the identifiers are signaled in the SPS basedon a value of a second syntax element (denoted subpic_ids_in_sps_flag), and wherein theidentifiers are signaled in the PPS based on a value of a third syntax element (denotedsubpic_ids_in_pps_flag).
[00137] B13. The method of solution B12, wherein subpic_ids_in_pps_flag is equal to zero dueto subpic_ids_explicitly_signalled_flag being zero or subpic_ids_in_sps_flag being one.
[00138] B14. The method of solution B13, wherein subpic_ids_in_pps_flag being equal to zeroindicates that no identifiers are signaled in the PPS.
[00139] B15. The method of solution B12, wherein subpic_ids_in_pps_flag is equal to one due tosubpic_ids_explicitly_signalled_flag being one and subpic_ids_in_sps_flag being zero.
[00140] B16. The method of solution B15, wherein subpic_ids_in_pps_flag being equal to oneindicates that an identifier for each of the one or more subpictures is explicitly signaled in the PPS.
[00141] B17. The method of any of solutions B1 to B15, wherein the conversion comprisesdecoding the video from the bitstream.
[00142] B18. The method of any of solutions B1 to B15, wherein the conversion comprisesencoding the video into the bitstream.
[00143] B19. A method of storing a bitstream representing a video to a computer-readablerecording medium, comprising generating a bitstream from a video according to a methoddescribed in any one or more of solutions B1 to B15; and writing the bitstream to the computerreadablerecording medium.
[00144] B20. A video processing apparatus comprising a processor configured to implement amethod recited in any one or more of solutions B1 to B19.
[00145] B21. A computer-readable medium having instructions stored thereon, the instructions,when executed, causing a processor to implement a method recited in one or more of solutions B1to B19.
[00146] B22. A computer readable medium that stores the bitstream generated according to anyone or more of solutions B1 to B19.
[00147] B23. A video processing apparatus for storing a bitstream, wherein the video processingapparatus is configured to implement a method recited in any one or more of solutions B1 to B19.
[00148] Yet another listing of solutions preferred by some embodiments is provided next.
[00149] C1. A method of video processing, comprising performing a conversion between a videoand a bitstream of a video, wherein the bitstream conforms to a format rule, and wherein the formatrule specifies that signaling a length of identifiers of subpictures in a sequence parameter set (SPS)is not based on a value of a syntax element indicative of whether the identifiers are signaled in theSPS.
[00150] C2. A method of video processing, comprising performing a conversion between a videoand a bitstream of a video, wherein the bitstream conforms to a format rule, and wherein the formatrule specifies that signaling a length of identifiers of subpictures in a picture parameter set (PPS)due to a syntax element indicating that the identifiers are explicitly signaled in the PPS.
[00151] C3. The method of solution C1 or C2, wherein the length further corresponds to a lengthof a subpicture identifier in a slice header.
[00152] C4. The method of any of solutions C1 to C3, wherein the syntax element issubpic_ids_explicitly_signalled_flag.
[00153] C5. The method of solution C3 or C4, wherein the identifiers are not signaled in the SPSand the identifiers are not signaled in the PPS.
[00154] C6. The method of solution C5, wherein a length of the subpicture identifier correspondsto a subpicture identifier length signaled in the SPS.
[00155] C7. A method of video processing, comprising performing a conversion between a videoand a bitstream of a video, wherein the bitstream conforms to a format rule, wherein the formatrule specifies that a first syntax element signaled in a sequence parameter set (SPS) of the bitstreamis indicative of a length of identifiers of subpictures in the SPS, and wherein the signaling of thefirst syntax element is independent of a value of a second syntax element that is indicative ofexplicit signaling of the identifiers of the subpictures in the SPS or a picture parameter set (PPS).
[00156] C8. The method of solution C7, wherein the second syntax element issubpic_ids_explicitly_signalled_flag.
[00157] C9. The method of solution C7 or C8, wherein the second syntax element being equal toone indicates that a set of identifiers, one for each of the subpictures, is explicitly signaled for eachof the subpictures in the SPS or the PPS, and wherein the second syntax element being equal tozero indicates that no identifiers are explicitly signaled in the SPS or the PPS.
[00158] C10. The method of solution C7 or C8, wherein a value of the first syntax element valueis either zero or one due to the value of the second syntax element being zero.
[00159] C11. The method of solution C7 or C8, wherein a value of the first syntax element valueis one due to the value of the second syntax element being one.
[00160] C12. The method of solution C7 or C8, wherein the value of the second syntax element iszero.
[00161] C13. The method of any of solutions C1 to C12, wherein the conversion comprisesdecoding the video from the bitstream.
[00162] C14. The method of any of solutions C1 to C12, wherein the conversion comprisesencoding the video into the bitstream.
[00163] C15. A method of storing a bitstream representing a video to a computer-readablerecording medium, comprising generating the bitstream from the video according to a methoddescribed in any one or more of solutions C1 to C12; and writing the bitstream to the computerreadablerecording medium.
[00164] C16. A video processing apparatus comprising a processor configured to implement amethod recited in any one or more of solutions C1 to C15.
[00165] C17. A computer-readable medium having instructions stored thereon, the instructions,when executed, causing a processor to implement a method recited in any one or more of solutionsC1 to C15.
[00166] C18. A computer readable medium that stores the bitstream generated according to anyone or more of solutions C1 to C15.
[00167] C19. A video processing apparatus for storing a bitstream, wherein the video processingapparatus is configured to implement a method recited in any one or more of solutions C1 to C15.
[00168] Yet another listing of solutions preferred by some embodiments is provided next.
[00169] P1. A method of video processing, comprising performing a conversion between a pictureof a video and a coded representation of the video, wherein a number of subpictures in the pictureis included in the coded representation as a field whose bitwidth is dependent on a value of thenumber of subpictures.
[00170] P2. The method of solution P1, wherein the field represents the number of subpicturesusing a codeword.
[00171] P3. The method of solution P2, wherein the codeword comprises a Golomb codeword.
[00172] P4. The method of any of solutions P1 to P3, wherein the value of the number ofsubpictures is restricted to be less than or equal to an integer number of coding tree blocks that fitwithin the picture.
[00173] P5. The method of any of solutions P1 to P4, wherein the field is dependent on a codinglevel associated with the coded representation.
[00174] P6. A method of video processing, comprising performing a conversion between a videoregion of a video and a coded representation of the video, wherein the coded representationconforms to a format rule, wherein the format rule specifies to omit a syntax element indicative ofsubpicture identifiers doe to the video region not comprising any subpictures.
[00175] P7. The method of solution P6, wherein the coded representation includes a field havinga 0 value indicating that the video region is not comprising any subpictures.
[00176] P8. A method of video processing, comprising performing a conversion between a videoregion of a video and a coded representation of the video, wherein the coded representationconforms to a format rule, wherein the format rule specifies to omit identifiers of subpictures inthe video region at a video region header level in the coded representation.
[00177] P9. The method of solution P8, wherein the coded representation identifies subpicturesnumerically according to an order in which the subpictures are listed in the video region header.
[00178] P10. A method of video processing, comprising performing a conversion between a videoregion of a video and a coded representation of the video, wherein the coded representationconforms to a format rule, wherein the format rule specifies to include identifiers of subpicturesand / or a length of the identifiers of subpictures in the video region at a sequence parameter setlevel or a picture parameter set level.
[00179] P11. The method of solution P10, wherein the length is included in the picture parameterset level.
[00180] P12. A method of video processing, comprising performing a conversion between a videoregion of a video and a coded representation of the video, wherein the coded representationconforms to a format rule, wherein the format rule specifies to include a field in the codedrepresentation at a video sequence level to indicate whether a subpicture identifier length field isincluded in the coded representation at the video sequence level.
[00181] P13. The method of solution P12, wherein the format rule specifies to set the field to "1"in case that another field in the coded representation indicates that a length identifier for the videoregion is included in the coded representation.
[00182] P14. The method of any of above solutions, wherein the video region comprises asubpicture of the video.
[00183] P15. The method of any of above solutions, wherein the conversion comprises parsingand decoding the coded representation to generate the video.
[00184] P16. The method of any of above solutions, wherein the conversion comprises encodingthe video to generate the coded representation.
[00185] P17. A video decoding apparatus comprising a processor configured to implement amethod recited in one or more of solutions P1 to P16.
[00186] P18. A video encoding apparatus comprising a processor configured to implement amethod recited in one or more of solutions P1 to P16.
[00187] P19. A computer program product having computer code stored thereon, the code, whenexecuted by a processor, causes the processor to implement a method recited in any of solutionsP1 to P16.
[00188] The disclosed and other solutions, examples, embodiments, modules and the functionaloperations described in this document can be implemented in digital electronic circuitry, or incomputer software, firmware, or hardware, including the structures disclosed in this document andtheir structural equivalents, or in combinations of one or more of them. The disclosed and otherembodiments can be implemented as one or more computer program products, i.e., one or moremodules of computer program instructions encoded on a computer readable medium for executionby, or to control the operation of, data processing apparatus. The computer readable medium canbe a machine-readable storage device, a machine-readable storage substrate, a memory device, acomposition of matter effecting a machine-readable propagated signal, or a combination of one ormore them. The term "data processing apparatus" encompasses all apparatus, devices, andmachines for processing data, including by way of example a programmable processor, a computer,or multiple processors or computers. The apparatus can include, in addition to hardware, code thatcreates an execution environment for the computer program in question, e.g., code that constitutesprocessor firmware, a protocol stack, a database management system, an operating system, or acombination of one or more of them. A propagated signal is an artificially generated signal, e.g.,a machine-generated electrical, optical, or electromagnetic signal, that is generated to encodeinformation for transmission to suitable receiver apparatus.
[00189] A computer program (also known as a program, software, software application, script, orcode) can be written in any form of programming language, including compiled or interpretedlanguages, and it 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 computerprogram does not necessarily correspond to a file in a file system. A program can be stored in aportion of a file that holds other programs or data (e.g., one or more scripts stored in a markuplanguage document), in a single file dedicated to the program in question, or in multiplecoordinated files (e.g., files that store one or more modules, sub programs, or portions of code). Acomputer program can be deployed to be executed on one computer or on multiple computers thatare located at one site or distributed across multiple sites and interconnected by a communicationnetwork.
[00190] The processes and logic flows described in this document can be performed by one ormore programmable processors executing one or more computer programs to perform functionsby operating on input data and generating output. The processes and logic flows can also beperformed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., anFPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
[00191] Processors suitable for the execution of a computer program include, by way of example,both general and special purpose microprocessors, and any one or more processors of any kind ofdigital computer. Generally, a processor will receive instructions and data from a read onlymemory or a random-access memory or both. The essential elements of a computer are a processorfor performing instructions and one or more memory devices for storing instructions and data.Generally, a computer will also include, or be operatively coupled to receive data from or transferdata to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto opticaldisks, or optical disks. However, a computer need not have such devices. Computer readablemedia suitable for storing computer program instructions and data include all forms of non-volatilememory, media and memory devices, including by way of example semiconductor memorydevices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal harddisks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. Theprocessor and the memory can be supplemented by, or incorporated in, special purpose logiccircuitry.
[00192] While this patent document contains many specifics, these should not be construed aslimitations on the scope of any subject matter or of what may be claimed, but rather as descriptionsof features that may be specific to particular embodiments of particular techniques. Certainfeatures that are described in this patent document in the context of separate embodiments can alsobe implemented in combination in a single embodiment. Conversely, various features that aredescribed in the context of a single embodiment can also be implemented in multiple embodimentsseparately or in any suitable subcombination. Moreover, although features may be describedabove as acting in certain combinations and even initially claimed as such, one or more featuresfrom a claimed combination can in some cases be excised from the combination, and the claimedcombination may be directed to a subcombination or variation of a subcombination.
[00193] Similarly, while operations are depicted in the drawings in a particular order, this shouldnot be understood as requiring that such operations be performed in the particular order shown orin sequential order, or that all illustrated operations be performed, to achieve desirable results.Moreover, the separation of various system components in the embodiments described in thispatent document should not be understood as requiring such separation in all embodiments.
[00194] Only a few implementations and examples are described and other implementations,enhancements and variations can be made based on what is described and illustrated in this patentdocument.
Claims
1. A method of video processing, comprising: performing a conversion between a video and a bitstream of the video, wherein the bitstream conforms to a format rule, and wherein the format rule specifies that signaling a length of identifiers of subpictures in a sequence parameter set (SPS) of the bitstream is based on a value of a first syntax element in the SPS indicative of subpicture information is present, and independent of a value of a second syntax element in the SPS indicative of whether the identifiers are explicitly signaled.
2. The method of claim 1, wherein the length corresponds to a number of bits used to represent a third syntax element indicating a subpicture identifier in the SPS, a fourth syntax element indicating a subpicture identifier in a picture parameter set (PPS) if present, and a fifth syntax element indicating a subpicture identifier in a slice header if present.
3. The method of claim 1, wherein the second syntax element is subpic_ids_explicitly_signalled_flag.
4. The method of claim 3, wherein the identifiers are not signaled in the SPS and the identifiers are not signaled in a picture parameter set (PPS).
5. The method of claim 4, wherein a length of the subpicture identifier corresponds to a subpicture identifier length signaled in the SPS.
6. The method of claim 1, wherein the length is signaled by a sixth syntax element sps_subpic_id_len_minus1, a value of which plus 1 is equal to the length.
7. The method of claim 6, wherein a value of sps_subpic_id_len_minus1 is in a range of 0 to 15.
8. The method of claim 1, wherein the second syntax element equal to one specifies that a set of identifiers, one for each subpicture, is explicitly signalled for each subpicture either in the SPS or a picture parameter set (PPS) and the second syntax element equal to zero specifies that no identifiers are explicitly signalled in the SPS or the PPS.
9. The method of claim 1, wherein the conversion comprises decoding the video from the bitstream.
10. The method of claim 1, wherein the conversion comprises encoding the video into the bitstream.
11. A method of video processing, comprising: performing a conversion between a video and a bitstream of a video, wherein the bitstream conforms to a format rule, wherein the format rule specifies that a first syntax element signaled in a sequence parameter set (SPS) of the bitstream is indicative of a length of identifiers of subpictures in the SPS, and wherein the signaling of the first syntax element is independent of a value of a second syntax element that is indicative of explicit signaling of the identifiers of the subpictures in the SPS or a picture parameter set (PPS).
12. The method of claim 11, wherein the second syntax element is subpic_ids_explicitly_signalled_flag.
13. The method of claim 11, wherein the second syntax element being equal to one indicates that a set of identifiers, one for each of the subpictures, is explicitly signaled for each of the subpictures in the SPS or the PPS, and wherein the second syntax element being equal to zero indicates that no identifiers are explicitly signaled in the SPS or the PPS.
14. The method of claim 11, wherein a value of the first syntax element value is either zero or one due to the value of the second syntax element being zero.
15. The method of claim 11, wherein a value of the first syntax element value is one due to the value of the second syntax element being one.
16. The method of claim 11, wherein the value of the second syntax element is zero.
17. The method of claim 11, wherein the conversion comprises decoding the video from the bitstream.
18. The method of claim 11, wherein the conversion comprises encoding the video into the bitstream.
19. A method for storing a bitstream of a video, comprising: generating the bitstream of the video; and storing the bitstream in a non-transitory the computer-readable recording medium, wherein the bitstream conforms to a format rule, and wherein the format rule specifies that signaling a length of identifiers of subpictures in a sequence parameter set (SPS) of the bitstream is based on a value of a first syntax element in the SPS indicative of subpicture information is present, and independent of a value of a second syntax element in the SPS indicative of whether the identifiers are explicitly signaled.
20. A video processing apparatus comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: perform a conversion between a video and a bitstream of the video, wherein the bitstream conforms to a format rule, and wherein the format rule specifies that signaling a length of identifiers of subpictures in a sequence parameter set (SPS) of the bitstream is based on a value of a first syntax element in the SPS indicative of subpicture information is present, and independent of a value of a second syntax element in the SPS indicative of whether the identifiers are explicitly signaled.
21. A computer-readable medium having instructions stored thereon, the instructions, when executed, causing a processor to implement a method recited in claim 1.
22. A computer readable medium that stores the bitstream generated according to claim 1.
23. A video processing apparatus for storing a bitstream, wherein the video processing apparatus is configured to implement a method recited in claim 1.
