Prosecution Insights
Last updated: April 19, 2026
Application No. 18/982,893

IMAGE DATA ENCODING AND DECODING

Non-Final OA §101§DP
Filed
Dec 16, 2024
Examiner
MESSMORE, JONATHAN R
Art Unit
2482
Tech Center
2400 — Computer Networks
Assignee
Sony Group Corporation
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
2y 11m
To Grant
86%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allow Rate
375 granted / 491 resolved
+18.4% vs TC avg
Moderate +9% lift
Without
With
+9.3%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
40 currently pending
Career history
531
Total Applications
across all art units

Statute-Specific Performance

§101
4.0%
-36.0% vs TC avg
§103
46.5%
+6.5% vs TC avg
§102
27.0%
-13.0% vs TC avg
§112
13.4%
-26.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 491 resolved cases

Office Action

§101 §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) (IDS) was/were submitted on 16 December 2024. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement(s) is/are being considered by the examiner. Double Patenting A rejection based on double patenting of the “same invention” type finds its support in the language of 35 U.S.C. 101 which states that “whoever invents or discovers any new and useful process... may obtain a patent therefor...” (Emphasis added). Thus, the term “same invention,” in this context, means an invention drawn to identical subject matter. See Miller v. Eagle Mfg. Co., 151 U.S. 186 (1894); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Ockert, 245 F.2d 467, 114 USPQ 330 (CCPA 1957). A statutory type (35 U.S.C. 101) double patenting rejection can be overcome by canceling or amending the claims that are directed to the same invention so they are no longer coextensive in scope. The filing of a terminal disclaimer cannot overcome a double patenting rejection based upon 35 U.S.C. 101. Claim 1 is/are rejected under 35 U.S.C. 101 as claiming the same invention as that of claim 1 of prior U.S. Patent No. 12200217. This is a statutory double patenting rejection. Instant Application 18/982893 Claim 1 Reference Application 17/622652 Claim 1 An image data encoding apparatus, comprising: an entropy encoder configured to selectively encode data items representing image data to be encoded by a first, context adaptive binary arithmetic coding (CABAC), encoding system or by a second, bypass, encoding system, so as to generate encoded binarized symbols, the image data representing one or more pictures of a picture sequence, each picture comprising two or more output data units representing respective sub-sections of the picture, each sub-section being decodable and reconstructable independently of other sub-sections in the picture and the picture sequence; the entropy encoder being further configured to generate an output data stream subject to a constraint defining an upper limit to a number of binarized symbols that may be expressed by any individual output data unit relative to a size in bytes of the output data unit, wherein the entropy encoder is configured to apply the constraint to each output data unit, and provide padding data, for each output data unit that does not meet the constraint, so as to increase the size in bytes of that output data unit in order to meet the constraint; and wherein the constraint is defined by N <= K1 * B + (K2 * CU), wherein: N is the number of binarized symbols in the output data unit; K1 is a constant; B is a number of encoded bytes for the output data unit; K2 is a variable dependent upon properties of minimum size coding units employed by the image data encoding apparatus; and CU is a size of the sub-section represented by the output data unit expressed as a number of coding units of minimum size. An image data encoding apparatus, comprising: an entropy encoder configured to selectively encode data items representing image data to be encoded by a first, context adaptive binary arithmetic coding (CABAC), encoding system or by a second, bypass, encoding system, so as to generate encoded binarized symbols, the image data representing one or more pictures of a picture sequence, each picture comprising two or more output data units representing respective sub-sections of the picture, each sub-section being decodable and reconstructable independently of other sub-sections in the picture and the picture sequence; the entropy encoder being further configured to generate an output data stream subject to a constraint defining an upper limit to a number of binarized symbols that may be expressed by any individual output data unit relative to a size in bytes of the output data unit, wherein the entropy encoder is configured to apply the constraint to each output data unit, and provide padding data, for each output data unit that does not meet the constraint, so as to increase the size in bytes of that output data unit in order to meet the constraint; and wherein the constraint is defined by N <= K1 * B + (K2 * CU), wherein: N is the number of binarized symbols in the output data unit; K1 is a constant; B is a number of encoded bytes for the output data unit; K2 is a variable dependent upon properties of minimum size coding units employed by the image data encoding apparatus; and CU is a size of the sub-section represented by the output data unit expressed as a number of coding units of minimum size. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JONATHAN R MESSMORE whose telephone number is (571)272-2773. The examiner can normally be reached Monday-Friday 9-5 EST/EDT. 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, Chris Kelley can be reached at 571-272-7331. 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. /JONATHAN R MESSMORE/Primary Examiner, Art Unit 2482
Read full office action

Prosecution Timeline

Dec 16, 2024
Application Filed
Dec 27, 2025
Non-Final Rejection — §101, §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12598306
PARSING FRIENDLY AND ERROR RESILIENT MERGE FLAG CODING
2y 5m to grant Granted Apr 07, 2026
Patent 12587680
Attribute Layers And Signaling In Point Cloud Coding
2y 5m to grant Granted Mar 24, 2026
Patent 12581073
VIDEO ENCODING AND DECODING
2y 5m to grant Granted Mar 17, 2026
Patent 12556683
INTRA BLOCK COPY WITH TEMPLATE MATCHING FOR VIDEO ENCODING AND DECODING
2y 5m to grant Granted Feb 17, 2026
Patent 12556663
GAMING TABLE EVENTS DETECTING AND PROCESSING
2y 5m to grant Granted Feb 17, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
76%
Grant Probability
86%
With Interview (+9.3%)
2y 11m
Median Time to Grant
Low
PTA Risk
Based on 491 resolved cases by this examiner. Grant probability derived from career allow 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