Point cloud information encoding and decoding method and device, computer equipment and storage medium
By distinguishing between isolated nodes and non-solved nodes in point clouds and adopting the corresponding encoding mode, the low encoding efficiency caused by replication points in point cloud compression is solved, and the encoding efficiency and speed are improved.
Patent Information
- Application Number
- CN202411048425.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2020-10-29
- Filing Date
- 2021-02-15
- Publication Date
- 2024-11-22
AI Technical Summary
In the prior art, in order to keep the number of points unchanged during point cloud compression, many points are quantized to the same position, resulting in duplication points being generated, resulting in low encoding efficiency.
By determining the orphan nodes and non-solute nodes in the point cloud, encoding is performed using orphan mode and non-solute mode respectively, reducing the number of bits, increasing the bit rate, and reducing storage and accelerating the encoding and decoding process.
Increase the bit rate of point cloud encoding, reduce storage requirements, and speed up encoding and decoding.
Smart Images

Figure CN119011864A_ABST
Abstract
Description
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims priority to U.S. Provisional Application No. 63 / 002,314 filed with the U.S. Patent Office on March 30, 2020, and priority to U.S. Regular Application No. 17 / 083,912 filed with the U.S. Patent Office on October 29, 2020, the entire contents of which are incorporated by reference into this application. Technical Field
[0003] The embodiments of the present application relate to video coding and decoding technology, and in particular, to a point cloud information coding and decoding method, apparatus, computer equipment and storage medium. Background Art
[0004] Point cloud modeling has been widely used in recent years, for example, in autonomous vehicles for object detection and localization, in geographic information systems (GIS) for mapping, and in cultural heritage projects for visualization and archiving of cultural heritage objects and collections.
[0005] A point cloud contains a set of high-dimensional points, usually three-dimensional (3D), each of which includes 3D position information and additional attributes such as color, reflectivity, etc. High-dimensional points can be captured using multiple cameras and / or depth sensors via light detection and ranging (LIDAR) in various environments, and can consist of thousands to billions of points, thereby realistically representing the original scene.
[0006] For faster transmission and / or reduced storage, compression techniques are used to reduce the amount of data required to represent point clouds. The Moving Picture Experts Group (MPEG), a working group of the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC), has created a Joint Technical Committee (JTC 1 / SC 29 / WG 11) and a Special Group (MPEG-PCC) to standardize compression techniques for static and / or dynamic point clouds.
[0007] Currently, encoders need to keep the number of points unchanged after compression, which results in many points being quantized to the same position, resulting in many duplicate points. For example, an isolated point can have multiple duplicate points. Therefore, the coding efficiency is not high when encoding isolated points and / or duplicate points. Summary of the invention
[0008] The present application relates to point cloud coding and decoding (PCC), and in particular to a point cloud information coding and decoding method, apparatus, computer equipment and storage medium, which can improve the compression efficiency of point clouds.
[0009] According to one aspect of the present application, a point cloud information encoding method is provided, comprising:
[0010] Acquire a point cloud, the point cloud comprising a set of points in a three-dimensional space;
[0011] Determine whether the current node is an isolated node in the set of nodes;
[0012] When it is determined that the current node is an isolated node, encoding the current node in an isolated mode; and,
[0013] When it is determined that the current node is not an isolated node, the current node is encoded in a non-isolated mode.
[0014] According to another aspect of the present application, a point cloud information encoding device is provided, comprising:
[0015] An acquisition module, used for acquiring a point cloud, wherein the point cloud includes a set of points in a three-dimensional space;
[0016] An isolated determination module, used to determine whether the current node is an isolated node in the group of points;
[0017] The encoding module is used to encode the current node in an isolated mode when it is determined that the current node is an isolated node; and to encode the current node in a non-isolated mode when it is determined that the current node is not an isolated node.
[0018] According to another aspect of the present application, a non-volatile computer-readable medium is provided, on which computer code is stored. When the computer code is executed by at least one processor, the at least one processor executes the above-mentioned point cloud information encoding method.
[0019] According to another aspect of the present application, a computer program product or a computer program is also provided, the computer program product or the computer program comprising computer instructions, the computer instructions being stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the above-mentioned method for encoding point cloud information.
[0020] As can be seen from the above technical solutions, the method provided by the embodiment of the present invention encodes isolated points, reduces the number of bits used for encoding, and thus improves the bit rate. At the same time, it can also reduce the memory used for encoding and decoding, and can increase the encoding and decoding speed. BRIEF DESCRIPTION OF THE DRAWINGS
[0021] Figure 1 An example of performing octree partitioning in a 3D space according to an embodiment of the present application is shown;
[0022] Figure 2An example of octree partitioning and tree structure according to an embodiment of the present application is shown;
[0023] Figure 3 An example of an architecture for encoding isolated points and duplicate points according to an embodiment of the present application is shown;
[0024] Figure 4-6 An example of encoding point cloud information according to an embodiment of the present application is shown;
[0025] Figure 7 A schematic diagram showing an example environment in which the system and / or method implemented by the present application is shown;
[0026] Figure 8 Shows example components of a computer device according to an embodiment of the present application;
[0027] Fig. 9 A schematic diagram of a method for encoding isolated points and duplicate points according to an embodiment of the present application is shown. DETAILED DESCRIPTION
[0028] In the Test Model 13 (TMC13) codec published by MPEG, geometric information and associated attributes (such as color or reflectivity) of points of a point cloud are compressed separately. The geometric information (e.g., 3D coordinates of the points) is encoded by octree partitioning with occupancy information. The attributes are then compressed based on the reconstructed geometry using prediction, lifting, and region-adaptive hierarchical transform techniques. The octree partitioning and occupancy encoding process is described in more detail below.
[0029] In TMC13, if the octree geometry codec is used, the geometry encoding process is as follows: First, the cube axis aligned bounding box B, consisting of two points (0,0,0) and (2 M-1 ,2 M-1 ,2 M-1 ) definition, where 2 M-1 Defines the size of B, and M is specified in the codestream.
[0030] Then, an octree structure is built by recursively subdividing B. At each stage, the cube is subdivided into 8 sub-cubes. Then, an 8-bit code, i.e., an occupancy code, is generated by associating a 1-bit value with each sub-cube to indicate whether it contains a point (i.e., whether it is full and has a value of 1) or does not contain a point (i.e., whether it is empty and has a value of 0). Only full sub-cubes (i.e., non-voxels) greater than 1 are further subdivided. Figure 1 An illustration of octree partitioning in 3D space is presented.
[0031] Figure 2An example of a two-level octree partition and corresponding occupancy codes is shown, where cubes and nodes are identified as black, indicating that they are occupied by points.
[0032] Then, the occupancy code of each node is compressed using an arithmetic encoder. The occupancy code can be represented as S (8-bit integer), and each bit in S indicates the occupancy state of each child node. TMC13 includes two encoding methods for occupancy codes: bit-by-bit encoding and byte-by-byte encoding. Bit-by-bit encoding is enabled by default. Both methods use context modeling to perform arithmetic coding to encode the occupancy code, and the context state is initialized at the beginning of the encoding process and updated during the encoding process.
[0033] For bit-wise encoding, the eight binary numbers in S are encoded in a certain order, where each binary number is encoded by referring to the occupancy status of the neighboring nodes and the children of the neighboring nodes, where the neighboring nodes are in the same level of the current node.
[0034] For byte-by-byte encoding, S is encoded by referring to:
[0035] An adaptive look-up table (A-LUT) that determines the N (e.g., 32) most frequently occupied codes, and
[0036] - A cache that determines the last M (eg, 16) different occupied codes observed.
[0037] A binary flag indicating whether S is in the A-LUT is encoded. If S is in the A-LUT, the index in the A-LUT is encoded by using a binary arithmetic encoder. If S is not in the A-LUT, a binary flag indicating whether S is in the cache is encoded. If S is in the cache, the binary representation of its index is encoded by using a binary arithmetic encoder. Otherwise, if S is not in the cache, the binary representation of S is encoded by using a binary arithmetic encoder.
[0038] The decoding process starts by parsing the dimensions of the bounding box B from the bitstream. Then, the same octree structure is constructed by subdividing B according to the decoded occupancy codes.
[0039] In the codec scheme discussed above, the duplicate point may refer to a point with the same geometric position in the octree structure, but their attributes may be different. According to an embodiment of the present application, the attribute may be color, reflectivity or other characteristic features associated with the same geometric position. However, the present application is not limited to different attributes. Thus, according to another embodiment, the duplicate point may refer to a point with the same geometric position in the octree structure, and has the same attributes. In some cases, even when performing geometric quantization, the encoder also needs to keep the number of points unchanged after compression. This causes many points to be quantized to the same position, thereby generating many duplicate points.
[0040] On the other hand, an isolated point refers to a single point with the same geometric position in an octree node. For example, if the point cloud contains only one point, then that point is an isolated point of the octree root node. For example, if a particular node has only one occupied child node, then that particular node will be an isolated node.
[0041] According to an embodiment of the present application, at least one isolated point may have at least one point as long as they have the same and unique geometric position in the octree node. In other words, the isolated point may have a copy, ie, a duplicate point.
[0042] According to at least one aspect of the present application, encoding duplicates and isolated points improves overall encoding performance. For example, the method of encoding duplicates and / or isolated points reduces the number of bits used for encoding, thereby improving the bit rate. In addition, due to the encoding of duplicates and isolated points, the memory used for encoding and decoding can be reduced, and the speed of encoding and decoding can be increased. In the present application, the method of encoding duplicates and isolated points is described in detail.
[0043] According to the method, device and system proposed in the embodiment of the present application, it can be used alone or in combination in any order. In addition, each of the method (or embodiment), encoder and decoder can be implemented by a processing circuit (for example, at least one processor or at least one integrated circuit). In one example, at least one processor executes a program stored in a non-volatile computer-readable medium. In addition, the disclosure of the present application is not limited to use related to TMC13 software or MPEG-PCC standards.
[0044] Figure 3An embodiment of the overall encoding method is illustrated. The octree nodes can be encoded in a predefined order, in which case a width-first encoding order is used, wherein a first-in-first-out (FIFO) data structure (or FIFO list) is applied. For each octree node, various criteria are applied to determine whether the current node is isolated. If it is an isolated node, the current node is encoded in an isolated mode, wherein the number of copies and the geometric position of the isolated point are encoded. Otherwise, the current node is encoded as follows: If the current node is a leaf node, the number of copies of the node can be encoded, and the tree partitioning is terminated. On the other hand, if the current node is not a leaf node, the occupancy code is encoded, and all occupied child nodes are inserted into the FIFO.
[0045] like Figure 3 As shown, the replication mode can be applied to leaf nodes or isolated points. According to an embodiment of the present application, in the replication mode, it is necessary to signal the number of replication points. Since the minimum number of replication points is 1, the number is reduced by 1 before encoding. In order to encode the number, the leading bit can be encoded using context and entropy coding.
[0046] According to the embodiment of the present application, the syntax table of num_duplicate_points can be as follows: Figure 4 As shown. Figure 4 , "num_duplicated_points_is_one" specifies whether num_duplicate_points is equal to 1, "num_duplicated_points_is_two" specifies whether num_duplicate_points is equal to 2, and "num_duplicated_points_minus_three" specifies num_duplicate_points as follows:
[0047] num_duplicate_points=num_duplicated_points_minus_three+3.
[0048] For example, the encoding operation may determine the number of duplicate points of the current node. Here, the encoding operation may determine whether the number of duplicate points is 1. If the number of duplicate points is 1, "num_duplicated_points_is_one" may be specified. According to an embodiment of the present application, the method may include specifying "num_duplicated_points_is_one" by indicating or setting a flag.
[0049] If the number of duplicate points is not 1, the encoding operation may determine whether the number of duplicate points is 2. If the number of duplicate points is 2, the encoding may specify "num_duplicated_points_is_two". However, if the number of duplicate points is not 2, the encoding operation may specify num_duplicate_points=num_duplicated_points_minus_three+3.
[0050] According to the embodiment of the present application, by implementing Figure 4 The process shown in the figure can achieve the best coding efficiency.
[0051] According to the embodiment of the present application, the following can be used: Figure 4 The decoding process is performed in reverse using the specified number of replication points as shown.
[0052] According to another embodiment, the syntax table of num_duplicate_points can be in Figure 5 In Figure 5 In , "num_duplicated_points_is_one" specifies whether num_duplicate_points is equal to 1, and "num_duplicated_points_minus_two" specifies num_duplicate_points as follows:
[0053] num_duplicate_points=num_duplicated_points_minus_two+2.
[0054] According to one aspect of the present application, various criteria can be used to determine whether the isolated mode is qualified. According to an embodiment of the present application, the isolated mode is qualified only when the current partition depth is less than a threshold. According to an embodiment of the present application, the threshold can be fixed, or can be specified by a high-level syntax, such as a sequence parameter set, a geometric parameter set, or a stripe header. In another embodiment, in addition to checking the partition depth, the method may also include checking whether the current node does not have a sibling node in the octree structure. If the current node has at least one sibling node, the isolated mode is unqualified.
[0055] According to an embodiment of the present application, if the isolated mode is qualified, a signal is sent to indicate whether the current node has an isolated point. The mark can be encoded using or without entropy coding, and different contexts can be used to improve coding efficiency. In one embodiment, a context is used to entropy encode the mark. Next, if the isolated mark is true, if duplicate points are allowed, the duplicate mode can be applied. Finally, the isolated position is signaled, and entropy coding can be used or not when encoding the position, and multiple contexts can be applied. According to an embodiment of the present application, bypass coding is performed on the isolated position without entropy coding.
[0056] According to an embodiment of the present application, the syntax table related to the isolated mode can be as follows: Figure 6 shown.
[0057] For example, the encoding operation may first determine whether the isolated mode is qualified. According to an embodiment of the present application, the isolated mode is qualified only when the current partition depth is less than a threshold value (i.e., "if (geomIsolatedModeFlag&&depth<=geomIsolatedModeMaxDepth)"). However, the present application is not limited to this, and thus, according to another embodiment, the check on the qualification of the isolated mode based on the current partition depth may be omitted. According to another embodiment, the qualification of the isolated mode may be checked based on different criteria.
[0058] Next, the encoding operation may determine whether the current node is an isolated node (ie, set "geom_isolated_flag"). When it is determined that the current node is an isolated node, the geometric position of the current node is encoded (ie, isolated_position_x, isolated_position_y, isolated_position_z).
[0059] According to an embodiment of the present application, the encoding operation may further include determining whether the current node is a duplicate node (ie, "!geomRemoveDuplicateFlag"). In this case, the number of duplicate points is also encoded. ... Figure 4 Or the method shown in 5 encodes the number of replication points. However, the present application is not limited thereto, and other methods of encoding nodes can be implemented.
[0060] exist Figure 6In the high-level syntax, specify geomIsolatedModeFlag and thegeomIsolatedModeMaxDepth to determine eligibility for isolated mode. depth indicates the partition depth of the current octree node. In this case, isolated mode qualifies only when geomIsolatedModeFlag is true and the depth is less than or equal to geomIsolatedModeMaxDepth. geom_isolated_flag specifies whether the current node is encoded in isolated mode. In the high-level syntax, specify geomRemoveDuplicateFlag to indicate eligibility for duplicate mode. As described above, num_duplicate_points specifies the number of duplicate points in the current node. isolated_position_x, isolated_position_y, and isolated_position_z specify the isolated positions.
[0061] According to the embodiment of the present application, the following can be used: Figure 6 The decoding process is performed in reverse for the number of replication points specified as shown.
[0062] According to the method for encoding duplicate points and / or isolated points provided in the embodiment of the present application, the number of bits used for encoding is reduced, thereby resulting in an increase in the bit rate. In addition, due to the encoding of duplicates and isolated points, the memory used for encoding and decoding can be reduced, and the speed of encoding and decoding is increased.
[0063] Figure 7 is a schematic diagram of an example communication system 700 in the systems and / or methods implemented in the present application. Figure 7 As shown, communication system 700 may include user equipment 710, platform 720, and network 730. The devices of communication system 700 may be interconnected via wired connections, wireless connections, or a combination of wired and wireless connections.
[0064] The communication system 700 may support unidirectional transmission of data. For example, the first user device 710 encodes video data locally and transmits it to the second user device 710 via the network 730. The second user device 710 may receive the encoded video data of the first user device 710 from the network 730, decode the encoded data, and display the recovered video data. Unidirectional data transmission is common in media service applications and the like.
[0065] The communication system 700 may support bidirectional transmission of data. For example, the communication system 700 may support bidirectional transmission of encoded video, such as during a video conference. For bidirectional transmission of data, each user device 710 may encode video data captured locally and transmit it to another user device 710 via the network 730. Each user device 710 may also receive encoded video data transmitted by another user device 710, may decode the encoded data, and display the recovered video data on a local display device.
[0066] User device 710 includes at least one device capable of receiving, generating, storing, processing, and / or providing information associated with platform 720. For example, user device 710 may include a computing device (e.g., a desktop computer, a laptop computer, a tablet computer, a handheld computer, a smart speaker, a server, etc.), a mobile phone (e.g., a smart phone, a wireless phone, etc.), a wearable device (e.g., a pair of smart glasses or a smart watch), or a similar device. In some embodiments, user device 710 can receive information from platform 720 and / or transmit information to platform 720.
[0067] The platform 720 includes at least one device capable of providing information to the user device 710, as described elsewhere in this application. In some embodiments, the platform 720 may include a cloud server or a group of cloud servers. In some embodiments, the platform 720 may be designed as a modular platform so that certain software components may be swapped in or out depending on specific needs. Thus, the platform 720 may be easily and / or quickly reconfigured for different purposes.
[0068] In some embodiments, such as Figure 7 As shown, platform 720 may be hosted in a cloud computing environment 722. It is worth noting that although the embodiments described herein describe platform 720 as being hosted in a cloud computing environment 722, in some embodiments, platform 720 may not be cloud-based (i.e., may be implemented outside of a cloud computing environment) or may be partially cloud-based.
[0069] The cloud computing environment 722 includes the environment of the host platform 720. The cloud computing environment 722 can provide computing, software, data access, storage and other services that do not require the end user (e.g., the user device 710) to know the physical location and configuration of at least one system and / or device of the host platform 720. Figure 7 As shown, cloud computing environment 722 may include a set of computing resources 724 (collectively referred to as “computing resources 724 ”, or individually referred to as “computing resource 724 ”).
[0070] The computing resources 724 include at least one personal computer, workstation computer, server device, or other type of computing and / or communication device. In some embodiments, the computing resource 724 may be a host platform 720. Cloud resources may include computing instances executed in the computing resource 724, storage devices provided in the computing resource 724, data transfer devices provided by the computing resource 724, etc. In some embodiments, the computing resource 724 may communicate with other computing resources 724 via a wired connection, a wireless connection, or a combination of a wired and wireless connection.
[0071] like Figure 7 As further shown in FIG. 7 , the computing resources 724 include a set of cloud resources, such as at least one application (“APP”) 724-1, at least one virtual machine (“VM”) 724-2, virtualized storage (“VS”) 724-3, at least one hypervisor (“HYP”) 724-4, and the like.
[0072] The application 724-1 includes at least one software application that can be provided to or accessed by the user device 710. The application 724-1 can eliminate the need to install and execute software applications on the user device 710. For example, the application 724-1 can include software associated with the platform 720 and / or any other software that can be provided via the cloud computing environment 722. In some embodiments, one application 724-1 can send information to at least one other application 724-1 via the virtual machine 724-2, or receive information from at least one other application 724-1.
[0073] Virtual machine 724-2 includes software for a machine (e.g., a computer) that executes a program, just like a physical machine. Virtual machine 724-2 can be a system virtual machine or a process virtual machine, depending on the use of virtual machine 724-2 and the degree of correspondence with any real machine. System virtual machines can provide a complete system platform that can support the execution of a complete operating system ("OS"). Process virtual machines can execute a single program and can support a single process. In some embodiments, virtual machine 724-2 can execute on behalf of a user (e.g., user device 710) and can manage the infrastructure of cloud computing environment 722, such as data management, synchronization, or long-duration data transmission.
[0074] Virtualized storage 724-3 includes at least one storage system and / or at least one device using virtualization technology within the storage system or device of computing resource 724. In some embodiments, in the context of a storage system, the types of virtualization may include block virtualization and file virtualization. Block virtualization may refer to the abstraction (or separation) of logical storage equivalent to physical storage, so that the storage system may be accessed regardless of physical storage or heterogeneous structures. This separation may allow the administrator of the storage system to manage storage for end users very flexibly. File virtualization may eliminate the dependency between data accessed at the file level and the location where the file is physically stored. This may optimize the use of storage, the consolidation of servers, and / or the performance of non-destructive file migration.
[0075] Hypervisor 724-4 can provide hardware virtualization technology that allows multiple operating systems (e.g., "guest operating systems") to execute concurrently on a host computer such as computing resource 724. Hypervisor 724-4 can present a virtual operating platform to the guest operating systems and can manage the execution of the guest operating systems. Multiple instances of various operating systems can share virtualized hardware resources.
[0076] The network 730 includes one or more wired and / or wireless networks. For example, the network 730 may include a cellular network (e.g., a fifth generation (5G) network, a long term evolution (LTE) network, a third generation (3G) network, a code division multiple access (CDMA) network, etc.), a public land mobile network (PLMN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), a telephone network (e.g., a public switched telephone network (PSTN)), a private network, an ad hoc network, an intranet, the Internet, a fiber-based network, etc., and / or a combination of these or other types of networks.
[0077] Figure 7 The number and arrangement of devices and networks shown in the figure are examples only. Figure 7 There may be additional devices and / or networks, fewer devices and / or networks, different devices and / or networks, or differently arranged devices and / or networks than those shown in FIG. Figure 7 Two or more of the devices shown in FIG. 1 may be implemented in a single device, or Figure 7 The single device shown in can be implemented as multiple distributed devices. Additionally or alternatively, a group of devices (eg, at least one device) of environment 700 can perform at least one function that is described as being performed by another group of devices of environment 700.
[0078] Figure 88 is a schematic diagram of example components of a computer device 800. Computer device 800 may correspond to user device 710 and / or platform 720. Figure 8 As shown, computer device 800 may include a bus 810 , a processor 820 , a memory 830 , a storage component 840 , an input component 850 , an output component 860 , and a communication interface 870 .
[0079] The bus 810 includes components that allow communication between components of the computer device 800. The processor 820 is implemented in hardware, firmware, or a combination of hardware and software. The processor 820 is a central processing unit (CPU), a graphics processing unit (GPU), an accelerated processing unit (APU), a microprocessor, a microcontroller, a digital signal processor (DSP), a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), or another type of processing component. In some embodiments, the processor 820 includes at least one processor that can be programmed to perform a function. The memory 830 includes a random access memory (RAM), a read-only memory (ROM), and / or another type of dynamic or static storage device (e.g., flash memory, magnetic memory, and / or optical memory) that stores information and / or instructions for use by the processor 820.
[0080] The storage component 840 stores information and / or software related to the operation and use of the computer device 800. For example, the storage component 840 may include a hard disk (e.g., a magnetic disk, an optical disk, a magneto-optical disk, and / or a solid-state drive), a compact disk (CD), a digital versatile disk (DVD), a floppy disk, a cassette, a magnetic tape, and / or another type of non-volatile computer-readable medium along with a corresponding drive.
[0081] Input components 850 include components that allow computer device 800 to receive information, such as via user input (e.g., a touch screen display, a keyboard, a keypad, a mouse, buttons, switches, and / or a microphone, etc.). Additionally or alternatively, input components 850 may include sensors for sensing information (e.g., a global positioning system (GPS) component, an accelerometer, a gyroscope, and / or an actuator, etc.). Output components 860 include components that provide output information from computer device 800 (e.g., a display, a speaker, and / or at least one light emitting diode (LED)).
[0082] The communication interface 870 includes transceiver-like components (e.g., a transceiver and / or a separate receiver and transmitter) that enable the computer device 800 to communicate with other devices, such as via a wired connection, a wireless connection, or a combination of a wired connection and a wireless connection. The communication interface 870 may allow the computer device 800 to receive information from another device and / or provide information to another device. For example, the communication interface 870 may include an Ethernet interface, an optical interface, a coaxial interface, an infrared interface, a radio frequency (RF) interface, a universal serial bus (USB) interface, a Wi-Fi interface, a cellular network interface, etc.
[0083] According to an embodiment of the present application, the computer device 800 may perform at least one process described in the present application. The computer device 800 may execute these processes in response to the processor 820 executing software instructions stored by a non-volatile computer-readable medium such as a memory 830 and / or a storage component 840. The computer-readable medium is defined as a non-volatile memory device in the present application. The memory device includes a memory space within a single physical storage device or a memory space distributed at both ends of multiple physical storage devices.
[0084] The software instructions may be read from another computer-readable medium or from another device into memory 830 and / or storage component 840 via communication interface 870. The software instructions stored in memory 830 and / or storage component 840, when executed, may cause processor 820 to perform at least one process described herein.
[0085] In addition or alternatively, hard-wired circuits may be used in place of or in combination with software instructions to perform at least one process described herein. Therefore, the embodiments described herein are not limited to any specific combination of hardware circuits and software.
[0086] Figure 8 The number and arrangement of components shown in the drawings are provided as examples. Figure 8 Computer device 800 may include additional components, fewer components, different components, or components arranged differently than those components shown in . Additionally or alternatively, a group of components (e.g., at least one component) of computer device 800 may perform at least one function that is described as being performed by another group of components of computer device 800.
[0087] Fig. 9 is a flow chart of an example process 900 for encoding isolated points and duplicate points of a point cloud. In some embodiments, Fig. 9 At least one process block of may be performed by user device 710. In some embodiments, Fig. 9At least one process block of may be performed by another device or a group of devices (such as platform 720) that is separate from user device 710 or includes a user device.
[0088] like Fig. 9 As shown, in operation 910, a point cloud is obtained, and the point cloud includes a set of points in a three-dimensional space. In operation 920, it is determined whether the current node is an isolated node in the set of points (that is, whether the node is isolated). In operation 930, if the current node is an isolated node, the current node is encoded in an isolated mode; if the current node is not an isolated node, the current node is encoded in a non-isolated mode.
[0089] In one example, when the current partition depth is less than or equal to a threshold, the isolated node is confirmed to be qualified.
[0090] In one example, the isolated node is eligible only when geomIsolatedModeFlag is true and the current partition depth is less than or equal to geomIsolatedModeMaxDepth.
[0091] In the isolation mode, determine whether the current node is a duplicate node. If the current node is a duplicate node, encode the number of copies, and then encode the geometric position of the isolated current node. If the current node is not a duplicate node, encode the geometric position of the isolated current node without performing the operation of encoding the number of copies.
[0092] In non-isolated mode, the current node is encoded as follows: if the current node is a leaf node, the number of copies of the node is encoded, and the tree partition is terminated. On the other hand, if the current node is not a leaf node, the occupation code is encoded, and all occupied child nodes are inserted into the FIFO list.
[0093] In one example, the non-isolated mode includes a replication mode, the replication mode is applied to a leaf node or an isolated point; the method further includes: in the replication mode, signaling a replication number, i.e., a number of replication points. The current node includes at least one isolated point, and the at least one isolated point refers to at least one point in the octree node with the same geometric position.
[0094] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the embodiments to the precise form disclosed. Modifications and variations are possible in light of the above disclosure or may be acquired from practice of the embodiments.
[0095] As used in this application, the term component is intended to be broadly interpreted as hardware, firmware, or a combination of hardware and software.
[0096] It will be apparent that the systems and / or methods described herein can be implemented in different forms of hardware, firmware, or a combination of hardware and software. The actual dedicated control hardware or software code used to implement these systems and / or methods does not limit the implementation scheme. Therefore, the operation and behavior of the systems and / or methods are not described in this application with reference to specific software codes - it should be understood that software and hardware can be designed to implement the systems and / or methods based on the description of the present application.
[0097] Even though particular combinations of features are recited in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of possible embodiments. In fact, many of these features can be combined in ways not specifically recited in the claims and / or disclosed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of possible embodiments includes each dependent claim in combination with every other claim in the claim group.
[0098] Elements, actions, or instructions used in this application should not be interpreted as essential or necessary unless explicitly described as such. In addition, as used in this application, the term "group" is intended to include at least one item (e.g., related items, unrelated items, a combination of related and unrelated items, etc.), and can be used interchangeably with "at least one". When it is desired to have only one item, the term "one" or similar language is used. In addition, as used in this application, "based on" is intended to mean "based at least in part on".
Claims
1. A point cloud information encoding method, characterized in that: The method comprises: Acquire a point cloud, the point cloud comprising a set of points in a three-dimensional space; When it is determined that the current node is an isolated node in the group of points, the current node is encoded in an isolated mode, wherein, Determining that the orphan mode is eligible includes: determining that a current partition depth of the current node is less than or equal to a threshold, the threshold being specified by a high-level syntax; and determining that the current node has no sibling nodes in an associated octree structure; Based on the high-level syntax element geom_isolated_flag, determining that the current node is the isolated node; Based on the high-level syntax element geomRemoveDuplicateFlag, determining whether the current node is a duplicate node; When it is determined that the current node is the duplicate node, the number of copies is encoded, and the geometric position of the current node is encoded; and, When it is determined that the current node is not an isolated node, the current node is encoded in a non-isolated mode.
2. The method according to claim 1, characterized in that The determining that the current partition depth of the current node is less than or equal to a threshold comprises: Determine if geomIsolatedModeFlag is true and the current partition depth is less than or equal to geomIsolatedModeMaxDepth.
3. The method according to claim 1, characterized in that After encoding the replication number, a step of encoding the geometric position of the current node is performed.
4. The method according to claim 1, characterized in that: Further including: When it is determined that the current node is not the duplicate node, the geometric position of the isolated current node is encoded instead of the number of duplicates.
5. The method according to claim 1, characterized in that Further including: In the non-isolated mode, it is determined whether the current node is a leaf node.
6. The method according to claim 5, characterized in that Further including: When it is determined that the current node is the leaf node, the number of copies is encoded and the tree partitioning is terminated.
7. The method according to claim 5, characterized in that Further including: When it is determined that the current node is not the leaf node, the occupation information is encoded, and all occupied child nodes are inserted into a first-in-first-out list.
8. The method according to any one of claims 1 to 7, characterized in that: The non-isolated mode includes a replication mode, and the replication mode is applied to a leaf node or an isolated point; The method further comprises: In the copy mode, the number of copies is signaled.
9. The method according to claim 8, characterized in that The isolated nodes refer to points with the same geometric position in the octree nodes.
10. A point cloud information decoding method, characterized in that: The method comprises: receiving a point cloud, the point cloud comprising a set of points in a three-dimensional space; When it is determined that the current node is an isolated node in the group of points, the current node is decoded in an isolated mode, wherein: Determining that the orphan mode is eligible includes: determining that a current partition depth of the current node is less than or equal to a threshold, the threshold being specified by a high-level syntax; and determining that the current node has no sibling nodes in an associated octree structure; Based on the high-level syntax element geom_isolated_flag, determining that the current node is the isolated node; Based on the high-level syntax element geomRemoveDuplicateFlag, determining whether the current node is a duplicate node; When it is determined that the current node is the duplicate node, decoding the number of copies and decoding the geometric position of the current node; and, When it is determined that the current node is not an isolated node, the current node is decoded in a non-isolated mode.
11. A point cloud information encoding device, characterized in that: include: An acquisition module, used for acquiring a point cloud, wherein the point cloud includes a set of points in a three-dimensional space; An isolated determination module, used to determine whether the current node is an isolated node in the group of points; An encoding module, configured to encode the current node in an isolated mode when it is determined that the current node is an isolated node in the group of points, wherein: Determining that the orphan mode is eligible includes: determining that a current partition depth of the current node is less than or equal to a threshold, the threshold being specified by a high-level syntax; and determining that the current node has no sibling nodes in an associated octree structure; Based on the high-level syntax element geom_isolated_flag, determining that the current node is the isolated node; Based on the high-level syntax element geomRemoveDuplicateFlag, determining whether the current node is a duplicate node; When it is determined that the current node is the duplicate node, the number of copies is encoded, and the geometric position of the current node is encoded; and, When it is determined that the current node is not an isolated node, the current node is encoded in a non-isolated mode.
12. A point cloud information decoding device, characterized in that: include: A receiving module, configured to receive a point cloud, wherein the point cloud includes a set of points in a three-dimensional space; An isolated determination module, used to determine whether the current node is an isolated node in the group of points; A decoding module, configured to decode the current node in an isolated mode when it is determined that the current node is an isolated node in the group of points, wherein: Determining that the orphan mode is eligible includes: determining that a current partition depth of the current node is less than or equal to a threshold, the threshold being specified by a high-level syntax; and determining that the current node has no sibling nodes in an associated octree structure; Based on the high-level syntax element geom_isolated_flag, determining that the current node is the isolated node; Based on the high-level syntax element geomRemoveDuplicateFlag, determining whether the current node is a duplicate node; When it is determined that the current node is the duplicate node, decoding the number of copies and decoding the geometric position of the current node; and, When it is determined that the current node is not an isolated node, the current node is decoded in a non-isolated mode.
13. A computer device, characterized in that: The method comprises a processor and a memory, wherein the memory stores at least one instruction, and the at least one instruction is loaded and executed by the processor to implement the method according to any one of claims 1 to 10.
14. A non-volatile computer readable medium, characterized in that: Computer codes are stored thereon, and the computer codes are used to execute the method according to any one of claims 1 to 10 by at least one processor.
15. A method for processing a code stream, characterized in that: A video code stream is stored on a non-volatile computer-readable storage medium, wherein the video code stream is generated according to the point cloud information encoding method described in any one of claims 1 to 9, or is decoded based on the point cloud information decoding method described in claim 10.
