Method, device and medium for point cloud coding and decoding

By limiting slice dependence and parameter set activation in point cloud encoding and decoding technology, the problem of low point cloud processing efficiency in the existing technology is solved, and more efficient point cloud encoding and decoding performance is achieved.

CN118923111APending Publication Date: 2024-11-08DOUYIN VISION CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202280084425.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2021-12-21
Filing Date
2022-12-20
Publication Date
2024-11-08

AI Technical Summary

Technical Problem

The existing point cloud encoding and decoding technology is less efficient when processing sparse point cloud data, especially in terms of slice dependence and parameter set activation, resulting in low processing efficiency.

Method used

A method is proposed to perform conversion between the current point cloud frame and the bitstream of the point cloud sequence, ensuring that the first slice does not exceed the single dependent slice's direct dependency, and limit the dependence of slices and chunking during the decoding process, ensuring that Consistency of parameter sets throughout the entire point cloud sequence.

Benefits of technology

Through this method, the efficiency of point cloud processing is improved, more efficient slicing applications and parameter set management is supported, and the overall performance of point cloud encoding and decoding is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118923111A_ABST
    Figure CN118923111A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a scheme for point cloud coding and decoding. The invention provides a method for point cloud coding and decoding. The method includes performing a conversion between a current point cloud frame of the point cloud sequence and a bitstream of the point cloud sequence, a first slice in the current point cloud frame being directly dependent by no more than a single dependent slice.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments of the present disclosure generally relate to point cloud encoding and decoding techniques, and more particularly to slices and parameter sets in geometry-based point cloud compression. Background Art

[0002] A point cloud is a collection of individual data points in a three-dimensional (3D) plane, with each point having set coordinates on the X, Y, and Z axes. Point clouds can therefore be used to represent the physical content of a three-dimensional space. Point clouds have proven to be a promising way to represent 3D visual data for a wide range of immersive applications, from augmented reality to self-driving cars.

[0003] Point cloud codec standards have evolved primarily through developments within the renowned MPEG organization. MPEG stands for Moving Picture Experts Group, one of the main standardization groups dealing with multimedia. In 2017, the MPEG 3D Graphics Codec Group (3DG) released a Call for Proposals (CFP) document to begin developing point cloud codec standards. The final standard will encompass two categories of solutions. Video-based point cloud compression (V-PCC or VPCC) is suitable for point sets with relatively uniform point distribution. Geometry-based point cloud compression (G-PCC or GPCC) is suitable for more sparse distributions. However, there is an overall desire to further improve the codec efficiency of conventional point cloud codec techniques. Summary of the invention

[0004] The embodiments of the present disclosure provide a solution for point cloud encoding and decoding.

[0005] In a first aspect, a method for point cloud encoding and decoding is provided. The method includes: performing conversion between a current point cloud frame of a point cloud sequence and a bit stream of the point cloud sequence, wherein a first slice in the current point cloud frame is directly dependent on no more than a single dependent slice.

[0006] Based on the method according to the first aspect of the present disclosure, a slice should be directly depended on by no more than a single dependent slice. Compared with traditional solutions lacking such a constraint, the proposed method can advantageously better support the application of slices, thereby improving the efficiency of point cloud processing.

[0007] In a second aspect, a device for processing point cloud data is provided. The device for processing point cloud data comprises a processor and a non-volatile memory having instructions thereon. The instructions, when executed by the processor, cause the processor to perform the method according to the first aspect of the present disclosure.

[0008] In a third aspect, a non-transitory computer-readable storage medium is provided, wherein the non-transitory computer-readable storage medium stores instructions, and the instructions enable a processor to execute the method according to the first aspect of the present disclosure.

[0009] In a fourth aspect, a non-transitory computer-readable recording medium is provided. The non-transitory computer-readable recording medium stores a bitstream generated by a method performed by a point cloud processing device and having a point cloud sequence. The method includes: performing a conversion between a current point cloud frame of the point cloud sequence and the bitstream, wherein a first slice in the current point cloud frame is directly dependent on no more than a single dependent slice.

[0010] In a fifth aspect, a method for storing a bitstream of a point cloud sequence is provided. The method includes: performing a conversion between a current point cloud frame of the point cloud sequence and a bitstream, wherein a first slice in the current point cloud frame is directly dependent on no more than a single dependent slice; and storing the bitstream in a non-transitory computer-readable recording medium.

[0011] This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will become more apparent through the following detailed description with reference to the accompanying drawings. In the exemplary embodiments of the present disclosure, the same reference numerals generally refer to the same components.

[0013] Figure 1 is a block diagram illustrating an example point cloud encoding and decoding system that may utilize the techniques of the present disclosure;

[0014] Figure 2 A block diagram of an example point cloud encoder according to some embodiments of the present disclosure is shown;

[0015] Figure 3 shows a block diagram of an example point cloud decoder according to some embodiments of the present disclosure;

[0016] Figure 4 A flowchart of a point cloud encoding and decoding method according to some embodiments of the present disclosure is shown; and

[0017] Figure 5 A block diagram of a computing device is shown in which various embodiments of the present disclosure may be implemented.

[0018] Throughout the drawings, the same or similar reference numbers generally refer to the same or similar elements. DETAILED DESCRIPTION

[0019] The principle of the present disclosure will now be described with reference to some embodiments. It should be understood that these embodiments are described only to illustrate and help those skilled in the art to understand and implement the present disclosure, and do not imply any limitation on the scope of the present disclosure. In addition to the methods described below, the disclosure described herein can also be implemented in various ways.

[0020] In the following description and claims, unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.

[0021] References in this disclosure to "one embodiment," "an embodiment," "an example embodiment," etc. indicate that the described embodiment may include a particular feature, structure, or characteristic, but it is contemplated that not every embodiment must include the particular feature, structure, or characteristic. Furthermore, these phrases do not necessarily refer to the same embodiment. Furthermore, when a particular feature, structure, or characteristic is described in conjunction with an example embodiment, whether or not explicitly described, it is considered to be within the knowledge of those skilled in the art to affect such feature, structure, or characteristic in relation to other embodiments.

[0022] It should be understood that although the terms "first" and "second" etc. can be used to describe various elements, these elements should not be limited to these terms. These terms are only used to distinguish one element from another element. For example, a first element can be referred to as a second element, and similarly, a second element can be referred to as a first element without departing from the scope of the exemplary embodiments. As used herein, the term "and / or" includes any and all combinations of one or more of the listed terms.

[0023] The terms used herein are only used for the purpose of describing specific embodiments and are not intended to limit the exemplary embodiments. As used herein, the singular forms "a", "an", and "the" are also intended to include the plural forms, unless the context clearly indicates otherwise. It should also be understood that the terms "include", "including", "have", "have", "include" and / or "include" when used herein indicate the presence of the features, elements and / or components, etc., but do not exclude the presence or addition of one or more other features, elements, components and / or combinations thereof. Example Environment

[0024] Figure 1is a block diagram illustrating an example point cloud encoding and decoding system 100 that can utilize the technology of the present disclosure. As shown, the point cloud encoding and decoding system 100 may include a source device 110 and a destination device 120. The source device 110 may also be referred to as a point cloud encoding device, and the destination device 120 may also be referred to as a point cloud decoding device. In operation, the source device 110 may be configured to generate encoded point cloud data, and the destination device 120 may be configured to decode the encoded point cloud data generated by the source device 110. The technology of the present disclosure is generally directed to encoding and decoding (encoding and / or decoding) point cloud data, that is, supporting point cloud compression. The encoding and decoding can be effective in compressing and / or decompressing point cloud data.

[0025] The source device 100 and the destination device 120 may include any of a wide range of devices, including desktop computers, notebook (i.e., laptop) computers, tablet computers, set-top boxes, telephone handsets (e.g., smart phones and mobile phones), televisions, cameras, display devices, digital media players, video game consoles, video streaming devices, vehicles (e.g., land or sea vehicles, spacecraft, aircraft, etc.), robots, lidar devices, satellites, extended reality devices, etc. In some cases, the source device 100 and the destination device 120 may be equipped with wireless communication capabilities.

[0026] The source device 100 may include a data source 112, a memory 114, a GPCC encoder 116, and an input / output (I / O) interface 118. The destination device 120 may include an input / output (I / O) interface 128, a GPCC decoder 126, a memory 124, and a data consumer 122. According to the present disclosure, the GPCC encoder 116 of the source device 100 and the GPCC decoder 126 of the destination device 120 may be configured to apply the techniques related to point cloud encoding and decoding of the present disclosure. Therefore, the source device 100 represents an example of an encoding device, and the destination device 120 represents an example of a decoding device. In other examples, the source device 100 and the destination device 120 may include other components or arrangements. For example, the source device 100 may receive data (e.g., point cloud data) from an internal source or an external source. Similarly, the destination device 120 may interface with an external data consumer instead of including the data consumer in the same device.

[0027] In general, the data source 112 represents a source of point cloud data (i.e., raw, unencoded point cloud data) and can provide a continuous series of "frames" of point cloud data to the GPCC encoder 116, which encodes the point cloud data for the frames. In some examples, the data source 112 generates point cloud data. The data source 112 of the source device 100 can include a point cloud capture device, such as any of a variety of cameras or sensors, for example, one or more cameras, an archive covering previously captured point cloud data, a 3D scanner or a light radar (LIDAR) device, and / or a data feed interface for receiving point cloud data from a data content provider. Therefore, in some examples, the data source 112 can generate point cloud data based on a signal from a LIDAR device. Alternatively or additionally, the point cloud data can be generated by a scanner, camera, sensor, or other data through a computer. For example, the data source 112 can generate point cloud data, or a combination of real-time point cloud data, archived point cloud data, and computer-generated point cloud data. In each case, the GPCC encoder 116 encodes captured, pre-captured, or computer-generated point cloud data. For encoding and decoding, the GPCC encoder 116 can rearrange the frames of the point cloud data from the received order (sometimes referred to as "display order") to the encoding and decoding order. The GPCC encoder 116 can generate one or more bit streams containing encoded point cloud data. The source device 100 can then output the encoded point cloud data via the I / O interface 118 for reception and / or retrieval by, for example, the I / O interface 128 of the destination device 120. The encoded point cloud data can be transmitted directly to the destination device 120 via the network 130A via the I / O interface 118. The encoded point cloud data can also be stored on the storage medium / server 130B for access by the destination device 120.

[0028] The memory 114 of the source device 100 and the memory 124 of the destination device 120 may represent general purpose memory. In some examples, the memory 114 and the memory 124 may store raw point cloud data, for example, raw point cloud data from the data source 112 and raw, decoded point cloud data from the GPCC decoder 126. Additionally or alternatively, the memory 114 and the memory 124 may store software instructions that may be executed by, for example, the GPCC encoder 116 and the GPCC decoder 126, respectively. Although in this example, the memory 114 and the memory 124 are shown separately from the GPCC encoder 116 and the GPCC decoder 126, it should be understood that the GPCC encoder 116 and the GPCC decoder 126 may also include internal memory for functionally similar or equivalent purposes. In addition, the memory 114 and the memory 124 may store encoded point cloud data, for example, output from the GPCC encoder 116 and input to the GPCC decoder 126. In some examples, portions of memory 114 and memory 124 may be allocated as one or more buffers, for example, to store raw, decoded, and / or encoded point cloud data.For example, memory 114 and memory 124 may store point cloud data.

[0029] I / O interface 118 and I / O interface 128 may represent a wireless transmitter / receiver, a modem, a wired network component (e.g., an Ethernet card), a wireless communication component that operates according to any of a variety of IEEE 802.11 standards, or other physical components. In examples where I / O interface 118 and I / O interface 128 include wireless components, I / O interface 118 and I / O interface 128 may be configured to transmit data, such as encoded point cloud data, according to a cellular communication standard (e.g., 4G, 4G-LTE (Long Term Evolution), LTE Advanced, 5G, etc.). In some examples where I / O interface 118 includes a wireless transmitter, I / O interface 118 and I / O interface 128 may be configured to transmit data, such as encoded point cloud data, according to other wireless standards (e.g., IEEE 802.11 specifications). In some examples, source device 100 and / or destination device 120 may include corresponding system-on-chip (SoC) devices. For example, source device 100 may include a SoC device to perform the functions attributed to GPCC encoder 116 and / or I / O interface 118 , and destination device 120 may include a SoC device to perform the functions attributed to GPCC decoder 126 and / or I / O interface 128 .

[0030] The techniques disclosed herein may be applied to encoding and decoding to support any of a variety of applications, such as communications between autonomous vehicles, communications between scanners, cameras, sensors and processing devices (e.g., local or remote servers), geographic mapping, or other applications.

[0031] The I / O interface 128 of the destination device 120 receives the encoded bitstream from the source device 110, and the encoded bitstream may contain signaling information defined by the GPCC encoder 116, which is also used by the GPCC decoder 126, such as a syntax element having a value representing a point cloud. The data consumer 122 uses the decoded data. For example, the data consumer 122 can use the decoded point cloud data to determine the location of the object point. In some examples, the data consumer 122 may include a display to present an image based on the point cloud data.

[0032] Each of the GPCC encoder 116 and the GPCC decoder 126 may be implemented as any of a variety of suitable encoder and / or decoder circuits, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware, or any combination thereof. When the technology is partially implemented in software, the device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the technology of the present disclosure. Each of the GPCC encoder 116 and the GPCC decoder 126 may be included in one or more encoders or decoders, any of which may be integrated as part of a combined encoder / decoder (CODEC) in a corresponding device. A device including the GPCC encoder 116 and / or the GPCC decoder 126 may include one or more integrated circuits, microprocessors, and / or other types of devices.

[0033] The GPCC encoder 116 and the GPCC decoder 126 may operate according to a codec standard, such as the Video Point Cloud Compression (VPCC) standard or the Geometry Point Cloud Compression (GPCC) standard. The present disclosure may generally refer to the coding and decoding of frames (e.g., encoding and decoding) to include the process of encoding or decoding data. The encoded bitstream typically includes a series of values ​​for syntax elements that represent codec decisions (e.g., codec modes).

[0034] A point cloud can cover a set of points in 3D space and can have attributes associated with the point. The attribute can be color information such as R, G, B or Y, Cb, Cr or reflectivity information, or other attributes. Point clouds can be captured by various cameras or sensors such as LiDAR sensors and 3D scanners, or they can be generated by computers. Point cloud data is used in a variety of applications, including but not limited to architecture (modeling), mapping (3D models for visualization and animation), and the automotive industry (LiDAR sensors to help navigation).

[0035] Figure 2is a block diagram showing an example of a GPCC encoder 200 according to some embodiments of the present disclosure, which may be Figure 1 An example of a GPCC encoder 116 in the system 100 is shown. Figure 3 is a block diagram showing an example of a GPCC decoder 300 according to some embodiments of the present disclosure, which may be Figure 1 An example of a GPCC decoder 126 in the system 100 is shown.

[0036] In the GPCC encoder 200 and the GPCC decoder 300, the point cloud position is first encoded and decoded. The attribute encoding and decoding depends on the decoded geometry. Figure 2 and Figure 3 , the region adaptive hierarchical transform (RAHT) unit 218, the surface approximation analysis unit 212, the RAHT unit 314, and the surface approximation synthesis unit 310 are options that are commonly used for category 1 data. The level of detail (LOD) generation unit 220, the lifting unit 222, the LOD generation unit 316, and the inverse lifting unit 318 are options that are commonly used for category 3 data. All other units are common between category 1 and category 3.

[0037] For category 3 data, the compressed geometry is typically represented as an octree from the root down to the leaf level for each voxel. For category 1 data, the compressed geometry is typically represented by a pruned octree (i.e., an octree from the root down to the leaf level for blocks larger than a voxel) plus a model that approximates the surface within each leaf of the pruned octree. In this way, category 1 and category 3 data share the octree codec mechanism, while category 1 data can additionally approximate the voxels within each leaf with a surface model. The surface model used is a triangulation of 1 to 10 triangles per block, resulting in a triangle soup. Therefore, category 1 geometry codecs are called triangle soup geometry codecs, while category 3 geometry codecs are called octree geometry codecs.

[0038] exist Figure 2 In the example, the GPCC encoder 200 may include a coordinate transformation unit 202, a color transformation unit 204, a voxelization unit 206, an attribute transfer unit 208, an octree analysis unit 210, a surface approximation analysis unit 212, an arithmetic coding unit 214, a geometric reconstruction unit 216, a RAHT unit 218, an LOD generation unit 220, a lifting unit 222, a coefficient quantization unit 224 and an arithmetic coding unit 226.

[0039] like Figure 2As shown in the example of , the GPCC encoder 200 can receive a set of positions and a set of attributes. The positions can include the coordinates of the points in the point cloud. The attributes can include information about the points in the point cloud, such as the color associated with the points in the point cloud.

[0040] The coordinate transformation unit 202 may apply a transformation to the coordinates of the point to transform the coordinates from the initial domain to the transformed domain. The present disclosure may refer to the transformed coordinates as transformed coordinates. The color transformation unit 204 may apply a transformation to transform the color information of the attribute to a different domain. For example, the color transformation unit 204 may transform the color information from the RGB color space to the YCbCr color space.

[0041] In addition, Figure 2 In the example of , the voxelization unit 206 may voxelize the transformed coordinates. Voxelization of the transformed coordinates may include quantizing and removing some points of the point cloud. In other words, multiple points of the point cloud may be subsumed into a single "voxel", which may thereafter be considered as a point in some aspects. In addition, the octree analysis unit 210 may generate an octree based on the voxelized transformed coordinates. Additionally, in Figure 2 In the example of , the surface approximation analysis unit 212 can analyze the points to potentially determine a surface representation of the set of points. The arithmetic coding unit 214 can perform arithmetic coding on syntax elements representing information of the octree and / or the surface determined by the surface approximation analysis unit 212. The GPCC encoder 200 can output these syntax elements in a geometry bitstream.

[0042] The geometric reconstruction unit 216 may reconstruct the transformed coordinates of the points in the point cloud based on the octree, the data indicating the surface determined by the surface approximation analysis unit 212, and / or other information. Due to voxelization and surface approximation, the number of transformed coordinates reconstructed by the geometric reconstruction unit 216 may be different from the number of original points of the point cloud. The present disclosure may refer to the resulting points as reconstructed points. The attribute transfer unit 208 may transfer the attributes of the original points of the point cloud to the reconstructed points of the point cloud data.

[0043] In addition, the RAHT unit 218 may apply RAHT coding to the attributes of the reconstruction points. Alternatively or additionally, the LOD generation unit 220 and the lifting unit 222 may apply LOD processing and lifting, respectively, to the attributes of the reconstruction points. The RAHT unit 218 and the lifting unit 222 may generate coefficients based on the attributes. The coefficient quantization unit 224 may quantize the coefficients generated by the RAHT unit 218 or the lifting unit 222. The arithmetic coding unit 226 may apply arithmetic coding to the syntax elements representing the quantized coefficients. The GPCC encoder 200 may output these syntax elements in the attribute bitstream.

[0044] exist Figure 3In the example, the GPCC decoder 300 may include a geometric arithmetic decoding unit 302, an attribute arithmetic decoding unit 304, an octree synthesis unit 306, an inverse quantization unit 308, a surface approximation synthesis unit 310, a geometric reconstruction unit 312, a RAHT unit 314, an LOD generation unit 316, an inverse lifting unit 318, an inverse coordinate transformation unit 320, and a color inverse transformation unit 322.

[0045] The GPCC decoder 300 may obtain a geometry bitstream and an attribute bitstream. The geometry arithmetic decoding unit 302 of the decoder 300 may apply arithmetic decoding (e.g., CABAC or other types of arithmetic decoding) to syntax elements in the geometry bitstream. Similarly, the attribute arithmetic decoding unit 304 may apply arithmetic decoding to syntax elements in the attribute bitstream.

[0046] The octree synthesis unit 306 may synthesize the octree based on the syntax elements parsed from the geometry bitstream. In the case where surface approximation is used in the geometry bitstream, the surface approximation synthesis unit 310 may determine the surface model based on the syntax elements parsed from the geometry bitstream and based on the octree.

[0047] Furthermore, the geometry reconstruction unit 312 may perform reconstruction to determine the coordinates of the points in the point cloud. The coordinate inverse transformation unit 320 may apply an inverse transformation to the reconstructed coordinates to convert the reconstructed coordinates (positions) of the points in the point cloud from the transformed domain back to the original domain.

[0048] Additionally, in Figure 3 In the example of , the inverse quantization unit 308 may inverse quantize the property value. The property value may be based on a syntax element obtained from the property bitstream (eg, including a syntax element decoded by the property arithmetic decoding unit 304).

[0049] Depending on how the attribute values ​​are encoded, the RAHT unit 314 may perform RAHT encoding and decoding to determine the color values ​​of the points in the point cloud based on the inverse quantized attribute values. Alternatively, the LOD generation unit 316 and the inverse lifting unit 318 may use a level of detail based technique to determine the color values ​​of the points in the point cloud.

[0050] In addition, Figure 3 In the example of , the color inverse transform unit 322 can apply an inverse color transform to the color value. The inverse color transform can be the inverse of the color transform applied by the color transform unit 204 of the encoder 200. For example, the color transform unit 204 can transform the color information from the RGB color space to the YCbCr color space. Therefore, the color inverse transform unit 322 can transform the color information from the YCbCr color space to the RGB color space.

[0051] Figure 2 and Figure 3Various units are shown to help understand the operations performed by the encoder 200 and the decoder 300. These units can be implemented as fixed-function circuits, programmable circuits, or a combination thereof. Fixed-function circuits refer to circuits that provide specific functions and are preset on the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks and provide flexible functions in the operations that can be performed. For example, a programmable circuit can execute software or firmware that causes the programmable circuit to operate in a manner defined by the instructions of the software or firmware. Fixed-function circuits can execute software instructions (for example, to receive parameters or output parameters), but the types of operations performed by fixed-function circuits are generally immutable. In some examples, one or more of these units may be different circuit blocks (fixed-function or programmable), and in some examples, one or more of these units may be integrated circuits.

[0052] Some exemplary embodiments of the present disclosure are described in detail below. It should be understood that the section titles used in this document are for ease of understanding and do not limit the embodiments disclosed in the section to only that section. In addition, although some embodiments are described with reference to GPCC or other specific point cloud codecs, the disclosed technology is also applicable to other point cloud coding and decoding technologies. In addition, although some embodiments describe the point cloud coding and decoding steps in detail, it should be understood that the corresponding decoding steps of the undo coding will be implemented by the decoder. In the following description and claims, unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by ordinary technicians in the field to which the present disclosure belongs. 1. Overview The present disclosure relates to point cloud compression techniques. Specifically, the present disclosure relates to the design of slices and parameter sets in the Geometry-Based Point Cloud Compression (G-PCC) standard. These ideas can be applied to any point cloud compression standard or non-standard point cloud codec, such as the G-PCC standard under development, either alone or in various combinations. 2. Abbreviations APS attribute parameter set ADU Attribute Data Unit DU Data Unit FBDU Frame Boundary Data Unit FSAP frame-specific attribute parameters GDU Geometry Data Unit GPS geometry parameter set G-PCC Geometry-based Point Cloud Compression LSB Least Significant Bit MSB Most Significant Bit PCC Point Cloud Compression SPS Sequence Parameter Set TI Tile inventory 3. Background 3.1 General Advances in 3D capture and rendering technologies are enabling new applications and services in assisted and autonomous driving, mapping, cultural heritage, industrial processes, immersive real-time communications, and virtual / augmented / mixed reality (VR / AR / MR) content creation, transmission, and communication. Point clouds have emerged as one of the main representations for such applications. A point cloud frame consists of a set of 3D points. In addition to having a 3D position, each point can also be associated with many other properties, such as color, transparency, reflectivity, timestamp, surface normal, and classification. Such a representation requires a large amount of data, which can be expensive in terms of storage and transmission. The Moving Picture Experts Group (MPEG) has developed two point cloud compression standards. The first is the Video-Based Point Cloud Compression (V-PCC) standard, which is suitable for point sets with a relatively uniform distribution of points. The second is the Geometry-Based Point Cloud Compression (G-PCC) standard, which is suitable for more sparse distributions. 3.2 Some Basic Concepts of G-PCC 3.2.1 Terms and definitions point The basic element of a point cloud consists of a position specified as a Cartesian coordinate and zero or more attributes. Point Cloud Unordered list of points Point cloud sequence A sequence of zero or more point clouds Point cloud frame Point cloud in point cloud sequence geometry The point locations associated with the point set property Scalar or vector attributes associated with each point in the point cloud Example color, reflectivity, frame index, etc. BitTorrent A bit sequence forming a representation of the encoded and decoded point cloud sequence Encoded and decoded point cloud frame Coded representation of point cloud frame Bounding Box An axis-aligned cuboid defining the region of space that bounds the point set Chunking The slice set identified by the common slice_tag syntax element value whose geometry is contained within the bounding box specified in the tile manifest data unit. slice Part or all of an encoded and decoded point cloud frame consisting of a GDU and zero or more corresponding ADUs Note 1 to be added: The bounding boxes of any two slices can intersect. 3.2.2 Encoded and decoded point cloud sequence The coded representation of a point cloud sequence consists of one or more point cloud frames coded as a DU sequence. The encoded and decoded point cloud sequence should include: - SPS, enumerates the attributes present in the encoded point cloud format and conveys metadata and decoding parameters pertaining to the entire encoded point cloud sequence. - At least one GPS transmitting parameters used in the decoding of geometric data. If an ADU is present in the encoded point cloud sequence, at least one APS conveys parameters used in the decoding of the attribute data. —DU includes each encoded and decoded point cloud frame. Profiles and levels specify limits on the number of bits required to represent geometry and attribute component information. 3.2.3 Encoded and Decoded Point Cloud Frames and Slices A decoded point cloud frame consists of a sequence of zero or more slices with the same value FrameCtr. Consecutive frame boundary data units are used to indicate an empty frame. The code point cloud frame consists of the following data units: —Geometry, attribute, or default attribute data element. —Zero or more frame boundary data units identifying the boundary between two encoded and decoded point cloud frames. A slice is an unordered list of points. Slice point positions are encoded relative to the slice origin in the encoded coordinate system. The encoded volumes of a slice may intersect, including within a point cloud frame. Each slice will consist of a single GDU followed by zero or more ADUs. The GDU header acts as a slice header. ADU depends on the corresponding GDU in the same slice. DUs belonging to different slices should not be interleaved. The decoded point cloud frame is the concatenation of all points in all constituent slices of the frame. Coincident points in a point cloud frame may originate from the concatenation of multiple slices. Slices are either independent or dependent. Independent slices do not require any other slices to be decoded first. Dependent slices require the immediately preceding slice in the bitstream order to be decoded first. A slice shall be dependent on at most a single dependent slice. 3.2.4 Slicing and Blocking A group of slices within a point cloud frame can be identified by a common value of slice_tag. The tile manifest provides a means of associating a bounding box with a set of slices. Each tile consists of a single bounding box and an identifier (tileId). Tile bounding boxes can overlap. When a tile manifest is present in the bitstream, the slice_tag will identify the tile by tileId. Otherwise, the use of slice_tag is application specific. The decoding process described in this document does not use the tile information. Decoder implementations may use the tile list to assist in spatial random access. A decoder performing spatial random access to decode a region R can use the tile manifest to determine the tilelds of the set of tiles that intersect R. Only slices with matching tilelds need to be decoded. 3.2.5 Parameter Set 3.2.5.1 Activation of parameter sets Parameters contained in SPS, GPS or APS will not have any effect until the corresponding parameter set is activated. At any given moment during the decoding process, at most one of the SPS, GPS and APS is active. Activation of a parameter set will deactivate any previously active parameter set of the same type. At the beginning of an encoded point cloud sequence, no parameter set is active. The SPS should be activated by parsing the GDU. After activation, the activated SPS will remain active for the entire encoded and decoded point cloud sequence. GPS should be activated by parsing the GDU. APS should be activated by parsing ADU. NOTE: Other DUs containing references to SPS, GPS or APSDUs do not cause the referenced parameter sets to be activated. 3.2.5.2 Order of parameter sets The DUs shall be delivered to the decoder in an order that makes any activated parameter sets available at the point of activation. 3.2.5.3 Copy parameter set All parameter set DUs with the same parameter set identifier shall be identical for the duration of the coded point cloud sequence. 3.3G-PCC GDU header (i.e., slice header) 3.3.1 Geometry Data Unit Header Syntax 3.3.2 Geometric Data Unit Header Semantics gdu_geometry_parameter_set_id specifies the value of the active GPS gps_geom_parameter_set_id. gdu_reserved_zero_3bits shall be equal to 0 in bitstreams conforming to this version of this document. Other values ​​of gdu_reserved_zero_3bits are reserved for future use by ISO / IEC. Decoders shall ignore the value of gdu_reserved_zero_3bits. slice_id identifies the slice for reference by other syntax elements. slice_tag can be used to identify one or more slices with a particular value of slice_tag. When a chunk manifest data unit is present, slice_tag is the chunk id. Otherwise, when no chunk manifest data unit is present, the interpretation of slice_tag is specified by external means. frame_ctr_lsb specifies the least significant bits of the frame_ctr_lsb_bits of the hypothetical frame number counter. Consecutive slices with different values ​​of frame_ctr_lsb form part of different output point cloud frames. Consecutive slices with the same value of frame_ctr_lsb without intervening frame boundary marker data units form part of the same encoded point cloud frame. A bitstream conformance requirement is that each encoded and decoded point cloud frame should have a unique value for FrameCtr. slice_entropy_continuation equal to 1 specifies that the entropy parsing state recovery process (XREF) will be applied to the GDU and any ADUs in the slice. slice_entropy_continuation equal to 0 specifies that the entropy parsing of the GDU and any ADUs in the slice is independent of any other slice. When not present, slice_entropy_continuation should be inferred to be 0. A bitstream conformance requirement is that slice_entropy_continuation is equal to 0 when the GDU is the first DU in a coded point cloud frame. prev_slice_id shall be equal to the value of slice_id of the previous GDU in the bitstream order. The decoder shall ignore slices where prev_slice_id is present and not equal to the value of slice_id of the previous slice. NOTE: It is recommended that slice_entropy_continuation should not be equal to 1 if slice_tag is not equal to the slice_tag of the GDU identified by prev_slice_id. 4. Question The design in the latest draft G-PCC specification has the following issues: 1) It specifies that a slice should be dependent on at most a single dependent slice. However, it is unclear whether it is allowed for slice C to depend on slice B, and slice B to depend on slice A, in which case slice A is dependent on both slices B and C. Furthermore, it is unclear whether a slice can be dependent on slices in different point cloud frames. 2) Allow slice_entropy_continuation to be equal to 1 for the current slice when its slice_tag is not equal to the slice_tag of the slice whose slice_id is equal to the prev_slice_id of the current slice. In other words, slice dependencies across tiles within a point cloud frame are allowed. However, this will disable the following spatial random access use case described in the latest draft G-PCC specification: A decoder performing spatial random access to decode a region R can use the tile manifest to determine the tileIds of the set of tiles that intersect R, and only needs to decode slices with matching tileIds. 3) Regarding duplicate parameter sets, it is specified that all parameter set DUs with the same parameter set identifier should be identical for the duration of a coded point cloud sequence. However, different types of parameter sets of a coded point cloud sequence may have the same parameter set identifier value. Therefore, this constraint should be narrowed down to specific types of parameter sets. 5. Detailed solutions In order to solve the above problems, the methods outlined below are disclosed. These solutions should be considered as examples for explaining the general concept and should not be interpreted in a narrow manner. In addition, these solutions can be applied alone or combined in any way. 1) In order to solve the first problem, one or more of the following items are stipulated: a. The first slice should be directly depended on by at most a single dependent slice. i. Alternatively, specify that the first slice should be depended on (directly or indirectly) by at most a single dependent slice. ii. In one example, the dependent slice may be explicitly signaled by the first slice. iii. In one example, dependent slices for the first slice may be derived implicitly. 1. For example, a dependent slice may be a slice that precedes the first slice in decoding order. b. Slices in a point cloud frame should not be dependent on slices in other point cloud frames (directly or indirectly). c. Slices in a chunk should not be depended on (directly or indirectly) by slices in other chunks. 2) In order to solve the second problem, it is stipulated that when the slice_tag of the slice sliceA is not equal to the slice_tag of the slice sliceB whose slice_id is equal to the prev_slice_id of sliceA, the value of the slice_entropy_continuation of the slice sliceA should be equal to 0. a. Alternatively, it is specified that when a tile manifest data unit applied to a point cloud frame exists, the value of slice_entropy_continuation of slice sliceA in the point cloud frame shall be equal to 0 when slice_tag of slice sliceA is not equal to slice_tag of slice sliceB whose slice_id is equal to prev_slice_id of sliceA. 3) To solve the third problem, it is specified that all parameter set DUs of a specific type of parameter set with the same parameter set identifier should be the same within the duration of the coded and decoded point cloud sequence. a. Alternatively, provide for the following: i. All SPSDUs with the same parameter set identifier shall be identical for the duration of the coded point cloud sequence. ii. All GPSDUs with the same parameter set identifier shall be identical for the duration of the encoded and decoded point cloud sequence. iii. All APSDUs with the same parameter set identifier shall be identical for the duration of the coded point cloud sequence. 6. Examples The following are some example embodiments of all solution aspects outlined in Section 5 above. These embodiments can be applied to G-VVC. The changes are highlighted relative to the latest draft G-PCC specification, where Underline , and deleted parts are shown with strikethrough. 6.1 Example 1 This embodiment corresponds to items 1.a, 1.b, 2, and 3 in Section 5. 6.1.1 Encoded and Decoded Point Cloud Frames and Slices A decoded point cloud frame consists of a sequence of zero or more slices with the same value of FrameCtr. Consecutive frame boundary data units are used to indicate empty frames. The code point cloud frame consists of the following data units: —Geometry, attribute, or default attribute data element. —Zero or more frame boundary data units identifying the boundary between two encoded and decoded point cloud frames. A slice is an unordered list of points. Slice point positions are encoded relative to the slice origin in the encoded coordinate system. The encoded volumes of a slice may intersect, including within a point cloud frame. Each slice will consist of a single GDU followed by zero or more ADUs. The GDU header acts as a slice header. ADU depends on the corresponding GDU in the same slice. DUs belonging to different slices should not be interleaved. The decoded point cloud frame is the concatenation of all points in all constituent slices of the frame. Coincident points in a point cloud frame may originate from the concatenation of multiple slices. Slices are either independent or dependent. Independent slices do not require any other slices to be decoded first. Dependent slices require the immediately preceding slice in the bitstream order to be decoded first. A slice should be depended on by at most a single slice direct rely. 6.1.2 Parameter Set 6.1.2.1 Activation of parameter sets Parameters contained in SPS, GPS or APS will not have any effect until the corresponding parameter set is activated. At any given moment during the decoding process, at most one of the SPS, GPS and APS is active. Activation of a parameter set will deactivate any previously active parameter set of the same type. At the beginning of an encoded point cloud sequence, no parameter set is active. The SPS should be activated by parsing the GDU. After activation, the activated SPS will remain active for the entire encoded and decoded point cloud sequence. GPS should be activated by parsing the GDU. APS should be activated by parsing ADU. NOTE: Other DUs containing references to SPS, GPS or APSDUs do not cause the referenced parameter sets to be activated. 6.1.2.2 Order of parameter sets The DUs shall be delivered to the decoder in an order that makes any activated parameter sets available at the point of activation. 6.1.2.3 Copy parameter set with the same parameter set identifier A specific type of parameter set All parameter sets DU shall be identical for the duration of the coded point cloud sequence. 6.1.3 Geometry Data Unit Header Semantics gdu_geometry_parameter_set_id specifies the value of the active GPS gps_geom_parameter_set_id. gdu_reserved_zero_3bits shall be equal to 0 in bitstreams conforming to this version of this document. Other values ​​of gdu_reserved_zero_3bits are reserved for future use by ISO / IEC. Decoders shall ignore the value of gdu_reserved_zero_3bits. slice_id identifies the slice for reference by other syntax elements. slice_tag can be used to identify one or more slices with a particular value of slice_tag. When a chunk manifest data unit is present, slice_tag is the chunk id. Otherwise, when no chunk manifest data unit is present, the interpretation of slice_tag is specified by external means. frame_ctr_lsb specifies the least significant bits of the frame_ctr_lsb_bits of the hypothetical frame number counter. Consecutive slices with different values ​​of frame_ctr_lsb form part of different output point cloud frames. Consecutive slices with the same value of frame_ctr_lsb without intervening frame boundary marker data units form part of the same encoded point cloud frame. A bitstream conformance requirement is that each encoded and decoded point cloud frame should have a unique value for FrameCtr. slice_entropy_continuation equal to 1 specifies that the entropy parsing state recovery process (XREF) will be applied to the GDU and any ADUs in the slice. slice_entropy_continuation equal to 0 specifies that the entropy parsing of the GDU and any ADUs in the slice is independent of any other slice. When not present, slice_entropy_continuation should be inferred to be 0. A bitstream conformance requirement is that slice_entropy_continuation is equal to 0 when the GDU is the first DU in a coded point cloud frame. prev_slice_id shall be equal to the value of slice_id of the previous GDU in the bitstream order. The decoder shall ignore slices where prev_slice_id is present and not equal to the value of slice_id of the previous slice. The bitstream conformance requirement is that when sliceA's slice_tag is not equal to its slice_id is equal to sliceA's prev_slice_id sliceB's slice_tag, sliceA's slice_entropy_ The value of continuation should be equal to 0.

[0053] More details of embodiments of the present disclosure related to slicing and parameter sets in geometry-based point cloud compression are described below.

[0054] As used herein, the term "point cloud sequence" may refer to a sequence of zero or more point clouds. The term "point cloud frame" may refer to a point cloud in a point cloud sequence. The term "encoded point cloud frame" may refer to an encoded representation of a point cloud frame. The term "bounding box" may refer to an axis-aligned cuboid that defines a spatial region that delimits a set of points. The term "slice" may refer to a portion or all of an encoded point cloud frame consisting of a geometry data unit (GDU) and zero or more corresponding attribute data units (ADUs).

[0055] Figure 4 FIG. 4 is a flowchart of a method 400 for point cloud encoding and decoding according to some embodiments of the present disclosure. Figure 4 As shown, at 402, a conversion between a current point cloud frame of a point cloud sequence and a bitstream of the point cloud sequence is performed. In some embodiments, the current point cloud frame may be encoded into the bitstream during the conversion at 402. Additionally or alternatively, the current point cloud frame may be decoded from the bitstream during the conversion at 402.

[0056] During the conversion at 402, the first slice in the current point cloud frame is directly dependent on no more than a single dependent slice. That is, the first slice is directly dependent on a single dependent slice, or the first slice is not directly dependent on anything. In other words, the slice should be directly dependent on no more than a single dependent slice. In one example, the first slice may be directly dependent on the second slice, and the second slice may be directly dependent on the third slice. In this case, the first slice is also indirectly dependent on the third slice.

[0057] In view of the above, a slice should be directly dependent on no more than a single dependent slice. Compared with traditional schemes lacking such constraints, the proposed method can advantageously better support the application of slices and thus improve the efficiency of point cloud processing.

[0058] In some embodiments, the number of dependent slices that directly or indirectly depend on the first slice is no greater than one. That is, a slice should be at most dependent on a single dependent slice (directly or indirectly). In other words, a slice should not be indirectly dependent on anything.

[0059] In some embodiments, a single dependent slice may be in the current point cloud frame. That is, a slice in a point cloud frame should not be dependent (directly or indirectly) on slices in other point cloud frames.

[0060] In some embodiments, the single dependent slice may be indicated by the first slice. For example, the dependent slice may be explicitly signaled by the first slice. In some alternative embodiments, the single dependent slice for the first slice may be implicitly derived. In one example, the single dependent slice may be determined based on the codec order. In another example, the single dependent slice precedes the first slice in the codec order.

[0061] In some embodiments, the first slice and the single dependent slice may be in the same tile in the current point cloud frame. Additionally or alternatively, the first slice may not be allowed to be dependent on slices in another point cloud frame different from the current point cloud frame. That is, the first slice should not be dependent on slices in another point cloud frame (directly or indirectly). In other words, slices in a tile should not be dependent on slices in another tile (directly or indirectly).

[0062] In some embodiments, the slice tag of the first slice may be different from the slice tag of the slice that precedes the first slice in the bitstream order. In one example, the slice that precedes the first slice in the bitstream order is the slice whose slice_id is equal to the prev_slice_id of the first slice. The geometry data unit (GDU) and the attribute data unit (ADU) in the first slice may be parsed independently. For example, the value of the syntax element slice_entropy_continuation of the first slice may be equal to 0.

[0063] In some embodiments, the tile manifest may be applied to the current point cloud frame. When there is a tile manifest data unit applied to the point cloud frame, the value of the syntax element slice_entropy_continuation of the first slice shall be equal to 0 when the slice_tag of the first slice is not equal to the slice_tag of the slice whose slice_id is equal to the prev_slice_id of the first slice.

[0064] In some embodiments, the conversion may be performed based on multiple data units for a parameter set of a first type. The multiple data units may have the same parameter set identifier, and the multiple data units are identical for the duration of the encoded point cloud sequence of the point cloud sequence. In other words, all parameter set DUs of a specific type of parameter set with the same parameter set identifier should be identical for the duration of the encoded point cloud sequence.

[0065] By way of example and not limitation, the first type of parameter set may be one of the following: a sequence parameter set (SPS), a geometry parameter set (GPS), or an attribute parameter set (APS). That is, all SPS data units (DUs) with the same parameter set identifier shall be identical for the duration of the encoded and decoded point cloud sequence. All GPS DUs with the same parameter set identifier shall be identical for the duration of the encoded and decoded point cloud sequence. All APS DUs with the same parameter set identifier shall be identical for the duration of the encoded and decoded point cloud sequence.

[0066] According to an embodiment of the present disclosure, a non-transitory computer-readable recording medium is proposed. A bitstream of a point cloud sequence is stored in a non-transitory computer-readable recording medium. The bitstream can be generated by a method performed by a point cloud processing device. According to the method, a conversion is performed between a current point cloud frame of a point cloud sequence and the bitstream. The first slice in the current point cloud frame is directly dependent on no more than a single dependent slice.

[0067] According to an embodiment of the present disclosure, a method for storing a bitstream of a point cloud sequence is proposed. In the method, a conversion is performed between a current point cloud frame of the point cloud sequence and a bitstream. The first slice in the current point cloud frame is directly dependent on no more than a single dependent slice. The bitstream is stored in a non-transitory computer-readable recording medium.

[0068] Implementations of the present disclosure may be described according to the following clauses, and features of these clauses may be combined in any reasonable manner.

[0069] Clause 1. A method for point cloud encoding and decoding, comprising: performing conversion between a current point cloud frame of a point cloud sequence and a bitstream of the point cloud sequence, wherein a first slice in the current point cloud frame is directly dependent on no more than a single dependent slice.

[0070] Clause 2. The method of clause 1, wherein the number of dependent slices that directly or indirectly depend on the first slice is no greater than one.

[0071] Clause 3. A method according to any one of clauses 1 to 2, wherein the single dependent slice is in the current point cloud frame.

[0072] Clause 4. The method according to any one of clauses 1 to 2, wherein the first slice is not allowed to be dependent on slices in another point cloud frame different from the current point cloud frame.

[0073] Clause 5. A method according to any one of clauses 1 to 4, wherein the single dependent slice is indicated by the first slice.

[0074] Clause 6. A method according to any one of clauses 1 to 4, wherein the single dependent slice is determined based on a coding order.

[0075] Clause 7. A method as described in any of clauses 1 to 4, wherein the single dependent slice precedes the first slice in coding order.

[0076] Clause 8. A method according to any one of clauses 1 to 7, wherein the first slice and the single dependent slice are in the same block in the current point cloud frame.

[0077] Clause 9. A method according to any one of clauses 1 to 8, wherein the slice tag of the first slice is different from the slice tags of slices preceding the first slice in the bitstream order, and the geometry data unit (GDU) and attribute data unit (ADU) in the first slice are parsed independently.

[0078] Clause 10. The method of clause 8, wherein a tile list is applied to the current point cloud frame.

[0079] Clause 11. A method according to any one of clauses 1 to 10, wherein the conversion is performed based on multiple data units for a first type of parameter set, the multiple data units have the same parameter set identifier, and the multiple data units are the same for the duration of the encoded point cloud sequence of the point cloud sequence.

[0080] Clause 12. The method of clause 11, wherein the first type of parameter set is one of: a sequence parameter set (SPS), a geometry parameter set (GPS), or an attribute parameter set (APS).

[0081] Clause 13. A method according to any one of clauses 1-12, wherein the converting comprises encoding the current point cloud frame into the bitstream.

[0082] Clause 14. A method according to any of clauses 1-12, wherein the converting comprises decoding the current point cloud frame from the bitstream.

[0083] Clause 15. An apparatus for processing point cloud 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 clauses 1 to 14.

[0084] Clause 16. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform the method of any one of clauses 1 to 14.

[0085] Item 17. A non-transitory computer-readable recording medium storing a bitstream generated by a method executed by a point cloud processing device having a point cloud sequence, wherein the method comprises: performing a conversion between a current point cloud frame of the point cloud sequence and the bitstream, wherein the first slice in the current point cloud frame is directly dependent on no more than a single dependent slice.

[0086] Item 18. A method for storing a bitstream of a point cloud sequence, comprising: performing a conversion between a current point cloud frame of the point cloud sequence and the bitstream, wherein a first slice in the current point cloud frame is directly dependent on no more than a single dependent slice; and storing the bitstream in a non-transitory computer-readable recording medium. Example Device

[0087] Figure 5 A block diagram of a computing device 500 in which various embodiments of the present disclosure may be implemented is shown. The computing device 500 may be implemented as or included in the source device 100 (or GPCC encoder 116 or 200) or the destination device 120 (or GPCC decoder 126 or 300).

[0088] Understandably, Figure 5 The computing device 500 shown in FIG. 5 is for illustration purposes only and is not intended to in any way imply any limitation on the functionality and scope of embodiments of the present disclosure.

[0089] like Figure 5 As shown, the computing device 500 includes a general computing device 500, which may include at least one or more processors or processing units 510, a memory 520, a storage unit 530, one or more communication units 540, one or more input devices 550, and one or more output devices 550.

[0090] In some embodiments, the computing device 500 can be implemented as any user terminal or server terminal with computing capabilities. The server terminal can be a server provided by a service provider, a large computing device, etc. The user terminal can be, for example, any type of mobile terminal, fixed terminal or portable terminal, including a mobile phone, a station, a unit, a device, a multimedia computer, a multimedia tablet computer, an Internet node, a communicator, a desktop computer, a laptop computer, a notebook computer, a netbook computer, a tablet computer, a personal communication system (PCS) device, a personal navigation device, a personal digital assistant (PDA), an audio / video player, a digital camera / camcorder, a positioning device, a television receiver, a radio broadcast receiver, an e-book device, a gaming device, or any combination thereof, and includes accessories and peripherals of these devices, or any combination thereof. It is conceivable that the computing device 500 can support any type of interface to the user (such as a "wearable" circuit device, etc.).

[0091] Processing unit 510 may be a physical or virtual processor and may implement various processes based on programs stored in memory 520. In a multi-processor system, multiple processing units execute computer executable instructions in parallel to increase the parallel processing capabilities of computing device 500. Processing unit 510 may also be referred to as a central processing unit (CPU), a microprocessor, a controller, or a microcontroller.

[0092] The computing device 500 typically includes a variety of computer storage media, such media can be any media accessible to the computing device 500, including but not limited to volatile and non-volatile media, or removable and non-removable media. The memory 520 can be a volatile memory (e.g., registers, cache, random access memory (RAM)), a non-volatile memory (e.g., read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM) or flash memory), or any combination thereof. The storage unit 530 can be any removable or non-removable medium, and can include machine-readable media, such as memory, flash drives, disks, or other media that can be used to store information and / or data and can be accessed in the computing device 500.

[0093] The computing device 500 may also include additional removable / non-removable, volatile / non-volatile storage media. Figure 5 Not shown, but a disk drive for reading and / or writing from a removable and non-volatile disk and an optical drive for reading and / or writing from a removable and non-volatile optical disk may be provided, in which case each drive may be connected to the bus (not shown) via one or more data media interfaces.

[0094] The communication unit 540 communicates with further computing devices via a communication medium. In addition, the functionality of the components in the computing device 500 may be implemented by a single computing cluster or multiple computing machines that can communicate via a communication connection. Thus, the computing device 500 may operate in a networked environment using logical connections to one or more other servers, networked personal computers (PCs), or further general-purpose network nodes.

[0095] Input device 550 may be one or more of various input devices, such as a mouse, keyboard, trackball, voice input device, etc. Output device 560 may be one or more of various output devices, such as a display, speaker, printer, etc. Computing device 500 may further communicate with one or more external devices (not shown) such as storage devices and display devices, one or more of which enable a user to interact with computing device 500, or any device that enables computing device 500 to communicate with one or more other computing devices (e.g., a network card, modem, etc.) if desired, through communication unit 540. Such communication may be performed through an input / output (I / O) interface (not shown).

[0096] In some embodiments, some or all components of the computing device 500 may also be arranged in a cloud computing architecture rather than being integrated in a single device. In a cloud computing architecture, components may be provided remotely and work together to implement the functions described in the present disclosure. In some embodiments, cloud computing provides computing, software, data access, and storage services, which will not require the end user to know the physical location or configuration of the system or hardware that provides these services. In various embodiments, cloud computing provides services via a wide area network (e.g., the Internet) using a suitable protocol. For example, a cloud computing provider provides applications via a wide area network, which can be accessed through a web browser or any other computing component. The software or components of the cloud computing architecture and the corresponding data may be stored on a remote server. The computing resources in a cloud computing environment may be merged or distributed at the location of a remote data center. Cloud computing infrastructure may provide services through a shared data center, although they appear as a single access point for users. Therefore, the cloud computing architecture may be used to provide the components and functions described herein from a service provider at a remote location. Alternatively, they may be provided by a conventional server, or installed directly or otherwise on a client device.

[0097] The computing device 500 may be used to implement the point cloud encoding / decoding in the embodiments of the present disclosure, and the memory 520 may include one or more point cloud encoding / decoding modules 525 having one or more program instructions, which can be accessed and executed by the processing unit 510 to perform the functions of the various embodiments described herein.

[0098] In an example embodiment of performing point cloud encoding, an input device 550 may receive point cloud data as input 570 to be encoded, and the point cloud data may be processed, for example, by a point cloud codec module 525 to generate an encoded bitstream, which may be provided as output 580 via an output device 560 .

[0099] In an example embodiment of performing point cloud decoding, input device 550 may receive an encoded bitstream as input 570 , which may be processed, for example, by point cloud codec module 525 to generate decoded point cloud data. The decoded point cloud data may be provided as output 580 via output device 560 .

[0100] Although the present disclosure has been specifically shown and described with reference to the preferred embodiments of the present disclosure, it will be understood by those skilled in the art that various changes can be made in form and detail without departing from the spirit and scope of the present application as defined by the appended claims. These changes are intended to be encompassed by the scope of the present application. Therefore, the foregoing description of the embodiments of the present application is not intended to be limiting.

Claims

1. A method for point cloud encoding and decoding, comprising: A conversion is performed between a current point cloud frame of a point cloud sequence and a bitstream of the point cloud sequence, wherein a first slice in the current point cloud frame is directly dependent on no more than a single dependent slice. 2 . The method according to claim 1 , wherein the number of dependent slices that directly or indirectly depend on the first slice is no greater than one.

3. The method according to any one of claims 1 to 2, wherein the single dependent slice is in the current point cloud frame. 4 . The method according to claim 1 , wherein the first slice is not allowed to be dependent on slices in another point cloud frame different from the current point cloud frame.

5. The method according to any one of claims 1 to 4, wherein the single dependent slice is indicated by the first slice.

6. The method according to any one of claims 1 to 4, wherein the single dependent slice is determined based on a coding and decoding order.

7. The method according to any one of claims 1 to 4, wherein the single dependent slice precedes the first slice in coding order.

8. The method according to any one of claims 1 to 7, wherein the first slice and the single dependent slice are in the same block in the current point cloud frame.

9. The method according to any one of claims 1 to 8, wherein the slice tag of the first slice is different from the slice tag of the slice preceding the first slice in the bitstream order, and the geometry data unit (GDU) and the attribute data unit (ADU) in the first slice are parsed independently.

10. The method of claim 8, wherein a tile list is applied to the current point cloud frame.

11. A method according to any one of claims 1 to 10, wherein the conversion is performed based on multiple data units for a first type of parameter set, the multiple data units have the same parameter set identifier, and the multiple data units are the same for the duration of the encoded point cloud sequence of the point cloud sequence.

12. The method of claim 11, wherein the first type of parameter set is one of: Sequence Parameter Set (SPS), Geometry parameter set (GPS), or Attribute Parameter Set (APS).

13. The method according to any one of claims 1-12, wherein the converting comprises encoding the current point cloud frame into the bitstream.

14. The method of any one of claims 1-12, wherein the converting comprises decoding the current point cloud frame from the bitstream.

15. An apparatus for processing point cloud 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 claims 1 to 14.

16. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform the method according to any one of claims 1 to 14.

17. A non-transitory computer-readable recording medium storing a bitstream of a point cloud sequence generated by a method performed by a point cloud processing device, wherein the method comprises: Converting is performed between a current point cloud frame of the point cloud sequence and the bitstream, a first slice in the current point cloud frame being directly dependent on by no more than a single dependent slice.

18. A method for storing a bit stream of a point cloud sequence, comprising: performing conversion between a current point cloud frame of the point cloud sequence and the bitstream, a first slice in the current point cloud frame being directly dependent on by no more than a single dependent slice; as well as The bit stream is stored in a non-transitory computer-readable recording medium.