Method, apparatus and medium for point cloud coding
By allowing search within different LOD groups and using multiple lists with varied geometric distances, the method addresses inefficiencies in conventional point cloud coding, enhancing accuracy and efficiency of nearest neighbor search and attribute inter-prediction.
Patent Information
- Application Number
- JP2024531412
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2021-11-26
- Filing Date
- 2022-11-25
- Publication Date
- 2024-11-14
- Estimated Expiration
- 2042-11-25
AI Technical Summary
Conventional point cloud coding techniques suffer from inefficiencies in accuracy and complexity in nearest neighbor search and attribute inter-prediction, particularly in geometry-based point cloud compression, due to inconsistent point distributions and reliance on Euclidean distance calculations.
The proposed method improves nearest neighbor search by allowing search within different levels of detail (LOD) groups and using multiple lists for neighboring points, incorporating geometric distances like Manhattan and Euclidean distances, and applying motion compensation to enhance prediction accuracy and efficiency.
This approach enhances the accuracy and efficiency of nearest neighbor search and attribute inter-prediction in point cloud coding, reducing computational complexity and improving coding performance.
Smart Images

Figure 2024542319000001_ABST
Abstract
Description
[Technical field]
[0001] FIELD OF THE DISCLOSURE Embodiments of the present disclosure relate generally to point cloud coding techniques, and more particularly to optimized inter prediction for point cloud attribute coding based on nearest neighbor search. [Background technology]
[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 contents of a three-dimensional space. Point clouds have shown to be a promising way to represent 3D visual data for a wide range of immersive applications, from augmented reality to autonomous vehicles.
[0003] Point cloud coding standards have evolved primarily through the development of the well-known MPEG organization. MPEG stands for Moving Picture Experts Group, one of the major standardization groups dealing with multimedia. In 2017, the MPEG 3D Graphics Coding Group (3DG) issued a Call for Proposals (CFP) document to initiate the development of a point cloud coding standard. The final standard will consist of two classes of solutions. Video-based point cloud compression (V-PCC or VPCC) is suitable for point sets where the points are relatively uniformly distributed. Geometry-based point cloud compression (G-PCC or GPCC) is suitable for more sparse distributions. However, the coding efficiency of traditional point cloud coding techniques is generally expected to be further improved. Summary of the Invention
[0004] An embodiment of the present disclosure provides a method for point cloud coding.
[0005] In a first aspect, a method for point cloud coding is proposed, which comprises, during a conversion between a current point cloud (PC) sample and a bitstream of a point cloud sequence, determining, for a current point in a current PC sample of a point cloud sequence, at least one neighbouring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a Level of Detail (LOD) group of the reference PC sample, and performing the conversion based on the at least one neighbouring point.
[0006] According to the method according to the first aspect of the present disclosure, points in a group of LODs of a reference PC sample are searched to obtain neighboring points of a current point. Compared with the conventional approach of only searching points in the same LOD as the current point, the proposed method can advantageously improve the accuracy of nearest neighbor search and attribute inter-prediction.
[0007] In a second aspect, another method for point cloud coding is proposed, which includes, during a conversion between a current point cloud (PC) sample and a bitstream of a point cloud sequence, determining a first plurality of neighboring points from a point in a second plurality of PC samples of a point cloud sequence to a current point in a current PC sample of the point cloud sequence, and performing the conversion based on the first plurality of neighboring points, where the first plurality of neighboring points are stored in a third plurality of lists.
[0008] According to the method according to the second aspect of the present disclosure, multiple neighboring points of a current point are stored in multiple lists. Compared with the conventional solution in which the neighboring points are stored in only one list, the proposed method can advantageously improve the efficiency of nearest neighbor search and attribute inter-prediction.
[0009] In a third aspect, an apparatus for processing point cloud data is proposed, the apparatus for processing point cloud data comprising a processor and a non-transitory memory with instructions that, when executed by the processor, cause the processor to perform a method according to the first or second aspect of the present disclosure.
[0010] In a fourth aspect, a non-transitory computer readable storage medium is proposed, said non-transitory computer readable storage medium storing instructions for causing a processor to perform a method according to the first or second aspect of the present disclosure.
[0011] In a fifth aspect, a non-transitory computer readable recording medium is proposed, which stores a bit stream of a point cloud sequence generated by a method executed by a point cloud processing device, the method comprising: determining, for a current point in a current point cloud (PC) sample of the point cloud sequence, at least one neighbouring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a Level of Detail (LOD) group of the reference PC sample; and generating the bit stream based on the at least one neighbouring point.
[0012] In a sixth aspect, a method for storing a bitstream of a point cloud sequence is proposed, the method comprising: determining, for a current point in a current point cloud (PC) sample of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a Level of Detail (LOD) group of the reference PC sample, generating the bitstream based on the at least one neighboring point, and storing the bitstream in a non-transitory computer-readable recording medium.
[0013] In a seventh aspect, another non-transitory computer-readable storage medium is proposed, the non-transitory computer-readable storage medium storing a bit stream of a point cloud sequence generated by a method executed by a point cloud processing device, the method comprising: determining a first plurality of neighboring points from points in a second plurality of current point cloud (PC) samples of the point cloud sequence to a current point in a PC sample of the point cloud sequence; and generating the bit stream based on the first plurality of neighboring points, where the first plurality of neighboring points are stored in a third plurality of lists.
[0014] In an eighth aspect, a method for storing a bit stream of a point cloud sequence is proposed, the method comprising: determining a first plurality of neighboring points from points in a second plurality of PC samples of the point cloud sequence to a current point in a current point cloud (PC) sample of the point cloud sequence, generating the bit stream based on the first plurality of neighboring points, and storing the bit stream in a non-transitory computer-readable recording medium, where the first plurality of neighboring points are saved in a third plurality of lists.
[0015] This description is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This description 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]
[0016] The above and other objects, features, and advantages of exemplary embodiments of the present disclosure will become more apparent through the following detailed description taken in conjunction with the accompanying drawings, in which like reference numerals generally refer to like components.
[0017] [Figure 1] FIG. 1 is a block diagram illustrating an example point cloud coding system that may utilize techniques of this disclosure.
[0018] [Diagram 2] FIG. 2 shows a block diagram illustrating an exemplary point cloud encoder according to some embodiments of the present disclosure.
[0019] [Diagram 3] FIG. 2 shows a block diagram illustrating an exemplary point cloud decoder, in accordance with some embodiments of the present disclosure.
[0020] [Figure 4] 1 illustrates a flowchart of a method for point cloud coding according to some embodiments of the present disclosure.
[0021] [Diagram 5] 1 illustrates a flowchart of another method for point cloud coding according to some embodiments of the present disclosure.
[0022] [Figure 6] FIG. 1 illustrates a block diagram of a computing device capable of implementing various embodiments of the present disclosure.
[0023] Throughout the drawings, the same or similar reference numbers typically refer to the same or similar elements. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0024] Next, the principles of the present disclosure will be described with reference to some embodiments. It should be understood that these embodiments are provided for illustrative purposes only, to help those skilled in the art understand and embody the present disclosure, and do not imply any limitations on the scope of the present disclosure. The disclosure described herein can be embodied in various ways other than those described below.
[0025] In the following description and claims, unless otherwise defined, 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.
[0026] References in this disclosure to "one embodiment," "one embodiment," "exemplary embodiment," and the like indicate that the described embodiment may include a particular feature, structure, or characteristic, but not all embodiments necessarily include the particular feature, structure, or characteristic. Moreover, such phrases do not necessarily refer to the same embodiment. Furthermore, when a particular feature, structure, or characteristic is described in connection with an exemplary embodiment, it is noted that it is within the knowledge of one of ordinary skill in the art to affect such feature, structure, or characteristic in connection with other embodiments, whether or not explicitly described.
[0027] Terms such as "first" and "second" may be used herein to describe various elements, but it should be understood that these elements should not be limited by these terms. These terms are used only to distinguish one element from another. For example, a first element may be referred to as a second element, and similarly, a second element may 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.
[0028] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments. As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms unless the context clearly dictates otherwise. It will be further understood that the terms "comprise," "comprising," "having," "having," "containing," and / or "including," as used herein, specify the presence of stated 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.
[0029] [Example environment] 1 is a block diagram illustrating an example point cloud coding system 100 that may utilize the techniques of this disclosure. As illustrated, the point cloud coding 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 coding 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 techniques of this disclosure are generally directed to supporting coding (encoding and / or decoding) of point cloud data, i.e., point cloud compression. The coding may be effective to compress and / or decompress the point cloud data.
[0030] Source device 100 and 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, telephones such as smartphones and mobile phones, televisions, cameras, displays, digital media players, video game consoles, video streaming devices, vehicles (e.g., land or sea vehicles, spacecraft, aircraft, etc.), robots, LIDAR devices, satellites, augmented reality devices, etc. In some cases, source device 100 and destination device 120 may be equipped for wireless communication.
[0031] 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. In accordance with 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 techniques of the present disclosure related to point cloud coding. Thus, 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 or external source. Similarly, the destination device 120 may interface with an external data consumer rather than including the data consumer in the same device.
[0032] In general, the data source 112 may represent a source of point cloud data (i.e., raw, unencoded point cloud data) and provide a continuous series of "frames" of point cloud data to the GPCC encoder 116, which encodes the point cloud data of the frames. In some examples, the data source 112 generates the point cloud data. The data source 112 of the source device 100 may include any of a variety of cameras or sensors, such as one or more video cameras, an archive containing previously captured point cloud data, a point cloud capture device such as a 3D scanner or a light detection and ranging (LIDAR) device, and / or a data feed interface that receives point cloud data from a data content provider. Thus, in some examples, the data source 112 may generate the point cloud data based on signals from a LIDAR device. Alternatively or additionally, the point cloud data may be computationally generated from scanners, cameras, sensors, or other data. For example, the data source 112 may generate the point cloud data or a combination of live point cloud data, archived point cloud data, and computationally generated point cloud data. In either case, the GPCC encoder 116 encodes the captured, pre-captured, or computer-generated point cloud data. The GPCC encoder 116 may rearrange the frames of the point cloud data from the order in which they were received (sometimes referred to as "display order") into a coding order for coding. The GPCC encoder 116 may generate one or more bitstreams including the encoded point cloud data. The source device 100 may then output the encoded point cloud data via the I / O interface 118 for receipt and / or retrieval by, for example, the I / O interface 128 of the destination device 120. The encoded point cloud data may be transmitted directly to the destination device 120 over the network 130A via the I / O interface 118. The encoded point cloud data may be stored in a storage medium / server 130B for access by the destination device 120.
[0033] The memory 114 of the source device 100 and the memory 124 of the destination device 120 may represent general purpose memories. In some examples, the memory 114 and the memory 124 may store raw point cloud data, e.g., 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 executable by, e.g., the GPCC encoder 116 and the GPCC decoder 126, respectively. Although the memory 114 and the memory 124 are shown in this example as separate 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. Additionally, the memory 114 and the memory 124 may store encoded point cloud data, e.g., 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 to store raw, decoded, and / or encoded point cloud data. For example, memory 114 and memory 124 may store point cloud data.
[0034] The I / O interface 118 and the I / O interface 128 may represent a wireless transmitter / receiver, a modem, a wired networking component (e.g., an Ethernet card), a wireless communication component operating according to any of the various IEEE 802.11 standards, or other physical components. In examples where the I / O interface 118 and the I / O interface 128 include wireless components, the I / O interface 118 and the I / O interface 128 may be configured to transfer data, such as encoded point cloud data, according to a cellular communication standard, such as 4G, 4G-LTE (Long Term Evolution), LTE-Advanced, 5G, etc. In some examples where the I / O interface 118 includes a wireless transmitter, the I / O interface 118 and the I / O interface 128 may be configured to transfer data, such as encoded point cloud data, according to other wireless standards, such as the IEEE 802.11 standard. In some examples, the source device 100 and / or the destination device 120 may include respective system-on-chip (SoC) devices. For example, the source device 100 may include an SoC device that performs functions attributed to the GPCC encoder 116 and / or the I / O interface 118, and the destination device 120 may include an SoC device that performs functions attributed to the GPCC decoder 126 and / or the I / O interface 128.
[0035] The techniques of this disclosure may be applied to encoding and decoding in support of any of a variety of applications, such as communication between autonomous vehicles, communication between processing device devices such as scanners, cameras, sensors and local or remote servers, geographic mapping, or other applications.
[0036] The I / O interface 128 of the destination device 120 receives the encoded bitstream from the source device 110. The encoded bitstream may include signaling information defined by the GPCC encoder 116, which is also used by the GPCC decoder 126, such as syntax elements having values that represent the point cloud. The data consumer 122 uses the decoded data. For example, the data consumer 122 may use the decoded point cloud data to determine a location of a physical object. In some examples, the data consumer 122 may include a display that presents an image based on the point cloud data.
[0037] The GPCC encoder 116 and the GPCC decoder 126 may each be embodied 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 combinations thereof. If the techniques are embodied in part in software, the device may store instructions of the software on a suitable non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the techniques of this 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 composite encoder / decoder (CODEC) in the respective 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.
[0038] The GPCC encoder 116 and the GPCC decoder 126 may operate according to a coding standard, such as the Video Point Cloud Compression (VPCC) standard or the Geometry Point Cloud Compression (GPCC) standard. This disclosure may generally refer to coding (e.g., encoding and decoding) of frames, which includes the process of encoding or decoding data. An encoded bitstream generally includes a series of values of syntax elements that represent coding decisions (e.g., coding modes).
[0039] A point cloud may include a set of points in 3D space and may have attributes associated with the points. The attributes may be color information such as R, G, B, Y, Cb, Cr, or reflectance information, or other attributes. Point clouds may be captured by various cameras and sensors such as LIDAR sensors and 3D scanners, or may be computer generated. Point cloud data is used in various applications including, but not limited to, construction (modeling), graphics (3D models for visualization and animation), and automotive industry (LIDAR sensors used for navigation).
[0040] Figure 2 is a block diagram illustrating an example of a GPCC encoder 200, which may be an example of the GPCC encoder 116 in the system 100 shown in Figure 1, according to some embodiments of the present disclosure. Figure 3 is a block diagram illustrating an example of a GPCC decoder 300, which may be an example of the GPCC decoder 126 in the system 100 shown in Figure 1, according to some embodiments of the present disclosure.
[0041] In both GPCC Encoder 200 and GPCC Decoder 300, the point cloud location is coded first. The attribute coding depends on the coded geometry. In Figures 2 and 3, Region Adaptive Hierarchical Transformation (RAHT) unit 218, Surface Approximation Analysis unit 212, RAHT unit 314 and Surface Approximation Synthesis unit 310 are options that are typically used for category 1 data. Level of Detail (LOD) Generation unit 220, Lifting unit 222, LOD Generation unit 316 and Inverse Lifting unit 318 are options that are typically used for category 3 data. All other units are common to categories 1 and 3.
[0042] For category 3 data, the compressed geometry is typically represented as an octree going from the root down to the leaf level of the individual voxels. For category 1 data, the compressed geometry is typically represented by a pruned octree (i.e. an octree going from the root down to the leaf level of blocks larger than a voxel) and a model approximating the surface in each leaf of the pruned octree. In this way, both category 1 and category 3 data share the octree coding mechanism, but category 1 data may additionally approximate the voxels in each leaf with a surface model. The surface model used is a triangulation with 1-10 triangles per block, resulting in a triangle soup. Category 1 geometry codecs are therefore known as Trisoup geometry codecs and category 3 geometry codecs are known as Octree geometry codecs.
[0043] In the example of FIG. 2, 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 geometry 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.
[0044] 2, the GPCC encoder 200 may receive a set of locations and a set of attributes. The locations may include coordinates of points in the point cloud. The attributes may include information about the points in the point cloud, such as a color associated with the points in the point cloud.
[0045] The coordinate transformation unit 202 may apply a transform to the coordinates of the points to convert the coordinates from the initial domain to the transformation domain. In this disclosure, the transformed coordinates may be referred to as transformed coordinates. The color transformation unit 204 may apply a transform to convert the color information of the attribute to a different domain. For example, the color transformation unit 204 may convert the color information from the RGB color space to the YCbCr color space.
[0046] Further, in the example of FIG. 2, the voxelization unit 206 may voxelize the transformed coordinates. The 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 contained within a single "voxel" and then treated as one point in some aspects. Further, the octree analysis unit 210 may generate an octree based on the voxelized transformed coordinates. Additionally, in the example of FIG. 2, the surface approximation analysis unit 212 may analyze the points to potentially determine a surface representation of the set of points. The arithmetic coding unit 214 may perform arithmetic coding on syntax elements representing the octree and / or surface information determined by the surface approximation analysis unit 212. The GPCC encoder 200 may output these syntax elements in the geometry bitstream.
[0047] The geometry reconstruction unit 216 may reconstruct transformation coordinates of points in the point cloud based on the octree, the data indicative of the surface determined by the surface approximation analysis unit 212, and / or other information. The number of transformation coordinates reconstructed by the geometry reconstruction unit 216 may differ from the number of original points of the point cloud due to voxelization and surface approximation. In this disclosure, the resulting points may be referred to as reconstructed points. The attribute transfer unit 208 may transfer attributes of the original points of the point cloud to the reconstructed points of the point cloud data.
[0048] Further, the RAHT unit 218 may apply RAHT coding to the attributes of the reconstructed 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 reconstructed 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 syntax elements representing the quantized coefficients. The GPCC encoder 200 may output these syntax elements in an attribute bitstream.
[0049] In the example of FIG. 3, the GPCC decoder 300 may include a geometry 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 geometry reconstruction unit 312, a RAHT unit 314, an LOD generation unit 316, an inverse lifting unit 318, a coordinate inverse transformation unit 320, and a color inverse transformation unit 322.
[0050] The GPCC decoder 300 may obtain a geometry bitstream and an attribute bitstream. A 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, an attribute arithmetic decoding unit 304 may apply arithmetic decoding to syntax elements in the attribute bitstream.
[0051] The octree synthesis unit 306 may synthesize an octree based on syntax elements parsed from the geometry bitstream. If surface approximation is used in the geometry bitstream, the surface approximation synthesis unit 310 may determine a surface model based on the syntax elements and octrees parsed from the geometry bitstream.
[0052] Further, the geometry reconstruction unit 312 may perform the reconstruction to determine coordinates of points in the point cloud. The coordinate inverse transformation unit 320 may apply an inverse transformation to the reconstructed coordinates to transform the reconstructed coordinates (positions) of the points in the point cloud from the transformation domain back to the initial domain.
[0053] Additionally, in the example of Figure 3, the inverse quantization unit 308 may inverse quantize the attribute value. The attribute value may be based on syntax elements obtained from the attribute bitstream (e.g., including syntax elements decoded by the attribute arithmetic decoding unit 304).
[0054] Depending on how the attribute values are encoded, the RAHT unit 314 may perform RAHT coding to determine color values for the points of the point cloud based on the dequantized attribute values. Alternatively, the LOD generation unit 316 and the inverse lifting unit 318 may use level-of-detail based techniques to determine color values for the points of the point cloud.
[0055] 3, the color inverse transform unit 322 may apply an inverse color transform to the color values. The inverse color transform may 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 may convert the color information from the RGB color space to the YCbCr color space. Thus, the color inverse transform unit 322 may convert the color information from the YCbCr color space to the RGB color space.
[0056] The various units in Figures 2 and 3 are shown to aid in understanding the operations performed by the encoder 200 and the decoder 300. The units may be embodied as fixed function circuits, programmable circuits, or a combination thereof. A fixed function circuit refers to a circuit that provides a specific function and is preconfigured with respect to the operations that it can perform. A programmable circuit refers to a circuit that can be programmed to perform various tasks and provides flexible functionality in the operations that it can perform. For example, a programmable circuit may execute software or firmware that causes the programmable circuit to operate in a manner defined by the software or firmware instructions. Although a fixed function circuit may execute software instructions (e.g., to receive parameters or output parameters), the types of operations that a fixed function circuit performs are generally immutable. In some examples, one or more units may be separate circuit blocks (fixed function or programmable) and in some examples, one or more units may be integrated circuits.
[0057] Some exemplary embodiments of the present disclosure are described in detail below. It should be understood that section headings are used herein for ease of understanding and are not intended to limit the embodiments disclosed in a section to only that section. Furthermore, although certain embodiments are described with reference to GPCC or other specific point cloud codecs, the disclosed techniques are also applicable to other point cloud coding techniques. Furthermore, although some embodiments describe point cloud encoding steps in detail, it will be understood that the corresponding steps of decoding to undo the coding are embodied by a decoder. [1. Overview] This disclosure relates to point cloud coding techniques, specifically point cloud attribute prediction in inter prediction. The ideas can be applied individually or in various combinations to point cloud coding standards or non-standard point cloud codecs, such as the currently under development Geometry-Based Point Cloud Compression (G-PCC). [2.Abbreviation] G-PCC: Geometry based Point Cloud Compression MPEG: Moving Picture Experts Group 3DG: 3D Graphics Coding Group CFP:Call For Proposal V-PCC: Video-based Point Cloud Compression LOD: Level of Detail CE: Core Experiment EE: Exploration Experiment inter-EM: Inter Exploration Model PC:Point Cloud RDO: Rate-distortion Optimization [3. Background] Point cloud coding standards have evolved primarily through developments at the well-known MPEG organization. MPEG stands for Moving Picture Experts Group, one of the major standardization groups dealing with multimedia. In 2017, the MPEG 3D Graphics Coding Group (3DG) issued a Call for Proposals (CFP) document to begin development of a point cloud coding standard. The final standard will consist of two classes of solutions. Video-based point cloud compression (V-PCC) is suitable for point sets where the points are relatively uniformly distributed. Geometry-based point cloud compression (G-PCC) is suitable for more sparse distributions. In order to explore future point cloud coding techniques in G-PCC, Core Experiment (CE) 13.5 and Exploration Experiment (EE) 13.2 have been established to develop inter prediction techniques in G-PCC. Since then, many new inter prediction methods have been adopted by MPEG and incorporated into the reference software named inter Exploration Model (inter-EM). Within a point cloud, there can be geometry and attribute information. Geometry information is used to describe the geometric position of the data points. Attribute information is used to record details of the data points such as texture, normal vectors, reflection, etc. Point cloud codecs can handle different information in different ways. Usually, a codec has a number of optional tools that support coding and decoding of geometry and attribute information, respectively. [3.1 Attribute Intra Prediction] In G-PCC, two attribute coding methods are proposed that utilize geometry information to perform attribute intra prediction. [3.1.1 Conversion prediction] Transformation prediction is an interpolation-based hierarchical nearest neighbor prediction method, which is typically used for sparse point cloud content. First, a level of detail (LOD) structure is generated. Then, nearest neighbors are searched based on the LOD structure. Then, attribute prediction is performed based on the search results. [3.1.1.1 LOD Generation] In the LOD generation process, the geometry information is utilized to construct a hierarchical structure of the point cloud that defines a set of "levels of detail". The hierarchical structure is used to efficiently predict attributes. It also makes it possible to provide advanced features such as progressive transmission and scalable rendering. The LOD generation process divides the point cloud points into refinement levels (point sets) R0, R1, …, R according to a user-defined parameter L that indicates the LOD number. L-1 Next, the attributes of the point cloud points are reorganized from R0 to R L-1 Level of detail l, LOD l are the refinement levels R0, R1, …, R l This can be obtained by taking the union of:
number
number
number
[0058] Further details of embodiments of the present disclosure related to optimized inter prediction for point cloud attribute coding based on nearest neighbor search are described below.
[0059] As used herein, the term "point cloud sequence" may refer to a sequence of one or more point clouds. The term "frame" may refer to a point cloud in a point cloud sequence. The term "PC sample" may refer to a unit that performs coding in point cloud sequence coding, such as a point cloud frame, a sub-region in a point cloud frame, a picture, a slice, a tile, a subpicture, a node, a point, or other unit that includes one or more nodes or points.
[0060] FIG. 4 shows a flowchart of a method 400 for point cloud coding according to some embodiments of the present disclosure. The method 400 may be embodied during conversion between a current PC sample of a point cloud sequence and a bitstream of a point cloud sequence. As shown in FIG. 4, the method 400 starts at 402, where at least one neighboring point is determined from a set of points in a reference PC sample of the current PC sample for a current point in the current PC sample. The set of points is in a group of Level of Detail (LOD) of the reference PC sample. As an example, the at least one neighboring point may be at least one nearest neighbor of the current point. To obtain the at least one nearest neighbor, a nearest neighbor search may be performed for points at the same LOD as the current point, and a nearest neighbor search may be performed for points at a lower LOD than the current point.
[0061] At 404, a transformation is performed based on the at least one neighboring point. For example, an attribute value of the current point may be predicted by calculating a weighted average of the attribute values of the at least one neighboring point. The transformation may be performed based on the predicted attribute value. In some embodiments, the transformation may include encoding the current PC sample into a bitstream. Additionally or alternatively, the transformation may include decoding the current PC sample from the bitstream. It should be understood that the above examples are provided for illustrative purposes only. The scope of the present disclosure is not limited in this respect.
[0062] Based on the above, the points in the group of LODs of the reference PC sample are searched to obtain the neighboring points of the current point. Compared with the traditional method of only searching the points in the same LOD as the current point, the proposed method can advantageously improve the accuracy of nearest neighbor search and attribute inter-prediction.
[0063] In some embodiments, the points in the reference PC sample may be divided into multiple LODs, which may include groups of LODs. Additionally or alternatively, the points in the current PC sample may be divided into one or more LODs.
[0064] In some embodiments, at least one neighboring point may be determined at 402 by performing a nearest neighbor search on the set of points. In some embodiments, for each point in the reference PC sample and / or the current PC sample, there may be one LOD level indicating a refinement list of one of the multiple LODs. In one example, the set of points may include points at the same LOD level as the current point. In another example, the set of points may include points at a lower LOD level than the current point. In a further example, the set of points may include points at a higher LOD level than the current point. It should be understood that the above discussion is provided for illustrative purposes only. The scope of the present disclosure is not limited in this respect.
[0065] In some embodiments, a first instruction may be included in the bitstream indicating whether a nearest neighbor search is performed for points at all LODs of the reference PC sample. For example, the first instruction may be signaled to a decoder. In one example, the first instruction may be coded with fixed length coding. Alternatively, the first instruction may be coded with unary coding. In a further example, the first instruction may be coded with truncated unary coding. In yet another example, the first instruction may be coded in a predictive manner.
[0066] Additionally or alternatively, a second instruction may be included in the bitstream indicating whether the nearest neighbor search is performed for points at the same LOD of the reference PC sample as the current point. The second instruction may be conditionally signaled. In one example, the second instruction may be included in the bitstream based on whether the nearest neighbor search may be performed for points at all LODs of the reference PC sample. In one example, the second instruction may be coded with fixed length coding. Alternatively, the second instruction may be coded with unary coding. In a further example, the second instruction may be coded with truncated unary coding. In yet another example, the second instruction may be coded in a predictive manner.
[0067] In some embodiments, at least one neighboring point may be determined at 402 based on a first geometric distance. At 404, at least one weight associated with the at least one neighboring point may be determined based on a second geometric distance, and a transformation may be performed based on the at least one weight and the at least one neighboring point. The second geometric distance is different from the first geometric distance. In some examples, the first geometric distance may be one of a Euclidean distance, a Manhattan distance, or a Chebyshev distance. In one example, the first geometric distance may be a Manhattan distance and the second geometric distance may be a Euclidean distance. Alternatively, the second geometric distance may be determined based on the first geometric distance. It should be understood that the above examples are merely described for illustrative purposes. The scope of the present disclosure is not limited in this respect.
[0068] In some embodiments, at least one neighboring point may be stored in a list. In some embodiments, the at least one neighboring point may include a target point. A first geometric distance between the target point and the current point may be the smallest of the first geometric distances between the current point and each point in the set of points. In some embodiments, the set of points may be defined by a search center and a search range.
[0069] In some embodiments, a compensated reference frame may be obtained by applying motion compensation to the reference frame at 404. Further, a prediction attribute value of the current point may be determined based on at least one neighboring point and the compensated reference frame, and a conversion may be performed based on the prediction attribute value. That is, motion compensation may be applied to the reference frame before attribute inter prediction.
[0070] Alternatively, at 404, a predicted attribute value of the current point may be determined based on at least one neighboring point and a reference frame, and a conversion may be performed based on the predicted attribute value, i.e., a reference frame without motion compensation may be used for attribute inter prediction.
[0071] In some embodiments, a third instruction may be included in the bitstream to indicate whether motion compensation is applied to the reference frame. In one example, the third instruction may be coded with fixed length coding. Alternatively, the third instruction may be coded with unary coding. In a further example, the third instruction may be coded with truncated unary coding. In yet another example, the third instruction may be coded in a predictive manner.
[0072] According to an embodiment of the present disclosure, a non-transitory computer-readable recording medium is proposed. A bit stream of a point cloud sequence is stored in the non-transitory computer-readable recording medium. The bit stream may be generated by a method executed by a point cloud processing device. According to the method, for a current point in a current PC sample, at least one neighboring point is determined from a set of points in a reference PC sample of the current PC sample. The set of points is in a Level of Detail (LOD) group of the reference PC sample. Furthermore, the bit stream is generated based on the at least one neighboring point.
[0073] According to an embodiment of the present disclosure, a method for storing a bit stream of a point cloud sequence is proposed. In the method, for a current point in a current PC sample, at least one neighboring point is determined from a set of points in a reference PC sample of the current PC sample. The set of points is in a Level of Detail (LOD) group of the reference PC sample. Furthermore, a bit stream is generated based on the at least one neighboring point. The bit stream is stored in a non-transitory computer-readable recording medium.
[0074] FIG. 5 illustrates a flowchart of another method 500 for point cloud coding according to some embodiments of the present disclosure. The method 500 may be embodied during conversion between a current PC sample of a point cloud sequence and a bit stream of the point cloud sequence. As shown in FIG. 5, the method 500 begins at 502, where a first plurality of neighboring points are determined from points in a second plurality of PC samples of the point cloud sequence to a current point in the current PC sample. The first plurality of neighboring points are stored in a third plurality of lists. As an example, the first plurality of neighboring points may include at least one nearest neighbor of the current point. A nearest neighbor search may be performed on the points of the current PC sample, and the search results may be stored in the first list. Furthermore, a nearest neighbor search may be performed on the points of the reference PC sample of the current PC sample, and the search results may be stored in a second list different from the second list.
[0075] At 404, a transformation is performed based on the first plurality of neighboring points. For example, an attribute value of the current point may be predicted by calculating a weighted average of the attribute values of the first plurality of neighboring points. The transformation may be performed based on the predicted attribute value. In some embodiments, the transformation may include encoding the current PC sample into a bitstream. Additionally or alternatively, the transformation may include decoding the current PC sample from the bitstream. It should be understood that the above examples are provided for illustrative purposes only. The scope of the present disclosure is not limited in this respect.
[0076] In view of the above, multiple neighboring points of the current point are stored in multiple lists. Compared with the conventional method in which the neighboring points are stored in only one list, the proposed method can advantageously improve the efficiency of nearest neighbor search and attribute inter-prediction.
[0077] In some embodiments, a first set of neighboring points of the first plurality of neighboring points may be stored in a first list of a third plurality of lists, where the first set of neighboring points are determined from points in the current PC sample. That is, the current PC sample has a first list for storing search results. Additionally or alternatively, a second set of neighboring points of the first plurality of neighboring points may be stored in a second list of the third plurality of lists, where the second set of neighboring points are determined from points in a reference PC sample of the current PC sample. The second list may be different from the first list. That is, the reference PC sample has a second list for storing search results.
[0078] In some embodiments, during the determination at 502, a first neighbor of the first plurality of neighbors may be determined from a point in the current PC sample, and the first neighbor may be stored in a first list. For example, in a nearest neighbor search of the current PC sample, only the first list may be modified. Additionally or alternatively, during the determination at 502, a second neighbor of the first plurality of neighbors may be determined from a point in the reference PC sample, and the second neighbor may be stored in a second list. For example, in a nearest neighbor search in one reference frame, only the corresponding list may be modified.
[0079] In some embodiments, at least one predicted attribute value of the current point may be determined based on the neighboring points stored in the third plurality of lists, and a transformation may be performed based on the at least one predicted attribute value, at 504. That is, information of the points stored in all the lists may be utilized to predict an attribute value of the current point.
[0080] In some embodiments, methods 400 and 500 may be applicable to other coding processes or search processes other than nearest neighbor search in geometry-based point cloud compression (GPCC), for example, methods 400 and 500 may be embodied in other coding modules in GPCC.
[0081] According to an embodiment of the present disclosure, a non-transitory computer-readable recording medium is proposed. A bit stream of a point cloud sequence is stored in the non-transitory computer-readable recording medium. The bit stream may be generated by a method executed by a point cloud processing device. According to the method, a first plurality of neighboring points are determined from points in a second plurality of PC samples of a point cloud sequence to a current point in a current PC sample. The first plurality of neighboring points are stored in a third plurality of lists. Furthermore, the bit stream is generated based on the first plurality of neighboring points.
[0082] According to an embodiment of the present disclosure, a method for storing a bit stream of a point cloud sequence is proposed. In the method, a first plurality of neighboring points are determined from points in a second plurality of PC samples of the point cloud sequence to a current point in a current PC sample. The first plurality of neighboring points are stored in a third plurality of lists. Furthermore, the bit stream is generated based on the first plurality of neighboring points. The bit stream is stored in a non-transitory computer-readable recording medium.
[0083] Implementations of the present disclosure may be described in light of the following clauses, the features of which may be combined in any reasonable manner.
[0084] Clause 1. A method for point cloud coding, comprising, during conversion between a current point cloud (PC) sample and a bitstream of a point cloud sequence, determining, for a current point in a current PC sample of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a level of detail (LOD) group of the reference PC sample, and performing the conversion based on the at least one neighboring point.
[0085] Clause 2. The method of clause 1, wherein points in the reference PC sample are divided into a plurality of LODs, the plurality of LODs comprising the group of LODs.
[0086] Clause 3. The method of any one of clauses 1 to 2, wherein points in the current PC sample are divided into one or more LODs.
[0087] Clause 4. The method of any one of clauses 2 to 3, wherein for each point in the reference PC sample there is one LOD level indicating one refinement list of the plurality of LODs.
[0088] Clause 5. The method of clause 4, wherein determining the at least one neighboring point comprises determining the at least one neighboring point by performing a nearest neighbor search on the set of points.
[0089] Clause 6. The method of clause 5, wherein the set of points includes points at the same LOD level as the current point.
[0090] Clause 7. The method of clause 5, wherein the set of points includes points at a lower LOD level than the current point.
[0091] Clause 8. The method of clause 5, wherein the set of points includes points at a higher LOD level than the current point.
[0092] Clause 9. The method of clause 5, wherein a first indication is included in the bitstream indicating whether the nearest neighbor search is performed for points at all LODs of the reference PC sample.
[0093] Clause 10. The method of clause 9, wherein the first instruction is coded with one of fixed length coding, unary coding, or truncated unary coding.
[0094] Clause 11. The method of clause 9, wherein the first instructions are coded in a predictive manner.
[0095] Clause 12. The method of clause 5, wherein a second indication is included in the bitstream indicating whether the nearest neighbor search is performed for a point at the same LOD of a reference PC sample as the current point.
[0096] Clause 13. The method of clause 12, wherein the second instruction is included in the bitstream based on whether the nearest neighbor search is performed for points at all LODs of the reference PC sample.
[0097] Clause 14. The method of clause 12, wherein the second instructions are coded with one of fixed length coding, unary coding, or truncated unary coding.
[0098] Clause 15. The method of clause 12, wherein the second instructions are coded in a predictive manner.
[0099] Clause 16. The method of any one of clauses 1 to 15, wherein the at least one neighboring point is determined based on a first geometric distance, and the step of performing the transformation includes the steps of determining at least one weight associated with the at least one neighboring point based on a second geometric distance, the second geometric distance being different from the first geometric distance, and performing the transformation based on the at least one weight and the at least one neighboring point.
[0100] Clause 17. The method of clause 16, wherein the at least one neighboring point is stored in a list.
[0101] Clause 18. A method according to any one of clauses 16 to 17, wherein the at least one neighbouring point includes a target point, and a first geometric distance between the target point and the current point is the smallest among first geometric distances between the current point and each point in the set of points.
[0102] Clause 19. The method of any one of clauses 16 to 18, wherein the first geometric distance is one of a Euclidean distance, a Manhattan distance, or a Chebyshev distance.
[0103] Clause 20. A method according to any one of clauses 16 to 19, wherein the set of points is defined by a search centre and a search range.
[0104] Clause 21. The method of any one of clauses 16 to 20, wherein the second geometric distance is determined based on the first geometric distance.
[0105] Clause 22. The method of any one of clauses 16 to 20, wherein the first geometric distance is a Manhattan distance and the second geometric distance is a Euclidean distance.
[0106] Clause 23. A method according to any one of clauses 1 to 15, wherein the step of performing the conversion comprises the steps of obtaining a compensated reference frame by applying motion compensation to the reference frame, determining a predicted attribute value of the current point based on the at least one neighboring point and the compensated reference frame, and performing the conversion based on the predicted attribute value.
[0107] Clause 24. A method according to any one of clauses 1 to 15, wherein the step of performing the transformation comprises the steps of determining a predicted attribute value of the current point based on the at least one neighboring point and the reference frame, and performing the transformation based on the predicted attribute value.
[0108] Clause 25. A method according to any one of clauses 1 to 15, wherein a third indication is included in the bitstream indicating whether motion compensation is applied to the reference frame or not.
[0109] Clause 26. The method of clause 25, wherein the third instruction is coded with one of fixed length coding, unary coding, or truncated unary coding.
[0110] Clause 27. The method of clause 25, wherein the third instructions are coded in a predictive manner.
[0111] Clause 28. The method of any one of clauses 1 to 27, wherein the at least one nearby point comprises at least one nearest neighbor of the current point.
[0112] Clause 29. A method for point cloud coding, comprising, during conversion between a current point cloud (PC) sample and a bitstream of a point cloud sequence, determining a first plurality of neighboring points from a point in a second plurality of PC samples of the point cloud sequence to a current point in a current PC sample of the point cloud sequence, and performing the conversion based on the first plurality of neighboring points, wherein the first plurality of neighboring points are stored in a third plurality of lists.
[0113] Clause 30. The method of clause 29, wherein a first set of neighboring points of the first plurality of neighboring points is stored in a first list of the third plurality of lists, the first set of neighboring points being determined from points in the current PC sample.
[0114] Clause 31. The method of clause 30, wherein a second set of neighboring points of the first plurality of neighboring points is stored in a second list of the third plurality of lists, the second set of neighboring points being determined from points in a reference PC sample of the current PC sample, the second list being different from the first list.
[0115] Clause 32. A method according to any one of clauses 30 to 31, wherein the step of determining the first plurality of neighboring points comprises the steps of determining a first neighboring point of the first plurality of neighboring points from a point in the current PC sample, and storing the first neighboring point in the first list.
[0116] Clause 33. The method of clause 31, wherein the step of determining the first plurality of neighboring points includes the steps of determining a second neighboring point of the first plurality of neighboring points from a point in the reference PC sample, and storing the second neighboring point in the second list.
[0117] Clause 34. The method of any one of clauses 29 to 33, wherein the step of performing the transformation includes the steps of determining at least one predicted attribute value of the current point based on neighboring points stored in the third plurality of lists, and performing the transformation based on the at least one predicted attribute value.
[0118] Clause 35. The method of any one of clauses 29 to 34, wherein the first plurality of neighboring points includes at least one nearest neighbor of the current point.
[0119] Clause 36. A method according to any one of clauses 1 to 35, wherein the current PC sample is a point cloud frame in the point cloud sequence, or a sub-region within a point cloud frame in the point cloud sequence.
[0120] Clause 37. The method according to any one of clauses 1 to 36, wherein the method is applicable to other coding processes or search processes other than nearest neighbor search in Geometry Based Point Cloud Compression (GPCC).
[0121] Clause 38. A method according to any one of clauses 1 to 37, wherein the conversion comprises encoding the current PC sample into the bitstream.
[0122] Clause 39. A method according to any one of clauses 1 to 37, wherein the conversion comprises decoding the current PC sample from the bitstream.
[0123] Clause 40. An apparatus for processing point cloud data comprising a processor and a non-transitory memory with instructions which, when executed by the processor, cause the processor to perform a method according to any one of clauses 1 to 39.
[0124] Clause 41. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform the method of any one of clauses 1 to 39.
[0125] Clause 42. A non-transitory computer-readable recording medium storing a bit stream of a point cloud sequence generated by a method executed by a point cloud processing device, the method comprising the steps of: determining, for a current point in a current point cloud (PC) sample of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a level of detail (LOD) group of the reference PC sample; and generating the bit stream based on the at least one neighboring point.
[0126] Clause 43. A method for storing a bitstream of a point cloud sequence, comprising the steps of: determining, for a current point in a current point cloud (PC) sample of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a Level of Detail (LOD) group of the reference PC sample; generating the bitstream based on the at least one neighboring point; and storing the bitstream in a non-transitory computer-readable recording medium.
[0127] Clause 44. A non-transitory computer-readable recording medium storing a bit stream of a point cloud sequence generated by a method executed by a point cloud processing device, the method comprising: determining a first plurality of neighboring points from points in a second plurality of current point cloud (PC) samples of the point cloud sequence to a current point in a PC sample of the point cloud sequence; and generating the bit stream based on the first plurality of neighboring points, wherein the first plurality of neighboring points are stored in a third plurality of lists.
[0128] Clause 45. A method for storing a bit stream of a point cloud sequence, comprising: determining a first plurality of neighboring points from points in a second plurality of PC samples of the point cloud sequence to a current point in a current point cloud (PC) sample of the point cloud sequence; generating the bit stream based on the first plurality of neighboring points; and storing the bit stream in a non-transitory computer-readable recording medium, wherein the first plurality of neighboring points are saved in a third plurality of lists.
[0129] [Example Device] 6 illustrates a block diagram of a computing device 600 capable of implementing various embodiments of the present disclosure. The computing device 600 may be embodied as or included in the source device 110 (or the GPCC encoder 116 or 200) or the destination device 120 (or the GPCC decoder 126 or 300).
[0130] It will be appreciated that the computing device 600 illustrated in FIG. 6 is for illustrative purposes only and is not intended to suggest any limitation on the functionality and scope of the embodiments of the present disclosure.
[0131] 6, the computing device 600 includes a general-purpose computing device 600. The computing device 600 may include at least one or more processors or processing units 610, a memory 620, a storage unit 630, one or more communication units 640, one or more input devices 650, and one or more output devices 660.
[0132] In some embodiments, the computing device 600 may be embodied as any user terminal or server terminal having computing capabilities. The server terminal may be a server provided by a service provider, a large-scale computing device, etc. The user terminal may be any type of mobile, fixed, or portable terminal, including, for example, a mobile phone, a station, a unit, a device, a multimedia computer, a multimedia tablet, 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 electronic book device, a gaming device, or any combination thereof (including accessories and peripherals of these devices, or any combination thereof). It is contemplated that the computing device 600 may support any type of interface to a user, such as "wearable" circuitry.
[0133] The processing unit 610 may be a physical or virtual processor and may implement various processes based on programs stored in memory 620. In a multiprocessor system, multiple processing units execute computer-executable instructions in parallel to increase the parallel processing capabilities of the computing device 600. The processing unit 610 may be referred to as a central processing unit (CPU), a microprocessor, a controller, or a microcontroller.
[0134] Computing device 600 typically includes a variety of computer storage media. Such media may be any media accessible by computing device 600, including but not limited to volatile and non-volatile media, or removable and non-removable media. Memory 620 may be volatile memory (e.g., registers, cache, random access memory (RAM)), non-volatile memory (e.g., read only memory (ROM), electrically erasable programmable read only memory (EEPROM), flash memory), or any combination thereof. Storage unit 630 may be any removable or non-removable media, including machine-readable media such as memory, flash memory drives, magnetic disks, or other media that can be used to store information and / or data and that can be accessed by computing device 600.
[0135] The computing device 600 may further include additional removable / non-removable, volatile / non-volatile memory media. Although not shown in FIG. 6, a magnetic disk drive that reads from and writes to a removable non-volatile magnetic disk and an optical disk drive that reads from and writes to a removable non-volatile optical disk may be provided. In such a case, each drive may be connected to a bus (not shown) via one or more data media interfaces.
[0136] The communication unit 640 communicates with further computing devices via a communication medium. Furthermore, the functionality of the components in the computing device 600 may be embodied by a single computing cluster or multiple computing machines that can communicate via a communication connection. Thus, the computing device 600 can operate in a networked environment using logical connections with one or more other servers, networked personal computers (PCs), or further general network nodes.
[0137] The input device 650 may be one or more of a variety of input devices such as a mouse, a keyboard, a tracking ball, a voice input device, etc. The output device 660 may be one or more of a variety of output devices such as a display, a loudspeaker, a printer, etc. The communication unit 640 may further enable the computing device 600 to communicate with one or more external devices (not shown), such as a storage device and a display device, one or more devices allowing a user to interact with the computing device 600, or any device (such as a network card, a modem, etc.) that allows the computing device 600 to communicate with one or more other computing devices, as needed. Such communication may be performed via an input / output (I / O) interface (not shown).
[0138] In some embodiments, instead of being integrated into a single device, some or all of the components of computing device 600 may be located in a cloud computing architecture. In a cloud computing architecture, the components may be provided remotely and work together to perform the functions described in this disclosure. In some embodiments, cloud computing provides computing, software, data access, and storage services without the end user needing to be aware of the physical location or configuration of the systems or hardware providing these services. In various embodiments, cloud computing provides services over a wide area network (such as the Internet) using appropriate protocols. For example, a cloud computing provider provides applications over a wide area network that can be accessed through a web browser or other computing components. The software or components of the cloud computing architecture and corresponding data may be stored on a server located in a remote location. Computing resources in a cloud computing environment may be consolidated or distributed at remote data center locations. A cloud computing infrastructure may act as a single access point for users but provide services through a shared data center. Thus, a cloud computing architecture may be used to provide the components and functions described herein from a service provider located in a remote location. Alternatively, they may be provided from a traditional server or installed directly or otherwise on a client device.
[0139] The computing device 600 may be used to implement point cloud encoding / decoding in embodiments of the present disclosure. The memory 620 may include one or more point cloud coding modules 625 having one or more program instructions. These modules are accessible and executable by the processing unit 610 to perform the functions of various embodiments described herein.
[0140] In an example embodiment performing point cloud encoding, the input device 650 may receive point cloud data to be encoded as an input 670. The point cloud data may be processed, for example, by the point cloud coding module 625 to generate an encoded bitstream. The encoded bitstream may be provided as an output 680 via the output device 660.
[0141] In an example embodiment performing point cloud decoding, the input device 650 may receive an encoded bitstream as an input 670. The encoded bitstream may be processed, for example, by the point cloud coding module 625 to generate decoded point cloud data. The decoded point cloud data may be provided as output 680 via the output device 660.
[0142] Although the present disclosure has been particularly shown and described with reference to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present application as defined by the appended claims. Such variations are intended to be within the scope of the present application. Accordingly, the foregoing description of the embodiments of the present application is not intended to be limiting.
Claims
1. 1. A method for point cloud coding, comprising: determining, for a current point in a current point cloud (PC) sample of a point cloud sequence during conversion between the current point cloud sample and a bitstream of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a level of detail (LOD) group of the reference PC sample; and performing the transformation based on the at least one neighboring point.
2. The method of claim 1 , wherein points in the reference PC sample are divided into a plurality of LODs, the plurality of LODs including the group of LODs.
3. The method according to any one of claims 1 to 2, wherein the points in the current PC sample are divided into one or more LODs.
4. The method according to any one of claims 2 to 3, wherein for each point in the reference PC sample there is one LOD level indicating one refinement list of the plurality of LODs.
5. The step of determining at least one neighboring point comprises: The method of claim 4 , comprising determining the at least one neighboring point by performing a nearest neighbor search on the set of points.
6. The method of claim 5 , wherein the set of points includes points at the same LOD level as the current point.
7. The method of claim 5 , wherein the set of points includes points at a lower LOD level than the current point.
8. The method of claim 5 , wherein the set of points includes points at a higher LOD level than the current point.
9. The method of claim 5 , wherein a first indication is included in the bitstream indicating whether the nearest neighbor search is performed for points at all LODs of the reference PC sample.
10. The first instruction includes: Fixed-length coding, Unary coding, or 10. The method of claim 9, wherein the image is coded using one of the following coding methods: truncated unary coding.
11. The method of claim 9 , wherein the first instruction is coded in a predictive manner.
12. The method of claim 5 , wherein a second indication is included in the bitstream indicating whether the nearest neighbor search is performed for a point at the same LOD of a reference PC sample as the current point.
13. The method of claim 12 , wherein the second indication is included in the bitstream based on whether the nearest neighbor search is performed for points at all LODs of the reference PC sample.
14. The second instruction includes: Fixed-length coding, Unary coding, or The method of claim 12, wherein the image is coded using one of the truncated unary coding methods.
15. The method of claim 12 , wherein the second instructions are coded in a predictive manner.
16. The at least one neighboring point is determined based on a first geometric distance; The step of performing the conversion comprises: determining at least one weight associated with the at least one neighboring point based on a second geometric distance, the second geometric distance being different from the first geometric distance; and performing said transformation based on said at least one weight and said at least one neighbouring point.
17. The method of claim 16 , wherein the at least one neighboring point is stored in a list.
18. 18. The method according to claim 16, wherein the at least one neighboring point includes a target point, and a first geometric distance between the target point and the current point is the smallest of first geometric distances between the current point and each point in the set of points.
19. The first geometric distance is: Euclidean distance, Manhattan distance, or The method according to any one of claims 16 to 18, wherein the distance is one of the Chebyshev distances.
20. The method according to any one of claims 16 to 19, wherein the set of points is defined by a search centre and a search range.
21. The method according to any one of claims 16 to 20, wherein the second geometric distance is determined based on the first geometric distance.
22. The method according to any one of claims 16 to 20, wherein the first geometric distance is a Manhattan distance and the second geometric distance is a Euclidean distance.
23. The step of performing the conversion comprises: obtaining a compensated reference frame by applying motion compensation to the reference frame; determining a predicted attribute value for the current point based on the at least one neighboring point and the compensated reference frame; and performing said conversion based on said predicted attribute value.
24. The step of performing the conversion comprises: determining a predicted attribute value for the current point based on the at least one neighboring point and the reference frame; and performing said conversion based on said predicted attribute value.
25. The method of any one of claims 1 to 15, wherein a third indication is included in the bitstream indicating whether motion compensation is applied to the reference frame or not.
26. The third instruction is: Fixed-length coding, Unary coding, or 26. The method of claim 25, wherein the signal is coded using one of the following coding methods: truncated unary coding.
27. 26. The method of claim 25, wherein the third instruction is coded in a predictive manner.
28. The method of any one of claims 1 to 27, wherein the at least one neighbouring point comprises at least one nearest neighbour of the current point.
29. 1. A method for point cloud coding, comprising: determining a first plurality of neighboring points from points in a second plurality of PC samples of a point cloud sequence to a current point in a current PC sample of the point cloud sequence during conversion between a current point cloud (PC) sample and a bit stream of the point cloud sequence; performing the transformation based on the first plurality of neighboring points; wherein the first plurality of neighboring points are stored in a third plurality of lists.
30. 30. The method of claim 29, wherein a first set of neighboring points of the first plurality of neighboring points is stored in a first list of the third plurality of lists, the first set of neighboring points being determined from points in the current PC sample.
31. 31. The method of claim 30, wherein a second set of neighboring points of the first plurality of neighboring points is stored in a second list of the third plurality of lists, the second set of neighboring points being determined from points in a reference PC sample of the current PC sample, the second list being different from the first list.
32. The step of determining a first plurality of neighboring points comprises: determining a first neighboring point of the first plurality of neighboring points from a point at the current PC sample; and saving said first neighbouring points in said first list.
33. The step of determining a first plurality of neighboring points comprises: determining a second neighboring point of the first plurality of neighboring points from a point in the reference PC sample; and saving the second neighboring points in the second list.
34. The step of performing the conversion comprises: determining at least one predicted attribute value of the current point based on the neighboring points stored in the third plurality of lists; and performing said conversion based on said at least one predictive attribute value.
35. The method of any one of claims 29 to 34, wherein the first plurality of neighbouring points comprises at least one nearest neighbour of the current point.
36. The method of any one of claims 1 to 35, wherein the current PC sample is a point cloud frame in the point cloud sequence, or a sub-region within a point cloud frame in the point cloud sequence.
37. The method according to any one of claims 1 to 36, wherein the method is applicable to other coding processes in Geometry Based Point Cloud Compression (GPCC) or to search processes other than nearest neighbour search.
38. A method according to any preceding claim, wherein the conversion comprises encoding the current PC sample into the bitstream.
39. A method according to any preceding claim, wherein the conversion comprises decoding the current PC sample from the bitstream.
40. 1. An apparatus for processing point cloud data, comprising a processor and a non-transitory memory with instructions, comprising: Apparatus, wherein the instructions, when executed by the processor, cause the processor to perform a method according to any one of claims 1 to 39.
41. A non-transitory computer readable storage medium storing instructions for causing a processor to perform the method of any one of claims 1 to 39.
42. 1. A non-transitory computer readable recording medium storing a bitstream of a point cloud sequence generated by a method executed by a point cloud processing device, the method comprising: determining, for a current point in a current point cloud (PC) sample of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a Level of Detail (LOD) group of the reference PC sample; and generating the bitstream based on the at least one neighboring point.
43. 1. A method for storing a bitstream of a point cloud sequence, comprising: determining, for a current point in a current point cloud (PC) sample of the point cloud sequence, at least one neighboring point from a set of points in a reference PC sample of the current PC sample, the set of points being in a Level of Detail (LOD) group of the reference PC sample; generating the bitstream based on the at least one neighboring point; and storing the bitstream on a non-transitory computer-readable recording medium.
44. 1. A non-transitory computer readable recording medium storing a bitstream of a point cloud sequence generated by a method executed by a point cloud processing device, the method comprising: determining a first plurality of neighboring points from points in a second plurality of current point cloud (PC) samples of the point cloud sequence to a current point in a PC sample of the point cloud sequence; generating the bitstream based on the first plurality of neighboring points; wherein the first plurality of neighboring points are stored in a third plurality of lists.
45. 1. A method for storing a bitstream of a point cloud sequence, comprising: determining a first plurality of neighboring points from points in a second plurality of current point cloud (PC) samples of the point cloud sequence to a current point in a PC sample of the point cloud sequence; generating the bitstream based on the first plurality of neighboring points; storing the bitstream on a non-transitory computer-readable recording medium; wherein the first plurality of neighboring points are stored in a third plurality of lists.
Citation Information
Patent Citations
Method and apparatus for video coding
US20200021844A1
Dynamic Point Cloud Compression Using Inter-Prediction
US20210099711A1
Trimming Search Space For Nearest Neighbor Determinations in Point Cloud Compression
US20210103780A1
Point cloud data transmission device, point cloud data transmission method, point cloud data reception device, and point cloud data reception method
US20210320960A1
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
WO2020175708A1
