Prosecution Insights
Last updated: August 17, 2026
Application No. 19/025,016

Approximation for Recoloring of Point Clouds

Non-Final OA §102
Filed
Jan 16, 2025
Priority
Jan 16, 2024 — provisional 63/621,552
Examiner
MAHMUD, FARHAN
Art Unit
2483
Tech Center
2400 — Computer Networks
Assignee
Comcast Cable Communications LLC
OA Round
1 (Non-Final)
56%
Grant Probability
Moderate
1-2
OA Rounds
2y 0m
Est. Remaining
66%
With Interview

Examiner Intelligence

Grants 56% of resolved cases
56%
Career Allowance Rate
221 granted / 395 resolved
-2.1% vs TC avg
Moderate +10% lift
Without
With
+10.2%
Interview Lift
resolved cases with interview
Typical timeline
3y 7m
Avg Prosecution
29 currently pending
Career history
439
Total Applications
across all art units

Statute-Specific Performance

§101
5.4%
-34.6% vs TC avg
§103
49.1%
+9.1% vs TC avg
§102
34.5%
-5.5% vs TC avg
§112
8.7%
-31.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 395 resolved cases

Office Action

§102
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 . Election/Restrictions Applicant's election with traverse of the Restriction Requirement in the reply filed on 04/27/2026 is acknowledged. The traversal is on the ground(s) that the two groups share some similar overlapping features which the applicant argues would not pose a serious search or examination burden. This is not found persuasive because applicant points out piecemeal some portions of claims which lightly overlap, however not even most of the claim limitations applicant cites fully overlap. They only recite similar terminology as they are necessarily operating in the same field, however, the underlying inventive concepts of each grouping is clearly different as previously laid out. The following table highlights some example differences which separates the two groupings with no overlap Group 1 Group 2 Claim 1 Claims 10, 15 determining a leaf node, of the plurality of the nodes, close to a position of the point; selecting, from one or more reference points associated with the leaf node, one or more reference points closest to the position of the point determining, based on attributes associated with a reference point determined from an approximate nearest neighbor search, attribute predictors for attributes associated with the reconstructed point The requirement is still deemed proper and is therefore made FINAL. Claims 10-20 are withdrawn from further consideration pursuant to 37 CFR 1.142(b), as being drawn to a nonelected Group, there being no allowable generic or linking claim. Applicant timely traversed the restriction (election) requirement in the reply filed on 04/27/2026. Information Disclosure Statement The information disclosure statement (IDS) submitted on 04/16/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. The information disclosure statement (IDS) submitted on 06/23/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claim(s) 1-9 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Gao et al. (US 20260170696 A1). Regarding Claim 1, Gao et al. teaches a method comprising: decoding, by a computing device, points of a point cloud, associated with content, to determine reconstructed points of the point cloud (Paragraphs 15-22); generating a space partitioning tree comprising a plurality of nodes that associates one or more reference points, of a reference point cloud for attributes, with a plurality of sub- volumes associated with the reference point cloud (Paragraphs 15-22); and for each reconstructed point of the reconstructed points: determining a point based on a motion vector, of a motion vector field, associated with the reconstructed point (Paragraphs 15-22; Paragraph 76; Paragraphs 102-108); determining a leaf node, of the plurality of the nodes, close to a position of the point (Paragraphs 15-22; Paragraphs 86-94); selecting, from one or more reference points associated with the leaf node, one or more reference points closest to the position of the point (Paragraphs 15-22; Paragraphs 86-94; Paragraphs 132-133); and determining, based on one or more attributes associated with the one or more selected reference points, an attribute predictor for an attribute associated with the reconstructed point (Paragraphs 15-22; Paragraphs 61-63; Paragraph 73). Regarding Claim 2, Gao et al. teaches the method of claim 1, Gao et al. further teaches for each reconstructed point of the reconstructed points: decoding, from a bitstream, a residual attribute indicating a difference between the attribute associated with each reconstructed point and the attribute predictor; and decoding, based on the attribute predictor and the decoded residual attribute, the attribute associated with the each reconstructed point of the reconstructed points (Paragraphs 15-22; Paragraphs 61-63; Paragraph 73; Paragraphs 195-203). Regarding Claim 3, Gao et al. teaches the method of claim 1, wherein the determining the attribute predictor is further based on: approximation information for searching the one or more reference points from the reference point cloud (Paragraphs 15-22; Paragraphs 61-63; Paragraph 73; Paragraphs 193-203). Regarding Claim 4, Gao et al. teaches the method of claim 1, wherein the one or more selected reference points comprise a plurality of selected reference points; and the method further comprising: determining, based on a weighted average of the plurality of attributes, the attribute predictor, wherein the weighted average of the plurality of attributes is based on respective distances between the plurality of selected reference points and the position of the point (Paragraphs 15-22; Paragraphs 61-63; Paragraph 73; Paragraphs 100-114; Paragraphs 193-203). Regarding Claim 5, Gao et al. teaches the method of claim 1, further comprising: selecting, based on distances between the one or more reference points and the position of the point, the one or more reference points closet to the position of the point, wherein the distances comprise at least one of a Manhattan distance, a Euclidean distance, Chebyshev distance, or a Minkowski distance (Paragraphs 15-22; Paragraphs 61-63; Paragraph 73; Paragraphs 100-114; Paragraphs 193-203). Regarding Claim 6, Gao et al. teaches the method of claim 1, wherein the determining the point is further based on translating the reconstructed point by the motion vector (Paragraphs 15-22; Paragraph 76; Paragraphs 102-108). Regarding Claim 7, Gao et al. teaches the method of claim 1, wherein the motion vector is associated with all points of the reconstructed points (Paragraphs 15-22; Paragraph 76; Paragraphs 102-108). Regarding Claim 8, Gao et al. teaches the method of claim 1, wherein the selecting the one or more reference points comprises: performing a depth-first search on the space partitioning tree to determine a node, of the plurality of nodes, associated with the smallest sub-volume containing the position of the point (Paragraphs 15-22; Paragraphs 61-63; Paragraph 73; Paragraphs 193-203). Regarding Claim 9, Gao et al. teaches the method of claim 1, further comprising: determining the reference point cloud for the attributes from an already-coded reference point cloud frame, wherein the already-coded reference point cloud is used to decode a geometry of the point cloud; and decoding at least one of: the motion vector field; or an indication of the already-coded reference point cloud (Paragraphs 15-22; Paragraph 76; Paragraphs 102-108; Paragraphs 149-155). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to FARHAN MAHMUD whose telephone number is (571)272-7712. The examiner can normally be reached 10-7. 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, Joseph Ustaris can be reached at 5712727383. 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. /FARHAN MAHMUD/Primary Examiner, Art Unit 2483
Read full office action

Prosecution Timeline

Jan 16, 2025
Application Filed
Jul 21, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12701211
Reducing Power Consumption of a Lenticular Display
2y 10m to grant Granted Aug 04, 2026
Patent 12664735
Mixed Reality Combination System
2y 8m to grant Granted Jun 23, 2026
Patent 12641286
Geometry Conversion for 360-degree Video Coding
2y 9m to grant Granted May 26, 2026
Patent 12634460
VISUAL QUALITY SIGNALLING MECHANISM
1y 11m to grant Granted May 19, 2026
Patent 12634441
AN APPARATUS, A METHOD AND A COMPUTER PROGRAM FOR VIDEO CODING AND DECODING
1y 4m to grant Granted May 19, 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

1-2
Expected OA Rounds
56%
Grant Probability
66%
With Interview (+10.2%)
3y 7m (~2y 0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 395 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