Prosecution Insights
Last updated: April 19, 2026
Application No. 19/025,525

SYSTEM AND METHOD FOR VIDEO CODING

Non-Final OA §DP
Filed
Jan 16, 2025
Examiner
TORRENTE, RICHARD T
Art Unit
2485
Tech Center
2400 — Computer Networks
Assignee
Panasonic Intellectual Property Corporation of America
OA Round
1 (Non-Final)
69%
Grant Probability
Favorable
1-2
OA Rounds
3y 3m
To Grant
83%
With Interview

Examiner Intelligence

Grants 69% — above average
69%
Career Allow Rate
717 granted / 1039 resolved
+11.0% vs TC avg
Moderate +14% lift
Without
With
+14.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
40 currently pending
Career history
1079
Total Applications
across all art units

Statute-Specific Performance

§101
6.5%
-33.5% vs TC avg
§103
51.9%
+11.9% vs TC avg
§102
25.9%
-14.1% vs TC avg
§112
8.3%
-31.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1039 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 (IDS) submitted on 1/16/25 is/are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Specification The lengthy specification has not been checked to the extent necessary to determine the presence of all possible minor errors. Applicant's cooperation is requested in correcting any errors of which applicant may become aware in the specification. Drawings The drawings were received on 1/16/25. These drawings are acceptable. 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 obviousness-type 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); and 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 a nonstatutory double patenting ground provided the conflicting application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b). Claim 1 is rejected on the ground of nonstatutory double patenting over claim 3 of U. S. Patent No. 12/262,004 since the claims, if allowed, would improperly extend the "right to exclude" already granted in the patent. Although the conflicting claims are not identical, they are not patentably distinct from each other because claim 1 of the present application encompass claim 3 of U.S. Patent No. 12/262,004. The subject matter claimed in the instant application is fully disclosed in the patent and is covered by the patent since the patent and the application are claiming common subject matter, as follows in the Table below. Instant Application 12/262,004 1. A non-transitory computer-readable recording medium storing a bitstream, the bitstream including an encoded signal and syntax information according to which a decoder: parses a first parameter from a sequence parameter set; parses a second parameter from a picture header in response to a value of the first parameter being 1; parses a third parameter from a slice header in response to the value of the first parameter being 1; parses a fourth parameter from a coding tree unit in response to a value of the third parameter being 1, the fourth parameter indicating a filter to be used in a CCALF (cross component adaptive loop filtering) process; generates a first coefficient value by applying the CCALF process to a first reconstructed image sample of a luma component; determines whether the first coefficient value is less than 64; sets the first coefficient value to zero in response to determining the first coefficient value is less than 64;generates a second coefficient value by applying an ALF (adaptive loop filtering) process to a second reconstructed image sample of a chroma component; generates a third coefficient value by adding the first coefficient value to the second coefficient value; and decodes a third reconstructed image sample of the chroma component using the third coefficient value. 3. A decoder, comprising: circuitry; and memory coupled to the circuitry; wherein the circuitry, in operation: parses a first parameter from a sequence parameter set; parses a second parameter from a picture header in response to a value of the first parameter being 1; parses a third parameter from a slice header in response to the value of the first parameter being 1; parses a fourth parameter from a coding tree unit in response to a value of the third parameter being 1, the fourth parameter indicating a filter to be used in a CCALF (cross component adaptive loop filtering) process; generates a first coefficient value by applying the CCALF process to a first reconstructed image sample of a luma component; determines whether the first coefficient value is less than 64; sets the first coefficient value to zero in response to determining the first coefficient value is less than 64; generates a second coefficient value by applying an ALF (adaptive loop filtering) process to a second reconstructed image sample of a chroma component; generates a third coefficient value by adding the first coefficient value to the second coefficient value; and decodes a third reconstructed image sample of the chroma component using the third coefficient value. It would have been obvious to one skilled in the art at the time of the invention was made to modify the cited steps as indicated in claim 1 of the instant US application since the omission/addition/alteration of the cited limitations would not have changed the process according to which the process of parsing syntax for proper decoding. Therefore, the ordinary skilled artisan would have been also motivated to modify claim 1 of the cited instant US application by altering the step of incorporating a non-transitory computer-readable recording medium storing a bitstream limitation to patent 12/262,004. The cited altering elements would not interfere with the functionality of the steps previously claimed and would perform the same function. In re Karlson, 136, USPQ 184 (CCPA 1963). Allowable Subject Matter Claim(s) 1 is/are allowed. The following is an Examiner’s statement of reasons for allowance: Claim(s) 1 discloses a non-transitory computer-readable recording medium storing a bitstream, the bitstream including an encoded signal and syntax information according to which a decoder: parses a first parameter from a sequence parameter set; parses a second parameter from a picture header in response to a value of the first parameter being 1; parses a third parameter from a slice header in response to the value of the first parameter being 1; parses a fourth parameter from a coding tree unit in response to a value of the third parameter being 1, the fourth parameter indicating a filter to be used in a CCALF (cross component adaptive loop filtering) process; generates a first coefficient value by applying the CCALF process to a first reconstructed image sample of a luma component; determines whether the first coefficient value is less than 64; sets the first coefficient value to zero in response to determining the first coefficient value is less than 64; generates a second coefficient value by applying an ALF (adaptive loop filtering) process to a second reconstructed image sample of a chroma component; generates a third coefficient value by adding the first coefficient value to the second coefficient value; and decodes a third reconstructed image sample of the chroma component using the third coefficient value. The closest prior arts Misra et al. (US 2022/0248007) discloses first to fourth syntax parameter (see Table 3; e.g. see ¶ 0186], [0191]) for CCALF and ALF filtering (see 410 and 412 in fig. 11A) but fail to anticipate or render the above underlined limitation obvious. Any comments considered necessary by applicant must be submitted no later than the payment of the issue fee and, to avoid processing delays, should preferably accompany the issue fee. Such submissions should be clearly labeled “Comments on Statement of Reasons for Allowance.” Citation of Pertinent Art The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. 1. He et al. (US 2018/0220138), discloses chroma coding using cross component adaptive coding. 2. Li et al. (US 2016/0234492), discloses adaptive loop filtering with writing parameter set of a picture header. 3. Liu et al. (2012/0183081), discloses loop filtering converting and setting coefficient value for filtering. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to RICHARD T TORRENTE whose telephone number is (571)270-3702. The examiner can normally be reached M-F: 6:45-3:15 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, Jay Patel can be reached at (571) 272-2988. 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. /RICHARD T TORRENTE/Primary Examiner, Art Unit 2485
Read full office action

Prosecution Timeline

Jan 16, 2025
Application Filed
Jan 22, 2026
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12604032
SYSTEMS AND METHODS FOR PERFORMING PADDING IN CODING OF A MULTI-DIMENSIONAL DATA SET
2y 5m to grant Granted Apr 14, 2026
Patent 12604041
METHODS AND DEVICES FOR GEOMETRIC PARTITIONING MODE SPLIT MODES REORDERING WITH PRE-DEFINED MODES ORDER
2y 5m to grant Granted Apr 14, 2026
Patent 12604014
METHOD AND SYSTEM OF VIDEO PROCESSING WITH LOW LATENCY BITSTREAM DISTRIBUTION
2y 5m to grant Granted Apr 14, 2026
Patent 12593062
IMAGE ENCODING AND DECODING METHOD WITH MERGE FLAG AND MOTION VECTORS
2y 5m to grant Granted Mar 31, 2026
Patent 12581067
INTRA PREDICTION METHOD AND DEVICE USING MPM LIST
2y 5m to grant Granted Mar 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
69%
Grant Probability
83%
With Interview (+14.0%)
3y 3m
Median Time to Grant
Low
PTA Risk
Based on 1039 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