FOR VIDEO-BASED POINT CLOUD CODING

CROSS-REFERENCE TO RELATED APPLICATION

[0001] This application is based on and claims priority to U.S. Provisional Application No. 63/286,434, filed on December 6, 2021, and U.S. Application No. 17/982,923, filed on November 8, 2022, in the U.S. Patent and Trademark Office, the disclosures of which are incorporated by reference herein in their entirety.

BACKGROUND

1. Field

[0002] The disclosure relates to Point Cloud Coding (PCC), and more specifically, systems and methods for adaptive filtering in patch generation for Videobased Point Cloud Coding (V-PCC).

2. Description of Related Art

[0003] A point cloud is used in many applications. For example, a point cloud is used in autonomous driving vehicles for object detection and localization, in geographic information systems (GIS) for mapping, and in cultural heritage preservation to visualize and archive cultural heritage objects and collections, etc.

[0004] Point clouds contain a set of high-dimensional points. For example, each point includes three-dimensional (3D) position information, and additional attributes such as color, reflectance, etc. Point clouds may be captured, for example, using multiple cameras and depth sensors, or laser imaging, detection, and ranging (LIDAR). To realistically represent a scene, point clouds may comprise thousands to billions of points. [0005] Compression technologies are needed to reduce the amount of data required to represent a point cloud for faster transmission or reduction of storage.

ISO/IEC MPEG (JTC 1/SC 29/WG 11) has created an ad-hoc group (MPEG-PCC) to standardize the compression techniques for static or dynamic point clouds.

SUMMARY

[0006] According to an aspect of the disclosure, there is provided a method that includes projecting a plurality of points included in a connected component (CC) to a projection plane associated with the CC; removing one or more outlier points from the plurality of points based on the projection to generate an updated CC; determining a first surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a first selection criteria; adaptively filtering the one or more points selected for the first surface, by adjusting a grid size parameter based on one or more characteristics of the CC; determining a second surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a second selection criteria; adding a patch corresponding to the filtered first surface and the second surface to a list of patches associated with an original point cloud; and coding the original point cloud based on the list of patches.

[0007] According to other aspects of the disclosure, an apparatus and computer readable medium consistent with the method are also provided.

BRIEF DESCRIPTION OF THE DRAWINGS

[0008] The above and other aspects, features and advantages of certain embodiments of the present disclosure will be more apparent from the following description taken in conjunction with the accompanying drawings, in which: [0009] FIG. l is a diagram illustrating components of one or more devices, according to various embodiments;

[0010] FIG. 2 is a flow diagram illustrating a method of patch generation in Video-based Point Cloud Coding (V-PCC), according to various embodiments;

[0011] FIG. 3 is a flowchart illustrating a method of generating a near surface s- near, a far surface s-far, and a list of patches, based on a CC, according to various embodiments;

[0012] FIG. 4 is a flowchart illustrating another method of generating a near surface s-near, a far surface s-far, and a list of patches, based on a CC, according to various embodiments;

[0013] FIG. 5 illustrates an sample reconstructed point cloud;

[0014] FIG. 6 is a flowchart illustrating a method of generating a near surface s- near, a far surface s-far, and a list of patches, based on a CC, by performing adaptive filtering, according to various embodiments; and

[0015] FIG. 7 is a flowchart illustrating another method of generating a near surface s-near, a far surface s-far, and a list of patches, based on a CC, by performing adaptive filtering, according to various embodiments.

DETAILED DESCRIPTION

[0016] According to various embodiment, adaptive filtering methods are provided, which can be applied to a patch generation process, such as patch generation in TMC2 or grided patch generation. The methods can be applied to any generated depth image including the near surface depth image and the far surface depth image. [0017] According to various embodiment, the method may adjust a parameter T adaptively based on characteristics of a connected component. The characteristics that may be taken into account may include but not limited to the following:

[0018] Statistics of a depth of points in the connected component. For example, a depth range, a minimum/maximum depth value, a mean depth value, a depth variation, etc.

[0019] Statistics of a geometry of the points in the connected component. For example, a bounding box, a geometry distribution, etc.

[0020] Statistics of a color of the points in the connected component. For example, a color similarity/variation etc.

[0021] Statistics of other attributes (such as reflectance, timestamp, etc.) of the points in the connected component.

[0022] In some embodiments, only one characteristic discussed above may be taken into account, or multiple characteristics together may be taken into account when making the decision. Several thresholds and criteria may be define to determine the value of T for each connected component.

[0023] According to an aspect of the disclosure, there is provided a method that includes projecting a plurality of points included in a connected component (CC) to a projection plane associated with the CC, and removing one or more outlier points from the plurality of points based on the projection to generate an updated CC; determining a first surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a first selection criteria; adaptively filtering the one or more points selected for the first surface, by adjusting a grid size parameter based on one or more characteristics of the CC; determining a second surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a second selection criteria; adding a patch corresponding to the filtered first surface and the second surface to a list of patches associated with an original point cloud; and coding the original point cloud based on the list of patches.

[0024] The one or more characteristics of the CC may include at least one of statistics associated with a depth of the points in the CC, statistics associated with a geometry of the points in the CC, statistics associated with a color of the points in the CC, and statistics associated with other attributes of the points in the CC.

[0025] The first surface may be a near surface, the second surface may be a far surface, and the first selection criteria includes selecting one point having a smallest depth among two or more points associated with the updated CC, when the two or more points have a same projected coordinate.

[0026] The first surface may be a far surface, the second surface may be a near surface, and the first selection criteria includes selecting one point having a largest depth among two or more points associated with the updated CC, when the two or more points have a same projected coordinate.

[0027] The method of adaptively filtering the one or more points selected for the first surface may include determining an adjustment value based on the one or more characteristics of the CC; adjusting the grid size parameter based on the adjustment value; and filtering the one or more points selected for the first surface using a grid in the projection plane associated with the CC, where the grid may be based on the adjusted grid parameter. [0028] The adjustment value may be based on an adjustment threshold value and a range between a smallest depth value and a largest depth value associated with the plurality of points included in the CC.

[0029] The adjustment value may be based on a plurality of adjustment threshold values and a range between a smallest depth value and a largest depth value associated with the plurality of points included in the CC.

[0030] The method may further include generating a list of CC, each CC associated with a projection plane, and including a raw point from the original point cloud and at least one neighbor point that neighbors the raw point in the original point cloud, such that the raw point and the at least one neighbor point have the same projection plane; projecting a plurality of points included in each CC to a projection plane associated with the CC, and removing one or more outlier points from the plurality of points based on the projection, to generate a list of updated CC; determining a first surface for each CC in the list of updated CC by selecting one or more points associated with the updated CC, based on the projection of the one or more points and the first selection criteria; adaptively filtering the one or more points selected for each first surface, by adjusting a grid size parameter based on one or more characteristics of the CC; determining a second surface for each CC in the list of updated CC by selecting one or more points associated with the updated CC, based on the projection of the one or more points and the second selection criteria; and adding a patch corresponding to each filtered first surface and each second surface to the list of patches associated with the original point cloud. [0031] If a CC among the list of CC is associated with a number of points that is less than a threshold number, then the CC may be removed from the list of CC.

[0032] The method of coding the original point cloud based on the list of patches may include: identifying a plurality of points associated with a filtered first surface and a second surface corresponding to each patch in the list of patches; reconstructing a point cloud based on the identified plurality of points; building a K-D tree using the reconstructed point cloud; searching the K-D tree for a nearest neighbor point to each point in the original point cloud; and classifying each point in the original point cloud as a raw point if a distance between the point and the nearest neighbor point is greater than a distance threshold.

[0033] According to an aspect of the disclosure, there is provided an apparatus including a memory storing program code; and at least one processor configured to execute the program code and operate as instructed by the program code. The program code may include: projecting code configured to cause at least one of the at least one processor to project a plurality of points included in a connected component (CC) to a projection plane associated with the CC, and removing one or more outlier points from the plurality of points based on the projection to generate an updated CC; determining code configured to cause at least one of the at least one processor to determine a first surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a first selection criteria; filtering code configured to cause at least one of the at least one processor to adaptively filter the one or more points selected for the first surface, by adjusting a grid size parameter based on one or more characteristics of the CC; determining code configured to cause at least one of the at least one processor to determine a second surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a second selection criteria; adding code configured to cause at least one of the at least one processor to add a patch corresponding to the filtered first surface and the second surface to a list of patches associated with an original point cloud; and coding code configured to cause at least one of the at least one processor to code the original point cloud based on the list of patches.

[0034] The first surface may be a near surface, the second surface may be a far surface, and the program code further includes first selection criteria code configured to cause the at least one processor to select one point having a smallest depth among two or more points associated with the updated CC, when the two or more points have a same projected coordinate.

[0035] The first surface may be a far surface, the second surface may be a near surface, and the program code further includes first selection criteria code configured to cause the at least one processor to select one point having a largest depth among two or more points associated with the updated CC, when the two or more points have a same projected coordinate.

[0036] The filtering code may include: determining code configured to cause at least one of the at least one processor to determine an adjustment value based on the one or more characteristics of the CC; adjusting code configured to cause at least one of the at least one processor to adjust the grid size parameter based on the adjustment value; and filtering code configured to cause at least one of the at least one processor to filter the one or more points selected for the first surface using a grid in the projection plane associated with the CC, where the grid may be based on the adjusted grid parameter.

[0037] The adjustment value may be based on an adjustment threshold value and a range between a smallest depth value and a largest depth value associated with the plurality of points included in the CC.

[0038] According to an aspect of the disclosure, a non-transitory computer readable medium may be provided that stores computer readable program code which, when executed by a processor, causes the processor to at least: project a plurality of points included in a connected component (CC) to a projection plane associated with the CC, and removing one or more outlier points from the plurality of points based on the projection to generate an updated CC; determine a first surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a first selection criteria; adaptively filter the one or more points selected for the first surface, by adjusting a grid size parameter based on one or more characteristics of the CC; determine a second surface by selecting one or more points associated with the updated CC, based on the projection of the one or more points and a second selection criteria; add a patch corresponding to the filtered first surface and the second surface to a list of patches associated with an original point cloud; and code the original point cloud based on the list of patches.

[0039] The first surface may be a near surface, the second surface may be a far surface, and the program code further cause the processor to at least select one point having a smallest depth among two or more points associated with the updated CC, when the two or more points have a same projected coordinate. [0040] The first surface may be a far surface, the second surface may be a near surface, and the program code further cause the processor to at least select one point having a largest depth among two or more points associated with the updated CC, when the two or more points have a same projected coordinate.

[0041] The program code which cause the processor to adaptively filter the one or more points selected for the first surface, may further cause the processor to at least: determine an adjustment value based on the one or more characteristics of the CC; adjust the grid size parameter based on the adjustment value; and filter the one or more points selected for the first surface using a grid in the projection plane associated with the CC, where the grid may be based on the adjusted grid parameter.

[0042] The adjustment value may be based on an adjustment threshold value and a range between a smallest depth value and a largest depth value associated with the plurality of points included in the CC.

[0043] The following detailed description of example embodiments refers to the accompanying drawings. The same reference numbers in different drawings may identify the same or similar elements.

[0044] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the implementations to the precise form disclosed. Modifications and variations are possible in light of the above disclosure or may be acquired from practice of the implementations. Further, one or more features or components of one embodiment may be incorporated into or combined with another embodiment (or one or more features of another embodiment). Additionally, in the flow diagrams and descriptions of operations provided below, it is understood that one or more operations may be omitted, one or more operations may be added, one or more operations may be performed simultaneously (at least in part), and the order of one or more operations may be switched.

[0045] It will be apparent that systems and/or methods, described herein, may be implemented in different forms of hardware, firmware, or a combination of hardware and software. The actual specialized control hardware or software code used to implement these systems and/or methods is not limiting of the implementations. Thus, the operation and behavior of the systems and/or methods were described herein without reference to specific software code. It is understood that software and hardware may be designed to implement the systems and/or methods based on the description herein.

[0046] 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 implementations. In fact, many of these features may 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 implementations includes each dependent claim in combination with every other claim in the claim set.

[0047] No element, act, or instruction used herein should be construed as critical or essential unless explicitly described as such. Also, as used herein, the articles “a” and “an” are intended to include one or more items, and may be used interchangeably with “one or more.” Where only one item is intended, the term “one” or similar language is used. Also, as used herein, the terms “has,” “have,” “having,” “include,” “including,” or the like are intended to be open-ended terms. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise. Furthermore, expressions such as “at least one of [A] and [B]” or “at least one of [A] or [B]” are to be understood as including only A, only B, or both A and B.

[0048] FIG. l is a diagram illustrating components of one or more devices, according to various embodiments. Referring to FIG. 1, the device 100 may include a bus 110, one or more processor(s) 120, a memory 130, a storage component 140, and a communication interface 150. It is understood that one or more of the components may be omitted and/or one or more additional components may be included.

[0049] The bus 110 includes a component that permits communication among the components of the device 100. The processor 120 may be implemented in hardware, firmware, or a combination of hardware and software. The processor 120 may be 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), a sparse tensor core, or another type of processing component. The processor 120 may include one or more processors. For example, the processor 120 may include one or more CPU, APU, FPGA, ASIC, sparse tensor core, or another type of processing component. The one or more processors of the processor 120 may be capable of being programmed to perform a function.

[0050] The memory 130 includes a random access memory (RAM), a read only memory (ROM), and/or another type of dynamic or static storage device (e.g., a flash memory, a magnetic memory, and/or an optical memory) that stores information and/or instructions for use by the processor 120. [0051] The storage component 140 stores information and/or software related to the operation and use of the device 100. For example, the storage component 140 may include a hard disk (e.g., a magnetic disk, an optical disk, a magneto-optic disk, and/or a solid state disk), a compact disc (CD), a digital versatile disc (DVD), a floppy disk, a cartridge, a magnetic tape, and/or another type of non-transitory computer-readable medium, along with a corresponding drive.

[0052] The communication interface 150 includes a transceiver-like component (e.g., a transceiver and/or a separate receiver and transmitter) that enables the device 100 to communicate with other devices, such as via a wired connection, a wireless connection, or a combination of wired and wireless connections. The communication interface 150 may permit the device 100 to receive information from another device and/or provide information to another device. For example, the communication interface 150 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, or the like.

[0053] The device 100 may perform one or more processes or functions described herein. The device 100 may perform operations based on the processor 120 executing software instructions stored by a non-transitory computer-readable medium, such as the memory 130 and/or the storage component 140. A computer-readable medium is defined herein as a non-transitory memory device. A memory device includes memory space within a single physical storage device or memory space spread across multiple physical storage devices. [0054] Software instructions may be read into the memory 130 and/or the storage component 140 from another computer-readable medium or from another device via the communication interface 150. When executed, software instructions stored in the memory 130 and/or storage component 140 may cause the processor 120 to perform one or more processes described herein.

[0055] Additionally, or alternatively, hardwired circuitry may be used in place of or in combination with software instructions to perform one or more processes described herein. Thus, embodiments described herein are not limited to any specific combination of hardware circuitry and software.

[0056] The number and arrangement of components shown in FIG. 1 are provided as an example. In practice, device 100 may include additional components, fewer components, different components, or differently arranged components than those shown in FIG. 1. Additionally, or alternatively, a set of components (e.g., one or more components) of device 100 may perform one or more functions described as being performed by another set of components of device 100.

[0057] Any one of the operations or processes described below (e.g., FIGS. 2, 3, 4, 6, and 7) may be implemented by or using any one of the elements illustrated in FIG.

1.

[0058] FIG. 2 is a flow diagram illustrating a method of patch generation in Video-based Point Cloud Coding (V-PCC), according to various embodiments. Generally, V-PCC decomposes an input point cloud into a set of patches. In the MPEG point cloud coding (PCC) test model software “TMC2”, for example, patch generation involves multiple steps. [0059] At 201, the method 200 includes determining a projection plane for each point in a point cloud (original point cloud) based on a defined clustering criterion (e.g., based on associated normal vectors and neighboring points).

[0060] At 202, the method 200 includes generating a list of raw points in the original point cloud. Initially, no point in the list belongs to any patch.

[0061] At 203, the method 200 includes generating a list of connected components (CCs) based on the points in the list of raw points, by grouping raw points that have the same projection plane and are neighboring each other. A K-D tree may be used to select each raw point’s neighboring points. A number of points in each CC in the list of CCs is determined, and if the number of points is less than a threshold number of points, then the CC may be removed from the list of CCs.

[0062] At 204, the method 200 includes determining a number of CCs remaining in the list of CCs. If the number of CCs is zero, then the method 200 stops. If the number of CCs is greater than zero, then the method 200 proceeds to 205.

[0063] At 205, the method 200 includes generating a near surface s-near, a far surface s-far, and a list of patches for the original point cloud. Generating the near surface s-near, the far surface s-far, and the list of patches is described in more detail in FIGS. 3, 4, 6, and 7.

[0064] At 206, the method 200 includes reconstructing a point cloud (reconstructed point cloud) based on points included in the near surface s-near and the far surface s-far, for all patches in the list of patches.

[0065] At 207, the method 200 includes building a K-D tree based on the reconstructed point cloud. [0066] At 208, the method 200 includes, for each point in the original point cloud, searching the K-D tree based on the reconstructed point cloud for the point’s nearest neighboring point. If a distance between a point in the original point cloud and its nearest neighboring point in the reconstructed point cloud is greater than a user-defined threshold, then the point is classified as a raw point. The method 200 returns to 203. [0067] FIG. 3 is a flowchart illustrating a method of generating a near surface s- near, a far surface s-far, and a list of patches, based on a CC, according to various embodiments. The method 300 shown in FIG. 3 may be performed for each CC in the list of CCs at 205 in FIG. 2.

[0068] At 301, the method 300 includes removing outliers. The points in the CC may be projected to the projection plane associated with the CC. For example, a projected coordinate of a 3D point in a two-dimensional (2D) UV plane may be denoted as (Uj, Vi), 1 = 0,1, , N — 1, where N is the number of points in the CC. A minimum value for the projected coordinates may be denoted as: u _min = minCuo, ^, ..., u _N _!),and Vmin = min(v ₀ ,v ₁ , ... , v _N-1 ).

[0069] If (uj — u _mjn ) > Uthj-esoid or (Vj — v _mjn ) > V^pe^d, where Uthresold and

Vthresoid are user-defined thresholds, the i-th point is determined to be an outlier point and is removed from the CC. The resulting CC is referred to as the updated CC and is denoted as CC’.

[0070] At 302, the method 300 includes near surface generation. If the CC’ is not empty (a number of points in the CC’ is greater than zero), then for each 3D point in the CC’, its projected coordinate in the 2D UV plane may be denoted as (uj, Vj), 1 = 0, ..., N — 1, where N is the number of points in the CC’. The method 300 may include determining a near surface s-near that is close to the projection plane associated with the CC’ by selecting points in the CC’ . The points in the CC’ may be selected such that if one or more points have the same projected UV coordinate, then the point that has a smallest depth value is selected to be part of the near surface s-near. The depth value of a point may correspond to a distance from the point to the projection plane. The projected coordinates of the selected points may be denoted as (uj, Vj), 1 = 0, , N — 1, and the depth value associated with each projected coordinate may be denoted as dj, 1 = 0, ..., N — 1 , where N is the number of points in the near surface s-near.

[0071] At 303, the method 300 includes near surface filtering. For a T X T grid in the projected plane, where T is a user-defined positive integer, a minimum depth value among points in the CC’ that are projected to the T x T grid may be denoted as d _min . A minimum depth value among all the points in the CC’ may be denoted as d _min , and a maximum allowed depth representation may be denoted as D _max . For a user-defined threshold d _threshoid , and a user-defined surface thickness d _surface , if a point (u, v, d) in the near surface S _near that is projected to the T x T grid satisfies the condition: where (u, v) is the projected coordinate and d is the depth value of the point, then the point is removed from the near surface S _near .

[0072] At 304, the method 300 includes far surface generation. The method 300 may include determining a far surface s-far by selecting points in the CC’ such that if one or more points have the same projected UV coordinate, then the point that has a largest depth value is selected to be part of the far surface s-far. For example, the far surface s- far may be initialized to be the same as the selected points (uj, Vj), 1 = 0, ... , N — 1 for the near surface s-near. If multiple points in the CC’ are projected to the same UV coordinate (Uj, Vj) , then the i-th point in the far surface S _far is replaced with the point having the largest depth value such that a distance between this point and the point pj in S _near is not greater than d _surface and the two points’ color values are close to each other.

[0073] At 305, the method 300 includes generating a list of patches. The method 300 may include adding a patch with the near surface and the far surface to a list of patches for the original point cloud.

[0074] FIG. 4 is a flowchart illustrating another method of generating a near surface s-near, a far surface s-far, and a list of patches, based on a CC, according to various embodiments. The method 400 shown in FIG. 4 may be performed for each CC in the list of CCs at 205 in FIG. 2.

[0075] At 401, the method 400 includes removing outliers. The points in the CC may be projected to the projection plane associated with the CC. For example, a projected coordinate of a 3D point in a two-dimensional (2D) UV plane may be denoted as

(Uj, Vj), 1 = 0,1, , N — 1, where N is the number of points in the CC. A minimum value for the projected coordinates may be denoted as: u _min = minCuo, ^, ..., u _N _!),and

Vmin = min(v ₀ ,v ₁ , ... , v _N-1 ).

[0076] If (uj — u _mjn ) > Uthj-esou or (Vj — v _mjn ) > V^pe^i^, where Uthresold and

Vthresoid are user-defined thresholds, the i-th point is determined to be an outlier point and is removed from the CC. The resulting CC is referred to as the updated CC and is denoted as CC’.

[0077] At 402, the method 400 includes far surface generation. If the CC’ is not empty (a number of points in the CC’ is greater than zero), then for each 3D point in the CC’, its projected coordinate in the 2D UV plane may be denoted as (uj, Vj), i =

0, N — 1, where N is the number of points in the CC’. The method 300 may include determining a far surface s-far that is farther away from the projection plane associated with the CC’ by selecting points in the CC’ such that if one or more points have the same projected UV coordinate, then the point that has a largest depth value is selected to be part of the far surface s-far. The depth value of a point may correspond to a distance from the point to the projection plane. The projected coordinates of the selected points may be denoted as (uj, Vj), 1 = 0, , N — 1, and the depth value associated with each projected coordinate may be denoted as dj, 1 = 0, ... , N — 1 , where N is the number of points in the far surface s-far.

[0078] At 403, the method 400 includes far surface filtering. For a T X T grid in the projected plane, where T is a user-defined positive integer, a maximum depth value among points in the CC’ that are projected to the T x T grid may be denoted as d _max . A maximum depth value among all the points in the CC’ may be denoted as d _max , and a maximum allowed depth representation may be denoted as D _max . For a user-defined threshold d _threshoid , and a user-defined surface thickness d _surface , if a point (u, v, d) in the far surface S _far that is projected to the T x T grid satisfies the condition: d > (dmax ^— ^threshold ) OF (d — d _sur f _ace ) > (d _max — D _max ), [0079] where (u, v) is the projected coordinate and d is the depth value of the point, then the point is removed from the far surface S _far .

[0080] At 404, the method 400 includes near surface generation. The method 400 may include determining a near surface s-near by selecting points in the CC’ such that if one or more points have the same projected UV coordinate, then the point that has a smallest depth value is selected to be part of the near surface s-near. For example, the near surface s-near may be initialized to be the same as the selected points (uj, Vj), 1 =

0, N — 1 for the far surface s-far. If multiple points in the CC’ are projected to the same UV coordinate (uj, Vj) , then the i-th point in the near surface S _near is replaced with the point having the smallest depth value such that a distance between this point and the point pi in S _far is not greater than d _surface and the two points’ color values are close to each other.

[0081] At 405, the method 400 includes generating a list of patches. The method 400 may include adding a patch with the near surface and the far surface to a list of patches for the original point cloud.

[0082] FIG. 5 illustrates an sample reconstructed point cloud. Referring to 303 in FIG. 3, and 403 in FIG. 4, the grid size T X T is fixed during an encoding process. If the parameter T is small, artifacts may appear. However, when T is large, many small patches may be produced and the coding efficiency may be reduced. As shown in FIG. 5, in an experiment using grid-based patch generation where T = 4, coding artifacts may be observed in the marked area 501.

[0083] According to various embodiments, the method 300 or the method 400 may include performing adaptive filtering. For example, at 303, the method 300 may include adaptively filtering the generated near surface s-near, and at 403, the method 400 may include adaptively filtering the generated far surface s-far. That is, the parameter T may be adaptively adjusted based on characteristics of the CC. [0084] Characteristics of a CC used to adaptively adjust the parameter T may include statistics associated with a depth of the points in the CC. For example, a depth range, a minimum/maximum depth value, a mean depth value, a depth variation, etc. [0085] Characteristics of a CC used to adaptively adjust the parameter T may include statistics associated with a geometry of the points in the CC. For example, a bounding box, geometry distribution, etc.

[0086] Characteristics of a CC used to adaptively adjust the parameter T may include statistics associated with a color of the points in the CC. For example, a color similarity/variation etc.

[0087] Characteristics of a CC used to adaptively adjust the parameter T may include statistics associated with other attributes (e.g., reflectance, timestamp, etc.) of the points in the CC.

[0088] The parameter T may be adaptively adjusted based on only one characteristics or based on multiple characteristics together. Additionally, one or more thresholds and/or criteria may be defined (e.g., by a user) to determine a value for the parameter T for each CC in a list of CCs.

[0089] FIG. 6 is a flowchart illustrating a method of generating a near surface s- near, a far surface s-far, and a list of patches, based on a CC, by performing adaptive filtering, according to various embodiments. The method 600 shown in FIG. 6 may be performed for each CC in the list of CCs at 205 in FIG. 2.

[0090] At 601, the method 600 includes removing outliers. The points in the CC may be projected to the projection plane associated with the CC. For example, a projected coordinate of a 3D point in a two-dimensional (2D) UV plane may be denoted as (Uj, Vj), i = 0,1, , N — 1, where N is the number of points in the CC. A minimum value for the projected coordinates may be denoted as: u _min = minCuo, ^, ..., u _N _!),and

Vmin = min(v ₀ ,v ₁ , ... , v _N-1 ).

[0091] If (uj — u _mjn ) > Uthj-esou or (vj Uthresold and

Vthresoid are user-defined thresholds, the i-th point is determined to be an outlier point and is removed from the CC. The resulting CC is referred to as the updated CC and is denoted as CC’.

[0092] At 602, the method 600 includes near surface generation. If the CC’ is not empty (a number of points in the CC’ is greater than zero), then for each 3D point in the CC’, its projected coordinate in the 2D UV plane may be denoted as (uj, Vj), 1 = 0, ..., N — 1, where N is the number of points in the CC’. The method 600 may include determining a near surface s-near that is close to the projection plane associated with the CC’ by selecting points in the CC’. The points in the CC’ may be selected such that if one or more points have the same projected UV coordinate, then the point that has a smallest depth value is selected to be part of the near surface s-near. The depth value of a point may correspond to a distance from the point to the projection plane. The projected coordinates of the selected points may be denoted as (uj, Vj), 1 = 0, ... , N — 1, and the depth value associated with each projected coordinate may be denoted as dj, 1 = 0, ..., N — 1 , where N is the number of points in the near surface s-near.

[0093] At 603, the method 600 includes near surface adaptive filtering. In one embodiment, the method 600 determines a range of depth for points in the CC. For example, the method 600 may include identifying a smallest depth value, denoted as d _min , and a largest depth value, denoted as d _max . The range of depth may be determined according to: where the operation |x| is the absolute value of x. The method 600 may include determining the parameter T based on the following: where d _Th is a positive integer threshold value (e.g., 64, 128, etc.), T _x and T ₂ are two positive integer values such that T _x > T ₂ (e.g., T _x = 32 and T _x = 4). Here, the method 600 selects a larger value for T when d _range is relatively large and the artifacts are likely to appear.

[0094] For a T x T grid in the projected plane, based on the determined value for T, a minimum depth value among points in the CC’ that are projected to the T x T grid may be denoted as d _min . A minimum depth value among all the points in the CC’ may be denoted as d _min , and a maximum allowed depth representation may be denoted as D _max . For a user-defined threshold d _threshoid , and a user-defined surface thickness d _surface , if a point (u, v, d) in the near surface S _near that is projected to the T x T grid satisfies the condition: where (u, v) is the projected coordinate and d is the depth value of the point, then the point is removed from the near surface S _near .

[0095] At 604, the method 600 includes far surface generation. The method 600 may include determining a far surface s-far by selecting points in the CC’ such that if one or more points have the same projected UV coordinate, then the point that has a largest depth value is selected to be part of the far surface s-far. For example, the far surface s- far may be initialized to be the same as the selected points (Uj, Vj), 1 = 0, , N — 1 for the near surface s-near. If multiple points in the CC’ are projected to the same UV coordinate (Uj, Vj) , then the i-th point in the far surface S _far is replaced with the point having the largest depth value such that a distance between this point and the point pj in S _near is not greater than d _surface and the two points’ color values are close to each other.

[0096] At 605, the method 600 includes generating a list of patches. The method 600 may include adding a patch with the near surface and the far surface to a list of patches for the original point cloud.

[0097] FIG. 7 is a flowchart illustrating another method of generating a near surface s-near, a far surface s-far, and a list of patches, based on a CC, by performing adaptive filtering, according to various embodiments. The method 700 shown in FIG. 7 may be performed for each CC in the list of CCs at 205 in FIG. 2.

[0098] At 701, the method 700 includes removing outliers. The points in the CC may be projected to the projection plane associated with the CC. For example, a projected coordinate of a 3D point in a two-dimensional (2D) UV plane may be denoted as

(Uj, Vj), 1 = 0,1, ... , N — 1, where N is the number of points in the CC. A minimum value for the projected coordinates may be denoted as:

[0099]

Vthresoid are user-defined thresholds, the i-th point is determined to be an outlier point and is removed from the CC. The resulting CC is referred to as the updated CC and is denoted as CC’.

[0100] At 702, the method 700 includes far surface generation. If the CC’ is not empty (a number of points in the CC’ is greater than zero), then for each 3D point in the CC’, its projected coordinate in the 2D UV plane may be denoted as (uj, Vj), 1 = 0, N — 1, where N is the number of points in the CC’. The method 300 may include determining a far surface s-far that is farther away from the projection plane associated with the CC’ by selecting points in the CC’ such that if one or more points have the same projected UV coordinate, then the point that has a largest depth value is selected to be part of the far surface s-far. The depth value of a point may correspond to a distance from the point to the projection plane. The projected coordinates of the selected points may be denoted as (uj, Vj), 1 = 0, , N — 1, and the depth value associated with each projected coordinate may be denoted as dj, 1 = 0, ... , N — 1 , where N is the number of points in the far surface s-far.

[0101] At 703, the method 700 includes far surface adaptive filtering. In one embodiment, the method 700 may include using multiple range thresholds to obtain finer granularity for the value of T. For example, two range thresholds may be used as follows: where d _Thl and d _Th2 are two positive integer threshold values such that d _Thl > d _Th2 , and where T _x , T ₂ and T ₂ are three positive integer values such that T _x > T ₂ > T ₃ .

[0102] For a T x T grid in the projected plane, based on the determined value for T, a maximum depth value among points in the CC’ that are projected to the T X T grid may be denoted as d _max . A maximum depth value among all the points in the CC’ may be denoted as d _max , and a maximum allowed depth representation may be denoted as D _m ax- For a user-defined threshold d _threshoid , and a user-defined surface thickness d _surface , if ^a point (u, v, d) in the far surface S _far that is projected to the T x T grid satisfies the condition: where (u, v) is the projected coordinate and d is the depth value of the point, then the point is removed from the far surface S _far .

[0103] At 704, the method 700 includes near surface generation. The method 700 may include determining a near surface s-near by selecting points in the CC’ such that if one or more points have the same projected UV coordinate, then the point that has a smallest depth value is selected to be part of the near surface s-near. For example, the near surface s-near may be initialized to be the same as the selected points (uj, Vj), 1 = 0, N — 1 for the far surface s-far. If multiple points in the CC’ are projected to the same UV coordinate (uj, Vj) , then the i-th point in the near surface S _near is replaced with the point having the smallest depth value such that a distance between this point and the point pi in S _far is not greater than d _surface and the two points’ color values are close to each other.

[0104] At 705, the method 700 includes generating a list of patches. The method 700 may include adding a patch with the near surface and the far surface to a list of patches for the original point cloud.

[0105] The foregoing disclosure provides illustration and description, but is not intended to be exhaustive or to limit the implementations to the precise form disclosed. Modifications and variations are possible in light of the above disclosure or may be acquired from practice of the implementations.

[0106] Some embodiments may relate to a system, a method, and/or a computer readable medium at any possible technical detail level of integration. Further, one or more of the above components described above may be implemented as instructions stored on a computer readable medium and executable by at least one processor (and/or may include at least one processor). The computer readable medium may include a computer-readable non-transitory storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out operations.

[0107] The computer readable storage medium may be a tangible device that may retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

[0108] Computer readable program instructions described herein may be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

[0109] Computer readable program code/instructions for carrying out operations may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, statesetting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects or operations.

[0110] These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flow diagram and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that may direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flow diagram and/or block diagram block or blocks.

[0111] The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flow diagram and/or block diagram block or blocks.

[0112] The flow and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer readable media according to various embodiments. In this regard, each block in the flow diagram or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). The method, computer system, and computer readable medium may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted in the Figures. In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed concurrently or substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flow diagram illustration, and combinations of blocks in the block diagrams and/or flow diagram illustration, may be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

[0113] It will be apparent that systems and/or methods, described herein, may be implemented in different forms of hardware, firmware, or a combination of hardware and software. The actual specialized control hardware or software code used to implement these systems and/or methods is not limiting of the implementations. Thus, the operation and behavior of the systems and/or methods were described herein without reference to specific software code — it being understood that software and hardware may be designed to implement the systems and/or methods based on the description herein.