Prosecution Insights
Last updated: July 17, 2026
Application No. 18/268,113

COMPRESSION OF TEMPORAL DATA BY USING GEOMETRY-BASED POINT CLOUD COMPRESSION

Non-Final OA §101§103
Filed
Jun 16, 2023
Priority
Dec 21, 2020 — EU 20216163.4 +1 more
Examiner
DHILLON, PUNEET S
Art Unit
2488
Tech Center
2400 — Computer Networks
Assignee
Nederlandse Organisatie Voor Toegepast-natuurwetenschappelijk Onderzoek Tno
OA Round
3 (Non-Final)
82%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 82% — above average
82%
Career Allowance Rate
241 granted / 293 resolved
+24.3% vs TC avg
Strong +19% interview lift
Without
With
+18.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 4m
Avg Prosecution
38 currently pending
Career history
336
Total Applications
across all art units

Statute-Specific Performance

§101
1.4%
-38.6% vs TC avg
§103
81.2%
+41.2% vs TC avg
§102
5.4%
-34.6% vs TC avg
§112
10.0%
-30.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 293 resolved cases

Office Action

§101 §103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Applicant(s) Response to Official Action The response filed on 02/12/2026 has been entered and made of record. Response to Arguments/Amendments Presented arguments have been fully considered, but are rendered moot in view of the new ground(s) of rejection necessitated by amendment(s) initiated by the applicant(s). Claim Objections Claims 18-23 are objected to because of the following informalities: The claims recite: “A decompression system as claimed in claim …” and should recite: “[[A]] The decompression system as claimed in claim …”. Appropriate correction is required. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. 35 U.S.C. 101 requires that a claimed invention must fall within one of the four eligible categories of invention (i.e. process, machine, manufacture, or composition of matter) and must not be directed to subject matter encompassing a judicially recognized exception as interpreted by the courts. The four eligible categories of invention include: (1) process which is an act, or a series of acts or steps, (2) machine which is an concrete thing, consisting of parts, or of certain devices and combination of devices, (3) manufacture which is an article produced from raw or prepared materials by giving to these materials new forms, qualities, properties, or combinations, whether by hand labor or by machinery, and (4) composition of matter which is all compositions of two or more substances and all composite articles, whether they be the results of chemical union, or of mechanical mixture, or whether they be gases, fluids, powders or solids. Claim 17 is rejected under 35 U.S.C. 101 as not falling within one of the four statutory categories of invention because the claimed invention is directed to computer program per se. A claim directed toward a non-transitory computer-readable medium having the program encoded thereon establishes a sufficient functional relationship between the program and a computer so as to remove it from the realm of “program per se”. Hence, adding the limitation of “stored on a non-transitory computer-readable medium” would resolve this issue. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1-6, 8-10, 14, 17-18, 21-23 are rejected under 35 U.S.C. 103 as being unpatentable over Mammou et al., hereinafter referred to as Mammou (US 2021/0150766 A1) in view of Sugio (US 2021/0368186 A1). As per claim 1, Mammou discloses a decompression system (Mammou: Abstract.) comprising at least one processor the at least one processor being configured to (Mammou: Paras. [0010], [0016] disclose a decompression system comprising at least one processor the at least one processor being configured to:): obtain a compressed three-dimensional point cloud (Mammou: Para. [0010] discloses receiving one or more encoded image frames of a compressed point cloud.), decompress the compressed three-dimensional point cloud into a three-dimensional point cloud by applying geometry-based point cloud decompression to the compressed three-dimensional point cloud (Mammou: Paras. [0011]-[0012], [0103] disclose decoding the one or more encoded image frames and generating a decompressed version of the compressed point cloud based, at least in part, on the determined spatial information for the plurality of patches and the attribute and geometry information included in the patches [i.e., the system decompresses the point cloud using geometry and spatial information].), and convert the point cloud to a plurality of two-dimensional arrays of element values by dividing the three-dimensional point cloud into a plurality of three-dimensional subspaces (Mammou: Para. [0306] discloses “project point cloud data/patches … on a 4:4:4 grid” and Para. [0134] discloses “projecting the points belonging to each patch” [i.e., converting the point cloud into 2D array grids by dividing the 3D geometry into patches for projection]), selecting a corresponding three-dimensional subspace for each position in the two-dimensional arrays (Mammou: Para. [0136] discloses “Let H(u, v) be the set of points of the current patch that get projected to the same pixel (u,v)” [i.e., selecting a projection ray or subspace H(u,v) that corresponds to each pixel position in the 2D array].), and determining an element value for each position in the two-dimensional arrays based on one or more values of one or more data points in the corresponding three-dimensional subspace (Mammou: Paras. [0136]-[0141], [0175] disclose determining an element value (e.g., depth, texture, or attribute) for each pixel position in the 2D array by evaluating the 3D data points within the projection ray/subspace H(u, v) corresponding to that pixel, and assigning the pixel based on the associate point, or an average/linear combination if multiple data points occupy that subspace.), However, Mammou does not explicitly disclose “… same positions in each of the plurality of two-dimensional arrays comprising a value of a same element at a different moment.”. Further, Sugio is in the same field of endeavor and teaches same positions in each of the plurality of two-dimensional arrays comprising a value of the same element at a different moment (Sugio: Para. [0207] discloses “temporal prediction in which a prediction unit corresponding to a different time is referred to,” Para. [0569] discloses “encodes (inter predicts) a space (SPC) associated with certain time T_Cur using an encoded space associated with different time T_LX,” and Para. [0237] discloses “the same dynamic object is encoded as an object in a GOS corresponding to a different time” [i.e., utilizing temporal prediction across frames such that the same spatial elements or objects are tracked across prediction units at different moments in time].). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, and having the teachings of Mammou and Sugio before him or her, to modify the point cloud data processing system of Mammou to include the same positions in two-dimensional arrays comprising a value of the same element at a different moment feature as described in Sugio. The motivation for doing so would have been to the compression rate and encoding efficiency by exploiting temporal redundancies between dynamic objects over time. As per claim 2, Mammou-Sugio disclose the decompression system as claimed in claim 1, wherein the two-dimensional arrays of element values are frames comprising pixel values (Sugio: Paras. [0216], [0556]-[0557] disclose three-dimensional data included in the VLM subspace includes, for example, at least one pair of a spatial position such as three-dimensional coordinates and an attribute value such as color information [includes pixel values], which is mapped to two-dimensional arrays.). As per claim 3, Mammou-Sugio disclose the decompression system as claimed in claim 1, wherein the element values comprise values derived from at least one sensor (Sugio: Para. [0458] discloses a plurality of sensors 815 are a group of sensors, such as visible light cameras and infrared cameras, that obtain information on the outside of the vehicle and generate sensor information 833. Sensor information 833 is, for example, three-dimensional data such as a point cloud (point group data), when sensors 815 are laser sensors such as LiDARs. Note that a single sensor may serve as a plurality of sensors 815.). As per claim 4, Mammou-Sugio disclose the decompression system as claimed in claim 3, wherein the element values comprise color values (Sugio: Paras. [0216], [0556]-[0557] disclose three-dimensional data included in the VLM subspace includes, for example, at least one pair of a spatial position such as three-dimensional coordinates and an attribute value such as color information, which is mapped to two-dimensional arrays.). As per claim 5, Mammou-Sugio disclose the decompression system as claimed in claim 1, wherein the at least one processor is configured to obtain metadata indicating dimensions of the plurality of two-dimensional arrays and divide the three-dimensional point cloud into the plurality of three-dimensional subspaces based on the indicated dimensions (Mammou: Para. [0105] discloses "metadata associated with patches … patch information indicating sizes and shapes of patches" and Para. [0245] discloses "extent of its 2D bounding box (DU0, DV0)" [i.e., metadata indicates the dimensions (sizes/bounding boxes) of the 2D arrays (patches), which controls how the point cloud is divided into subspaces for projection.). As per claim 6, Mammou-Sugio-Kim disclose the decompression system as claimed in claim 5, wherein the at least one processor is configured to determine point cloud dimensions of the three-dimensional point cloud and divide the three-dimensional point cloud into a plurality of three-dimensional subspaces further based on the determined point cloud dimensions (Mammou: Paras. [0244]-[0246] disclose "Minimum/maximum/average/median depth value" [i.e., the metadata defines the point cloud dimensions via minimum/maximum depths, which is used to divide the subspaces]). As per claim 8, Mammou-Sugio disclose the decompression system as claimed in claim 1, wherein the compressed three-dimensional point cloud was compressed using lossy geometry-based point cloud compression and the at least one processor is configured to determine for each position in the two-dimensional arrays whether the corresponding three-dimensional subspace comprises at least one data point and if a three-dimensional subspace corresponding to a position in the two-dimensional arrays does not comprise a data point, determine a geometrical shape encompassing the three-dimensional subspace and determine an element value for the position based on one or more element values of one or more data points which are part of the determined geometrical shape. (Mammou: Para. [0152] discloses "lossy compression", Para. [0134] discloses "If H(u, v) is empty then the pixel is marked as unoccupied", and Para. [0186] discloses "padding may be performed to fill the non-occupied pixels … For each block … the intra prediction modes … are assessed and the one that produces the lowest prediction errors on the occupied pixels is retained" [i.e., for empty subspaces lacking a data point, padding determines a geometric block (shape) encompassing the space and determines the pixel value based on occupied adjacent pixels].). As per claim 9, Mammou-Sugio disclose the decompression system as claimed in claim 1, wherein the at least one processor is configured to obtain metadata identifying a method which was used to map positions of element values in an original plurality of arrays to coordinates of the data points of the three-dimensional point cloud before the three-dimensional point cloud was compressed and select the corresponding three-dimensional subspace for each position in the two-dimensional arrays based on the identified method (Mammou: Paras. [0244]-[0247] disclose before the three-dimensional point cloud was compressed, an "Index of the projection direction" is metadata that identifies the projection direction (method) used to map 3D coordinates to 2D arrays, which dictates the selection of the corresponding subspace for each position.). As per claim 10, Mammou-Sugio disclose the decompression system as claimed in claim 1, wherein the decompression system is a terminal (Mammou: Para. [0092] discloses the decoder is implemented within an end-user terminal device such as a head-mounted display.). As per claim 14, Mammou discloses a method of decompressing compressed two-dimensional arrays of element values (Mammou: Abstract.), the method comprising: obtaining a compressed three-dimensional point cloud (Mammou: Para. [0010] discloses receiving one or more encoded image frames of a compressed point cloud.); decompressing the compressed three-dimensional point cloud into a three-dimensional point cloud by applying geometry-based point cloud decompression to the compressed three-dimensional point cloud (Mammou: Paras. [0011]-[0012], [0103] disclose decoding the one or more encoded image frames and generating a decompressed version of the compressed point cloud based, at least in part, on the determined spatial information for the plurality of patches and the attribute and geometry information included in the patches [i.e., the system decompresses the point cloud using geometry and spatial information].); and converting the point cloud to a plurality of two-dimensional arrays of element values by dividing the three-dimensional point cloud into a plurality of three-dimensional subspaces (Mammou: Para. [0306] discloses “project point cloud data/patches … on a 4:4:4 grid” and Para. [0134] discloses “projecting the points belonging to each patch” [i.e., converting the point cloud into 2D array grids by dividing the 3D geometry into patches for projection]), selecting a corresponding three-dimensional subspace for each position in the two-dimensional arrays (Mammou: Para. [0136] discloses “Let H(u, v) be the set of points of the current patch that get projected to the same pixel (u,v)” [i.e., selecting a projection ray or subspace H(u,v) that corresponds to each pixel position in the 2D array].), and determining an element value for each position in the two-dimensional arrays based on one or more values of one or more data points in the corresponding three-dimensional subspace (Mammou: Paras. [0136]-[0141], [0175] disclose determining an element value (e.g., depth, texture, or attribute) for each pixel position in the 2D array by evaluating the 3D data points within the projection ray/subspace H(u, v) corresponding to that pixel, and assigning the pixel based on the associate point, or an average/linear combination if multiple data points occupy that subspace.), However, Mammou does not explicitly disclose “… same positions in each of the plurality of two-dimensional arrays comprising a value of a same element at a different moment.”. Further, Sugio is in the same field of endeavor and teaches same positions in each of the plurality of two-dimensional arrays comprising a value of the same element at a different moment (Sugio: Para. [0207] discloses “temporal prediction in which a prediction unit corresponding to a different time is referred to,” Para. [0569] discloses “encodes (inter predicts) a space (SPC) associated with certain time T_Cur using an encoded space associated with different time T_LX,” and Para. [0237] discloses “the same dynamic object is encoded as an object in a GOS corresponding to a different time” [i.e., utilizing temporal prediction across frames such that the same spatial elements or objects are tracked across prediction units at different moments in time].). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, and having the teachings of Mammou and Sugio before him or her, to modify the point cloud data processing system of Mammou to include the same positions in two-dimensional arrays comprising a value of the same element at a different moment feature as described in Sugio. The motivation for doing so would have been to the compression rate and encoding efficiency by exploiting temporal redundancies between dynamic objects over time. As per claim 17, Mammou-Sugio disclose a computer program product for a computing device, the computer program product comprising computer program code to perform the method of claim 14 when the computer program product is run on a processing unit of the computing device. As per claim 18, Mammou-Sugio disclose a decompression system as claimed in claim 1, wherein the element values comprise color values from a camera (Mammou: Paras. [0093]-[0094] disclose element values comprise color values from a camera.). As per claim 21, Mammou-Sugio disclose a decompression system as claimed in claim 1, wherein the decompression system is a set-top box (Mammou: Para. [0637] discloses wherein the decompression system is a set-top box.). As per claim 22, Mammou-Sugio disclose a decompression system as claimed in claim 1, wherein the decompression system is a computer (Mammou: Para. [0637] discloses wherein the decompression system is a computer.). As per claim 23, Mammou-Sugio disclose a decompression system as claimed in claim 9, wherein the mapping method identifies a coordinate system used in the mapping (Mammou: Para. [0093] discloses wherein the mapping method identifies a coordinate system used in the mapping.). Claims 19-20 are rejected under 35 U.S.C. 103 as being unpatentable over Mammou et al., hereinafter referred to as Mammou in view of Sugio in further view of Sinharoy et al., hereinafter referred to as Sinharoy (US 2019/0197739 A1). As per claim 19, Mammou-Sugio disclose a decompression system as claimed in claim 3 (Mammou: Abstract.), However, Mammou-Sugio do not explicitly disclose “… wherein the at least one sensor is a temperature sensor.”. Further, Sinharoy is in the same field of endeavor and teaches wherein the at least one sensor is a temperature sensor (Sinharoy: Para. [0054] discloses wherein the at least one sensor is a temperature sensor.). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, and having the teachings of Mammou-Sugio and Sinharoy before him or her, to modify the decompression system of Mammou-Sugio to include the temperature sensor feature as described in Sinharoy. The motivation for doing so would have been to improve user experience by providing an expanded configuration that can host a variety of different components that are associated with three-dimensional content. As per claim 20, Mammou-Sugio disclose a decompression system as claimed in claim 3 (Mammou: Abstract.), However, Mammou-Sugio do not explicitly disclose “… wherein the at least one sensor is a humidity sensor.”. Further, Sinharoy is in the same field of endeavor and teaches wherein the at least one sensor is a humidity sensor (Sinharoy: Para. [0054] discloses wherein the at least one sensor is a humidity sensor.). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, and having the teachings of Mammou-Sugio and Sinharoy before him or her, to modify the decompression system of Mammou-Sugio to include the temperature sensor feature as described in Sinharoy. The motivation for doing so would have been to improve user experience by providing an expanded configuration that can host a variety of different components that are associated with three-dimensional content. Allowable Subject Matter Claims 7 is objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure and can be viewed in the list of references. Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to PEET DHILLON whose telephone number is (571)270-5647. The examiner can normally be reached M-F: 5am-1:30pm. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Sath V. Perungavoor can be reached at 571-272-7455. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /PEET DHILLON/Primary Examiner Art Unit: 2488 Date: 03-31-2026
Read full office action

Prosecution Timeline

Jun 16, 2023
Application Filed
Nov 14, 2025
Non-Final Rejection mailed — §101, §103
Feb 12, 2026
Response Filed
Apr 02, 2026
Final Rejection mailed — §101, §103
Jun 29, 2026
Request for Continued Examination
Jul 02, 2026
Response after Non-Final Action
Jul 14, 2026
Non-Final Rejection mailed — §101, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12671847
CROSS-COMPONENT SAMPLE ADAPTIVE OFFSET
2y 1m to grant Granted Jun 30, 2026
Patent 12647577
INTRA PREDICTION MODES SIGNALING
2y 3m to grant Granted Jun 02, 2026
Patent 12626506
METHOD AND SYSTEM FOR DETECTING CHANGES IN AREAS
1y 4m to grant Granted May 12, 2026
Patent 12598346
A DISPLAY DEVICE AND OPERATION METHOD THEREOF
1y 8m to grant Granted Apr 07, 2026
Patent 12567263
IMAGING SYSTEM
1y 9m to grant Granted Mar 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
82%
Grant Probability
99%
With Interview (+18.6%)
2y 4m (~0m remaining)
Median Time to Grant
High
PTA Risk
Based on 293 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month