Coding and decoding method and device

By dividing the polygonal mesh into sub-mesh and generating a sub-mesh header, the problem of low encoding efficiency in existing technologies is solved, and adaptive and efficient polygonal mesh compression is achieved.

CN122002035APending Publication Date: 2026-05-08TENCENT AMERICA LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511506353.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2025-08-18
Filing Date
2025-10-21
Publication Date
2026-05-08

AI Technical Summary

Technical Problem

In existing technologies, polygon mesh encoding based on connected components is inefficient and cannot effectively and adaptively compress.

Method used

The polygonal mesh is divided into multiple sub-mesh, and a sub-mesh header is generated according to the mesh face type, resulting in a bitstream that includes the polygonal mesh and the sub-mesh header.

Benefits of technology

It improves encoding efficiency and achieves adaptive and efficient polygon mesh compression.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN122002035A_ABST
    Figure CN122002035A_ABST
Patent Text Reader

Abstract

A method of encoding performed by at least one processor includes: receiving a polygon mesh including a plurality of vertices defining a plurality of faces; determining the grid surface type of the polygonal grid; dividing the polygonal grid into a plurality of sub-grids; generating a sub-grid header for at least one sub-grid of the plurality of sub-grids according to at least a grid face type of the polygonal grid; and generating a bitstream including the polygon mesh and the sub-mesh header.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This disclosure relates to video encoding and decoding technologies. More specifically, this disclosure relates to encoding and decoding methods and devices. Background Technology

[0002] Polygonal meshes are typically composed of several connected components (CCs), which may have different properties. Therefore, it is beneficial to group them into different CC groups (referred to as slices in this disclosure) based on their properties, allowing them to be adaptively and efficiently compressed. Grouping them into different sub-mesh groups based on their CC properties can also be beneficial, allowing them to be adaptively and efficiently compressed. Because these connected components may have different properties, encoding them as a whole is not efficient. Summary of the Invention

[0003] According to one aspect of this disclosure, an encoding method is provided, the method comprising: receiving a polygonal mesh including a plurality of vertices defining a plurality of faces; determining a mesh face type of the polygonal mesh; dividing the polygonal mesh into a plurality of submesh; generating a submesh header for at least one of the plurality of submesh according to at least the mesh face type of the polygonal mesh; and generating a bit stream including the polygonal mesh and the submesh header.

[0004] According to one aspect of this disclosure, a decoding method is provided, the method comprising: receiving a bit stream including a polygonal grid and a subgrid header, the polygonal grid being divided into a plurality of subgrids; and decoding at least one of the plurality of subgrids according to the subgrid header, wherein the subgrid header is generated based on the grid face type of the polygonal grid.

[0005] According to one aspect of this disclosure, a method for storing or transmitting a bit stream is provided, the bit stream being generated according to the above-described encoding method, or the bit stream being decoded according to the above-described decoding method.

[0006] According to one aspect of this disclosure, an encoding / decoding apparatus is provided, the apparatus including a memory for storing instructions and a processor in communication with the memory, wherein, when the processor executes the instructions, the processor is configured to cause the apparatus to perform the above-described encoding method or the above-described decoding method.

[0007] In this application, the embodiments of this disclosure divide connected components into sub-mesh or slices according to the characteristics of the connected components, and apply a high-level syntax for polygon mesh compression, which facilitates adaptive and efficient compression, thereby improving coding efficiency. Attached Figure Description

[0008] Further features, properties, and various advantages of the disclosed subject matter will become more apparent from the following detailed description and accompanying drawings, in which:

[0009] Figure 1 This is a schematic diagram of a communication system according to an embodiment of the present disclosure.

[0010] Figure 2 This is a schematic diagram of a streaming system according to an embodiment of the present disclosure.

[0011] Figure 3 This is a schematic illustration of an example mesh encoder according to an embodiment of the present disclosure.

[0012] Figure 4 This is a flowchart illustrating an example process for encoding a polygonal mesh according to an embodiment of this disclosure.

[0013] Figure 5 An example processing for geometry encoding according to an embodiment of this disclosure is shown.

[0014] Figure 6 An example processing for how each slice is encoded is shown according to an embodiment of this disclosure.

[0015] Figures 7 to 9 The lossless results of adding a geometric slice layer (without adaptive encoding mode) according to an embodiment of this disclosure are shown compared to TM 5.0a using the default configuration.

[0016] Figures 10 to 12 The lossless results of adding geometric slicing layers with adaptive coding mode according to an embodiment of this disclosure are shown relative to the TM 5.0 per-mesh configuration.

[0017] Figures 13 to 15 Additional lossless results are shown for adding a geometric slice layer (without adaptive encoding mode) according to an embodiment of this disclosure, relative to TM 5.0a using the default configuration.

[0018] Figures 16 to 18 Additional lossless results are shown for adding geometric slicing layers and adaptive coding modes according to an embodiment of this disclosure relative to the TM 5.0 per-mesh configuration.

[0019] Figure 19 and Figure 20 The results of dual-degree-26c6346a relative to P01T0 according to an embodiment of the present disclosure are shown.

[0020] Figure 21 and Figure 22The results of parallelogram prediction -a8fc726b relative to divisibility -26c6346a according to an embodiment of this disclosure are shown.

[0021] Figure 23 and Figure 24 The results of reflection prediction -6f012e07 relative to parallelogram prediction -a8fc726b according to an embodiment of the present disclosure are shown.

[0022] Figure 25 The results of the special UV treatment -9a10dee4 relative to the reflection prediction -6f012e07 according to an embodiment of the present disclosure are shown.

[0023] Figures 26 to 28 The results of the test model v1.0 relative to P01 (non-destructive) according to an embodiment of this disclosure are shown.

[0024] Figure 29 Example performance of an integrated symmetric coding tool according to an embodiment of this disclosure is shown.

[0025] Figure 30 An example of lossy coding performance of a test model 1.0 with integrated symmetric coding tools according to an embodiment of this disclosure is shown.

[0026] Figure 31 An example computer system according to an embodiment of this disclosure is shown. Detailed Implementation

[0027] The following detailed description of the exemplary embodiments is with reference to the accompanying drawings. The same reference numerals in different drawings may identify the same or similar elements.

[0028] The foregoing disclosure provides illustrations and descriptions, but is not intended to be exhaustive or to limit the implementation to the exact forms disclosed. Modifications and variations can be made based on the foregoing disclosure, or modifications and variations can be derived from practice of the implementation. Furthermore, one or more features or components of one embodiment may be incorporated into or combined with another embodiment (or one or more features of another embodiment). Additionally, in the flowcharts and descriptions of operations provided below, it should be understood that one or more operations may be omitted, one or more operations may be added, one or more operations may be performed simultaneously (at least partially), and the order of one or more operations may be switched.

[0029] It will be apparent that the systems and / or methods described herein can be implemented in various forms of hardware, firmware, or a combination of hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods is not limited in its implementation. Therefore, the operation and behavior of the systems and / or methods are described herein without reference to any specific software code—it should be understood that software and hardware can be designed to implement the systems and / or methods based on the descriptions herein.

[0030] Even if specific combinations of features are listed in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of possible implementations. In fact, many of these features can be combined in ways not specifically listed in the claims and / or not disclosed in the specification. While each dependent claim listed below may directly refer to only one claim, the disclosure of possible implementations includes combinations of each dependent claim with every other claim in the claim set.

[0031] Unless explicitly stated otherwise, no element, action, or instruction used herein should be construed as critical or necessary. Furthermore, as used herein, the articles “a” and “an” are intended to include one or more items and may be used interchangeably with “one or more.” The term “an” or similar language is used when referring to only one item. Furthermore, as used herein, the terms “has,” “have,” “having,” “include,” “including,” etc., are intended to be open-ended terms. Furthermore, unless explicitly stated otherwise, the phrase “based on” is intended to mean “at least partially based on.” Additionally, expressions such as “at least one of [A] and [B]” or “at least one of [A] or [B]” should be understood to include only A, only B, or both A and B.

[0032] Throughout this specification, references to "one embodiment," "implementation," or similar language mean that a particular feature, structure, or characteristic described in connection with the indicated embodiment is included in at least one embodiment of this solution. Therefore, throughout this specification, the phrases "in one embodiment," "in an embodiment," and similar language may, but not necessarily all, refer to the same embodiment.

[0033] Furthermore, the features, advantages, and characteristics described in this disclosure may be combined in any suitable manner in one or more embodiments. Based on the description herein, those skilled in the art will recognize that this disclosure may be practiced without one or more specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of this disclosure.

[0034] Reference Figures 1 to 2 This describes one or more embodiments of the encoding and decoding structures for implementing the present disclosure.

[0035] Figure 1 A simplified block diagram of a communication system 100 according to an embodiment of the present disclosure is shown. System 100 may include at least two terminals 110 and 120 interconnected via a network 150. For unidirectional data transmission, the first terminal 110 may encode video data, including grid data, at its local location for transmission to the other terminal 120 via the network 150. The second terminal 120 may receive the encoded video data from the other terminal from the network 150, decode the encoded data, and display the recovered video data. Unidirectional data transmission is common in media service applications, etc.

[0036] Figure 1 A second pair of terminals 130, 140 is shown, which are provided to support bidirectional transmission of encoded video, for example, during video conferencing. For bidirectional data transmission, each terminal 130, 140 can encode video data captured at a local location for transmission to the other terminal via network 150. Each terminal 130, 140 can also receive encoded video data transmitted by the other terminal, decode the encoded data, and display the recovered video data on a local display device.

[0037] exist Figure 1In this context, terminals 110 to 140 can be, for example, servers, personal computers, smartphones, and / or any other type of terminal. For example, terminals (110 to 140) can be laptop computers, tablet computers, media players, and / or dedicated video conferencing equipment. Network 150 refers to any number of networks transmitting encoded video data among terminals 110 to 140, including, for example, wired and / or wireless communication networks. Communication network 150 can exchange data in circuit-switched and / or packet-switched channels. Representative networks include telecommunications networks, local area networks (LANs), wide area networks (WANs), and / or the Internet. For the purposes of this discussion, unless otherwise stated below, the architecture and topology of network 150 may be irrelevant to the operation of this disclosure.

[0038] Figure 2 The placement of a video encoder and decoder in a streaming environment is illustrated as an example of an application to the disclosed subject matter. The disclosed subject matter can be used with other video-enabled applications, including, for example, video conferencing, digital television, and storing compressed video on digital media including CDs (Compact Discs), DVDs (Digital Video Disks), memory sticks, etc.

[0039] like Figure 2 As shown, the streaming system 200 may include a capture subsystem 213, which includes a video source 201 and an encoder 203. The streaming system 200 may also include at least one streaming server 205 and / or at least one streaming client 206.

[0040] Video source 201 can create a stream 202, for example, including a 3D mesh and metadata associated with the 3D mesh. Video source 201 may include, for example, a 3D sensor (e.g., a depth sensor) or a 3D imaging technique (e.g., a digital camera device) and a computing device configured to generate the 3D mesh using data received from the 3D sensor or 3D imaging technique. The sample stream 202, which may have a high data volume compared to an encoded video bitstream, can be processed by an encoder 203 coupled to video source 201. Encoder 203 may include hardware, software, or a combination thereof to implement or enforce aspects of the disclosed subject matter as described in more detail below. Encoder 203 can also generate an encoded video bitstream 204. The encoded video bitstream 204, which may have a lower data volume compared to the uncompressed stream 202, can be stored on a streaming server 205 for future use. One or more streaming clients 206 and 207 can access streaming server 205 to retrieve video bitstreams 208 and 209, which may be copies of the encoded video bitstream 204.

[0041] Streaming client 207 may include video decoder 210 and display 212. Video decoder 210 may, for example, decode video bitstream 209 as an incoming copy of encoded video bitstream 204, and create outgoing video sample stream 211 that can be displayed on display 212 or another presentation device (not depicted). In some streaming systems, video bitstreams 204, 208, and 209 may be encoded according to certain video encoding / compression standards.

[0042] Figure 3 An example trellis encoder 300 is shown. Encoder 300 can perform V-DMC processing for decimation and reparameterization before encoding the bitstream. Figure 3 As shown, the input mesh can undergo decimation 302 and UV reparameterization 304. Subsequently, geometry reparameterization 306 is performed, which includes base mesh refinement and displacement generation. The output of the base mesh refinement is provided to the Draco encoder 308 to generate the base mesh binary. The output of the displacement generation is provided to the displacement encoder 310 to generate the displacement binary. The output of the displacement encoder 310 is provided to the texture transfer 312 and the image encoder 314 to generate the texture binary. The base mesh binary, texture binary, and displacement binary can be included in a bitstream 316. In one or more examples, texture coordinates or UV coordinates (often simply referred to as UV) map vertices to their positions on the texture through a process called “UV mapping.” The UV defines a 2D (two-dimensional, 2D) position in texture space for each vertex in the mesh.

[0043] Different grid cells (CCs) have different characteristics, so encoding them as a whole is inefficient. Dividing them into subgrids based on their characteristics improves encoding efficiency. However, dividing CCs into subgrids requires high-level syntax for grids and slices.

[0044] The implementation involves a high-level syntax for polygon mesh compression.

[0045] According to one or more implementations, this syntax can be applied to any property encoding a polygon mesh, including positional and non-positional properties. In one or more examples, a high-level syntax for positional properties is provided in the table below.

[0046]

[0047] Table 1

[0048] In one or more examples, “mesh_face_type” is encoded using 2 bits, and the correspondence between the codeword and the face type is given in the table below, which also includes the corresponding “min_face_degree” for each face type (face_type).

[0049]

[0050] Table 2

[0051] In one or more examples, the binary 0s and 1s in the codeword above can be flipped.

[0052]

[0053] Table 3

[0054] In one or more examples, "repeated_cc" indicates whether all CCs in the subgrid have the same connectivity; "prediction_strategy" is encoded using 4 bits and corresponds to the strategy used to predict the location; "indices_coding_strategy" is encoded using 1 bit, where 0 indicates the polygonal fan method and 1 indicates the two-degree method; "traversal_strategy" is encoded using 2 bits and corresponds to the traversal strategy used in the polygonal fan method. In one or more examples, the prediction strategy can be a parallelogram prediction strategy.

[0055] The implementation also relates to a high-level syntax for geometric encoding in polygon mesh compression.

[0056] According to one or more implementations, the syntax can be applied to encode the geometry of a polygonal mesh.

[0057]

[0058]

[0059]

[0060]

[0061]

[0062] Table 4

[0063] In one or more examples, the prefix "gmh" represents "geometric mesh header," the prefix "gsh" represents "geometric slice header," the prefix "sps" represents "sequence parameter set," and the prefix "gps" represents "geometric parameter set." In one or more examples, a unidirectional prediction mode may indicate that vertices can be predicted using a set of vertices (e.g., left vertex) based on a prediction strategy (e.g., parallelogram prediction). In one or more examples, a multidirectional prediction mode may indicate that vertices can be predicted using two sets of vertices (e.g., left vertex and right vertex) based on a prediction strategy.

[0064] Figure 4 This is a flowchart of an example process 400 for encoding a polygonal mesh. The process can begin at operation S402, where a polygonal mesh is received. The process proceeds to operation S404, where the mesh face type of the polygonal mesh is determined. The process proceeds to operation S406, where the polygonal mesh is divided into multiple meshes. The process proceeds to operation S408, where a submesh header is generated for at least one of the multiple submeshes based on the mesh face type. The process proceeds to operation S410, where a bitstream including the polygonal mesh and the submesh headers is generated.

[0065] In one or more examples, it is possible to determine the basis. Figure 4 The bitstream generated by the process shown in the diagram undergoes decoding. The decoder can receive the bitstream and extract the subgrid headers included in the bitstream. The decoder can decode at least one subgrid of the polygonal grid included in the bitstream based on the subgrid headers and any additional information included in the subgrid headers.

[0066] The implementation involves a high-level syntax for geometric mesh portions and geometric slices, as well as a geometric slice encoder and decoder. The geometric mesh portion encoder and decoder have also been updated.

[0067] The implementation includes a method for adaptively determining the geometric index encoding of each CC in the input mesh based on the topological properties of each connected component (CC). However, alternately running different code paths can affect encoding performance, so it is desirable to group the CCs into different groups according to their encoding patterns. In one or more examples, a group of CCs in the positional attributes is named a geometric slice, and the original geometric slice is renamed a geometric mesh portion.

[0068] By targeting all attributes Replace with The current code is refactored. For example, "encodeSlice" is renamed to "encodeMeshPart". Following the discussion in WDFG, a new structure "GeometryIntraSliceHeader" is created to signal information about the geometric slices. Encoders and decoders for the geometric slices are also created. First, classes named "GeometrySliceBaseEncoder" and "GeometrySliceBaseDecoder" are created as base classes for the geometric slice encoder and decoder, respectively. Then, two derived classes, "GeometrySlicePolygonFanEncoder" and "GeometrySliceDualDegreeEncoder", are created for the polygon fan encoding mode and the dual-degree encoding mode, respectively. Corresponding derived classes "GeometrySlicePolygonFanDecoder" and "GeometrySliceDualDegreeDecoder" are also created. The base classes implement common functions used by the derived classes, such as "encodeSliceHeader()" and "decodeSliceHeader()". Derived classes implement their own functions used by the corresponding encoding pattern.

[0069] Figure 5 A sample flowchart of process 500 for geometry encoding is shown. This process can begin at operation 502 with checks, regularization, geometry analysis, etc. The process proceeds to operation 504 to determine the encoding pattern for each CC. The process proceeds to operation 506 to group the CCs into slices according to their encoding patterns. The process proceeds to operation 508 to initialize the sorter and reorder information. The process proceeds to operation 510 to encode the mesh portion header. The process proceeds to operation 512 to encode each slice.

[0070] Figure 6 A sample flowchart of process 600 for how each slice is encoded is shown. This process can begin at operation 602 by updating the parameters _encCtx and ddInfo for the current slice. The process proceeds to operation 604 to create a polygonal fan encoder or a two-degree encoder for the current slice. The process proceeds to operation 606 to initialize the traverser and predictor for the current slice. The process proceeds to operation 608 to encode the slice header. The process proceeds to operation 610 to start the arithmetic encoder. The process proceeds to operation 612 to encode the slice according to the index encoding pattern. The process proceeds to operation 614 to stop the arithmetic encoder.

[0071] Figures 7 to 9The lossless results are shown with the addition of a geometric slice layer (without adaptive encoding mode) compared to TM5.0a using the default configuration. Figures 10 to 12 The results show the lossless results of adding a geometric slice layer with an adaptive encoding mode relative to the per-mesh configuration of TM 5.0.

[0072] Figures 13 to 15 The additional lossless results are shown with the addition of a geometric slice layer (without adaptive encoding mode) compared to TM 5.0a using the default configuration. Figures 16 to 18 The additional lossless results are shown with the addition of a geometric slicing layer and an adaptive encoding mode relative to the per-mesh configuration of TM5.0.

[0073] The figures below report the released VVM polygonal mesh codec (PMC) test model v1.0, including software changes and bug fixes compared to CfP response P01, as well as the integrated encoding tools from CfP response P03. In particular, the figures below illustrate the results and performance of the integrated lossless tools from CfP response P03.

[0074] Figure 19 and Figure 20 The results for dual-degree -26c6346a relative to P01T0 are shown.

[0075] Figure 21 and Figure 22 The results for the parallelogram prediction -a8fc726b relative to the degree -26c6346a are shown.

[0076] Figure 23 and Figure 24 The results for reflection prediction -6f012e07 versus parallelogram prediction -a8fc726b are shown.

[0077] Figure 25 The results of the special UV treatment -9a10dee4 are shown relative to the reflection prediction -6f012e07.

[0078] Figures 26 to 28 The results of the test model v1.0 relative to P01 (lossless) are shown.

[0079] Figure 29 Example performance of the integrated symmetric coding tool is shown.

[0080] Figure 30 An example of lossy coding performance of Test Model 1.0 with integrated symmetric coding tools is shown.

[0081] The techniques described above can be implemented as computer software that uses computer-readable instructions and is physically stored on one or more computer-readable media. For example, Figure 31 A computer system 3100 suitable for implementing certain embodiments of the present disclosure is shown.

[0082] Computer software can be encoded using any suitable machine code or computer language, which can be subjected to mechanisms such as assembly, compilation, and linking to create code containing instructions that can be executed directly by a computer's central processing unit (CPU), graphics processing unit (GPU), or through interpretation, microcode execution, etc.

[0083] The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, Internet of Things devices, etc.

[0084] Figure 31 The components shown for computer system 3100 are examples and are not intended to impose any limitation on the scope or functionality of computer software implementing embodiments of this disclosure. The configuration of the components should also not be construed as having any dependency or requirement relating to any one or a combination of components shown in a non-limiting embodiment of computer system 3100.

[0085] Computer system 3100 may include certain human-machine interface input devices. Such human-machine interface input devices can respond to input from one or more human users via, for example, tactile input (e.g., keystrokes, swipes, data glove movements), audio input (e.g., voice, tapping), visual input (e.g., gestures), and olfactory input (not depicted). Human-machine interface devices can also be used to capture certain media that are not necessarily directly related to human conscious input, such as audio (e.g., speech, music, ambient sounds), images (e.g., scanned images, photographic images obtained from still image capturing devices), and video (e.g., two-dimensional video, three-dimensional video including stereoscopic video).

[0086] Input human-machine interface devices may include one or more of the following (only one of each is described): keyboard 3101, mouse 3102, touchpad 3103, touch screen 3110, data glove, joystick 3105, microphone 3106, scanner 3107, and camera device 3108.

[0087] Computer system 3100 may also include certain human-machine interface output devices. Such human-machine interface output devices can stimulate the senses of one or more human users through, for example, tactile output, sound, light, and smell / taste. Such human-machine interface output devices may include tactile output devices (e.g., tactile feedback via touchscreen 3110, data gloves, or joystick 3105, but tactile feedback devices that are not used as input devices may also exist). For example, such devices may be audio output devices (e.g., speakers 3109, headphones (not depicted)); visual output devices (e.g., screens 3110, including CRT (Cathode Ray Tube) screens, LCD (Liquid Crystal Display) screens, plasma screens, OLED (Organic Light Emitting Diode) screens, each screen may or may not have touchscreen input capability, each screen may or may not have tactile feedback capability—some of the screens may be able to output two-dimensional visual output or more than three-dimensional output in a manner such as stereoscopic output; virtual reality glasses (not depicted); holographic displays and ashtrays (not depicted)); and printers (not depicted).

[0088] The computer system 3100 may also include human-accessible storage devices and their associated media, such as optical media including CD / DVD ROM (Read Only Memory, ROM) / RW 3120 with media such as CD / DVD 3121, thumb drives 3122, removable hard disk drives or solid-state drives 3123, conventional magnetic media such as magnetic tapes and floppy disks (not depicted), and devices based on dedicated ROM / ASIC (Application Specific Integrated Circuit, ASIC) / PLD (Programmable Logic Device, PLD) such as security dongles (not depicted), etc.

[0089] Those skilled in the art should also understand that the term "computer-readable medium" as used in connection with the presently disclosed subject matter does not include transmission media, carrier waves, or other transient signals.

[0090] Computer system 3100 may also include interfaces to one or more communication networks. These networks can be wireless, wired, or optical. They can also be local area, wide area, metropolitan area, vehicular, industrial, real-time, latency-tolerant, etc. Examples of networks include: local area networks (LANs), such as Ethernet and wireless LANs; cellular networks, including GSM (Global System for Mobile Communication), 3G (the Third Generation), 4G (the Fourth Generation), 5G (the Fifth Generation), and LTE (Long Term Evolution); wired or wireless wide area digital television networks, including cable TV, satellite TV, and terrestrial broadcast TV; and CANBus (Controller Area Network Bus) vehicular and industrial networks, etc. Some networks typically require external network interface adapters attached to certain general-purpose data ports or peripheral buses 3149 (such as, for example, the USB (Universal Serial Bus, USB) port of computer system 3100); other networks are typically integrated into the core of computer system 3100 via system buses attached to, for example, an Ethernet interface to a PC (Personal Computer, PC) system or a cellular network interface to a smartphone computer system. Using any of these networks, computer system 3100 can communicate with other entities. Such communication can be one-way receiving (e.g., broadcasting TV), one-way transmitting (e.g., to a CANBus device), or bidirectional, such as to other computer systems using local area digital networks or wide area digital networks. Such communication can include communication to cloud computing environments 3155. Certain protocols and protocol stacks can be used on each of those networks and network interfaces described above.

[0091] The aforementioned human-machine interface device, human-accessible storage device, and network interface 3154 can be attached to the core 3140 of the computer system 3100.

[0092] Core 3140 may include one or more central processing units (CPUs) 3141, graphics processing units (GPUs) 3142, dedicated programmable processing units in the form of field-programmable gate areas (FPGAs) 3143, hardware accelerators 3144 for certain tasks, etc. These devices, along with read-only memory (ROM) 3145, random access memory 3146, and internal mass storage devices 3147 such as internal non-user-accessible hard disk drives (SDs), SSDs, etc., can be connected via system bus 3148. In some computer systems, system bus 3148 can be accessed via one or more physical connectors to allow for expansion with additional CPUs, GPUs, etc. Peripheral devices can be directly attached to the core's system bus 3148, or attached to the core's system bus 3148 via peripheral bus 3149. Peripheral bus architectures include PCI (Peripheral Component Interconnect / Interface), USB, etc. A graphics adapter 3150 may be included in core 3140.

[0093] The CPU 3141, GPU 3142, FPGA 3143, and accelerator 3144 can execute certain instructions, which, when combined, constitute the aforementioned computer code. This computer code can be stored in ROM 3145 or RAM 3146. Transient data can also be stored in RAM 3146, while permanent data can be stored, for example, in an internal mass storage device 3147. Fast storage and retrieval of any memory device in the memory device can be achieved by using a cache memory, which can be closely associated with one or more CPUs 3141, GPUs 3142, mass storage devices 3147, ROM 3145, RAM 3146, etc.

[0094] Computer-readable media may have computer code thereon for performing operations of various computer implementations. The media and computer code may be specifically designed and constructed for the purposes of this disclosure, or the media and computer code may be of a type known and available to those skilled in the art of computer software.

[0095] By way of example and not limitation, the computer system 3100 with the architecture, and in particular the core 3140, can be functionalized by a processor (including a CPU, GPU, FPGA, accelerator, etc.) executing software embodied in one or more tangible computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage devices as described above, and certain storage devices of the core 3140 having non-transitory characteristics, such as internal mass storage device 3147 or ROM 3145. Software implementing various embodiments of this disclosure can be stored in such devices and executed by the core 3140. Depending on specific needs, the computer-readable media may include one or more memory devices or chips. The software can cause the core 3140, and in particular the processors therein (including CPU, GPU, FPGA, etc.), to execute specific processes or specific portions of specific processes described herein, including defining data structures stored in RAM 3146 and modifying such data structures according to the software-defined processes. Alternatively or as an alternative, the computer system may be provided with functionality by hard-wired or otherwise embodied logic in circuitry (e.g., accelerator 3144), which may operate in place of or with software to perform a particular process or a particular portion of a particular process described herein. Where appropriate, reference to software may encompass logic, and reference to logic may encompass software. Where appropriate, reference to computer-readable medium may encompass circuitry storing software for execution (e.g., integrated circuit (IC)), circuitry embodying logic for execution, or both. This disclosure includes any suitable combination of hardware and software.

[0096] While this disclosure has described several non-limiting embodiments, there are variations, substitutions, and various alternative equivalents that fall within the scope of this disclosure. Therefore, it will be appreciated that those skilled in the art will be able to conceive of many systems and methods that, while not expressly shown or described herein, embody the principles of this disclosure and are therefore within its spirit and scope.

[0097] The above disclosure also covers the following implementation methods:

[0098] (1) An encoding method executed by at least one processor, the method comprising: receiving a polygonal mesh, the polygonal mesh including a plurality of vertices defining a plurality of faces; determining a mesh face type of the polygonal mesh; dividing the polygonal mesh into a plurality of sub-mesh; generating a sub-mesh header for at least one of the plurality of sub-mesh according to at least the mesh face type of the polygonal mesh; and generating a bit stream including the polygonal mesh and the sub-mesh header.

[0099] (2) The method according to feature (1), wherein when the mesh face type indicates that the polygon mesh includes more than one type of face, the submesh header includes submesh_face_type, the submesh_face_type indicating the face type of the at least one submesh.

[0100] (3) The method according to feature (1) or (2), wherein the mesh face type is one of the following: a first face type indicating that the polygonal mesh includes triangular faces, a second face type indicating that the polygonal mesh includes quadrilateral faces, a third face type indicating that the polygonal mesh includes both triangular faces and quadrilateral faces, and a fourth face type indicating that the polygonal mesh contains polygonal faces.

[0101] (4) The method according to any one of features (1) to (3), wherein the subgrid header further includes a parameter indicating whether all connected components in the at least one subgrid have the same connectivity.

[0102] (5) The method according to any one of features (1) to (4), wherein the subgrid header further includes a prediction strategy that indicates how to encode vertices in the at least one subgrid based on one or more vertices in the at least one subgrid.

[0103] (6) The method according to feature (5), wherein the prediction strategy is a parallelogram prediction strategy.

[0104] (7) The method according to feature (5), wherein the subgrid header further includes the following parameter, which indicates at least one of a unidirectional prediction mode and a multidirectional prediction mode.

[0105] (8) The method according to feature (7), wherein, in the one-way prediction mode, the vertex is encoded using at least one side of the subgrid header according to the prediction strategy.

[0106] (9) The method according to feature (7), wherein, in the multi-directional prediction mode, the vertex is encoded using at least two sides of the subgrid header according to the prediction strategy.

[0107] (10) The method according to any one of features (1) to (9), wherein the subgrid header includes an index encoding strategy that indicates one of the polygonal fan method and the two-degree method.

[0108] (11) The method according to feature (10), wherein the subgrid header includes a traversal strategy for the polygon fan method based on determining the index encoding strategy.

[0109] (12) A decoding method executed by at least one processor, the method comprising: receiving a bit stream including a polygonal grid and a subgrid header, the polygonal grid being divided into a plurality of subgrids; and decoding at least one of the plurality of subgrids according to the subgrid header, wherein the subgrid header is generated based on the grid face type of the polygonal grid.

[0110] (13) The decoding method according to feature (12), wherein when the mesh face type indicates that the polygon mesh includes more than one type of face, the submesh header includes submesh_face_type, the submesh_face_type indicating the face type of the at least one submesh.

[0111] (14) The decoding method according to feature (12) or (13), wherein the mesh face type is one of the following: a first face type indicating that the polygonal mesh includes triangular faces, a second face type indicating that the polygonal mesh includes quadrilateral faces, a third face type indicating that the polygonal mesh includes both triangular faces and quadrilateral faces, and a fourth face type indicating that the polygonal mesh contains polygonal faces.

[0112] (15) The decoding method according to any one of features (12) to (14), wherein the subgrid header further includes a parameter indicating whether all connected components in the at least one subgrid have the same connectivity.

[0113] (16) The decoding method according to any one of features (12) to (15), wherein the subgrid header further includes a prediction strategy that indicates how to decode vertices in the at least one subgrid based on one or more vertices in the at least one subgrid.

[0114] (17) The decoding method according to feature (16), wherein the prediction strategy is a parallelogram prediction strategy.

[0115] (18) The decoding method according to feature (16), wherein the subgrid header further includes the following parameter, which indicates at least one prediction mode among unidirectional prediction mode and multidirectional prediction mode.

[0116] (19) The decoding method according to feature (18), wherein, in the one-way prediction mode, the vertex is decoded using at least one side of the subgrid header according to the prediction strategy.

[0117] (20) A method executed by at least one processor, the method comprising: processing a polygonal mesh, the polygonal mesh including a plurality of vertices defining a plurality of faces, wherein determining a mesh face type of the polygonal mesh; wherein dividing the polygonal mesh into a plurality of submesh; wherein generating a submesh header for at least one of the plurality of submesh according to at least the mesh face type of the polygonal mesh; and wherein a bit stream includes the polygonal mesh and the submesh header.

Claims

1. An encoding method, characterized in that, The method includes: Receive a polygonal mesh, the polygonal mesh comprising a plurality of vertices defining a plurality of faces; Determine the mesh face type of the polygonal mesh; The polygonal grid is divided into multiple sub-grids; Generate a subgrid header for at least one of the plurality of subgrids based on at least the grid face type of the polygonal grid; and Generate a bitstream including the polygonal grid and the subgrid header.

2. The method according to claim 1, characterized in that, When the mesh face type indicates that the polygonal mesh includes more than one type of face, the submesh header includes submesh_face_type, which indicates the face type of the at least one submesh.

3. The method according to claim 1, characterized in that, The mesh face type is one of the following: a first face type indicating that the polygonal mesh includes triangular faces, a second face type indicating that the polygonal mesh includes quadrilateral faces, a third face type indicating that the polygonal mesh includes both triangular and quadrilateral faces, and a fourth face type indicating that the polygonal mesh contains polygonal faces.

4. The method according to claim 1, characterized in that, The subgrid header also includes parameters indicating whether all connected components in the at least one subgrid have the same connectivity, or The subgrid header also includes a prediction strategy that indicates how to encode vertices in the at least one subgrid based on one or more vertices in the at least one subgrid, or The subgrid header includes an index encoding strategy that indicates one of the polygonal fan method and the two-degree method.

5. The method according to claim 4, characterized in that, The prediction strategy is a parallelogram prediction strategy.

6. The method according to claim 4, characterized in that, The subgrid header also includes parameters indicating at least one of a unidirectional prediction mode and a multidirectional prediction mode.

7. The method according to claim 6, characterized in that, In the one-way prediction mode, the vertex is encoded using at least one side of the sub-grid header according to the prediction strategy, or In the multi-directional prediction mode, the vertex is encoded using at least two sides of the sub-grid header according to the prediction strategy.

8. The method according to claim 4, characterized in that, The subgrid header includes a traversal strategy for the polygonal fan method based on the index encoding strategy.

9. A decoding method, characterized in that, The method includes: Receive a bit stream including a polygonal grid and a subgrid header, wherein the polygonal grid is divided into multiple subgrids; Decode at least one subgrid among the plurality of subgrids based on the subgrid header. The sub-mesh header is generated based on the mesh face type of the polygonal mesh.

10. The decoding method according to claim 9, characterized in that, When the mesh face type indicates that the polygonal mesh includes more than one type of face, the submesh header includes submesh_face_type, which indicates the face type of the at least one submesh.

11. The decoding method according to claim 9, characterized in that, The mesh face type is one of the following: a first face type indicating that the polygonal mesh includes triangular faces, a second face type indicating that the polygonal mesh includes quadrilateral faces, a third face type indicating that the polygonal mesh includes both triangular and quadrilateral faces, and a fourth face type indicating that the polygonal mesh contains polygonal faces.

12. The decoding method according to claim 9, characterized in that, The subgrid header also includes parameters indicating whether all connected components in the at least one subgrid have the same connectivity, or The subgrid header also includes a prediction strategy that indicates how to decode vertices in the at least one subgrid based on one or more vertices in the at least one subgrid.

13. The decoding method according to claim 12, characterized in that, The prediction strategy is a parallelogram prediction strategy.

14. The decoding method according to claim 12, characterized in that, The subgrid header also includes parameters indicating at least one of a unidirectional prediction mode and a multidirectional prediction mode.

15. The decoding method according to claim 14, characterized in that, In the one-way prediction mode, the vertex is decoded using at least one side of the subgrid header according to the prediction strategy.

16. A method for storing or transmitting a bit stream, characterized in that, The video bitstream is generated by the method according to any one of claims 1 to 8, or the bitstream is decoded by the method according to any one of claims 9 to 15.

17. A codec device, characterized in that, The device includes a memory for storing instructions and a processor in communication with the memory, wherein when the processor executes the instructions, the processor is configured to cause the device to perform the method according to any one of claims 1 to 8, or the method according to any one of claims 9 to 15.