Various advanced syntax improvements in dynamic mesh encoding and decoding
By designing a dynamic mesh codec and improving advanced syntax, and utilizing the Draco and HEVC models to compress the underlying mesh and displacement vectors, the problem of low transmission efficiency in dynamic mesh encoding and decoding is solved, achieving efficient data transmission and encoding/decoding.
Patent Information
- Application Number
- CN202580029014.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-07-05
- Filing Date
- 2025-04-16
- Publication Date
- 2026-11-17
AI Technical Summary
Existing dynamic mesh coding and decoding technologies are difficult to effectively compress using existing 2D video coding and decoding standards, resulting in large data volumes and low transmission efficiency.
A dynamic mesh codec design is adopted, which utilizes Draco to compress the base mesh and uses the HEVC test model to compress the displacement vector and property graph. Advanced syntax design is combined to improve encoding and decoding efficiency.
By optimizing the encoding and decoding process, the extra effort required to implement a dynamic mesh encoding and decoding system is reduced, thereby improving data transmission throughput and encoding/decoding efficiency.
Smart Images

Figure CN123125883A_ABST
Abstract
Description
[0001] Cross-reference to related applications
[0002] This application claims priority and benefit to U.S. Provisional Patent Application No. 63 / 636,457, filed April 19, 2024, and U.S. Provisional Patent Application No. 63 / 668,083, filed July 5, 2024. All of these applications are incorporated herein by reference in their entirety. Technical Field
[0003] This disclosure relates to the generation, storage, and use of digital audio and video media information in file formats. Background Technology
[0004] Digital video accounts for the largest share of bandwidth used on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, the bandwidth demand for digital video is likely to continue to grow. Summary of the Invention
[0005] The first aspect relates to a method for processing video data, comprising: determining a hypothetical reference decoder (HRD) for combining different sub-bitstreams; and performing a conversion between visual media data and bitstreams based on the HRD.
[0006] The second aspect relates to an apparatus for processing video data, comprising: a processor; and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform any of the aspects described above.
[0007] The third aspect relates to a non-transitory computer-readable medium comprising a computer program product for use by a video codec device, the computer program product including computer-executable instructions stored on the non-transitory computer-readable medium such that, when executed by a processor, the video codec device performs the methods of any of the preceding aspects.
[0008] The fourth aspect relates to a non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method includes: determining a hypothetical reference decoder (HRD) for combining different sub-bitstreams; and generating a bitstream based on the determination.
[0009] The fifth aspect relates to a method for storing a bitstream of video, comprising: determining a hypothetical reference decoder (HRD) for combining different sub-bitstreams; generating a bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.
[0010] The sixth aspect relates to the methods, apparatus, or systems described in this disclosure.
[0011] For clarity, any of the embodiments described above may be combined with one or more other embodiments described above to create new embodiments within the scope of this disclosure.
[0012] These and other features will become clearer through the following detailed description of the embodiments with reference to the accompanying drawings and claims. Attached Figure Description
[0013] For a more complete understanding of this disclosure, reference will now be made to the accompanying drawings and detailed descriptions, wherein like reference numerals denote like parts.
[0014] Figure 1 This is a block diagram illustrating the decoder design for dynamic mesh encoding and decoding.
[0015] Figure 2 This is a block diagram illustrating the structure of the dynamic mesh encoding / decoding test model.
[0016] Figure 3 This is a block diagram illustrating an example video processing system.
[0017] Figure 4 This is a block diagram of an example video processing device.
[0018] Figure 5 This is a flowchart of an example method for video processing.
[0019] Figure 6 This is a block diagram illustrating an example video codec system.
[0020] Figure 7 This is a block diagram showing an example encoder.
[0021] Figure 8 This is a block diagram showing an example decoder.
[0022] Figure 9 This is a schematic diagram of an example encoder. Detailed Implementation
[0023] First, it should be understood that although illustrative implementations of one or more embodiments are provided below, the disclosed systems and / or methods can be implemented using any number of techniques, whether currently known or yet to be developed. This disclosure should not be limited in any way to the illustrative embodiments, drawings, and techniques described below, including the exemplary designs and implementations shown and described herein, but can be modified within the scope of the appended claims and the full scope of their equivalents.
[0024] 1. Preliminary Discussion
[0025] This disclosure relates to improvements to dynamic mesh coding and decoding of immersive video based on the Moving Picture Experts Group (MPEG-I) standard. Specifically, it relates to advanced syntax design. It is also applicable to other immersive video coding and decoding standards or codecs.
[0026] 2. Further discussion
[0027] In computer graphics, three-dimensional (3D) / immersive content can typically be represented by 3D meshes and texture maps. These mesh and texture data can be generated by a machine or converted from images captured by multiple cameras from different angles. Similar to two-dimensional (2D) video, the mesh and texture data change as these 3D contents change over time and include dynamic mesh sequences. Dynamic meshes are typically large in data and difficult to store and transmit. To meet the requirements of applications using dynamic meshes, the Moving Picture Experts Group (MPEG) issued a call for proposals [1]. One of the key requirements for effectively using existing 2D codecs is to compress most of the data using current 2D video codec standards while keeping other parts simple and low in complexity. Such requirements ensure that the representation can take advantage of 2D video hardware / software systems without spending much effort redesigning specific systems for dynamic meshes.
[0028] MPEG received five responses to the call for proposals. Based on these proposals, a test model was developed to develop the planned dynamic mesh coding standard.
[0029] The latest test model of Dynamic Mesh Codec (V-DMC) prior to the drafting of this document can be found at the following link: http: / / mpegx.int-evry.fr / software / MPEG / dmc / mpeg-vmesh-tm / - / tags / v7.0; and the latest working draft document is WD 6.0 [2].
[0030] 2.1 Data Representation in Dynamic Mesh Encoding and Decoding
[0031] Figure 1 This is a block diagram illustrating the decoder design for dynamic mesh encoding and decoding. Figure 1The decoder design described in WD 6.0 [2] is shown. As can be seen, the dynamic mesh decoder receives four bitstreams and performs decoding to reconstruct the dynamic mesh plus texture signal. The first bitstream represents the base mesh, which is a decimated version of the original mesh. The second bitstream represents the displacement vector between the reconstructed base mesh and the original mesh. The displacement vectors are arranged as 2D video and compressed using a codec that conforms to the 2D video codec standard, or the displacements can also be encoded and decoded using an arithmetic codec. The third bitstream represents the texture (or attribute map). The attribute map is also arranged as 2D video and compressed using a codec that conforms to the 2D video codec standard. The design philosophy is to make the base mesh portion small enough so that the module that processes the base mesh can be easily implemented. On the other hand, the displacement vectors and attribute maps account for most of the volume of the entire dynamic mesh data and can be processed using current dedicated high-efficiency 2D video codec systems. Such a design can reduce the extra effort required to implement a dynamic mesh codec system and ensure high throughput and encoding / decoding efficiency for dynamic mesh data.
[0032] 2.2 Test Model for Dynamic Mesh Encoding and Decoding
[0033] Figure 2 This is a block diagram illustrating the structure of the dynamic mesh encoding / decoding test model. Figure 2 The structure of an example dynamic mesh codec model is shown. In this model, Draco is used to compress the base mesh, and the HEVC test model (e.g., HM) is used to compress the displacement vectors and property maps. However, it should be noted that other mesh or video codec systems can also be used for dynamic mesh codecs.
[0034] The base mesh m is generated from the original mesh using a downsampling scheme. Then, its quantized version is applied using Draco. Encode and decode. Reconstruct the underlying mesh. By means of Obtained through inverse quantization. Displacement vector. It is achieved by using a subdivision scheme to make the original mesh and It is generated by the differences between the subdivided versions.
[0035] 2.3 Basic Grid Sub-Bit Stream
[0036] The following abbreviations may be used in this article: Basic Mesh Coding Layer (BMCL), Basic Mesh Frame Parameter Set (BMFPS), Basic Mesh Sequence Parameter Set (BMSPS), Coded Basic Mesh Buffer (CBMB), Coded Basic Mesh Sequence (CBMS), and Coded Basic Mesh Buffer (DBMB).
[0037] Syntax and Semantics
[0038] Tabular syntax
[0039] General Network Abstraction Layer (NAL) Unit Syntax
[0040]
[0041] NAL Unit Header Syntax
[0042]
[0043] Raw byte sequence payload, trailing bit, and byte alignment syntax
[0044] Basic Grid Sequence Parameter Set (SPS) Raw Byte Sequence Payload (RBSP) Syntax
[0045] General Basic Mesh Sequence Parameter Set (RBSP) Syntax
[0046]
[0047]
[0048] Basic Mesh SPS Extended Syntax
[0049]
[0050] Basic grid gradations, layers, and levels syntax
[0051]
[0052] Level toolset constraint information syntax
[0053]
[0054] Basic Frame Parameter Set (RBSP) Syntax
[0055] General Basic Frame Parameter Set (RBSP) Syntax
[0056]
[0057] Basic grid and subgrid information
[0058]
[0059] Basic Mesh Submesh Layer RBSP Syntax
[0060]
[0061] Basic Mesh Submesh Header Syntax
[0062]
[0063] Reference list structure syntax
[0064]
[0065] Basic Mesh Submesh Cell Syntax
[0066]
[0067] Basic Mesh Frame Intra-Mesh Cell Syntax
[0068]
[0069] The `bmidu_intra_submesh_data_unit( submeshID, unitSize )` method contains a portion of mesh data of size `unitSize`, as an ordered stream of bytes or bits, where the location of cell boundaries can be identified from patterns in the data. The format of this underlying mesh data is identified by `bmptl_profile_codec_group_idc` or by SEI message mappings from the component codec.
[0070] Basic Mesh Frame Submesh Cell Syntax
[0071]
[0072] `bm_inter_submesh_data_unit( submeshID, vertexCount )` contains a portion of motion data of size `unitSize`, as an ordered stream of bytes or bits, where the positions of cell boundaries can be identified from patterns in the data. The format of this underlying mesh data is identified by `bmptl_profile_codec_group_idc` or by SEI messages mapped by the component codec.
[0073] Basic Mesh Frame-to-Frame Submesh Data Cell Syntax
[0074]
[0075]
[0076] Basic grid skip subgrid data cell syntax
[0077]
[0078] Semantics
[0079] Overview
[0080] This section defines the semantics associated with syntactic structures and syntactic elements within those structures. When a table or set of tables is used to define the semantics of syntactic elements, any value not defined in the table(s) should not be present in the bitstream unless otherwise specified in this disclosure.
[0081] NAL unit semantics
[0082] General NAL unit semantics
[0083] BmNumBytesInNalUnit specifies the size of the NAL unit in bytes. This value is necessary for decoding the NAL unit. In order to estimate BmNumBytesInNalUnit, some form of NAL unit boundary division is required. Appendix D of V-DMC specifies one such division method for sample stream formats. Other division methods may be specified outside of this disclosure.
[0084] Note 1 – The Basic Mesh Coding Layer (BMCL) is defined to efficiently represent the content of the basic mesh data. The NAL is defined to format the data and provide header information in a manner suitable for transmission over various communication channels or storage media. All data is contained in NAL units, each containing an integer number of bytes. The NAL unit specifies a general format that can be used for both packet-oriented and bitstream systems. The format of the NAL units for packet-oriented transmission and sample streams is the same, except that in the sample stream format specified in Appendix D of V-DMC, each NAL unit may be preceded by an additional element specifying the NAL unit size.
[0085] rbsp_byte[i] is the i-th byte of the RBSP. The RBSP is defined as an ordered sequence of bytes, as shown below:
[0086] RBSP contains a data bit string (SODB), as shown below:
[0087] 1. If SODB is empty (i.e., its length is zero bits), then RBSP is also empty.
[0088] 2. Otherwise, the RBSP contains SODB, as shown below:
[0089] – The first byte of the RBSP contains the first (most significant, leftmost) 8 bits of the SODB; the next byte of the RBSP contains the next 8 bits of the SODB, and so on, until less than 8 bits of the SODB remain.
[0090] – The rbsp_trailing_bits() syntax structure exists after SODB, as shown below:
[0091] – The first (most significant, leftmost) bits of the last RBSP byte contain the remaining bits of SODB (if any).
[0092] – The next bit consists of a single bit equal to 1 (i.e., rbsp_stop_one_bit).
[0093] – When rbsp_stop_one_bit is not the last bit of the byte alignment byte, there are one or more bits equal to 0 (i.e., instances of rbsp_alignment_zero_bit) to achieve byte alignment.
[0094] The suffix "_rbsp" is used in the syntax table to indicate syntax structures with these RBSP attributes. These structures are carried within NAL units as the contents of rbsp_byte[i]. The association between RBSP syntax structures and NAL units is specified in Table H-1.
[0095] Note 2 – When the boundaries of the RBSP are known, the decoder can extract the SODB from the RBSP by concatenating the bits of the RBSP bytes, discarding the last (least significant, rightmost) bit (rbsp_stop_one_bit) that is equal to 1, and discarding any subsequent (lower significant, rightmost) bits that are equal to 0 after it. The data required for the decoding process is contained in the SODB portion of the RBSP.
[0096] NAL Unit Header Semantics
[0097] The nal_forbidden_zero_bit must be equal to 0.
[0098] The nal_unit_type specifies the type of RBSP data structure contained in the NAL unit, as specified in Table H.1.
[0099] NAL units with a nal_unit_type (for which no semantics are specified) within the range NAL_UNSPEC_45..NAL_UNSPEC_63 (inclusive) should not affect the decoding process specified in this document.
[0100] Note 1 – NAL unit types in the range NAL_UNSPEC_45..NAL_UNSPEC_63 can be used as determined by the application. This document does not specify the decoding process for these values of nal_unit_type. Because different applications can use these NAL unit types for different purposes, special care is required in the design of encoders that generate NAL units with these nal_unit_type values, and in the design of decoders that interpret the contents of NAL units with these nal_unit_type values. This document does not define any management for these values. These nal_unit_type values are only applicable in contexts where “conflicts” (i.e., different definitions of the meaning of NAL unit contents with the same nal_unit_type value) are not important, impossible, or manageable, such as those defined or managed in control applications or transport specifications, or by controlling the environment in which bitstreams are distributed.
[0101] For purposes other than determining the amount of data in the decoding units of the bitstream (as specified in D of V-DMC), the decoder must ignore (i.e., remove and discard from the bitstream) the contents of all NAL units that use the reserved value of nal_unit_type.
[0102] Note 2 – This requirement allows for the future definition of compatible extensions to this document.
[0103] Similar to atlases, a similar NAL cell type is defined for the base grid, enabling similar functionality for random access and partitioning of the base grid. Unlike atlases that are divided into patches, this document defines the concept of subgrids and specific NAL cells corresponding to the encoded / decoded base subgrid data. Additionally, NAL cells that can include metadata such as SEI messages are also defined.
[0104] Specifically, the supported basic mesh NAL element types are specified in Table H-1:
[0105] Table H.1
[0106]
[0107]
[0108] Note 3 – A clean random access (CRA) grid frame can have an associated random access skipped preamble (RASL) or a random access decodable preamble (RADL) grid frame present in the bitstream.
[0109] Note 4 – A disconnected link access (BLA) grid frame with a nal_unit_type equal to NAL_BLA_W_LP can have an associated RASL or RADL grid frame present in the bitstream. A BLA grid frame with a nal_unit_type equal to NAL_BLA_W_RADL does not have an associated RASL grid frame present in the bitstream, but may have an associated RADL grid frame present in the bitstream. A BLA grid frame with a nal_unit_type equal to NAL_BLA_N_LP does not have an associated preceding grid frame present in the bitstream.
[0110] Note 5 – Instant Decode Refresh (IDR) grid frames with a nal_unit_type equal to NAL_IDR_N_LP do not have an associated preceding grid frame present in the bitstream. IDR grid frames with a nal_unit_type equal to NAL_IDR_W_RADL do not have an associated RASL grid frame present in the bitstream, but may have an associated RADL grid frame present in the bitstream.
[0111] All encoded / decoded subgrid NAL units of an access unit must have the same value of nal_unit_type. A grid frame or access unit is also referred to as having nal_unit_type equal to the nal_unit_type of its encoded / decoded subgrid NAL units.
[0112] If a grid frame has a nal_unit_type equal to NAL_TRAIL_N, NAL_TSA_N, NAL_STSA_N, NAL_RADL_N, or NAL_RASL_N, then the grid frame is an SLNR grid frame. Otherwise, the grid frame is a sublayer reference grid frame.
[0113] Each grid frame, except for the first grid frame in the bitstream in the decoding order, is considered to be associated with a previous intra-random access point (IRAP) grid frame in the decoding order.
[0114] When a grid frame is a leading grid frame, it must be a RADL or RASL grid frame.
[0115] When a grid frame is a follower grid frame, it should not be a RADL or RASL grid frame.
[0116] When a grid frame is a preceding grid frame, it must precede all subsequent grid frames associated with the same IRAP-encoded grid frame in the decoding order.
[0117] There should be no RASL grid frames in the bitstream that are associated with BLA grid frames that have a nal_unit_type equal to NAL_BLA_W_RADL or NAL_BLA_N_LP.
[0118] There should be no RASL grid frames associated with IDR grid frames in the bitstream.
[0119] There should be no RADL grid frames in the bitstream that are associated with BLA grid frames with a nal_unit_type equal to NAL_BLA_N_LP or IDR grid frames with a nal_unit_type equal to NAL_IDR_N_LP.
[0120] Note 6 – Random access can be performed at the location of an IRAP-encoded grid access cell by discarding all access cells preceding the IRAP-encoded grid access cell (and correctly decoding the IRAP-encoded grid frame and all subsequent non-RASL grid frames in the decoding order), provided that each parameter set is available when activation is required (either in the bitstream or through external means not specified in this document).
[0121] Any RASL grid frame associated with a CRA or BLA grid frame must precede any RADL grid frame associated with a CRA or BLA grid frame in the output order.
[0122] Any RASL grid frame associated with a CRA grid frame must be after any IRAP encoded / decoded grid frame that precedes the CRA grid frame in the output order and in the decoding order.
[0123] The nal_unit_type associated with a specific grid frame j, equal to NAL_V3C_AUD, means that all output V3C-based codec (V3C) component frames (if present in their corresponding sub-bitstreams and have the same output temporal order as grid frame j) must have the same decoding order, taking into account any missing frames in each sub-bitstream as the decoding order of the grid frames.
[0124] Note 7 – Applications can specify the use of nal_unit_type equal to NAL_V3C_AUD to separate all grid frames in the V3C sequence. In this case, all V3C sub-bitstreams (including sub-bitstreams corresponding to different maps) will be aligned in decoding order and output time.
[0125] Note 8 – If a frame is missing in a sub-bitstream and NAL_V3C_AUD is encountered, it can be assumed that the missing frame actually exists in its sub-bitstream and has the same decoding order as all other corresponding frames in the other sub-bitstreams. The frame can then be generated using the method described in Appendix B.
[0126] `nal_layer_id` specifies the identifier of the layer to which a BMCL NAL unit belongs, or the identifier of the layer to which a non-BMCL NAL unit applies. The value of `nal_layer_id` must be in the range of 0 to 62 (inclusive). A value of 63 may be specified in the future by ISO / IEC. Except for the purpose of determining the amount of data in the decoding unit of the bitstream, the decoder must ignore all data following the value 63 of `nal_layer_id` in the NAL unit, and decoders conforming to the specifications in Appendix A must ignore (i.e., remove and discard from the bitstream) all NAL units with a value of `nal_layer_id` not equal to 0.
[0127] Note 9 – The value 63 of nal_layer_id can be used to indicate the layer identifier for future extensions of this document.
[0128] The nal_layer_id value must be the same for all BMCL NAL cells in the encoded / decoded mesh frame. The nal_layer_id value of the encoded / decoded mesh frame is the nal_layer_id value of the ACL NAL cell in the encoded / decoded mesh frame.
[0129] When nal_unit_type equals NAL_EOB, the value of nal_layer_id must be equal to 0.
[0130] The value of nal_temporal_id_plus1 minus 1 specifies the time-domain identifier of the NAL cell. The value of nal_temporal_id_plus1 should not be equal to 0.
[0131] The variable BmTemporalID is defined as follows:
[0132] BmTemporalID = nal_temporal_id_plus1 – 1 (48)
[0133] When nal_unit_type is in the range of NAL_BLA_W_LP to NAL_RSV_IRAP_BMCL29 (inclusive), that is, the encoded subgrid belongs to the IRAP encoded grid frame, BmTemporalID must be equal to 0.
[0134] When nal_unit_type is equal to NAL_TSA_R or NAL_TSA_N, BmTemporalID should not be equal to 0.
[0135] BmTemporalID should not be equal to 0 when nal_layer_id is equal to 0 and nal_unit_type is equal to NAL_STSA_R or NAL_STSA_N.
[0136] The BmTemporalID value of all BMCL NAL cells in the access cell must be the same. The BmTemporalID value of the encoded / decoded mesh frame or access cell is the BmTemporalID value of the BMCL NAL cells in the encoded / decoded mesh frame or access cell. The BmTemporalID value of the sublayer representation is the maximum value of the BmTemporalID of all BMCL NAL cells in the sublayer representation.
[0137] The value of BmTemporalID for non-BMCL NAL elements is constrained as follows:
[0138] 1. If nal_unit_type equals NAL_BMSPS, then BmTemporalID must be equal to 0, and the BmTemporalID of the access unit containing the NAL unit must be equal to 0.
[0139] 2. Otherwise, if nal_unit_type equals NAL_EOS or NAL_EOB, then BmTemporalID must be equal to 0.
[0140] 3. Otherwise, if nal_unit_type is equal to NAL_AUD, NAL_V3C_AUD or NAL_FD, then BmTemporalID must be equal to the BmTemporalID of the access unit containing the NAL unit.
[0141] 4. Otherwise, BmTemporalID must be greater than or equal to the BmTemporalID of the access cell containing the NAL cell.
[0142] Note 10 – When the NAL unit is a non-BMCL NAL unit, the value of BmTemporalID is equal to the minimum of the BmTemporalID values of all access units to which the non-BMCL NAL unit applies. When nal_unit_type equals NAL_BMFPS, BmTemporalID can be greater than or equal to the BmTemporalID of the access unit, because all base grid frame parameter sets (BMFPS) can be included at the beginning of the bitstream, where the first encoded / decoded base grid frame has a BmTemporalID equal to 0. When nal_unit_type is equal to NAL_PREFIX_NSEI, NAL_PREFIX_ESEI, NAL_SUFFIX_NSEI, or NAL_SUFFIX_ESEI, BmTemporalID can be greater than or equal to the BmTemporalID of the access unit, because the SEI NAL unit can contain information, for example, in the buffer period SEI message or the underlying grid frame timing SEI message, which applies to a subset of the bitstream that includes the access unit, where the BmTemporalID value for that access unit is greater than the BmTemporalID of the access unit that includes the SEI NAL unit.
[0143] The order of NAL cells and base grid frames, and their association with the encoded / decoded base grid frames, access cells, and encoded / decoded base grid sequences.
[0144] Overview
[0145] This section specifies the constraints on the order of NAL cells and basic grid frames in the basic grid sub-bitstream.
[0146] Any NAL cell order that conforms to these constraints in the basic lattice sub-bitstream is referred to herein as the NAL cell decoding order. Within a NAL cell, the syntax in Section 8.3 specifies the decoding order of syntax elements. The decoder must be able to receive NAL cells and their syntax elements in the decoding order.
[0147] The order and activation of BMSPS and BMFPS RBSP
[0148] This section specifies the activation procedures for the Basic Grid Sequence Parameter Set (BMSPS) and the Basic Grid Frame Parameter Set (BMFPS).
[0149] Note – The BMSPS and BMFPS mechanisms separate the transmission of information that does not change frequently from the transmission of encoded and decoded mesh data. In some applications, BMSPS and BMFPS can be transmitted “out-of-band”.
[0150] A BMFPS RBSP includes parameters that can be referenced by the NAL cells of one or more encoded base grid frames. At the start of the decoding process, each BMFPS RBSP is initially considered inactive for any base grid. At any given moment during the decoding process, at most one BMFPS RBSP is considered active for each base grid, and activation of any particular BMFPS RBSP for a particular base grid results in the deactivation of previously active BMFPS RBSPs for that particular grid.
[0151] When a BMFPS RBSP (with a specific value of afps_mesh_frame_parameter_set_id) is inactive for a particular base mesh and is referenced by a decoded submesh NAL cell with nal_layer_id equal to 0 (using the ath_mesh_frame_parameter_set_id value equal to afps_mesh_frame_parameter_set_id), it is subsequently activated. This BMFPS RBSP is referred to as the active BMFPS RBSP until it is deactivated by the activation of another BMFPS RBSP. If the V3C cell header is unavailable, the variable bmfpsMeshID is set to the vuh_mesh_id of the BMFPS RBSP or determined externally. If the V3C cell header is unavailable, the variable activatingBMeshID is set to the vuh_mesh_id of the decoded submesh NAL cell or determined externally. The BMFPS RBSP with the specific value of bmfps_frame_parameter_set_id must be available for the decoding process before its activation, and must be included in at least one encoded / decoded mesh access cell whose BmTemporalID is less than or equal to that of the BMFPS NAL cell, or provided by external means. The bmfpsMeshID must be equal to the activatingBMeshID, and the BMFPS NAL cell containing the BMFPSRBSP must have a nal_layer_id equal to 0.
[0152] Any BMFPS NAL cell containing the value of bmfps_frame_parameter_set_id of the active BMFPS RBSP of the encoded and decoded grid frame must have the same content as the active BMFPS RBSP of the encoded and decoded base grid frame, unless it is after the last BMCL NAL cell of the encoded and decoded base grid frame and before the first BMCL NAL cell of another encoded and decoded base grid frame.
[0153] A BMSPS RBSP includes parameters that can be referenced by one or more BMSPS RBSPs. At the start of the decoding process, each BMSPS RBSP is initially considered inactive. At any given moment during the decoding process, at most one BMSPS RBSP is considered active, and the activation of any particular BMSPS RBSP results in the deactivation of the previously active BMSPS RBSP.
[0154] When a BMSPS RBSP (with a specific value of bmsps_sequence_parameter_set_id) is not yet active for a particular base mesh, and is referenced by the activation of a BMFPS RBSP (where bmfps_sequence_parameter_set_id equals the bmsps_sequence_parameter_set_id value, and afpsMeshID is set to equal vuh_mesh_id or determined by external means), it is activated for that particular base mesh. This BMSPS RBSP is referred to as the active BMSPS RBSP for that particular base mesh until it is deactivated by the activation of another BMSPS RBSP for that particular base mesh. If the V3C cell header is unavailable, the variable bmspsMeshID is set to equal vuh_mesh_id or determined by external means. If the V3C cell header is unavailable, the variable activatingMeshID is set to equal vuh_mesh_id of the encoded submesh or determined by external means. A BMSPS RBSP with the specific value of bmsps_mesh_sequence_parameter_set_id must be available for the decoding process before its activation. It must be included in at least one access unit where BmTemporalID equals 0 or provided by external means, bmspsMeshID equals activatingMeshID, and the NAL unit containing the BMSPS RBSP must have a nal_layer_id equal to 0. An activated BMSPS RBSP must remain active for the entire encoded / decoded underlying mesh sequence (CBMS).
[0155] Any BMSPS NAL cell containing the bmsps_sequence_parameter_set_id value of the active BMSPS RBSP of the CBMS and having any bmspsMeshID value and nal_layer_id equal to 0 must have the same content as the active BMSPS RBSP of the CBMS, unless it is after the last access cell of the CBMS and before the first BMCL NAL cell of another CBMS.
[0156] All constraints expressed in the relationships between the values of syntax elements in BMSPS and BMFPS, and the values of variables derived from these syntax elements, and other syntax elements, are expressions of constraints applicable only to active BMSPS RBSPs and active BMFPS RBSPs. If any BMSPS RBSP and BMFPS RBSP are never activated in the bitstream, then their syntax elements must have values conforming to the specified constraints if they are activated by reference in an otherwise standard-compliant bitstream.
[0157] During the decoding process (see entry H.9 in V-DMC), the values of the parameters for the active BMSPS RBSP and active BMFPS RBSP are considered valid. For the interpretation of SEI messages, the values of the active BMSPS RBSP and active BMFPS RBSP for the decoding process of the BMCL NAL cell of the base mesh frame in the same access cell with a nal_layer_id equal to 0 are considered valid, unless otherwise specified in the SEI message semantics.
[0158] The order of access units (AUs) and their association with the CBMS.
[0159] A bitstream conforming to this document consists of one or more CBMS.
[0160] A CBMS consists of one or more access units. The order of the NAL units and the encoded / decoded base grid frames, and their association with the access units, is described in section 8.4.5.4.3.
[0161] The first access unit of CBMS is an IRAP encoded and decoded mesh access unit with NoOutputBeforeRecoveryFlag equal to 1.
[0162] The requirement for bitstream consistency is that, when present, the next access unit following an access unit containing a sequence end NAL unit or a bitstream end NAL unit must be an IRAP encoded / decoded mesh access unit, which can be an IDR access unit, a BLA access unit, or a CRA access unit.
[0163] The order of NAL units and the encoded / decoded base grid frames, and their association with access units.
[0164] This section specifies the order of the NAL units and the encoded / decoded base grid frames of a CVS that belong to one or more grades as specified in Appendix A and are decoded using a decoding process, as well as their association with the access units.
[0165] An access cell consists of a decoded base mesh with nal_layer_id equal to 0, zero or more BMCL NAL cells with nal_layer_id greater than 0, and zero or more non-BMCL NAL cells. The association between BMCL NAL cells and the decoded mesh is described in section H.8.2.2.3.5.
[0166] The first access unit in the bitstream begins with the first NAL unit of the bitstream.
[0167] The first BMCL NAL unit of the encoded / decoded mesh frame where `firstBlAFrmNalUnit` is equal to 0. The first of any of the following NAL units preceding `firstBlAFrmNalUnit` and following (if any) the last BMCL NAL unit preceding `firstBlAFrmNalUnit` defines the start of a new access unit:
[0168] Note 1 – In the decoding order, the last BMCL NAL unit before firstBlAFrmNalUnit can have a nal_layer_id greater than 0.
[0169] 1. Access cell separator with nal_layer_id equal to 0 or V3C access cell separator NAL cell (if present).
[0170] 2. BMSPS NAL cells with nal_layer_id equal to 0 (if present).
[0171] 3. BMFPS NAL cells with nal_layer_id equal to 0 (if they exist).
[0172] 4. Prefixed SEI NAL cells with nal_layer_id equal to 0 (if present).
[0173] 5. NAL units with nal_layer_id equal to 0 and nal_unit_type in the range NAL_RSV_NBMCL_40..NAL_RSV_NBMCL_44 (if they exist).
[0174] 6. NAL units with nal_layer_id equal to 0 and nal_unit_type in the range NAL_UNSPEC_45..NAL_UNSPEC_63 (if they exist).
[0175] Note 2 – The first NAL unit before firstBlAFrmNalUnit and (if any) after the last BMCL NAL unit before firstBlAFrmNalUnit can only be one of the NAL units mentioned above.
[0176] The firstBlAFrmNalUnit begins a new access unit when there is no NAL unit before firstBlAFrmNalUnit and (if any) after the last BMCL NAL unit before firstBlAFrmNalUnit.
[0177] The order of the encoded / decoded base grid frames and non-BMCL NAL cells within the access cell must adhere to the following constraints:
[0178] 1. When an access unit separator or V3C access unit separator NAL unit exists with nal_layer_id equal to 0, it must be the first NAL unit. At most one access unit separator or V3C access unit separator NAL unit can exist within any access unit.
[0179] 2. When any BMSPS NAL unit, BMFPS NAL unit, prefix SEI NAL unit, NAL unit with nal_unit_type in the range NAL_RSV_NACL_40..NBMCL_RSV_NBMCL_44, or NAL unit with nal_unit_type in the range NAL_UNSPEC_45..NAL_UNSPEC_63 exists, they should not be after the last BMCL NAL unit of the accessed unit.
[0180] 3. A NAL unit with a nal_unit_type equal to NAL_FD, NAL_SUFFIX_NSEI, NAL_SUFFIX_ESEI, or in the range NAL_RSV_NBMCL_40..NAL_RSV_NBMCL_44 or NAL_UNSPEC_45..NAL_UNSPEC_63 should not precede the first BMCL NAL unit accessed.
[0181] 4. When there is a sequence end NAL unit where nal_layer_id equals 0, it must be the last NAL unit among all NAL units where nal_layer_id equals 0 in the accessed unit, excluding the bit stream end NAL unit (if it exists).
[0182] 5. When there is a bitstream end NAL unit, it must be the last NAL unit in the accessed unit.
[0183] Note 3 – Decoders conforming to the tiers specified in Appendix A do not use NAL units with nal_layer_id greater than 0 (e.g., access or V3C access unit separator NAL units with nal_layer_id greater than 0) for access unit boundary detection, except to identify NAL units as BMCL or non-BMCL NAL units.
[0184] The order of BMCL NAL units and their association with the encoded / decoded mesh frames.
[0185] This section specifies the order of BMCL NAL units and their association with the encoded / decoded underlying grid frame.
[0186] Each BMCL NAL unit is part of the encoded and decoded base grid frame.
[0187] The order of BMCL NAL cells within the base grid frame after encoding and decoding is constrained as follows:
[0188] 1. The first BMCL NAL unit of the encoded and decoded base mesh frame must have an ath_id equal to FirstSubmeshID.
[0189] The subgrids of the base grid frame must be arranged in ascending order of their ath_id values.
[0190] 2.4 Atlas Sequence Parameter Set Extension and Quantization Parameter Syntax and Semantics in V-DMC
[0191] The following description shows the atlas sequence parameter set extension and quantization parameter syntax and semantic design in the V-DMC CD text [4].
[0192] 8.3.6.1.3 Atlas Sequence Parameter Set V-DMC Extended Syntax
[0193]
[0194]
[0195] 8.3.6.1.4 Quantization Parameter Syntax
[0196]
[0197]
[0198] 8.4.6.1.3 Atlas Sequence Parameter Set V-DMC Extended Semantics
[0199] The `asve_subdivision_iteration_count` indicates the number of iterations used for subdivision.
[0200] `asve_lod_adaptive_subdivision_flag` equal to 1 indicates that the subdivision method is transmitted via signaling for each subdivision iteration. `asve_lod_adaptive_subdivision_flag` equal to 0 indicates that the same subdivision method is applied for each subdivision iteration.
[0201] `asve_subdivision_method[i]` is an identifier for a method that subdivides the mesh associated with the current atlas sequence parameter set at the subdivision index equal to `i`. Table 2 describes a list of supported subdivision methods and their relationship to `asve_subdivision_method`.
[0202] Table 2 – List of Subdivision Methods
[0203]
[0204] `asve_1d_displacement_flag` equal to 1 indicates that only the first component of the displacement exists in the compressed geometric video. The remaining two components are presumed to be 0. `asve_1D_displacement_flag` equal to 0 indicates that all three components of the displacement exist in the compressed geometric video. Define the following variables:
[0205] DisplacementDim = asve_1d_displacement_flag ? 1 : 3
[0206] `asve_displacement_reference_qp` specifies the initial value of the QuantizationParameter for the current frame. When it does not exist, `asve_displacement_reference_qp` is set to 49.
[0207] An asve_quantization_parameters_present_flag value of 1 indicates that the vdmc_quantization_parameters() syntax structure exists. An asve_quantization_parameters_present_flag value of 0 indicates that the vdmc_quantization_parameters() syntax structure does not exist.
[0208] The `asve_transform_method` directive indicates the identifier of the transformation applied to the displacement. Table 3 describes a list of supported transformations and their relationship to `asve_transform_method`.
[0209] Table 3 – List of Transformation Methods
[0210]
[0211] An `asve_lifting_offset_present_flag` value of 1 indicates that the lift offset parameter can exist in the `vdmc_lifting_transform_parameters` syntax structure. An `asve_lifting_offset_present_flag` value of 0 indicates that the lift offset parameter does not exist in the `vdmc_lifting_transform_parameters` syntax structure.
[0212] asve_num_attribute_video indicates the number of attributes transmitted via signaling through the video sub-bitstream. The V3C bitstream consistency requirement is that the value of asve_num_attribute_video must be equal to the value of ai_attribute_count[j], where j is the ID of the current atlas.
[0213] `asve_attribute_type_id[i]` indicates the attribute type of the attribute video data unit at index `i`. Table 4 of ISO / IEC 23090-5(2E):2023 describes a list of supported attributes. The V3C bitstream consistency requirement is that the value of `asve_attribute_type_id[i]` must be equal to the value of `ai_attribute_type_id[j][i]`, where `j` is the ID of the current atlas.
[0214] `asve_attribute_frame_width[i]` indicates the atlas frame width of the attribute video data unit at index `i`, in integer luminance samples of the atlas with atlas ID `j`. The V3C bitstream consistency requirement is that the value of `asve_attribute_frame_width[i]` must be equal to the value of `vps_ext_attribute_frame_width[j][i]`, where `j` is the ID of the current atlas.
[0215] `asve_attribute_frame_height[i]` indicates the atlas frame height of the attribute video data unit at index `i`, in integer luminance samples of the atlas with atlas ID `j`. The V3C bitstream consistency requirement is that the value of `asve_attribute_frame_height[i]` must be equal to the value of `vps_ext_attribute_frame_height[j][i]`, where `j` is the ID of the current atlas.
[0216] `asve_attribute_subtexture_enabled_flag[i]` equal to 0 indicates that the information for the region in the image corresponding to the sub-grid does not exist for the attribute transmitted via signal in the attribute video data unit with index i in the grid block data unit. `asve_attribute_subtexture_enabled_flag[i]` equal to 1 indicates that the information for the region in the image corresponding to the sub-grid exists for the attribute transmitted via signal in the attribute video data unit with index i in the grid block data unit.
[0217] `asve_displacement_id_present_flag` equal to 1 indicates that the displacement data block is identified by its ID. `asve_displacement_id_present_flag` equal to 0 indicates that the displacement data is identified by its position. `asve_packing_method` equal to 0 specifies that the displacement component samples are arranged in ascending order, and `asve_packing_method` equal to 1 specifies that the displacement component samples are arranged in descending order.
[0218] An asve_projection_texcoord_enable_flag value of 0 indicates that texture coordinates can be transferred in the underlying mesh, while an asve_projection_texcoord_enable_flag value of 1 indicates that texture coordinates will be derived using projection parameters from the mesh's small data cells.
[0219] An asve_projection_texcoord_mapping_present_flag value of 1 indicates that asve_projection_texcoord_mapping_attribute_index exists. If asve_projection_texcoord_mapping_present_flag value of 0, it indicates that asve_projection_texcoord_mapping_attribute_index does not exist, and the face ID is implicitly inferred using connected components.
[0220] The `asve_projection_texcoord_mapping_attribute_index` directive indicates the index of the underlying mesh attribute, which will be used to map the set of faces to sub-blocks.
[0221] `asve_projection_texcoord_output_attribute_index` indicates the index of the texture coordinate attribute carried in the reconstructed base mesh. The value indicated by `asve_projection_texcoord_output_attribute_index` must be less than or equal to `vps_ext_bmesh_data_attribute_count`. When it does not exist, `asve_projection_texcoord_output_attribute_index` is set to 0.
[0222] `asve_projection_texcoord_output_bit_depth_minus1` indicates the bit depth of the texture coordinates generated by `orthoAtlas`. `asve_projection_texcoord_output_bit_depth_minus1` must be in the range of 0 to 31 (inclusive).
[0223] asve_projection_texcoord_scale_factor indicates the value of the scaling factor variable TexcoordProjectionScaleFactor used for deriving texture coordinates from geometric projection.
[0224] An asve_vdmc_vui_parameters_present_flag value of 1 indicates that the vdmc_vui_parameters() syntax structure as specified in Appendix G exists. An asve_vdmc_vui_parameters_present_flag value of 0 indicates that the vdmc_vui_parameters() syntax structure as specified in Appendix G does not exist.
[0225] 8.4.6.1.4 Semantics of Quantization Parameters
[0226] A value of 1 for `vqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be sent at each level of detail using incremental encoding / decoding. A value of 0 for `vqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be the same across all levels of detail. `qpIndex` is the index of the quantization parameter set.
[0227] `vqp_bitdepth_offset[qpIndex]` indicates the bit depth offset value applied to the quantization process of the bit shift. `qpIndex` is the index of the quantization parameter set.
[0228] `vqp_quantization_parameters[ qpIndex ][ k ]` indicates the quantization parameters to be used for the inverse quantization of the k-th component of the shift. The value of `vqp_quantization_parameters[ qpIndex ][ k ]` must be in the range of 0 to 100 (inclusive). `qpIndex` is the index of the quantization parameter set.
[0229] `vqp_log2_lod_inverse_scale[qpIndex][k]` indicates the scaling factor applied to the quantization process of the k-th component of the shift, for each level of detail. `qpIndex` is the index of the quantization parameter set.
[0230] `vqp_lod_delta_quantization_parameter_value[qpIndex][i][k]` specifies the absolute difference between the quantization parameter values of the i-th layer and the k-th component and the value of `asve_displacement_reference_qp`. If it does not exist, the value of `vqp_lod_delta_quantization_parameter_value[qpIndex][i][k]` is presumed to be 0. The value of the QuantizationParameter for each LoD layer must be in the range of 0 to 100. `qpIndex` is the index of the quantization parameter set.
[0231] `vqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` specifies the sign of the difference between the quantization parameter values of the i-th layer and the k-th component and the value of `asve_displacement_reference_qp`. `vqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` equal to 0 indicates a positive difference. `vqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` equal to 1 indicates a negative difference. When it does not exist, the value of `vqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` is presumed to be 0. `qpIndex` is the index of the quantization parameter set.
[0232] A value of 1 for `vqp_direct_quantization_enabled_flag[qpIndex]` indicates that the inverse scaling factor is directly derived from the displacement quantization parameters transmitted via the signal and is calculated as follows:
[0233] InverseScale[ qpIndex ][ i ][ k ] = 1 ÷ QuantizationParameter[qpIndex ][ i ][ k ]
[0234] A value of 0 for `vqp_direct_quantization_enabled_flag[qpIndex]` indicates that the descaling factor must be calculated as follows:
[0235] bitDepthPosition = asps_geometry_3d_bit_depth_minus1 + 1
[0236] InverseScale[ qpIndex ][ i ][ k ] = pow(0.5, 16 + vqp_bitdepth_offset[ qpIndex ] – bitDepthPosition + (4 – QuantizationParameter[ qpIndex ][ i ][k ]) ÷ 6)
[0237] Where qpIndex is the index of the quantization parameter set.
[0238] `vqp_inverse_quantization_offset_enable_flag[qpIndex]` equal to 0 indicates that the inverse quantization offset may not be applied to the wavelet transform coefficients of the inverse quantization of the compensation shift. `vqp_inverse_quantization_offset_enable_flag[qpIndex]` equal to 1 indicates that the inverse quantization offset is applied to the wavelet transform coefficients of the inverse quantization of the compensation shift.
[0239] `vqp_inverse_quantization_offset_sign_delta[ qpIndex ][ i ][ j ][ k ]` indicates the difference in sign between LoD i and LoD i-1 when i is non-zero, representing the difference in sign of the inverse quantization offset of the wavelet transform displacement coefficients with inverse quantization and displacement dimension j located in region k (dead zone: 0, positive non-dead zone: 1, negative non-dead zone: 2). When i is zero, it indicates the absolute value of the sign.
[0240] `vqp_inverse_quantization_offset_value_log2_prec1_delta[ qpIndex ][ i][ j ][ k ]` indicates the difference of the inverse quantization offset values of the first precision level, located in region k (dead zone: 0, positive non-dead zone: 1, negative non-dead zone: 2), between LoD i and LoD i-1, when i is non-zero. When i is zero, it indicates the absolute value of the offset value of the first precision level associated with LoD 0.
[0241] `vqp_inverse_quantization_offset_value_log2_prec2_delta[ qpIndex ][ i][ j ][ k ]` indicates the value of the inverse quantization offset of the second precision level, located in region k (dead zone: 0, positive non-dead zone: 1, negative non-dead zone: 2), with displacement dimension j, when `i` is non-zero. When `i` is zero, it indicates the absolute value of the offset of the second precision level associated with `LoD 0`.
[0242] 2.5 Syntax and Semantics of Displacement Sequence Parameter Set (RBSP) and Quantization Parameters in V-DMC
[0243] J.7.1.2.1.1 General Displacement Sequence Parameter Set (RBSP) Syntax
[0244]
[0245]
[0246] J.7.1.2.1.3 Quantization Parameter Syntax
[0247]
[0248] J.7.2.2.1.1 Semantics of the General Displacement Sequence Parameter Set (RBSP)
[0249] dsps_sequence_parameter_set_id provides an identifier for the displacement sequence parameter set for reference by other syntax elements.
[0250] `dsps_codec_id` indicates the identifier of the codec used for compression shifting. `dsps_codec_id` must be in the range of 0 to 255 (inclusive). This codec can be identified by the level defined in Appendix J.10, the component codec mapping SEI message, or by means outside this document. It can be associated with a specific shift codec by the level specified in the corresponding specification, or it can be explicitly indicated using the SEI message as done in the V3C specification for video sub-bitstreams.
[0251] `dsps_single_dimension_flag` indicates the number of dimensions of the displacement associated with it. `dsps_single_dimension_flag` equal to 0 indicates that all three components of the displacement are used. `dsps_single_dimension_flag` equal to 1 indicates that only the normal component of the displacement is used. The variable `MaxDimension` is derived as follows:
[0252] MaxDimension = dsps_single_dimension_flag ? 1 : 3
[0253] The dsps_msb_align_flag indicates how to convert decoded shift samples into samples at bit depths within the shift range specified in B.2.8.
[0254] The increment of 4 in dsps_log2_max_displ_frame_order_cnt_lsb_minus4 specifies the values of the variables Log2MaxDisplFrmOrderCntLsb and MaxDisplFrmOrderCntLsb used in the decoding process for offset frame order counting, as follows:
[0255] Log2MaxDisplFrmOrderCntLsb =
[0256] dsps_log2_max_displ_frame_order_cnt_lsb_minus4 + 4
[0257] MaxDisplFrmOrderCntLsb = 2 Log2MaxDisplFrmOrderCntLsb
[0258] The value of dsps_log2_max_displ_frame_order_cnt_lsb_minus4 must be in the range of 0 to 12 (inclusive).
[0259] The value of dsps_max_dec_displ_frame_buffering_minus1 plus 1 specifies the maximum required size of the shift frame buffer for CDS decoding, in units of shift frame storage buffer. The value of dsps_max_dec_displ_frame_buffering_minus1 must be in the range of 0 to 15 (inclusive).
[0260] `dsps_max_num_reorder_frames` specifies the maximum number of frames that a CDS can have before any frame in the decoding order and after that frame in the output order. The value of `dsps_max_num_reorder_frames` must be in the range of 0 to `bmsps_max_dec_mesh_frame_buffering_minus1` (inclusive).
[0261] A non-zero value of dsps_max_latency_increase_plus1 is used to calculate the value of MaxLatencyDisplacementFrames, which specifies the maximum number of frames that a CDS can have before any frame in the output order and after any frame in the decoding order.
[0262] When dsps_max_latency_increase_plus1 is not equal to 0, the value of MaxLatencyDisplacementFrames is specified as follows:
[0263] MaxLatencyDisplacementFrames =
[0264] dsps_max_num_reorder_frames + dsps_max_latency_increase_plus1 - 1
[0265] When dsps_max_latency_increase_plus1 equals 0, there is no corresponding constraint. The value of dsps_max_latency_increase_plus1 must be in the range of 0 to 2^32 - 2 (inclusive).
[0266] A long-term reference shift of 0 indicates that no long-term reference shifts are used for inter-frame prediction of any encoded or decoded shifted frames in the CDS. A long-term reference shift of 1 indicates that long-term reference shift frames can be used for inter-frame prediction of one or more encoded or decoded shifted frames in the CDS.
[0267] `dsps_num_ref_displ_frame_lists_in_dsps` specifies the number of `displ_ref_list_struct(rlsIdx)` syntax structures included in the displacement sequence parameter set. The value of `dsps_num_ref_displ_frame_lists_in_dsps` must be in the range of 0 to 64 (inclusive).
[0268] Note – The decoder allocates memory for a total of (dsps_num_ref_displ_frame_lists_in_dsps + 1) displ_ref_list_struct(rlsIdx) syntax structures, because one displ_ref_list_struct(rlsIdx) syntax structure can be directly transmitted via signal in the displacement header of the current displacement frame.
[0269] The increment of 1 in dsps_geometry_3d_bit_depth_minus1 indicates the bit depth of the geometric coordinates of the reconstructed volumetric content. dsps_geometry_3d_bit_depth_minus1 must be in the range of 0 to 31 (inclusive).
[0270] `dsps_subdivision_method` indicates the identifier of the method used to subdivide the mesh associated with the current DSPS sequence parameter set. Table 2 describes a list of supported subdivision methods and their relationship to `dsps_subdivision_method`.
[0271] `dsps_subdivision_iteration_count` indicates the number of iterations used for subdivision. When it does not exist, the value of `dsps_subdivision_iteration_count` is presumed to be 0.
[0272] dsps_displacement_reference_qp specifies the initial value of the QuantizationParameter for the current frame. When it does not exist, dsps_displacement_reference_qp is set to 49.
[0273] The value of dsps_extension_present_flag equal to 1 indicates that dsps_extension_count exists in the displacement sequence parameter set.
[0274] dsps_extension_count specifies the number of extensions present in the current displacement sequence parameter set. When none exist, dsps_extension_count is presumed to be 0.
[0275] When dsps_extensions_length_minus1 exists, it specifies, in bytes, the cumulative length DspsExtensionsLength of all extensions following this syntax element. DspsExtensionsLength is calculated as follows:
[0276] if(dsps_extension_count == 0)
[0277] DspsExtensionsLength = 0
[0278] else
[0279] DspsExtensionsLength = dsps_extensions_length_minus1 + 1
[0280] The requirement is that DspsExtensionsLength equals 3 when dsps_extension_count is not equal to 0. The sum of dsps_extension_count and all dsps_extension_length[i].
[0281] dsps_extension_type[i] indicates the DSPS extension type of the extension at index i as specified in Table J.2 of V-DMC. Values indicated as reserved are reserved for future use by ISO / IEC and should not exist in the bitstream conforming to this version of the document. Decoders conforming to this version of the document should ignore such reserved extensions. The requirement is that a particular dsps_extension_type[i] value must exist only once throughout the entire DSPS, and the order of the extensions is irrelevant.
[0282] `dsps_extension_length[i]` specifies the number of bytes used to represent the payload size of the syntax structure associated with index `i`. If `dsps_extension_length[i]` is equal to 0, then there is no extension payload for the extension at index `i`. Otherwise, the extension at index `i` must have a payload size of 8 bytes. ( dsps_extension_length[ i ]– 1 ) + 1 to 8 The payload size in bits within the range of dsps_extension_length[i] (inclusive of end values).
[0283] 7.2.2.1.3 Quantization Parameter Syntax
[0284] A value of 1 for `dqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be sent at each level of detail using incremental encoding / decoding. A value of 0 for `dqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be the same across all levels of detail. `qpIndex` is the index of the quantization parameter set.
[0285] dqp_bitdepth_offset[ qpIndex ] indicates the bit depth offset value applied to the quantization process of the bit shift. qpIndex is the index of the quantization parameter set.
[0286] `dqp_quantization_parameters[ qpIndex ][ k ]` indicates the quantization parameters to be used for the inverse quantization of the k-th component of the shift. The value of `dqp_quantization_parameters[ qpIndex ][ k ]` must be in the range of 0 to 100 (inclusive). `qpIndex` is the index of the quantization parameter set.
[0287] `dqp_log2_lod_inverse_scale[ qpIndex ][ k ]` indicates the scaling factor applied to the k-th component of the shift, for each level of detail. `qpIndex` is the index of the quantization parameter set.
[0288] `dqp_lod_delta_quantization_parameter_value[ qpIndex ][ i ][ k ]` specifies the absolute difference between the quantization parameter values of the i-th layer and the k-th component and the value `dsps_displacement_reference_qp`. If it does not exist, the value of `dqp_lod_delta_quantization_parameter_value[ qpIndex ][ i ][ k ]` is presumed to be 0. `qpIndex` is the index of the quantization parameter set. The value of the `QuantizationParameter` for each LoD layer must be in the range of 0 to 100.
[0289] `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` specifies the sign of the difference between the quantization parameter values of the i-th layer and the k-th component and the value of `dsps_displacement_reference_qp`. `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` equal to 0 indicates a positive difference. `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` equal to 1 indicates a negative difference. When it does not exist, the value of `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` is presumed to be 0. `qpIndex` is the index of the quantization parameter set.
[0290] 3. Technical problems solved by the disclosed embodiments
[0291] The example design for dynamic mesh encoding and decoding has the following problems:
[0292] First, an HRD should be defined for each sub-bitstream. However, the number of sub-bitstreams can be large, complicating decoder implementation. The goal is to reduce the number of required HRDs.
[0293] Second, for non-video sub-bitstreams, there is no indication of the maximum allowed number of reordered images.
[0294] Third, there is no indication of maximum latency for non-video sub-bitstreams.
[0295] Fourth, the lack of constraints between different sub-bit streams can result in significant system latency.
[0296] Fifth, syntax elements that break down the iteration count are transmitted directly via signals. However, when the count is 0, transmitting the count via signals is unnecessary.
[0297] Sixth, the Qp reference offset of the displacement is disordered.
[0298] Seventh, the current Qp can be equal to 0, and the derived InverseScale can be invalid.
[0299] 4. List of solutions and implementation examples
[0300] To address at least some of the problems mentioned above, methods outlined below are disclosed. These projects should be considered as examples for interpreting general concepts, and not interpreted in a narrow sense. Furthermore, these designs can be applied individually or combined in any way.
[0301] 1. To address the shortcomings of problem 1, HRDs of different sub-bit streams can be combined.
[0302] a. In one example, the combination of HRDs between sub-bitstream 1 to sub-bitstream N means that NAL units with the same nal_unit_type from different bitstreams are all treated as the same type in the combined HRD.
[0303] i. When multiple HRDs are combined, bitstream consistency is for the combined HRD, not for individual HRDs.
[0304] b. In one example, the atlas HRD and the base grid HRD can be combined.
[0305] c. In one example, the atlas HRD and the displacement HRD can be combined.
[0306] d. In one example, the displacement HRD and the base mesh HRD can be combined.
[0307] e. In one example, the atlas HRD, the base mesh HRD, and the displacement HRD can be combined.
[0308] 2. To address the shortcomings of problem 2, one or more syntax elements indicating the maximum allowed number of reordered images can be transmitted via signaling in a sub-bitstream.
[0309] a. In one example, the maximum allowed number of reordered images means the maximum number of output images that can be before any output image in the decoding order and after any of those output images in the output order.
[0310] b. In one example, the maximum allowed number of reordered images must be within the range of 0 to the maximum required size of the decoded image buffer for the sub-bitstream.
[0311] c. In one example, one or more syntax elements are signaled to indicate the maximum allowed number of pictures for reordering a sub-bitstream of the atlas.
[0312] d. In one example, one or more syntax elements are signaled to indicate the maximum allowed number of pictures for reordering against the underlying grid sub-bitstream.
[0313] e. In one example, one or more syntax elements are signaled to indicate the maximum allowed number of pictures for reordering the shifted sub-bit stream.
[0314] f. In one example, if the sub-bitstreams have different time-domain levels, then for each time-domain level, one or more syntax elements are signaled to indicate the maximum allowed number of images to be reordered for that time-domain level.
[0315] g. In one example, one or more syntax elements are also signaled to indicate the maximum allowed number of images for reordering across all sub-bitstreams.
[0316] i. In one example, the maximum allowed number of images for reordering across all sub-bitstreams is the maximum allowed number of images for reordering within each sub-bitstream.
[0317] ii. In one example, syntax elements can be transmitted via signals in the atlas parameter set extension.
[0318] iii. In one example, syntax elements can be transmitted via signals in VUI parameter extensions.
[0319] h. In one example, one or more syntax elements can be used to indicate whether the maximum allowed number of images to be reordered is 0.
[0320] i. In one example, a flag could be used to indicate whether the maximum allowed number of images to be reordered is 0.
[0321] 3. To address the shortcomings of problem 3, one or more syntax elements indicating the maximum delay can be transmitted via signaling in the sub-bitstream.
[0322] a. In one example, latency is a term used to describe the number of images.
[0323] b. In one example, maximum latency means the maximum number of output images that can precede any output image in the output order and follow that image in the decoding order.
[0324] c. In one example, one or more syntax elements are transmitted via signals to indicate the maximum delay for the atlas sub-bitstream.
[0325] d. In one example, one or more syntax elements are signaled to indicate the maximum delay for the underlying grid sub-bitstream.
[0326] e. In one example, one or more syntax elements are signaled to indicate the maximum delay for the shifted sub-bit stream.
[0327] f. In one example, if the sub-bitstreams have different time-domain levels, then for each time-domain level, one or more syntax elements are signaled to indicate the maximum delay for that time-domain level.
[0328] g. In one example, one or more syntax elements are also transmitted via signaling to indicate the maximum delay for all sub-bit streams.
[0329] i. In one example, the maximum delay for all sub-bitstreams is the maximum value of the maximum delay for each sub-bitstream.
[0330] ii. In one example, syntax elements can be transmitted via signals in the atlas parameter set extension.
[0331] iii. In one example, syntax elements can be transmitted via signals in VUI parameter extensions.
[0332] h. In one example, one or more syntax elements can be used to indicate whether the maximum delay is 0.
[0333] i. In one example, a flag could be used to indicate whether the maximum delay is 0.
[0334] 4. To address the shortcomings of problem 4, one or more syntax elements indicating the maximum allowed number of reordered images and / or the maximum delay can be transmitted via signaling in the bitstream.
[0335] a. In one example, suppose a bitstream has sub-bitstreams 1 to N, and the maximum allowed number of reordered pictures of sub-bitstream i is R(i), i = 1...N, then one or more syntax elements can be signaled to indicate the maximum number in R(i) (i = 1...N).
[0336] b. In one example, suppose the bitstream has sub-bitstreams 1 to N, and the maximum delay of sub-bitstream i is L(i), i = 1...N, then one or more syntax elements can be signaled to indicate the maximum number in L(i) (i = 1...N).
[0337] c. In one example, (multiple) syntax elements can be in the atlas parameter sequence set.
[0338] d. In one example, (multiple) syntax elements can be in a set of general atlas parameter sequences.
[0339] 5. To address the shortcomings of problem 5, the subdivision iteration count minus 1 can be transmitted via signal in the bitstream.
[0340] a. In one example, in the atlas sequence parameter set, the iteration count minus 1 can be transmitted via signaling.
[0341] b. In one example, in the atlas frame parameter set, the iteration count minus 1 can be transmitted via signaling.
[0342] c. In one example, within a grid of small data cells, decrementing the iteration count by 1 can be achieved via signal transmission.
[0343] 6. To address the shortcomings of problem 1, non-video sub-bitstreams can be transmitted as atlas sub-bitstreams, or transmitted within atlas sub-bitstreams.
[0344] a. In one example, in addition to encoding and decoding the base grid sub-bitstream, the atlas sub-bitstream can be designed to carry the base grid data.
[0345] i. In one example, it further requires the underlying grid to have the same intra / inter-frame encoding / decoding type and / or reference frame structure as the atlas sub-bitstream.
[0346] b. In one example, in addition to encoding and decoding the shifted sub-bitstream, the atlas sub-bitstream can be designed to carry shift data.
[0347] i. In one example, it further requires that the displacement data have the same intra / inter-frame encoding / decoding type and / or reference frame structure as the atlas sub-bitstream.
[0348] c. In one example, the atlas sub-bitstream can be designed to carry both the underlying grid data and the displacement data.
[0349] i. In one example, it further requires that both the base grid and the displacement have the same intra / inter-frame encoding / decoding type and / or reference frame structure as the atlas sub-bitstream.
[0350] 7. To address the shortcomings of problem 6, it is stipulated that the incremental value of the reference Qp can be transmitted via signal.
[0351] a. In one example, reference Qp minus N can be transmitted via signaling.
[0352] i. In one example, N equals 49.
[0353] 8. To address the shortcomings of problem 7, it is stipulated that the Qp value (either through signal transmission or derivation) must be greater than 0.
[0354] a. In one example, the minimum Qp value is equal to 1.
[0355] 9. To address the shortcomings of problem 7, alternatively, the amplitude limiting operator can be applied to derive the Qp value.
[0356] a. In one example, the clipping operator Clip3(minQp, maxQp,Qp) can be applied before using the Qp value.
[0357] i. In one example, minQp equals 1.
[0358] ii. In one example, maxQp equals 100.
[0359] 5. Examples
[0360] The following are some example implementations of the aspects outlined in Section 4 of the previous article.
[0361] Most of the relevant sections that have been added or modified are shown in bold, and some of the deleted sections are shown in both bold and italic fonts. There may be some other changes that are essentially editorial and therefore not indicated.
[0362] 5.1 Example 1
[0363] This embodiment refers to items 1, 1.e, which are outlined in Section 4 of the previous article. The following text changes are based on V3C version 3 [3].
[0364] E.1 Overview
[0365] This appendix specifies the hypothetical reference decoder (HRD) and its use in checking the consistency between the atlas sub-bitstream and the decoder. In this section, bitstream refers to the atlas sub-bitstream unless otherwise indicated.
[0366] Two types of bitstreams or subsets of bitstreams undergo HRD compliance checks for this document. The first type (referred to as Type I bitstream) is a NAL cell stream containing the following:
[0367] – All encoded and decoded atlas access units in the atlas sub-bitstream, including ACL NAL units and non-ACL NAL units with nal_unit_type equal to NAL_FD (pad data NAL unit);
[0368] – If a base grid sub-bitstream exists, then all base grid cells in the base grid sub-bitstream are BMCL NAL cells and non-BMCL NAL cells whose nal_unit_type is equal to NAL_FD (filler data NAL cells).
[0369] – If a sub-bitstream exists, then all shifted units in the sub-bitstream are DCL NAL units and non-DCL NAL units whose nal_unit_type is equal to NAL_FD (filler data NAL units).
[0370] The second type (referred to as Type II bitstream) is a NAL unit stream, which, in addition to the ACL NAL units and padding data NAL units of all encoded / decoded atlas access units in the atlas sub-bitstream, also includes BMCL NAL units of all base grid units in the base grid sub-bitstream if a base grid sub-bitstream exists, and non-BMCL NAL units whose nal_unit_type is equal to NAL_FD (padding data NAL units), at least one of the following:
[0371] – Additional non-ACL NAL units in addition to the padding data NAL units;
[0372] – If a base grid sub-bitstream exists, then additional non-BMCL NAL cells are added in addition to the padding data NAL cells;
[0373] – If a shifted sub-bit stream exists, then additional non-DCL NAL units are added in addition to the padding data NAL units;
[0374] – The sample stream NAL header structure syntax elements ssnh_unit_size_precision_bytes_minus1 and ssnh_reserved_zero_5bits, and all ssnu_nal_unit_size syntax elements that form the NAL sample stream from the NAL unit stream (as specified in Appendix D).
[0375] 5.2 Example 2
[0376] This embodiment refers to items 2, 2.a, 2.d, 2.e, 3, 3.a, 3.b, 3.d, and 3.e as outlined in Section 4 of the previous article. The following text changes are based on V-DMC WD 6.0 [2].
[0377] H.8.1.3.1.1 General Basic Mesh Sequence Parameter Set (RBSP) Syntax
[0378]
[0379] H.8.3.1.1 General Basic Mesh Sequence Parameter Set (RBSP) Semantics ...
[0381] The value of bmsps_max_dec_mesh_frame_buffering_minus1 plus 1 specifies the maximum required size of the CBMS decoding base grid frame buffer, in units of the base grid frame storage buffer. The value of bmsps_max_dec_mesh_frame_buffering_minus1 must be in the range of 0 to 15 (inclusive).
[0382] bmsps_max_num_reorder_frames specifies the maximum number of frames that can precede any frame in the decoding order and follow that frame in the output order. The value of bmsps_max_num_reorder_frames must be in the range of 0 to bmsps_max_dec_mesh_frame_buffering_minus1 (inclusive).
[0383] A value of bmsps_max_latency_increase_plus1 that is not equal to 0 is used to calculate the value of MaxLatencyFrames, which specifies the maximum number of frames that can precede any frame in the output order and follow the image in the decoding order.
[0384] When bmsps_max_latency_increase_plus1 is not equal to 0, the value of MaxLatencyFrames is specified as follows:
[0385] MaxLatencyFrames = bmsps_max_num_reorder_frames + bmsps_max_latency_increase_plus1 - 1
[0386] When bmsps_max_latency_increase_plus1 equals 0, there is no corresponding limitation. The value of bmsps_max_latency_increase_plus1 must be between 0 and 2. 32 - Within the range of 2 (inclusive). ...
[0388] J.7.1.2.1.1 General Displacement Sequence Parameter Set RBSP
[0389]
[0390] J.7.2.2.1.1 Semantics of the General Displacement Sequence Parameter Set (RBSP) ...
[0392] The value of dsps_max_dec_displ_frame_buffering_minus1 plus 1 specifies the maximum required size of the shift frame buffer for CDS decoding, in units of shift frame storage buffer. The value of dsps_max_dec_displ_frame_buffering_minus1 must be in the range of 0 to 15 (inclusive).
[0393] The `dsps_max_num_reorder_frames` parameter specifies the maximum number of frames that can precede any frame in the decoding order and follow that frame in the output order. The value of `dsps_max_num_reorder_frames` must be in the range of 0 to `bmsps_max_dec_mesh_frame_buffering_minus1` (inclusive).
[0394] A non-zero value of dsps_max_latency_increase_plus1 is used to calculate the value of MaxLatencyFrames, which specifies the maximum number of frames that can precede any frame in the output order and follow the image in the decoding order.
[0395] When dsps_max_latency_increase_plus1 is not equal to 0, the value of MaxLatencyFrames is specified as follows:
[0396] MaxLatencyFrames = dsps_max_num_reorder_frames + dsps_max_latency_increase_plus1 - 1
[0397] When dsps_max_latency_increase_plus1 equals 0, there is no corresponding constraint. The value of dsps_max_latency_increase_plus1 must be between 0 and 2. 32 - Within the range of 2 (inclusive).
[0398] 5.3 Example 3
[0399] This embodiment refers to items 1, 1.a and 1.ai as outlined in Section 4 of the previous article. The following text changes are based on the V-DMCCD text [4].
[0400] 8.3.6.1.3 Atlas Sequence Parameter Set V-DMC Extended Syntax
[0401]
[0402] 8.4.6.1.3 Atlas Sequence Parameter Set V-DMC Extended Semantics ...
[0404] `asve_displacement_reference_qp_minus49` plus 49 specifies the initial value of the QuantizationParameter for the current frame. The value of `asve_displacement_reference_qp_minus49` must be in the range of -48 to +51 (inclusive). If it does not exist, `asve_displacement_reference_qp_minus49` is set to an integer equal to 49. 49 0. ...
[0406] J.7.1.2.1.1 General Displacement Sequence Parameter Set (RBSP) Syntax
[0407]
[0408] J.7.2.2.1.1 Semantics of the General Displacement Sequence Parameter Set (RBSP) ...
[0410] `dsps_displacement_reference_qp_minus49` plus 49 specifies the initial value of the QuantizationParameter for the current frame. The value of `dsps_displacement_reference_qp_minus49` must be in the range of -48 to +51 (inclusive). If it does not exist, `dsps_displacement_reference_qp_minus49` is set to an integer equal to 49. 49 0. ...
[0412] 5.4 Example 4
[0413] This embodiment refers to items 2, 2.a, which are outlined in Section 4 of the previous article. The following text changes are based on the V-DMC CD text [4].
[0414] 8.4.6.1.4 Semantics of Quantization Parameters
[0415] A value of 1 for `vqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be sent at each level of detail using incremental encoding / decoding. A value of 0 for `vqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be the same across all levels of detail. `qpIndex` is the index of the quantization parameter set.
[0416] `vqp_bitdepth_offset[qpIndex]` indicates the bit depth offset value applied to the quantization process of the bit shift. `qpIndex` is the index of the quantization parameter set.
[0417] vqp_quantization_parameters[ qpIndex ][ k ] indicates the k-th parameter to be used for displacement. th The quantization parameters for the inverse quantization of each component. The value of vqp_quantization_parameters[qpIndex][k] must be within the range of... 0 The range is from 1 to 100 (inclusive). qpIndex is the index of the quantization parameter set.
[0418] `vqp_log2_lod_inverse_scale[qpIndex][k]` indicates the scaling factor applied to the quantization process of the k-th component of the shift, for each level of detail. `qpIndex` is the index of the quantization parameter set.
[0419] `vqp_lod_delta_quantization_parameter_value[qpIndex][i][k]` specifies the absolute difference between the quantization parameter values of the i-th layer and the k-th component and the value of `asve_displacement_reference_qp`. When not present, the value of `vqp_lod_delta_quantization_parameter_value[qpIndex][i][k]` is presumed to be 0. The value of the QuantizationParameter for each LoD layer must be within the range specified in the original text. 0 The range is from 1 to 100. qpIndex is the index of the quantization parameter set. ...
[0421] 7.2.2.1.3 Quantization Parameters grammar Semantics
[0422] A value of 1 for `dqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be sent at each level of detail using incremental encoding / decoding. A value of 0 for `dqp_lod_quantization_flag[qpIndex]` indicates that the quantization parameters will be the same across all levels of detail. `qpIndex` is the index of the quantization parameter set.
[0423] dqp_bitdepth_offset[ qpIndex ] indicates the bit depth offset value applied to the quantization process of the bit shift. qpIndex is the index of the quantization parameter set.
[0424] `dqp_quantization_parameters[ qpIndex ][ k ]` indicates the quantization parameters to be used for the inverse quantization of the k-th component of the shift. The value of `dqp_quantization_parameters[ qpIndex ][ k ]` must be within the range specified in the original text. 0 The range is from 1 to 100 (inclusive). qpIndex is the index of the quantization parameter set.
[0425] `dqp_log2_lod_inverse_scale[ qpIndex ][ k ]` indicates the scaling factor applied to the k-th component of the shift, for each level of detail. `qpIndex` is the index of the quantization parameter set.
[0426] `dqp_lod_delta_quantization_parameter_value[ qpIndex ][ i ][ k ]` specifies the absolute difference between the quantization parameter values of the i-th layer and the k-th component and the value `dsps_displacement_reference_qp`. If it does not exist, the value of `dqp_lod_delta_quantization_parameter_value[ qpIndex ][ i ][ k ]` is presumed to be 0. `qpIndex` is the index of the quantization parameter set. The value of the QuantizationParameter for each LoD layer must be within the range specified in the original text. 0 The range is from 1 to 100.
[0427] `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` specifies the sign of the difference between the quantization parameter values of the i-th layer and the k-th component and the value of `dsps_displacement_reference_qp`. `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` equal to 0 indicates a positive difference. `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` equal to 1 indicates a negative difference. When it does not exist, the value of `dqp_lod_delta_quantization_parameter_sign[ qpIndex ][ i ][ k ]` is presumed to be 0. `qpIndex` is the index of the quantization parameter set.
[0428] 5.5 Example 5
[0429] This embodiment refers to items 3, 3.a, and 3.ai, which are outlined in Section 4 of the previous article. The following text changes are based on the V-DMC CD text [5].
[0430] 8.3.6.1.4 Quantization Parameter Syntax
[0431]
[0432]
[0433] J.7.1.2.1.3 Quantization Parameter Syntax
[0434]
[0435] 6. References
[0436] [1] MPEG technical requirements, “CfP for. Dynamic Mesh Coding,” ISO / IEC JTC 1 / SC 29 / WG 2 doc. no. N145, in Oct. 2021.
[0437] [2] MPEG output document, “WD 6.0 of V-DMC,” ISO / IEC JTC 1 / SC 29 / WG 7doc. no. N00822, in Jan. 2024.
[0438] [3] MPEG output document, “Text of ISO / IEC FDIS 23090-5 2nd EditionVisual volumetric video-based coding (V3C) and video-based point cloudcompression (V-PCC) ,” ISO / IEC JTC 1 / SC 29 / WG 7 doc. no. N00553, in Jan.2024.
[0439] [4] MPEG output document, “Text of ISO / IEC CD 23090-29 Video-basedmesh coding,” ISO / IEC JTC 1 / SC 29 / WG 7 doc. no. N00885, in Apr. 2024.
[0440] Figure 3 This is a block diagram illustrating an example video processing system 4000 in which various embodiments disclosed herein may be implemented. Various implementations may include some or all of the components of system 4000. System 4000 may include an input 4002 for receiving video content. The video content may be received in a raw or uncompressed format, such as 8 or 10-bit multi-component pixel values, or it may be in a compressed or encoded format. Input 4002 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interfaces include wired interfaces (such as Ethernet, Passive Optical Networking (PON), etc.) and wireless interfaces (such as Wi-Fi or cellular interfaces).
[0441] System 4000 may include an encoding / decoding component 4004 capable of implementing the various encoding / decoding or coding methods described in this disclosure. Encoding / decoding component 4004 can reduce the average bit rate from the video input 4002 to the output of encoding / decoding component 4004 to produce an encoded / decoded representation of the video. Encoding / decoding techniques are therefore sometimes referred to as video compression or video transcoding techniques. The output of encoding / decoding component 4004 may be stored or transmitted via a communication connection, such as that represented by component 4006. The bitstream (or encoded / decoded) representation of the video received at input 4002, whether stored or communicated, may be used by component 4008 to generate pixel values or displayable video that is sent to display interface 4010. The process of generating user-visible video from the bitstream representation is sometimes referred to as video decompression. Furthermore, although some video processing operations are referred to as “encoding / decoding” operations or tools, it should be understood that encoding / decoding tools or operations used at the encoder will be followed by corresponding decoding tools or operations that inversely reproduce the encoding / decoding results performed by the decoder.
[0442] Examples of peripheral bus interfaces or display interfaces may include Universal Serial Bus (USB), High Definition Multimedia Interface (HDMI), or DisplayPort, etc. Examples of storage interfaces include Serial Advanced Technology Attachment (SATA), Peripheral Component Interconnect (PCI), Integrated Drive Electronics (IDE), etc. The embodiments described in this disclosure can be embodied in a variety of electronic devices, such as mobile phones, laptops, smartphones, or other devices capable of performing digital data processing and / or video display.
[0443] Figure 4 This is a block diagram of an example video processing apparatus 4100. Apparatus 4100 can be used to implement one or more methods described herein. Apparatus 4100 can be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, etc. Apparatus 4100 may include one or more processors 4102, one or more memories 4104, and video processing circuitry 4106. The processors(multiple) 4102 can be configured to implement one or more methods described in this disclosure. The memories(multiple) 4104 can be used to store data and code for implementing the methods and embodiments described herein. The video processing circuitry 4106 can be used to implement some embodiments described in this disclosure in hardware circuitry. In some embodiments, the video processing circuitry 4106 may be at least partially included in the processor 4102, such as a graphics coprocessor.
[0444] Figure 5 This is a flowchart of an example method 4200 for video processing. Method 4200 determines, in step 4202, a hypothetical reference decoder (HRD) for combining different sub-bitstreams. In step 4204, a conversion between visual media data and the bitstream is performed based on the HRD. The conversion may include encoding at the encoder, decoding at the decoder, or a combination thereof.
[0445] It should be noted that method 4200 can be implemented in an apparatus for processing video data, including a processor and a non-transitory memory having instructions thereon, such as a video encoder 4400, a video decoder 4500, and / or an encoder 4600. In this case, the instructions, when executed by the processor, cause the processor to perform method 4200. Furthermore, method 4200 can be executed by a non-transitory computer-readable medium, which includes a computer program product for use by a video encoding / decoding device. The computer program product includes computer-executable instructions stored on the non-transitory computer-readable medium, causing the video encoding / decoding device to perform method 4200 when executed by a processor.
[0446] Figure 6This is a block diagram illustrating an example video encoding / decoding system 4300 that can utilize embodiments of the present disclosure. The video encoding / decoding system 4300 may include a source device 4310 and a destination device 4320. The source device 4310 generates encoded video data, and this source device 4310 may be referred to as a video encoding device. The destination device 4320 can decode the encoded video data generated by the source device 4310, and this destination device 4320 may be referred to as a video decoding device.
[0447] Source device 4310 may include video source 4312, video encoder 4314, and input / output (I / O) interface 4316. Video source 4312 may include sources such as video capture devices, interfaces for receiving video data from video content providers, and / or computer graphics systems for generating video data, or combinations of such sources. Video data may include one or more pictures. Video encoder 4314 encodes the video data from video source 4312 to generate a bitstream. The bitstream may include a sequence of bits forming a codec representation of the video data. The bitstream may include codec pictures and associated data. Codec pictures are codec representations of pictures. Associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. I / O interface 4316 may include a modulator / demodulator (modem) and / or transmitter. Encoded video data may be transmitted directly to destination device 4320 via network 4330 through I / O interface 4316. Encoded video data may also be stored on storage medium / server 4340 for access by destination device 4320.
[0448] The destination device 4320 may include an I / O interface 4326, a video decoder 4324, and a display device 4322. The I / O interface 4326 may include a receiver and / or a modem. The I / O interface 4326 may acquire encoded video data from the source device 4310 or the storage medium / server 4340. The video decoder 4324 may decode the encoded video data. The display device 4322 may display the decoded video data to a user. The display device 4322 may be integrated with the destination device 4320 or may be external to the destination device 4320, wherein the destination device 4320 may be configured to interface with an external display device.
[0449] The video encoder 4314 and the video decoder 4324 can operate according to video compression standards, such as the High Efficiency Video Codec (HEVC) standard, the Multi-Functional Video Codec (VVM) standard, and other existing and / or further standards.
[0450] Figure 7 This is a block diagram illustrating an example of a video encoder 4400, which can be... Figure 6 The system 4300 shown includes a video encoder 4314. The video encoder 4400 can be configured to perform any or all embodiments of this disclosure. The video encoder 4400 includes multiple functional components. The embodiments described in this disclosure can be shared among the various components of the video encoder 4400. In some examples, a processor can be configured to perform any or all embodiments described in this disclosure.
[0451] The functional components of the video encoder 4400 may include a segmentation unit 4401; a prediction unit 4402, which may include a mode selection unit 4403, a motion estimation unit 4404, a motion compensation unit 4405, and an intra-frame prediction unit 4406; a residual generation unit 4407; a transform processing unit 4408; a quantization unit 4409; an inverse quantization unit 4410; an inverse transform unit 4411; a reconstruction unit 4412; a buffer 4413; and an entropy coding unit 4414.
[0452] In other examples, the video encoder 4400 may include more, fewer, or different functional components. In one example, the prediction unit 4402 may include an intra-block copy (IBC) unit. The IBC unit can perform prediction in an IBC mode, where at least one reference picture is the picture in which the current video block is located.
[0453] Furthermore, some components such as the motion estimation unit 4404 and the motion compensation unit 4405 can be highly integrated, but for illustrative purposes, they are shown separately in the example of the video encoder 4400.
[0454] The segmentation unit 4401 can segment an image into one or more video blocks. The video encoder 4400 and the video decoder 4500 can support various video block sizes.
[0455] The mode selection unit 4403 can select one of several encoding / decoding modes (intra-frame encoding / decoding or inter-frame encoding / decoding), for example, based on error results, and provide the resulting intra-frame or inter-frame encoded / decoded block to the residual generation unit 4407 to generate residual block data, and to the reconstruction unit 4412 to reconstruct the coded block for use as a reference image. In some examples, the mode selection unit 4403 can select an intra-frame / inter-frame joint prediction (CIIP) mode, where prediction is based on inter-frame prediction signals and intra-frame prediction signals. In the case of inter-frame prediction, the mode selection unit 4403 can also select a resolution for the block based on motion vectors (e.g., sub-pixel precision or integer pixel precision).
[0456] To perform inter-frame prediction on the current video block, motion estimation unit 4404 can generate motion information for the current video block by comparing one or more reference frames from buffer 4413 with the current video block. Motion compensation unit 4405 can determine the predicted video block for the current video block based on the motion information and decoded samples of images from buffer 4413 other than the image associated with the current video block.
[0457] The motion estimation unit 4404 and the motion compensation unit 4405 can perform different operations on the current video block, for example, depending on whether the current video block is in an I-band, P-band, or B-band.
[0458] In some examples, motion estimation unit 4404 can perform unidirectional prediction on the current video block, and can search reference images in list 0 or list 1 to find a reference video block for the current video block. Motion estimation unit 4404 can then generate a reference index indicating the reference image in list 0 or list 1, where the reference image contains the reference video block and a motion vector indicating the spatial displacement between the current video block and the reference video block. Motion estimation unit 4404 can output the reference index, prediction direction indicator, and motion vector as motion information for the current video block. Motion compensation unit 4405 can generate a predicted video block for the current block based on the reference video block indicated by the motion information of the current video block.
[0459] In other examples, motion estimation unit 4404 can perform bidirectional prediction on the current video block. Motion estimation unit 4404 can search for reference images in list 0 to find a reference video block for the current video block, and can also search for reference images in list 1 to find another reference video block for the current video block. Motion estimation unit 4404 can then generate reference indices indicating the reference images containing the reference video blocks in lists 0 and 1, and motion vectors indicating the spatial displacement between the reference video blocks and the current video block. Motion estimation unit 4404 can output the reference index and motion vector of the current video block as motion information for the current video block. Motion compensation unit 4405 can generate a predicted video block for the current video block based on the reference video blocks indicated by the motion information of the current video block.
[0460] In some examples, the motion estimation unit 4404 can output a complete set of motion information for use in the decoder's decoding process. In some examples, the motion estimation unit 4404 may not output a complete set of motion information for the current video. Instead, the motion estimation unit 4404 can reference the motion information of another video block to transmit the motion information of the current video block via a signal. For example, the motion estimation unit 4404 may determine that the motion information of the current video block is sufficiently similar to the motion information of neighboring video blocks.
[0461] In one example, the motion estimation unit 4404 may indicate a value to the video decoder 4500 in the syntax structure associated with the current video block, which indicates that the current video block has the same motion information as another video block.
[0462] In another example, motion estimation unit 4404 may identify another video block and motion vector difference (MVD) in the syntax structure associated with the current video block. The motion vector difference indicates the difference between the motion vector of the current video block and the motion vector of the indicated video block. Video decoder 4500 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.
[0463] As discussed above, the video encoder 4400 can transmit motion vectors via signaling in a predictive manner. Two examples of predictive signaling techniques that can be implemented by the video encoder 4400 include Advanced Motion Vector Prediction (AMVP) and Merge Pattern Signaling.
[0464] Intra-prediction unit 4406 can perform intra-prediction on the current video block. When intra-prediction unit 4406 performs intra-prediction on the current video block, it can generate prediction data for the current video block based on decoded samples of other video blocks in the same frame. The prediction data for the current video block can include the predicted video block and various syntax elements.
[0465] The residual generation unit 4407 can generate residual data for the current video block by subtracting (or more) predicted video blocks from the current video block. The residual data for the current video block may include residual video blocks corresponding to different sample components of the samples in the current video block.
[0466] In other examples, such as in skip mode, there may be no residual data for the current video block, and the residual generation unit 4407 may not perform subtraction operations.
[0467] The transform processing unit 4408 can generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to the residual video blocks associated with the current video block.
[0468] After the transform processing unit 4408 generates a transform coefficient video block associated with the current video block, the quantization unit 4409 can quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values associated with the current video block.
[0469] The inverse quantization unit 4410 and the inverse transform unit 4411 can apply inverse quantization and inverse transform to the transform coefficient video block respectively to reconstruct the residual video block from the transform coefficient video block. The reconstruction unit 4412 can add the reconstructed residual video block to the corresponding samples of one or more predicted video blocks generated by the prediction unit 4402 to produce a reconstructed video block associated with the current block for storage in the buffer 4413.
[0470] After the video block is reconstructed by reconstruction unit 4412, a loop filtering operation can be performed to reduce video block artifacts in the video block.
[0471] Entropy encoding unit 4414 can receive data from other functional components of video encoder 4400. When entropy encoding unit 4414 receives data, it can perform one or more entropy encoding operations to generate entropy-encoded data and output a bitstream including the entropy-encoded data.
[0472] Figure 8 This is a block diagram illustrating an example of a video decoder 4500, which can be... Figure 6 The system 4300 shown includes a video decoder 4324. The video decoder 4500 can be configured to perform any or all embodiments of this disclosure. In the example shown, the video decoder 4500 includes multiple functional components. The embodiments described in this disclosure can be shared among the various components of the video decoder 4500. In some examples, a processor can be configured to perform any or all embodiments described in this disclosure.
[0473] In the example shown, the video decoder 4500 includes an entropy decoding unit 4501, a motion compensation unit 4502, an intra-frame prediction unit 4503, an inverse quantization unit 4504, an inverse transform unit 4505, a reconstruction unit 4506, and a buffer 4507. In some examples, the video decoder 4500 can perform a decoding process that is generally contrasted with the encoding process described with respect to the video encoder 4400.
[0474] The entropy decoding unit 4501 can retrieve the encoded bitstream. The encoded bitstream may include entropy-encoded video data (e.g., encoded video data blocks). The entropy decoding unit 4501 can decode the entropy-encoded video data, and based on the entropy-decoded video data, the motion compensation unit 4502 can determine motion information including motion vectors, motion vector precision, reference image list index, and other motion information. The motion compensation unit 4502 can determine this information, for example, by executing AMVP and Merge modes.
[0475] The motion compensation unit 4502 can generate motion compensation blocks, possibly performing interpolation based on an interpolation filter. The identifier of the interpolation filter to be used, with sub-pixel accuracy, can be included in the syntax element.
[0476] The motion compensation unit 4502 can use interpolation filters, such as those used by the video encoder 4400 during the encoding of a video block, to calculate sub-integer pixels for a reference block. The motion compensation unit 4502 can determine the interpolation filter used by the video encoder 4400 based on the received syntax information, and the motion compensation unit 4502 can use the interpolation filter to generate a prediction block.
[0477] The motion compensation unit 4502 may use some syntax information to determine the size of the blocks of (multiple) frames and / or (multiple) stripes used to encode the encoded video sequence, segmentation information describing how each macroblock of the picture of the encoded video sequence is segmented, a mode indicating how each segment is encoded, one or more reference frames (and a list of reference frames) for each inter-frame codec block, and other information for decoding the encoded video sequence.
[0478] Intra-prediction unit 4503 can use, for example, an intra-prediction mode received in the bitstream to form prediction blocks from spatially adjacent blocks. Inverse quantization unit 4504 inverse quantizes (i.e., dequantizes) the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 4501. Inverse transform unit 4505 applies the inverse transform.
[0479] The reconstruction unit 4506 can add the residual block to the corresponding predicted block generated by the motion compensation unit 4502 or the intra-frame prediction unit 4503 to form a decoded block. If necessary, a deblocking filter can also be used to filter the decoded block to remove block artifacts. The decoded video block is then stored in a buffer 4507, which provides a reference block for subsequent motion compensation / intra-frame prediction, and the buffer 4507 also generates decoded video for presentation on a display device.
[0480] Figure 9This is a schematic diagram of an example encoder 4600. Encoder 4600 is suitable for implementing VVC techniques. Encoder 4600 includes three loop filters: a deblocking filter (DF) 4602, a sample adaptive compensation (SAO) 4604, and an adaptive loop filter (ALF) 4606. Unlike DF 4602, which uses predefined filters, SAO 4604 and ALF 4606 utilize the original samples of the current image, respectively, by adding an offset and by applying a finite impulse response (FIR) filter, and by utilizing the side information from the encoding and decoding through signal transmission offset and filter coefficients to reduce the mean square error between the original and reconstructed samples. ALF 4606 is located in the last processing stage of each image and can be considered as a tool for attempting to capture and repair artifacts caused by previous stages.
[0481] The encoder 4600 also includes an intra-frame prediction component 4608 and a motion estimation / compensation (ME / MC) component 4610 configured to receive input video. The intra-frame prediction component 4608 is configured to perform intra-frame prediction, while the ME / MC component 4610 is configured to perform inter-frame prediction using a reference image obtained from a reference image buffer 4612. Residual blocks from inter-frame or intra-frame prediction are fed into a transform (T) component 4614 and a quantization (Q) component 4616 to generate quantized residual transform coefficients, which are then fed into an entropy encoding / decoding component 4618. The entropy encoding / decoding component 4618 entropy-encodes and decodes the prediction results and quantized transform coefficients and transmits them to a video decoder (not shown). The quantization component output from the quantization component 4616 can be fed into an inverse quantization (IQ) component 4620, an inverse transform component 4622, and a reconstruction (REC) component 4624. REC component 4624 is able to output images to DF 4602, SAO 4604 and ALF 4606 for filtering before these images are stored in reference image buffer 4612.
[0482] The following provides a list of preferred solutions as examples.
[0483] The following solutions illustrate examples of the embodiments discussed herein.
[0484] 1. A method for processing media data, comprising: determining a hypothetical reference decoder (HRD) for combining different sub-bitstreams; and performing a conversion between visual media data and bitstreams based on said HRD.
[0485] 2. According to the method described in Solution 1, for sub-bitstream 1 to sub-bitstream N, network abstraction layer (NAL) units with the same nal_unit_type in different sub-bitstreams are all considered to be of the same type in the joint HRD.
[0486] 3. The method according to any one of solutions 1-2, wherein when multiple HRDs are combined, bitstream consistency is for the combined HRD, not for individual HRDs.
[0487] 4. The method according to any one of solutions 1-3, wherein two or more of the atlas HRD, the base mesh HRD, and the displacement HRD are combined.
[0488] 5. The method according to any one of solutions 1-4, wherein one or more syntax elements are transmitted by signaling in a sub-bitstream to indicate the maximum allowed number of reordered images.
[0489] 6. The method according to any one of solutions 1-5, wherein the maximum allowed number of reordered images includes the maximum allowed number of output images that can precede any output image in the decoding order and follow any of the output images in the output order.
[0490] 7. The method according to any one of solutions 1-6, wherein the maximum allowed number of reordered images must be within the range of 0 to the maximum required size of the decoded image buffer of the sub-bitstream.
[0491] 8. The method according to any one of solutions 1-7, wherein one or more syntax elements are transmitted via signaling to indicate the maximum allowed number of pictures for reordering for atlas sub-bitstreams, for base grid sub-bitstreams, or for shift sub-bitstreams.
[0492] 9. The method according to any one of solutions 1-8, wherein when the sub-bitstreams have different time-domain levels, one or more syntax elements are signaled to indicate the maximum allowed number of images to be reordered for each time-domain level.
[0493] 10. The method according to any one of solutions 1-9, wherein one or more syntax elements are transmitted by signaling to indicate the maximum allowed number of pictures for reordering all sub-bitstreams.
[0494] 11. The method according to any one of solutions 1-10, wherein the maximum allowed number of reordered pictures for all sub-bitstreams is the maximum allowed number of reordered pictures for each sub-bitstream, or wherein syntax elements are signaled in the atlas parameter set extension, or wherein syntax elements are signaled in the video availability information (VUI) parameter extension.
[0495] 12. The method according to any one of solutions 1-11, wherein one or more syntax elements are transmitted by signaling in a sub-bit stream to indicate maximum delay.
[0496] 13. The method according to any one of solutions 1-12, wherein the delay is the number of images, or wherein the maximum delay is the maximum number of output images that can precede any output image in the output order and follow any of said images in the decoding order.
[0497] 14. The method according to any one of solutions 1-13, wherein one or more syntax elements are transmitted by signaling to indicate the maximum delay for the atlas sub-bit stream, the maximum delay for the base grid sub-bit stream, or the maximum delay for the shift sub-bit stream.
[0498] 15. The method according to any one of solutions 1-14, wherein when the sub-bit streams have different time-domain levels, one or more syntax elements are signaled to indicate the maximum delay for each time-domain level.
[0499] 16. The method according to any one of solutions 1-15, wherein one or more syntax elements are signaled to indicate the maximum delay for all sub-bitstreams, or wherein the maximum delay for all sub-bitstreams is the maximum value of the maximum delay for each sub-bitstream, or wherein syntax elements are signaled in atlas parameter set expansion, or wherein syntax elements are signaled in VUI parameter expansion.
[0500] 17. The method according to any one of solutions 1-16, wherein one or more syntax elements are transmitted via signaling in a bitstream to indicate the maximum allowed number of reordered pictures or the maximum delay.
[0501] 18. The method according to any one of solutions 1-17, wherein when the bitstream has sub-bitstreams 1 to N and the maximum allowed number of reordered pictures of sub-bitstream i is R(i), i = 1...N, one or more syntax elements are signaled to indicate the maximum number in R(i) (i = 1...N), or wherein when the bitstream has sub-bitstreams 1 to N and the maximum delay of sub-bitstream i is L(i), i = 1...N, one or more syntax elements are signaled to indicate the maximum number in L(i) (i = 1...N), or wherein syntax elements are signaled in atlas parameter set expansion, or wherein syntax elements are signaled in VUI parameter expansion.
[0502] 19. The method according to any one of solutions 1-18, wherein the subdivision iteration number minus 1 is transmitted via signal in the bit stream.
[0503] 20. The method according to any one of solutions 1-19, wherein the iteration count minus 1 is transmitted via signaling in the atlas sequence parameter set, atlas frame parameter set, or grid block data unit.
[0504] 21. An apparatus for processing video data, comprising: a processor; and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method according to any one of solutions 1-20.
[0505] 22. A non-transitory computer-readable medium comprising a computer program product for use by a video codec device, the computer program product including computer-executable instructions stored on the non-transitory computer-readable medium such that, when executed by a processor, the video codec device performs the method according to any one of solutions 1-20.
[0506] 23. A non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method includes: determining a hypothetical reference decoder (HRD) for combining different sub-bitstreams; and generating a bitstream based on the determination.
[0507] 24. A method for storing a bitstream of video, comprising: determining a hypothetical reference decoder (HRD) for combining different sub-bitstreams; generating a bitstream based on the determination; and storing the bitstream in a non-transitory computer-readable recording medium.
[0508] 25. A method, apparatus or system described in this disclosure.
[0509] In the described solution, the encoder conforms to the format rules by generating a codec representation based on those rules. In the described solution, the decoder parses the syntax elements in the codec representation using known information about their presence or absence, based on the format rules, to produce the decoded video.
[0510] In this disclosure, the term "video processing" can refer to video encoding, video decoding, video compression, or video decompression. For example, a video compression algorithm can be applied during the conversion from a pixel representation of a video to a corresponding bitstream representation, and vice versa. For example, the bitstream representation of the current video block can correspond to bits at co-positions or propagated at different positions in the bitstream defined by the syntax. For example, a macroblock can be encoded based on the error residual value after transformation and encoding / decoding, and can also use bits from the header and other fields in the bitstream. Furthermore, during the conversion, the decoder can parse the bitstream based on this determination, knowing whether some fields may be present or absent, as described in the solutions above. Similarly, the encoder can determine whether to include or exclude specific syntax fields, and generate the codec representation accordingly by including or excluding syntax fields from the codec representation.
[0511] The disclosed and other solutions, examples, embodiments, modules, and functional operations described herein can be implemented in digital electronic circuits, or in computer software, firmware, or hardware, including the structures disclosed herein and their structural equivalents, or in combinations thereof. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more computer program instruction modules encoded on a computer-readable medium for execution by or control of the operation of a data processing apparatus. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a storage device, a material composition affecting machine-readable propagation signals, or a combination thereof. The term "data processing apparatus" includes all means, devices, and machines for processing data, including, for example, a programmable processor, a computer, or multiple processors or computers. In addition to hardware, the apparatus may also include code that creates an execution environment for an associated computer program, for example, code constituting processor firmware, a protocol stack, a database management system, an operating system, or a combination thereof. Propagation signals are artificially generated signals, such as machine-generated electrical signals, optical signals, or electromagnetic signals, which are generated to encode information to be transmitted to a suitable receiver device.
[0512] Computer programs (also known as programs, software, software applications, scripts, or code) can be written in any programming language, including compiled or interpreted languages, and can be deployed in any form, including standalone programs or modules, components, subroutines, or other units suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the related program, or in multiple co-located files (e.g., a file storing one or more modules, subroutines, or code portions). A computer program can be deployed to execute on one computer or on multiple computers located at a single site or distributed across multiple sites and interconnected by a communications network.
[0513] The processing and logic flows described in this disclosure can be executed by one or more programmable processors that execute one or more computer programs to perform functions by manipulating input data and generating outputs. The processing and logic flows can also be executed by special-purpose logic circuitry, and the apparatus can also be implemented as special-purpose logic circuitry, such as field-programmable gate arrays (FPGAs) or application-specific integrated circuits (ASICs).
[0514] Processors suitable for executing computer programs include, for example, general-purpose and special-purpose microprocessors, and any one or more processors in any type of digital computer. Typically, the processor receives instructions and data from read-only memory or random access memory, or both. The basic components of a computer are a processor that executes instructions and one or more storage devices that store the instructions and data. Typically, a computer will also include one or more mass storage devices for storing data, such as magnetic disks, magneto-optical disks, or optical disks. However, a computer does not necessarily have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and storage devices, including, for example, semiconductor storage devices such as EPROM, EEPROM, and flash memory devices; magnetic disks, such as internal hard disks or removable hard disks; magneto-optical disks; and CD-ROMs and DVD-ROMs. The processor and memory may be supplemented by or incorporated into special-purpose logic circuitry.
[0515] While this disclosure contains numerous details, these details should not be construed as limiting any subject matter or the scope of the claims, but rather as descriptions of features specific to particular embodiments of this disclosure. Certain features described in the context of individual embodiments in this disclosure may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented separately in multiple embodiments, or in any suitable sub-combination. Furthermore, although features may function in certain combinations as described above, and even were originally claimed in this manner, in some cases one or more features in a claimed combination may be removed from that combination, and the claimed combination may be for sub-combinations or variations thereof.
[0516] Similarly, although operations are depicted in a specific order in the accompanying drawings, this should not be construed as requiring such operations to be performed sequentially in the particular order or sequence shown, or requiring all shown operations to be performed in order to achieve the desired result. Furthermore, the partitioning of various system components in the embodiments described in this disclosure should not be construed as requiring such partitioning in all embodiments.
[0517] Only a few implementations and examples are described, and other implementations, improvements and variations may be made based on what is described and shown in this disclosure.
[0518] When there is no intermediary component (other than a line, trace, or other medium between the first and second components), the first component is directly coupled to the second component. When there is an intermediary component other than a line, trace, or other medium between the first and second components, the first component is indirectly coupled to the second component. The term "coupled" and its variations include direct coupling and indirect coupling. The use of the term "approximately" means including a range of ±10% of the following figures, unless otherwise specified.
[0519] While several embodiments have been provided in this disclosure, it should be understood that the disclosed systems and methods may be embodied in many other specific forms without departing from the spirit or scope of this disclosure. The present examples are intended to be illustrative rather than restrictive and are not intended to be limited to the details set forth herein. For example, various elements or components may be combined or integrated into another system, or certain features may be omitted or not implemented.
[0520] Furthermore, the technologies, systems, subsystems, and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, technologies, or methods without departing from the scope of this disclosure. Other items shown or discussed as couplings may be directly connected or indirectly coupled or communicated through some interface, device, or intermediate component (whether electrical, mechanical, or otherwise). Those skilled in the art can identify examples of other changes, substitutions, and modifications, which may be made without departing from the spirit and scope of this disclosure.
Claims
1. A method for processing media data, comprising: Determine the hypothetical reference decoder (HRD) for different sub-bit streams. as well as The conversion between visual media data and bitstream is performed based on the HRD.
2. The method of claim 1, wherein the non-video sub-bitstream is transmitted as at least a portion of the atlas sub-bitstream.
3. The method according to any one of claims 1-2, wherein instead of encoding and decoding the basic grid sub-bitstream, the basic grid data is carried in the atlas sub-bitstream.
4. The method according to any one of claims 1-3, wherein the underlying grid data is required to have the same intra / inter-frame encoding / decoding type and / or reference frame structure as the atlas sub-bitstream.
5. The method according to any one of claims 1-4, wherein instead of encoding and decoding the shifted sub-bit stream, the shift data is carried in the atlas sub-bit stream.
6. The method according to any one of claims 1-5, wherein the displacement data is required to have the same intra / inter-frame encoding / decoding type and / or reference frame structure as the atlas sub-bitstream.
7. The method according to any one of claims 1-6, wherein the atlas sub-bitstream carries both the base grid data and the displacement data.
8. The method according to any one of claims 1-7, wherein the base grid data and the displacement data both have the same intra / inter-frame encoding / decoding type and / or reference frame structure as the atlas sub-bitstream.
9. The method according to any one of claims 1-8, wherein the incremental value of the reference quantization parameter (Qp) is transmitted via signal transmission.
10. The method according to any one of claims 1-9, wherein the reference Qp minus N is transmitted via signal transmission.
11. The method according to any one of claims 1-10, wherein the reference Qp minus N is transmitted via a signal, wherein N equals 49.
12. The method according to any one of claims 1-10, wherein the value of Qp is greater than 0, regardless of whether Qp is transmitted by signal or derived.
13. The method according to any one of claims 1-12, wherein the minimum Qp value is equal to 1.
14. The method according to any one of claims 1-13, wherein a limiting operator is applied to derive the Qp value.
15. The method according to any one of claims 1-14, wherein the clipping operator is applied before the Qp value is used, and wherein the clipping operator includes Clip3(minQp, maxQp, Qp), where minQp equals 1, maxQp equals 100, and Qp represents the Qp value before clipping.
16. The method according to any one of claims 1-15, wherein the conversion comprises encoding the visual media data into the bitstream.
17. The method according to any one of claims 1-15, wherein the conversion comprises decoding the visual media data from the bitstream.
18. An apparatus for processing video data, comprising: processor; and a non-transitory memory thereon having instructions, wherein the instructions, when executed by the processor, cause the processor to perform the method according to any one of claims 1-17.
19. A non-transitory computer-readable medium comprising a computer program product for use by a video codec apparatus, the computer program product comprising computer-executable instructions stored on the non-transitory computer-readable medium such that, when executed by a processor, the video codec apparatus performs the method according to any one of claims 1-17.
20. A non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method includes: Determine the hypothetical reference decoder (HRD) for different sub-bit streams. as well as Based on the determination, a bit stream is generated.
21. A method for storing a video bitstream, comprising: Determine the hypothetical reference decoder (HRD) for different sub-bit streams. Based on the determination, a bit stream is generated; as well as The bit stream is stored in a non-transitory computer-readable recording medium.
