Prosecution Insights
Last updated: August 18, 2026
Application No. 19/242,322

GEOMETRIC PARTITION BASED INTRA PREDICTION

Non-Final OA §DP
Filed
Jun 18, 2025
Priority
Sep 15, 2021 — provisional 63/261,248 +1 more
Examiner
DEMOSKY, PATRICK E
Art Unit
2482
Tech Center
2400 — Computer Networks
Assignee
Tencent Technology (Shenzhen) Company Limited
OA Round
1 (Non-Final)
65%
Grant Probability
Favorable
1-2
OA Rounds
1y 11m
Est. Remaining
56%
With Interview

Examiner Intelligence

Grants 65% — above average
65%
Career Allowance Rate
255 granted / 391 resolved
+7.2% vs TC avg
Minimal -9% lift
Without
With
+-9.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
20 currently pending
Career history
407
Total Applications
across all art units

Statute-Specific Performance

§101
2.7%
-37.3% vs TC avg
§103
64.8%
+24.8% vs TC avg
§102
15.8%
-24.2% vs TC avg
§112
13.4%
-26.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 391 resolved cases

Office Action

§DP
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 . Information Disclosure Statement The information disclosure statement(s) submitted on 10/6/2025 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 2, 10, and 19 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 10, and 18 of U.S. Patent No. 12,363,288 B2 in view of Lee et al. (US 20230015638 A1). Although the claims at issue are not identical, they are not patentably distinct from each other because of the reasons set forth below: Claims 3-9, 11-18, and 20-21 are rejected based on their dependence from claims 2, 10, and 19, respectively. (Note: limitations bolded and underlined highlight claim language differing between the instant application and U.S. Patent No. 12,363,288 B2). Instant Application Issued U.S. Patent No. 12,363,288 B2 Claim 2 A non-transitory computer-readable storage medium storing instructions which when executed by a processor cause the processor to perform an encoding method comprising: partitioning a coding unit (CU) in a picture of a video into a first partition and a second partition based on a geometric partition mode (GPM), the first partition and the second partition being adjacent to each other and divided by a partition line; determining a first intra prediction mode for the first partition of the CU; determining a second intra prediction mode for the second partition of the CU based on one of a first constraint that the second intra prediction mode is planar intra mode and a second constraint that the second intra prediction mode is adjacent to the first intra prediction mode, the first intra prediction mode being different from the second intra prediction mode; encoding the CU in a bitstream based on the first intra prediction mode for the first partition of the CU and the second intra prediction mode for the second partition of the CU; and transmitting the encoded bitstream. Claim 10 A method of video encoding performed in a video encoder, the method comprising: partitioning a coding unit (CU) in a picture of a video into a first partition and a second partition based on a geometric partition mode (GPM), wherein the first partition and the second partition are adjacent to each other and divided by a partition line; determining a first intra prediction mode for the first partition of the CU; determining a second intra prediction mode for the second partition of the CU based on one of a first constraint that the second intra prediction mode is planar intra mode and a second constraint that the second intra prediction mode is adjacent to the first intra prediction mode, the first intra prediction mode being different from the second intra prediction mode; and encoding the CU in a bitstream based on the first intra prediction mode for the first partition of the CU and the second intra prediction mode for the second partition of the CU. Claim 10 An apparatus for video processing, comprising: processing circuitry configured to: receive coded information of a coding unit (CU) in a picture of a video from a coded video bitstream; partition the CU into a first partition and a second partition based on a geometric partition mode (GPM), the first partition and the second partition being adjacent to each other and divided by a partition line; determine a first intra prediction mode for the first partition of the CU; determine a second intra prediction mode for the second partition of the CU based on one of a first constraint that the second intra prediction mode is planar intra mode and a second constraint that the second intra prediction mode is adjacent to the first intra prediction mode, the first intra prediction mode being different from the second intra prediction mode; and reconstruct the CU based on the first intra prediction mode for the first partition of the CU and the second intra prediction mode for the second partition of the CU. Claim 1 A method of video decoding performed in a video decoder, the method comprising: receiving coded information of a coding unit (CU) in a picture of a video from a coded video bitstream; partitioning the CU into a first partition and a second partition based on a geometric partition mode (GPM), wherein the first partition and the second partition are adjacent to each other and divided by a partition line; determining a first intra prediction mode for the first partition of the CU; determining a second intra prediction mode for the second partition of the CU based on one of a first constraint that the second intra prediction mode is planar intra mode and a second constraint that the second intra prediction mode is adjacent to the first intra prediction mode, the first intra prediction mode being different from the second intra prediction mode; and reconstructing the CU based on the first intra prediction mode for the first partition of the CU and the second intra prediction mode for the second partition of the CU. Claim 19 An apparatus for video processing, comprising: processing circuitry configured to: partition a coding unit (CU) in a picture of a video into a first partition and a second partition based on a geometric partition mode (GPM), the first partition and the second partition being adjacent to each other and divided by a partition line; determine a first intra prediction mode for the first partition of the CU; determine a second intra prediction mode for the second partition of the CU based on one of a first constraint that the second intra prediction mode is planar intra mode and a second constraint that the second intra prediction mode is adjacent to the first intra prediction mode, the first intra prediction mode being different from the second intra prediction mode; and encode the CU in a bitstream based on the first intra prediction mode for the first partition of the CU and the second intra prediction mode for the second partition of the CU. Claim 10 A method of video encoding performed in a video encoder, the method comprising: partitioning a coding unit (CU) in a picture of a video into a first partition and a second partition based on a geometric partition mode (GPM), wherein the first partition and the second partition are adjacent to each other and divided by a partition line; determining a first intra prediction mode for the first partition of the CU; determining a second intra prediction mode for the second partition of the CU based on one of a first constraint that the second intra prediction mode is planar intra mode and a second constraint that the second intra prediction mode is adjacent to the first intra prediction mode, the first intra prediction mode being different from the second intra prediction mode; and encoding the CU in a bitstream based on the first intra prediction mode for the first partition of the CU and the second intra prediction mode for the second partition of the CU. Table 1 Regarding claim 2, as noted above, claim 2 of the instant application is a variation of claim 10 of U.S. Patent No. 12,363,288 B2. Specifically, claim 2 of the instant application is drawn towards a non-transitory computer-readable storage medium storing instructions which when executed by a processor cause the processor to perform an encoding method which partitions a CU into a first partition and a second partition based on a geometric partition mode (GPM). Claim 10 of U.S. Patent No. 12,363,288 B2 recites limitations nearly verbatim to claim 2 of the instant application, but is instead drawn towards a method of video encoding performed in a video encoder rather than “a non-transitory computer-readable storage medium”. Additionally, claim 2 of the instant application appears to uniquely recite: “transmitting the encoded bitstream”. However, Lee et al. discloses: the practice of storing instructions, or “code” on a non-transitory computer-readable storage medium (to be executed by a processor), and [See Lee, ¶ 0322 discloses a non-transitory computer-readable recording medium according to the present invention may store a bitstream generated by an image encoding method.] transmitting a bitstream after it has been encoded [See Lee, ¶ 0117 discloses encoding apparatus 100 may generate a bitstream including encoded information through encoding the input image, and output the generated bitstream. The generated bitstream may be stored in a computer readable recording medium, or may be streamed through a wired/wireless transmission medium.] It would have been obvious to the person having ordinary skill in the art before the effective filing date of the claimed invention to modify the invention disclosed by issued U.S. Patent No. 12,363,288 B2 to add the teachings of Lee in order to provide improved coding efficiency when transmitting image data through existing transmission media channels. Regarding claim 10, as noted above, claim 10 of the instant application is a variation of claim 1 of U.S. Patent No. 12,363,288 B2. Specifically, claim 10 of the instant application is drawn towards an apparatus for video processing, comprising: processing circuitry. Claim 1 of U.S. Patent No. 12,363,288 B2 recites limitations nearly verbatim to claim 2 of the instant application, but is instead drawn towards a method of video decoding rather than “an apparatus”. Additionally, claim 1 of the instant application appears to uniquely recite: “processing circuitry configured to”. However, Lee et al. discloses: a) processing circuitry configured to [See Lee, ¶ 0352 discloses examples of the computer-readable recording medium include magnetic recording media such as hard disks, floppy disks, and magnetic tapes: optical data storage media such as CD-ROMs or DVD-ROMs; magneto-optimum media such as floptical disks, and hardware devices, such as read-only memory (ROM), random-access memory (RAM), flash memory, etc., which are particularly structured to store and implement the program instruction.] Note: Claim 19 is rejected for analogous reasons presented for claim 10 above. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to PATRICK E DEMOSKY whose telephone number is (571)272-8799. The examiner can normally be reached Monday - Friday 7-4 EST. 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, Jamie Atala can be reached at 5712727384. 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. /PATRICK E DEMOSKY/Primary Examiner, Art Unit 2486
Read full office action

Prosecution Timeline

Jun 18, 2025
Application Filed
Oct 17, 2025
Response after Non-Final Action
Jul 24, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12707095
HIGH LEVEL SYNTAX FOR VIDEO CODING AND DECODING
1y 9m to grant Granted Aug 11, 2026
Patent 12695877
IMAGE ENCODING/DECODING METHOD AND DEVICE FOR PERFORMING BDOF, AND METHOD FOR TRANSMITTING BITSTREAM
1y 11m to grant Granted Jul 28, 2026
Patent 12695920
HIGH LEVEL SYNTAX FOR VIDEO CODING AND DECODING
1y 9m to grant Granted Jul 28, 2026
Patent 12689722
ILLUMINATION COMPENSATION FOR VIDEO ENCODING AND DECODING
4y 7m to grant Granted Jul 21, 2026
Patent 12689730
MULTI-QUANTIZER METHOD FOR IMAGE AND VIDEO COMPRESSION
1y 5m to grant Granted Jul 21, 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
65%
Grant Probability
56%
With Interview (-9.0%)
3y 1m (~1y 11m remaining)
Median Time to Grant
Low
PTA Risk
Based on 391 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