Prosecution Insights
Last updated: August 17, 2026
Application No. 18/932,031

SIMPLIFIED MOST PROBABLE MODE LIST GENERATION SCHEME

Non-Final OA §102
Filed
Oct 30, 2024
Priority
Dec 04, 2018 — provisional 62/775,373 +4 more
Examiner
RIDER, JUSTIN W
Art Unit
Tech Center
Assignee
Tencent Technology (Shenzhen) Company Limited
OA Round
1 (Non-Final)
84%
Grant Probability
Favorable
1-2
OA Rounds
1y 8m
Est. Remaining
96%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
220 granted / 262 resolved
+24.0% vs TC avg
Moderate +12% lift
Without
With
+12.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 5m
Avg Prosecution
19 currently pending
Career history
283
Total Applications
across all art units

Statute-Specific Performance

§101
15.2%
-24.8% vs TC avg
§103
38.5%
-1.5% vs TC avg
§102
33.5%
-6.5% vs TC avg
§112
7.3%
-32.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 262 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 . Information Disclosure Statement The information disclosure statements (IDSs) submitted on 10/30/2024 and 04/01/2026 are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statements are 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)(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. Claim(s) 1-20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by BROSS et al., "Versatile Video Coding (Draft 3)", 124. MPEG Meeting, Macao, Motion Picture Expert Group or ISO/ IECJTC1/SC29/WG11), no. m45225, XP030215989, Decembers, 2018, 185 pages. referred to as BROSS hereinafter. Regarding Claim 1, BROSS shows a method for video decoding (Clause 8.3 describes the decoding process for coding units.), the method performed by at least one processor and comprising: obtaining video data and one or more most probable mode (MPM) lists indicating angular intra prediction modes (8.3.2 expressly derives MPM candidates for intra prediction modes, including angular modes.); and decoding the video data based on the one or more MPM lists (8.3.2 & 8.3.4 wherein the decoder uses the derived MPM candidate list to determine IntraPredModeY.), wherein at least one of the MPM lists comprises a sequence of candModeList values of a candModeList value, another candModeList value immediately subsequent to the candModeList value, and a second other candModeList value immediately subsequent to the other candModeList value (8.3.2, step 3 explicitly defines six-entry candModeList sequences with ordered candidate positions.), wherein the candModeList value is represented in the at least one of the MPM lists as: 2+((first mode indication+an offset) by a modular operation) (8.3.2, step 3 expressly uses expressions such as 2+((candIntraPredModeA+61)%64).), wherein other candModeList value is represented in the at least one of the MPM lists as: 2+((a second mode indication−an offset) by the modular operation) (8.3.2, step 3 discloses adjacent MPM entries using subtraction/offset-based wrapping.), and wherein the second other candModeList value is represented in the at least one of the MPM lists as: 2+((the first mode indication−(one less than the offset)) by the modular operation) (8.3.2, step 3 corresponds to the +60 term when offset is 61.). Regarding claim 2, BROSS shows the limitations as per Claim 1 above, wherein the first mode indication and the second mode indication both represent a candIntraPredModeA value (8.3.2 step 3, expressly has an embodiment where both expressions derive from candIntraPredModeA.). Regarding claim 3, BROSS shows the limitations as per Claim 1 above, wherein the first mode indication represents a minimum of a (candIntraPredModeA, candIntraPredModeB) value, and wherein the second mode indication represents a maximum of the (candIntraPredModeA, candIntraPredModeB) value (8.3.2 step 3, explicitly defines minAB = Min(candIntraPredModeA, candIntraPredModeB) and maxAB = Max(...).). Regarding claim 4, BROSS shows the limitations as per Claim 1 above, wherein the offset is represented in the at least one of the MPM lists as “61” (8.3.2, step 3 wherein document repeatedly uses +61 and +60 candidate formulas.). Regarding claim 5, BROSS shows the limitations as per Claim 1 above, wherein the modular operation is represented in the at least one of the MPM lists as “% 64” (8.3.2, step 3 wherein repeatedly uses % 64 in the candidate formulas.). Regarding claim 6, BROSS shows the limitations as per Claim 1 above, wherein the at least one of the MPM lists comprises a third other candModeList value (8.3.2, step 3 wherein the six-entry MPM list clearly includes at least a third additional candidate.). Regarding claim 7, BROSS shows the limitations as per Claim 6 above, wherein the at least one of the MPM lists comprises a fourth other candModeList value (8.3.2, step wherein the same six-entry list includes a fourth additional candidate.). Regarding Claim 8, BROSS shows a method for video encoding, the method performed by at least one processor and comprising: receiving video data (Clause 6.2 discloses source pictures and their relationship to the processes outlined in the paper.); and encoding the video data to signal one or more most probable mode (MPM) lists indicating angular intra prediction modes (The encoder signals the MPM list by selecting an index (intra_luma_mpm_idx) that corresponds to an entry in the MPM list derived at the decoder (Clause 8.3.2). The syntax table in 7.3.4.2 defines the bitstream structure for this signaling, and the semantics in 7.4.5 define the mapping of these bits to the MPM candidates.), wherein at least one of the MPM lists comprises a sequence of candModeList values of a candModeList value, another candModeList value immediately subsequent to the candModeList value, and a second other candModeList value immediately subsequent to the other candModeList value (8.3.2, step 3 explicitly defines six-entry candModeList sequences with ordered candidate positions.), wherein the candModeList value is represented in the at least one of the MPM lists as: 2+((first mode indication+an offset) by a modular operation) (8.3.2, step 3 expressly uses expressions such as 2+((candIntraPredModeA+61)%64).), wherein other candModeList value is represented in the at least one of the MPM lists as: 2+((a second mode indication−an offset) by the modular operation) (8.3.2, step 3 discloses adjacent MPM entries using subtraction/offset-based wrapping.), and wherein the second other candModeList value is represented in the at least one of the MPM lists as: 2+((the first mode indication−(one less than the offset)) by the modular operation) (8.3.2, step 3 corresponds to the +60 term when offset is 61.). Regarding claim 9, BROSS shows the limitations as per Claim 8 above, wherein the first mode indication and the second mode indication both represent a candIntraPredModeA value (8.3.2 step 3, expressly has an embodiment where both expressions derive from candIntraPredModeA.). Regarding claim 10, BROSS shows the limitations as per Claim 8 above, wherein the first mode indication represents a minimum of a (candIntraPredModeA, candIntraPredModeB) value, and wherein the second mode indication represents a maximum of the (candIntraPredModeA, candIntraPredModeB) value (8.3.2 step 3, explicitly defines minAB = Min(candIntraPredModeA, candIntraPredModeB) and maxAB = Max(...).). Regarding claim 11, BROSS shows the limitations as per Claim 8 above, wherein the offset is represented in the at least one of the MPM lists as “61” (8.3.2, step 3 wherein document repeatedly uses +61 and +60 candidate formulas.). Regarding claim 12, BROSS shows the limitations as per Claim 8 above, wherein the modular operation is represented in the at least one of the MPM lists as “% 64” (8.3.2, step 3 wherein repeatedly uses % 64 in the candidate formulas.). Regarding claim 13, BROSS shows the limitations as per Claim 8 above, wherein the at least one of the MPM lists comprises a third other candModeList value (8.3.2, step 3 wherein the six-entry MPM list clearly includes at least a third additional candidate.). Regarding claim 14, BROSS shows the limitations as per Claim 13 above, wherein the at least one of the MPM lists comprises a fourth other candModeList value (8.3.2, step wherein the same six-entry list includes a fourth additional candidate.). Regarding Claim 15, BROSS shows a method of processing visual media data, the method performed by at least one processor and comprising: performing a conversion between a visual media file and a bitstream of a visual media data according to a format rule (Clause 6.1), wherein the bitstream signals one or more most probable mode (MPM) lists indicating angular intra prediction modes (8.3.2 wherein the syntax format necessarily signals the MPM by nature of its creation.), wherein at least one of the MPM lists comprises a sequence of candModeList values of a candModeList value, another candModeList value immediately subsequent to the candModeList value, and a second other candModeList value immediately subsequent to the other candModeList value (8.3.2, step 3 explicitly defines six-entry candModeList sequences with ordered candidate positions.), wherein the candModeList value is represented in the at least one of the MPM lists as: 2+((first mode indication+an offset) by a modular operation) (8.3.2, step 3 expressly uses expressions such as 2+((candIntraPredModeA+61)%64).), wherein other candModeList value is represented in the at least one of the MPM lists as: 2+((a second mode indication−an offset) by the modular operation) (8.3.2, step 3 discloses adjacent MPM entries using subtraction/offset-based wrapping.), and wherein the second other candModeList value is represented in the at least one of the MPM lists as: 2+((the first mode indication−(one less than the offset)) by the modular operation) (8.3.2, step 3 corresponds to the +60 term when offset is 61.). Regarding claim 16, BROSS shows the limitations as per Claim 15 above, wherein the first mode indication and the second mode indication both represent a candIntraPredModeA value (8.3.2 step 3, expressly has an embodiment where both expressions derive from candIntraPredModeA.). Regarding claim 17, BROSS shows the limitations as per Claim 15 above, wherein the first mode indication represents a minimum of a (candIntraPredModeA, candIntraPredModeB) value, and wherein the second mode indication represents a maximum of the (candIntraPredModeA, candIntraPredModeB) value (8.3.2 step 3, explicitly defines minAB = Min(candIntraPredModeA, candIntraPredModeB) and maxAB = Max(...).). Regarding claim 18, BROSS shows the limitations as per Claim 15 above, wherein the offset is represented in the at least one of the MPM lists as “61” (8.3.2, step 3 wherein document repeatedly uses +61 and +60 candidate formulas.). Regarding claim 19, BROSS shows the limitations as per Claim 15 above, wherein the modular operation is represented in the at least one of the MPM lists as “% 64” (8.3.2, step 3 wherein repeatedly uses % 64 in the candidate formulas.). Regarding claim 20, BROSS shows the limitations as per Claim 15 above, wherein the at least one of the MPM lists comprises a fourth other candModeList value (8.3.2, step wherein the same six-entry list includes a fourth additional candidate.). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JUSTIN W. RIDER whose telephone number is (571)270-1068. The examiner can normally be reached Monday-Friday, 7.00 am - 4.30 pm. 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 J Atala can be reached at (571) 272-7384. 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. JUSTIN W. RIDER Primary Patent Examiner Art Unit 2486 /Justin W Rider/Primary Patent Examiner, Art Unit 2486
Read full office action

Prosecution Timeline

Oct 30, 2024
Application Filed
Jul 16, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12707064
VIDEO ENCODING/DECODING METHOD AND APPARATUS APPLYING A MERGE MODE WITH MOTION VECTOR DIFFERENCE TO COMBINED AN INTER/INTRA PREDICTION MODE OR A GEOMETRIC PARTITIONING MODE
2y 4m to grant Granted Aug 11, 2026
Patent 12695910
VIDEO ENCODING, DECODING METHOD AND DECODER
1y 9m to grant Granted Jul 28, 2026
Patent 12695866
INTRA MODE CODING BASED ON TEMPLATE
1y 9m to grant Granted Jul 28, 2026
Patent 12695922
ENTROPY DECODING METHOD, AND DECODING APPARATUS USING SAME
1y 5m to grant Granted Jul 28, 2026
Patent 12688640
ANIMATED DECORATIVE ITEMS WITH SENSOR INPUTS
3y 1m 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
84%
Grant Probability
96%
With Interview (+12.3%)
3y 5m (~1y 8m remaining)
Median Time to Grant
Low
PTA Risk
Based on 262 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