Prosecution Insights
Last updated: July 17, 2026
Application No. 19/128,391

ENCODING AND DECODING METHODS OF INTRA PREDICTION MODES USING DYNAMIC LISTS OF MOST PROBABLE MODES AND CORRESPONDING APPARATUSES

Non-Final OA §103
Filed
May 08, 2025
Priority
Nov 10, 2022 — EU 22315274.5 +1 more
Examiner
NAWAZ, TALHA M
Art Unit
Tech Center
Assignee
InterDigital Inc.
OA Round
1 (Non-Final)
89%
Grant Probability
Favorable
1-2
OA Rounds
12m
Est. Remaining
88%
With Interview

Examiner Intelligence

Grants 89% — above average
89%
Career Allowance Rate
551 granted / 617 resolved
+29.3% vs TC avg
Minimal -1% lift
Without
With
+-0.8%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 2m
Avg Prosecution
17 currently pending
Career history
641
Total Applications
across all art units

Statute-Specific Performance

§101
2.5%
-37.5% vs TC avg
§103
67.0%
+27.0% vs TC avg
§102
24.6%
-15.4% vs TC avg
§112
1.7%
-38.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 617 resolved cases

Office Action

§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 . Priority This application discloses and claims only subject matter disclosed in prior application, and names the inventor or at least one joint inventor named in the prior application. Accordingly, this application may constitute a continuation or divisional. Should applicant desire to claim the benefit of the filing date of the prior application, attention is directed to 35 U.S.C. 120, 37 CFR 1.78, and MPEP § 211 et seq. The presentation of a benefit claim may result in an additional fee under 37 CFR 1.17(w)(1) or (2) being required, if the earliest filing date for which benefit is claimed under 35 U.S.C. 120, 121, 365(c), or 386(c) and 1.78(d) in the application is more than six years before the actual filing date of the application. Acknowledgment is made of applicant’s claim for foreign priority under 35 U.S.C. 119 (a)-(d). The certified copy has been filed. Information Disclosure Statement The information disclosure statement (IDS) submitted on 05/08/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 § 103 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 (i.e., changing from AIA to pre-AIA ) 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 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claims 1-3, 6-7, 11-12, 14-16, 19-20, 24-25, 27-28 and 31-38 are rejected under 35 U.S.C. 103 as being unpatentable over Li et al. (US20220182665) (hereinafter Li) in view of Ko et al. (US20200275124) (hereinafter Ko). Regarding claim 1, Li discloses an encoding method comprising: obtaining an intra prediction mode for a current block to be encoded [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. obtaining a list of intra prediction modes, wherein the list comprises a set of intra prediction modes ordered according to how frequently each intra prediction mode occurs and further adapted according to at least one characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. encoding the intra prediction mode for the current block responsive to the list of intra prediction modes [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. Li discloses the limitations of the claim. However, Li does not explicitly disclose characteristic of the current block selected from the group consisting of block size, block shape, and tree depth. Ko more explicitly discloses characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [0138-0162, 0177-0188; various coding teachings utilizing block parameters including size, shape and depth parameters]. It would have been obvious to one of ordinary skill in the art before the effective filing date to incorporate the teachings of Li with the teachings of Ko as stated above. By incorporating the teachings as such, further data compression efficiency while improving quality is achieved (see Ko 0003-0011). Regarding claim 2, Li discloses wherein the set of intra prediction modes is ordered in a decreasing order of frequency [0198-0214; lists are sorted and ordered in various configurations]. Regarding claim 3, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block [Fig. 9, 0072, 0096, 0141-0143; coding parameters including neighboring block information]. Regarding claim 6, Li discloses the neighboring blocks comprise one block located at half position of a current block width and one block located at half position of a current block height [Figs. 7-10, 0152-0177; various block divisions and splits]. Regarding claim 7, Li discloses wherein the neighboring blocks comprise blocks located at least one quarter position of a current block width and height [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. Regarding claim 11, Li discloses wherein the list of intra prediction modes comprises, after the set of intra prediction modes of neighboring blocks, at least one intra prediction mode of another ordered list of default intra prediction modes whose order depends on a shape of the current block [Fig 16, 0273-0287; lists and modes constructed utilizing parameters including block shape]. Regarding claim 12, Li discloses wherein a size of the list depends on a size of the current block or on a tree-depth associated with the current block [Fig 16, 0273-0287; lists and modes constructed utilizing various parameters]. Regarding claim 14, Li discloses a decoding method comprising: obtaining encoded data for a current block to be decoded [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. obtaining a list of intra prediction modes wherein the list comprises a set of intra prediction modes ordered according to how frequently each intra prediction mode occurs and further adapted according to at least one characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. decoding an intra prediction mode from the encoded data responsive to the list of intra prediction modes [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. Li discloses the limitations of the claim. However, Li does not explicitly disclose characteristic of the current block selected from the group consisting of block size, block shape, and tree depth. Ko more explicitly discloses characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [0138-0162, 0177-0188; various coding teachings utilizing block parameters including size, shape and depth parameters]. It would have been obvious to one of ordinary skill in the art before the effective filing date to incorporate the teachings of Li with the teachings of Ko as stated above. By incorporating the teachings as such, further data compression efficiency while improving quality is achieved (see Ko 0003-0011). Regarding claim 15, Li discloses wherein the set of intra prediction modes is ordered in a decreasing order of frequency [0198-0214; lists are sorted and ordered in various configurations]. Regarding claim 16, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block [Fig. 9, 0072, 0096, 0141-0143; coding parameters including neighboring block information]. Regarding claim 19, Li discloses wherein the neighboring blocks comprise one block located at half position of a current block width and one block located at half position of a current block height [Figs. 7-10, 0152-0177; various block divisions and splits]. Regarding claim 20, Li discloses wherein the neighboring blocks comprise blocks located at least one quarter position of a current block width and height [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. Regarding claim 24, Li discloses wherein the list of intra prediction modes comprises, after the set of intra prediction modes of neighboring blocks, at least one intra prediction mode of another ordered list of default intra prediction modes whose order depends on a shape of the current block [Fig 16, 0273-0287; lists and modes constructed utilizing parameters including block shape]. Regarding claim 25, Li discloses wherein a size of the list depends on a size of the current block or on a tree-depth associated with the current block [Fig 16, 0273-0287; lists and modes constructed utilizing various parameters]. Regarding claim 27, Li discloses an encoding apparatus comprising one or more processors and at least one memory coupled to the one or more processors, wherein the one or more processors are configured to perform (Fig. 20; CRM): obtaining an intra prediction mode for a current block to be encoded [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. obtaining a list of intra prediction modes, wherein the list comprises a set of intra prediction modes ordered according to how frequently each intra prediction mode occurs and further adapted according to at least one characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. encoding the intra prediction mode for the current block responsive to the list of intra prediction modes [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. Li discloses the limitations of the claim. However, Li does not explicitly disclose characteristic of the current block selected from the group consisting of block size, block shape, and tree depth. Ko more explicitly discloses characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [0138-0162, 0177-0188; various coding teachings utilizing block parameters including size, shape and depth parameters]. It would have been obvious to one of ordinary skill in the art before the effective filing date to incorporate the teachings of Li with the teachings of Ko as stated above. By incorporating the teachings as such, further data compression efficiency while improving quality is achieved (see Ko 0003-0011). Regarding claim 28, Li discloses a decoding apparatus comprising one or more processors and at least one memory coupled to the one or more processors, wherein the one or obtaining encoded data for a current block to be decoded [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. obtaining a list of intra prediction modes, wherein the list comprises a set of intra prediction modes ordered according to how frequently each intra prediction mode occurs and further adapted according to at least one characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. decoding an intra prediction mode from the encoded data responsive to the list of intra prediction modes [ABS, 0006-0012, 0032, 0151-0177; video coding process including intra prediction mode, most probable and other parameters to construct lists and tables]. Li discloses the limitations of the claim. However, Li does not explicitly disclose characteristic of the current block selected from the group consisting of block size, block shape, and tree depth. Ko more explicitly discloses characteristic of the current block selected from the group consisting of block size, block shape, and tree depth [0138-0162, 0177-0188; various coding teachings utilizing block parameters including size, shape and depth parameters]. It would have been obvious to one of ordinary skill in the art before the effective filing date to incorporate the teachings of Li with the teachings of Ko as stated above. By incorporating the teachings as such, further data compression efficiency while improving quality is achieved (see Ko 0003-0011). Regarding claim 31, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block, and wherein the neighboring blocks comprise one block located at half position of a current block width and one block located at half position of a current block height [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. Regarding claim 32, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block, and wherein the neighboring blocks comprise blocks located at least one quarter position of a current block width and height. [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. Regarding claim 33, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block, and wherein the list of intra prediction modes comprises, after the set of intra prediction modes of neighboring blocks, at least one intra prediction mode of another ordered list of default intra prediction modes whose order depends on a shape of the current block [Fig 16, 0273-0287; lists and modes constructed utilizing parameters including block shape]. Regarding claim 34, Li discloses wherein a size of the list depends on a size of the current block or on a tree-depth associated with the current block [Fig 16, 0273-0287; lists and modes constructed utilizing parameters including block shape]. Regarding claim 35, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block, and wherein the neighboring blocks comprise one block located at half position of a current block width and one block located at half position of a current block height [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. Regarding claim 36, Li discloses wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block, and wherein the neighboring blocks comprise blocks located at least one quarter position of a current block width and height [Figs. 7-18, TBLS 1-2, 0051-0053, 0072-0081, 0152-0177; frequence tables, average usage and other parameters including block size used in coding process]. Regarding claim 37, Li discloses claim 28, wherein the set of intra prediction modes is a set of intra prediction modes of neighboring blocks of the current block, and wherein the list of intra prediction modes comprises, after the set of intra prediction modes of neighboring blocks, at least one intra prediction mode of another ordered list of default intra prediction modes whose order depends on a shape of the current block [Fig 16, 0273-0287; lists and modes constructed utilizing parameters including block shape]. Regarding claim 38, Li discloses wherein a size of the list depends on a size of the current block or on a tree-depth associated with the current block [Fig 16, 0273-0287; lists and modes constructed utilizing parameters including block shape]. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to TALHA M NAWAZ whose telephone number is (571)270-5439. The examiner can normally be reached Flex, M-R 6:30am-3:30pm; F 8:30am-12: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, Joe G Ustaris can be reached at 571-272-7383. 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. /TALHA M NAWAZ/Primary Examiner, Art Unit 2483
Read full office action

Prosecution Timeline

May 08, 2025
Application Filed
Jul 01, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12664628
DEVICE AND METHOD FOR SURROUND VIEW CAMERA SYSTEM WITH REDUCED MANHATTAN EFFECT DISTORTION
1y 12m to grant Granted Jun 23, 2026
Patent 12646254
METHOD AND DEVICE FOR QUICKLY MEASURING ROCK JOINT BASED ON HUGE POINT CLOUD DATA
1y 10m to grant Granted Jun 02, 2026
Patent 12641240
ENCODER, A DECODER AND CORRESPONDING METHODS OF CHROMA INTRA MODE DERIVATION
1y 10m to grant Granted May 26, 2026
Patent 12634435
METHOD, APPARATUS, AND MEDIUM FOR VIDEO PROCESSING
2y 4m to grant Granted May 19, 2026
Patent 12627805
CODING FRAMEWORK FOR IMAGE-RELATED PARAMETERS
2y 1m to grant Granted May 12, 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
89%
Grant Probability
88%
With Interview (-0.8%)
2y 2m (~12m remaining)
Median Time to Grant
Low
PTA Risk
Based on 617 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