Prosecution Insights
Last updated: July 17, 2026
Application No. 18/336,941

POINT CLOUD ENCODING AND DECODING METHOD AND POINT CLOUD DECODER

Final Rejection §102
Filed
Jun 16, 2023
Priority
Dec 22, 2020 — continuation of PCTCN2020138423
Examiner
YENTRAPATI, AVINASH
Art Unit
2672
Tech Center
2600 — Communications
Assignee
Guangdong OPPO Mobile Telecommunications Corp., Ltd.
OA Round
2 (Final)
75%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
70%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
513 granted / 686 resolved
+12.8% vs TC avg
Minimal -5% lift
Without
With
+-4.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
24 currently pending
Career history
705
Total Applications
across all art units

Statute-Specific Performance

§101
2.2%
-37.8% vs TC avg
§103
83.7%
+43.7% vs TC avg
§102
8.9%
-31.1% vs TC avg
§112
4.6%
-35.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 686 resolved cases

Office Action

§102
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 . Claim Rejections - 35 USC § 102 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. 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)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale or otherwise available to the public before the effective filing date of the claimed invention. (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. Claims 1-5, 9-12, 14, 19-20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by D1.1 With regard to claim 1, D1 teach obtaining geometry information and attribute information of points in a point cloud (see ¶ 537: geometry and attribute information); determining prediction values of the attribute information of the points in the point cloud according to the geometry information of the points in the point cloud (see ¶¶ 540, 548: prediction value of attribute information; prediction value calculated using reference node, which is determined based on the geometry information); determining residual values of the attribute information of the points in the point cloud according to the prediction values of the attribute information of the points in the point cloud (see ¶ 590: residual value); and processing the residual values of the attribute information of the points in the point cloud with a first encoding process, lossless encoding being performed on a residual value of attribute information of at least one point in the point cloud in the first encoding process (see ¶¶ 590-592: encoding of residual values; ¶ 651: lossless encoding). With regard to claim 2, D1 teach wherein the at least one point comprises N points and N is an integer multiple of 2, or the at least one point comprises N points and each two neighboring points in the N points have an equal interval (see fig. 1: point cloud with N points multiple of 2). With regard to claim 3, D1 teach wherein performing lossless encoding on the residual value of the attribute information of the at least one point in the point cloud comprises: performing, according to a preset interval, lossless encoding on residual values of attribute information of points spaced at preset intervals in the point cloud (see ¶¶ 590-592, 651: lossless encoding of residual values). With regard to claim 4, D1 teach further comprising: performing level of detail (LOD) partition on the point cloud according to the geometry information of the points in the point cloud to obtain a plurality of detail representation layers of the point cloud, wherein each detail representation layer comprises one or more points (see ¶¶ 521, 532: level of detail layers; see also ¶ 609); and wherein performing lossless encoding on the residual value of the attribute information of the at least one point in the point cloud comprises: performing lossless encoding on a residual value of attribute information of at least one point in at least one detail representation layer in the plurality of detail representation layers (see ¶¶ 590-592, 651: lossless encoding of residual values). With regard to claim 5, D1 teach method of claim 4, wherein performing lossless encoding on the residual value of the attribute information of the at least one point in the at least one detail representation layer in the plurality of detail representation layers comprises: obtaining, from the plurality of detail representation layers, at least one first type of detail representation layer in which a total number of points is less than or equal to a first preset value and at least one second type of detail representation layer in which a total number of points is greater than the first preset value (see ¶¶ 521, 532: level of detail layers comprising plurality of layers with plurality of points, implicitly consist of points that are less than some number or greater than some number); performing lossless encoding on residual values of attribute information of all points in the first type of detail representation layer; and performing lossless encoding on a residual value of attribute information of at least one point in the second type of detail representation layer (see ¶¶ 590-592, 651: lossless encoding of residual values). The level of detail layers typically involve varying number of points depending on the level of detail to be preserved. With regard to claim 9, D1 teach wherein performing lossless encoding on the residual value of the attribute information of the at least one point in the point cloud comprises: skipping the at least one point for which lossless encoding is performed on the residual value of the attribute information, in the process of quantizing the residual values of the attribute information of the points in the point cloud; setting a quantization step size of the at least one point for which lossless encoding is performed on the residual value of the attribute information to be 1; or setting a quantization parameter (QP) of the at least one point for which lossless encoding is performed on the residual value of the attribute information to be a target value, wherein the target value is a QP value corresponding to a quantization step size of 1 (see ¶¶ 424, 443, 526: quantization parameter maybe selected or changed; ¶¶ 590-592, 651: lossless encoding implicit that the quantization parameter is set to or approaches 1). Note that the quantization parameter is recognized to be a result effective variable that can be optimized through routine experimentation. With regard to claim 10, see discussion of claim 1, which describes the encoding process. The steps of the decoding process are simply the inverse of encoding process as described in the discussion of claim 1. See also for example figs. 49, 55, ¶¶ 528-556: decoding steps. With regard to claim 11, D1 teach method of claim 10, wherein decoding the bitstream of the point cloud to obtain the residual values of the attribute information of the points in the point cloud comprises: decoding the bitstream of the point cloud to obtain first information, wherein the first information is indicative of a point of which a residual value of attribute information is determined to be subject to lossless encoding (see ¶ 972: lossless enable flag); decoding the bitstream of the point cloud to obtain residual information of attribute information of a point to-be-decoded in the point cloud and determining whether the residual information of the attribute information of the point to- be-decoded in the point cloud is determined to be subject to lossless encoding according to the first information (see ¶¶ 610, 614, 616, 972: decoding residual information); determining the residual information of the attribute information of the point to-be- decoded as a residual value of the attribute information of the point to-be-decoded based on a determination that the residual information of the attribute information of the point to-be- decoded is determined to be subject to lossless encoding (see ¶¶ 610, 614, 616, 972: decoding residual information, ¶ 972: using lossless flag); and determining residual information of the attribute information of the point to-be-decoded after inverse quantization as the residual value of the attribute information of the point to-be- decoded based on a determination that the residual information of the attribute information of the point to-be-decoded is determined to be subject to lossy encoding (see ¶¶ 610, 614, 616: inverse quantization of residual values). With regard to claim 12, D1 teach the first information comprises N, and N is a total number of points in the point cloud of which residual values of attribute information have been subject to lossless encoding; N is an integer multiple of 2; or each two neighboring points in N points have an equal interval (see fig. 1: N number of points in the point cloud and is a multiple of 2). With regard to claim 14, D1 teach method of claim 11, further comprising: performing level of detail (LOD) partition on the point cloud according to the geometry information of the points in the point cloud to obtain a plurality of detail representation layers of the point cloud, wherein each detail representation layer comprises one or more points (see ¶¶ 521, 532, 574, 609: level of detail layers). With regard to claim 19, see discussion of claim 10. With regard to claim 20, see discussion of claim 11. Claims 6-8, 13, 15-18 are 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 and any intervening claims. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to AVINASH YENTRAPATI whose telephone number is (571)270-7982. The examiner can normally be reached on 8AM-5PM. 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, Sumati Lefkowitz can be reached on (571) 272-3638. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /AVINASH YENTRAPATI/Primary Examiner, Art Unit 2672 1 US Publication No. 2022/0028120.
Read full office action

Prosecution Timeline

Jun 16, 2023
Application Filed
Jan 30, 2026
Non-Final Rejection mailed — §102
Apr 28, 2026
Response Filed
Jul 15, 2026
Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12678363
MOVEMENT SUPPORTING DEVICE, MOVEMENT SUPPORTING METHOD, AND PROGRAM
3y 10m to grant Granted Jul 14, 2026
Patent 12682594
IMAGE PROCESSING DEVICE, IMAGE PROCESSING METHOD, AND PROGRAM
2y 12m to grant Granted Jul 14, 2026
Patent 12671905
LIGHTING CONFIGURATION FOR METROLOGY SYSTEM WITH IMAGES ACQUIRED AT DIFFERENT FOCUS POSITIONS
4y 0m to grant Granted Jun 30, 2026
Patent 12670606
SYSTEMS AND METHODS FOR VIDEO DATA DEPTH DETERMINATION AND VIDEO MODIFICATION
3y 5m to grant Granted Jun 30, 2026
Patent 12670594
SYSTEM AND METHOD FOR EVALUATING A PULMONARY VENTILATION AND PERFUSION GRADIENT
2y 2m to grant Granted Jun 30, 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
75%
Grant Probability
70%
With Interview (-4.7%)
2y 11m (~0m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 686 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