Prosecution Insights
Last updated: April 19, 2026
Application No. 19/005,629

SCALING LIST PARAMETER-BASED VIDEO OR IMAGE CODING

Non-Final OA §DP
Filed
Dec 30, 2024
Examiner
BRANIFF, CHRISTOPHER
Art Unit
2484
Tech Center
2400 — Computer Networks
Assignee
Nokia Technologies Oy
OA Round
1 (Non-Final)
85%
Grant Probability
Favorable
1-2
OA Rounds
2y 2m
To Grant
96%
With Interview

Examiner Intelligence

Grants 85% — above average
85%
Career Allow Rate
544 granted / 637 resolved
+27.4% vs TC avg
Moderate +10% lift
Without
With
+10.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
28 currently pending
Career history
665
Total Applications
across all art units

Statute-Specific Performance

§101
4.1%
-35.9% vs TC avg
§103
55.3%
+15.3% vs TC avg
§102
16.3%
-23.7% vs TC avg
§112
7.7%
-32.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 637 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 . 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 1-3 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 2 and 3 of U.S. Patent No. 12,225,190 in view of Liu et al. (US 2016/0050436, referred to herein as “Liu”). Claim 1 of Instant Application An apparatus for decoding an image, the apparatus comprising: a memory; and at least one processor connected to the memory, the at least one processor configured to: obtain image information including prediction mode information, residual information and a sequence parameter set (SPS) from a bitstream; derive prediction samples for a current block based on the prediction mode information; derive quantized transform coefficients for the current block based on the residual information; derive transform coefficients based on the quantized transform coefficients; derive residual samples based on the transform coefficients; and generate reconstruction samples based on the prediction samples and the residual samples, wherein the transform coefficients are derived by performing a dequantization process on the quantized transform coefficients based on scaling list data, wherein the image information includes an adaptation parameter set (APS), wherein the APS is identified based on APS ID information related to an identifier for the APS, wherein the APS includes the scaling list data based on APS type information for APS parameters included in the APS, wherein a range of values of the APS ID information is determined based on the APS type information, and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. Claim 1 of US 12,225,190 An image decoding method performed by a decoding apparatus, the method comprising: obtaining image information including prediction mode information, residual information and a sequence parameter set (SPS) from a bitstream; deriving prediction samples for a current block based on the prediction mode information; deriving quantized transform coefficients for the current block based on the residual information; deriving transform coefficients based on the quantized transform coefficients; deriving residual samples based on the transform coefficients; and generating reconstruction samples based on the prediction samples and the residual samples, wherein the transform coefficients are derived by performing a dequantization process on the quantized transform coefficients based on scaling list data, wherein the image information includes an adaptation parameter set (APS), wherein the APS is identified based on APS ID information related to an identifier for the APS, wherein the APS includes the scaling list data based on APS type information for APS parameters included in the APS, wherein a range of values of the APS ID information is determined based on the APS type information, and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. Table 1. Regarding claim 1, claim 1 of U.S. Patent No. 12, 225,190 discloses many of the same limitations as shown in Table 1. Claim 1 of U.S. Patent No. 12,225,190 does not explicitly disclose: a memory; and at least one processor connected to the memory. However, Liu discloses: a memory; and at least one processor connected to the memory (Liu: paragraphs [0011] – [0013], disclosing scalable video coding; paragraphs [0039] and [0042], disclosing implementation via processor). At the time the application was effectively filed, it would have been obvious for a person having ordinary skill in the art to use the processor implementation of Liu with the method of claim 1 of U.S. Patent No. 12,225,190. One would have been motivated to modify claim 1 of U.S. Patent No. 12,225,190 in this manner in order to automate video coding on computing devices such as an encoder (Liu: Fig. 1, paragraph [0006]). Regarding claim 2, the claim recites the same or similar limitations as claim 1, above, and is rejected in view of claim 2 of U.S. Patent No. 12,225,190 in view of Liu for the reasons discussed above. Regarding claim 3, the claim recites the same or similar limitations as claim 1, above, and is rejected in view of claim 3 of U.S. Patent No. 12,225,190 in view of Liu for the reasons discussed above. Claims 1, 2 and 3 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 8 and 16 of U.S. Patent No. 11,889,062 in view of Liu. Claim 1 of Instant Application An apparatus for decoding an image, the apparatus comprising: a memory; and at least one processor connected to the memory, the at least one processor configured to: obtain image information including prediction mode information, residual information and a sequence parameter set (SPS) from a bitstream; derive prediction samples for a current block based on the prediction mode information; derive quantized transform coefficients for the current block based on the residual information; derive transform coefficients based on the quantized transform coefficients; derive residual samples based on the transform coefficients; and generate reconstruction samples based on the prediction samples and the residual samples, wherein the transform coefficients are derived by performing a dequantization process on the quantized transform coefficients based on scaling list data, wherein the image information includes an adaptation parameter set (APS), wherein the APS is identified based on APS ID information related to an identifier for the APS, wherein the APS includes the scaling list data based on APS type information for APS parameters included in the APS, wherein a range of values of the APS ID information is determined based on the APS type information, and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. Claim 1 of US 11,889,062 A decoding apparatus for image decoding, the decoding apparatus comprising: a memory; and at least one processor connected to the memory, the at least one processor configured to: obtain image information including prediction mode information and residual information from a bitstream; derive prediction samples for a current block based on the prediction mode information; derive quantized transform coefficients for the current block based on the residual information; derive transform coefficients based on the quantized transform coefficients; derive residual samples based on the transform coefficients; and generate reconstruction samples based on the prediction samples and the residual samples, wherein the transform coefficients are derived by performing a dequantization process on the quantized transform coefficients based on scaling list data, and wherein the image information includes an adaptation parameter set (APS), and wherein the APS is identified based on APS ID information related to an identifier for the APS, and wherein the APS includes the scaling list data based on APS type information for APS parameters included in the APS, and wherein a range of values of the APS ID information is determined based on the APS type information. Table 2. Regarding claim 1, claim 1 of U.S. Patent No. 11,889,062 discloses many of the same limitations as shown in Table 2. Claim 1 of U.S. Patent No. 11,889,062 does not explicitly disclose: a sequence parameter set (SPS); and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. However, Liu discloses: a sequence parameter set (SPS); and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS (Liu: paragraph [0021], disclosing use of a sequence parameter set signaled in a bitstream that indicates scaling list information including a scaling_list_enabled_flag that indicates whether scaling list data is enabled). At the time the application was effectively filed, it would have been obvious for a person having ordinary skill in the art to use the scaling list enabling of Liu in the method of claim 1 of U.S. Patent No. 11,889,062. One would have been motivated to modify claim 1 of U.S. Patent No. 11,889,062 in this manner in order to better signal the use of scaling list data for scalable video coding and multi-view coding as well as to reduce the required scaling list data for such systems (Liu: paragraphs [0003] – [0010]). Regarding claim 2, the claim recites the same or similar limitations as claim 1, above, and is rejected in view of claim 8 of U.S. Patent No. 11,889,062 in view of Liu for the reasons discussed above. Regarding claim 3, the claim recites the same or similar limitations as claim 1, above, and is rejected in view of claim 16 of U.S. Patent No. 11,889,062 in view of Liu for the reasons discussed above. Claims 1, 2 and 3 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1, 8 and 16 of U.S. Patent No. 11,528,477 in view of Liu. Claim 1 of Instant Application An apparatus for decoding an image, the apparatus comprising: a memory; and at least one processor connected to the memory, the at least one processor configured to: obtain image information including prediction mode information, residual information and a sequence parameter set (SPS) from a bitstream; derive prediction samples for a current block based on the prediction mode information; derive quantized transform coefficients for the current block based on the residual information; derive transform coefficients based on the quantized transform coefficients; derive residual samples based on the transform coefficients; and generate reconstruction samples based on the prediction samples and the residual samples, wherein the transform coefficients are derived by performing a dequantization process on the quantized transform coefficients based on scaling list data, wherein the image information includes an adaptation parameter set (APS), wherein the APS is identified based on APS ID information related to an identifier for the APS, wherein the APS includes the scaling list data based on APS type information for APS parameters included in the APS, wherein a range of values of the APS ID information is determined based on the APS type information, and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. Claim 1 of US 11,528,477 An image decoding method performed by a decoding apparatus, the method comprising: obtaining image information including prediction mode information and residual information from a bitstream; deriving prediction samples for a current block based on the prediction mode information; deriving quantized transform coefficients for the current block based on the residual information; deriving transform coefficients based on the quantized transform coefficients; deriving residual samples based on the transform coefficients; and generating reconstruction samples based on the prediction samples and the residual samples, wherein the transform coefficients are derived by performing a dequantization process on the quantized transform coefficients based on scaling list data, and wherein the image information includes an adaptation parameter set (APS), and wherein the APS is identified based on APS ID information related to an identifier for the APS, and wherein the APS includes the scaling list data based on APS type information for APS parameters included in the APS, and wherein a range of values of the APS ID information is determined based on the APS type information. Table 3. Regarding claim 1, claim 1 of U.S. Patent No. 11,528,477 discloses many of the same limitations as shown in Table 3. Claim 1 of U.S. Patent No. 11,528,477 does not explicitly disclose: a memory; and at least one processor connected to the memory; a sequence parameter set (SPS); and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. However, Liu discloses: a memory; and at least one processor connected to the memory (Liu: paragraphs [0011] – [0013], disclosing scalable video coding; paragraphs [0039] and [0042], disclosing implementation via processor); a sequence parameter set (SPS); and wherein scaling list enabled flag information for indicating whether a scaling list is used for a scaling process is included in the SPS. (Liu: paragraph [0021], disclosing use of a sequence parameter set signaled in a bitstream that indicates scaling list information including a scaling_list_enabled_flag that indicates whether scaling list data is enabled). At the time the application was effectively filed, it would have been obvious for a person having ordinary skill in the art to use the scaling list enabling of Liu in the method of claim 1 of U.S. Patent No. 11,528,477. One would have been motivated to modify claim 1 of U.S. Patent No. 11,528,477 in this manner in order to better signal the use of scaling list data for scalable video coding and multi-view coding as well as to reduce the required scaling list data for such systems (Liu: paragraphs [0003] – [0010]). Regarding claim 2, the claim recites the same or similar limitations as claim 1, above, and is rejected in view of claim 8 of U.S. Patent No. 11,528,477 in view of Liu for the reasons discussed above. Regarding claim 3, the claim recites the same or similar limitations as claim 1, above, and is rejected in view of claim 16 of U.S. Patent No. 11,528,477 in view of Liu for the reasons discussed above. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Christopher Braniff whose telephone number is (571)270-5009. The examiner can normally be reached M-F 7AM to 4PM. 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, Thai Tran can be reached at (571) 272-7382. 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. CHRISTOPHER T. BRANIFF Primary Examiner Art Unit 2484 /CHRISTOPHER BRANIFF/Primary Examiner, Art Unit 2484
Read full office action

Prosecution Timeline

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

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12598279
METHOD AND APPARATUS FOR PROCESSING FRAME SEQUENCE AND SYSTEM FOR TREATING VISUAL DYSFUNCTION
2y 5m to grant Granted Apr 07, 2026
Patent 12593067
PREDICTIVE CODING OF TEXTURE COORDINATES FOR POLYGON MESH COMPRESSION
2y 5m to grant Granted Mar 31, 2026
Patent 12587627
METHODS AND SYSTEM OF MULTIVIEW VIDEO RENDERING, PREPARING A MULTIVIEW CACHE, AND REAL-TIME MULTIVIEW VIDEO CONVERSION
2y 5m to grant Granted Mar 24, 2026
Patent 12586257
METHOD FOR ENCODING AND DECODING A 3D POINT CLOUD, ENCODER, DECODER
2y 5m to grant Granted Mar 24, 2026
Patent 12581115
GROUPING OF DUPLICATE VERTICES IN POSITION COMPRESSION
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
85%
Grant Probability
96%
With Interview (+10.2%)
2y 2m
Median Time to Grant
Low
PTA Risk
Based on 637 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