Prosecution Insights
Last updated: May 29, 2026
Application No. 18/624,728

EFFICIENT ACTIVATION FUNCTION IN NEURAL NETWORK IMAGE COMPRESSION DECODER

Non-Final OA §103
Filed
Apr 02, 2024
Priority
Apr 03, 2023 — provisional 63/456,782
Examiner
ANYIKIRE, CHIKAODILI E
Art Unit
2487
Tech Center
2400 — Computer Networks
Assignee
Tencent America LLC
OA Round
2 (Non-Final)
75%
Grant Probability
Favorable
2-3
OA Rounds
1y 0m
Est. Remaining
86%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allowance Rate
786 granted / 1049 resolved
+16.9% vs TC avg
Moderate +12% lift
Without
With
+11.5%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
42 currently pending
Career history
1096
Total Applications
across all art units

Statute-Specific Performance

§101
0.6%
-39.4% vs TC avg
§103
63.7%
+23.7% vs TC avg
§102
30.5%
-9.5% vs TC avg
§112
0.2%
-39.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1049 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 . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on April 2, 2026 has been entered. 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. Claim(s) 1 - 6, 9, 11 - 15, 19, and 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Chen et al (US 2023/0069953, hereafter Chen) in view of Guo et al (US 2024/0323441, hereafter Guo). As per claim 1, Chen discloses a method for video decoding performed by at least one processor, the method comprising: receiving a video bitstream comprising a current block in a current picture (¶ 53 and 54); and reconstructing the current block by transforming the current block by a neural network comprising a plurality of upsample modules and activation modules (¶ 57 - 62), wherein at least one of the activation modules comprises a LeakyReLu function and a convolution function (¶ 12, 112, and 116), at least one of the activation modules comprises a LeakyReLu function and a convolution function, and reconstructing the current block comprises at least one of multiplying and adding an input to the at least one of the activation modules to an output of the at least one of the LeakyReLu function and the convolution function (Figure 6; ¶ 92). However, Chen does not explicitly teach multiplying an input to the at least one of the activation modules to an output of the at least one of the LeakyReLu function and the convolution function, and adding the input to the at least one of the activation modules to result of multiplying the input to the at least one of the activation modules to the output of the at least one of the LeakyReLu function and the convolution function. In the same field of endeavor, Guo discloses multiplying an input to the at least one of the activation modules to an output of the at least one of the LeakyReLu function and the convolution function, and adding the input to the at least one of the activation modules to result of multiplying the input to the at least one of the activation modules to the output of the at least one of the LeakyReLu function and the convolution function (Figure 16b; ¶ 244 - 249). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention as effectively filed to modify the invention Chen in view of Guo. The advantage improved coding performance. As per claim 2, Chen discloses the method according to claim 1, wherein, of the at least one of the activation modules, an output of the LeakyReLu function is an input to the convolution function (Figure 6; shows example of LeakyReLU output connected to convolution function). As per claim 3, Chen discloses the method according to claim 2. However, Chen does not explicitly teach wherein, of the at least one of the activation modules, an output of the convolution function is an input to a multiplication function of the at least one of the activation modules. In the same field of endeavor, Guo teaches wherein, of the at least one of the activation modules, an output of the convolution function is an input to a multiplication function of the at least one of the activation modules (Figure 16b; ¶ 244 - 249). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Chen in view of Guo. The advantage is improved video enhancement. As per claim 4, Chen discloses the method according to claim 3. However, Chen does not explicitly teach wherein, of the at least one of the activation modules, an output of multiplication function is an input to an addition function of the at least one of the activation modules. In the same field of endeavor, Guo teaches wherein, of the at least one of the activation modules, an output of multiplication function is an input to an addition function of the at least one of the activation modules (Figure 16b; ¶ 244 and 249). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Chen in view of Guo. The advantage is improved video enhancement. As per claim 5, Chen discloses the method according to claim 3. However, Chen does not explicitly teach the at least one of the activation modules consists of the LeakyReLu function, the convolution function, the multiplication function and the addition function. In the same field of endeavor, Guo teaches the at least one of the activation modules consists of the LeakyReLu function, the convolution function, the multiplication function and the addition function. (Figure 16b; ¶ 244 - 249). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Chen in view of Guo. The advantage is improved video enhancement. As per claim 6, Chen discloses the method according to claim 2, wherein, of the at least one of the activation modules, an output of the convolution function is an input to a second LeakyReLu function of the at least one of the activation modules (Figure 6; Chen’s disclosure shows a figure indicating that the output of the convolution function is an input to a second LeakyReLU function). As per claim 9, Chen discloses the method according to claim 2, wherein the convolution function comprises 1x1 kernel (¶ 74; At the final layer a 1×1 convolution 395 is used). Regarding claim 11, arguments analogous to those presented for claim 1 are applicable for claim 11. Regarding claim 12, arguments analogous to those presented for claim 2 are applicable for claim 12. Regarding claim 13, arguments analogous to those presented for claim 3 are applicable for claim 13. Regarding claim 14, arguments analogous to those presented for claim 4 are applicable for claim 14. Regarding claim 15, arguments analogous to those presented for claim 5 are applicable for claim 15. Regarding claim 19, arguments analogous to those presented for claim 9 are applicable for claim 19. Regarding claim 20, arguments analogous to those presented for claim 1 are applicable for claim 20. Claim(s) 7, 8, 10, and 16 - 18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Chen in view of Guo (hereafter Chen) in further view of Kwon et al (US 2022/0237744, hereafter Kwon). As per claim 7, Chen discloses the method according to claim 6. However, Chen does not explicitly teach wherein, of the at least one of the activation modules, an output of the a second LeakyReLu function is an input to a multiplication function of the at least one of the activation modules. In the same field of endeavor, Kwon teaches wherein, of the at least one of the activation modules, an output of the a second LeakyReLu function is an input to a multiplication function of the at least one of the activation modules(Figure 6; ¶ 93 and 94). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Chen in view of Kwon. The advantage is improved video enhancement. As per claim 8, Chen discloses the method according to claim 7. However, Chen does not explicitly teach wherein, of the at least one of the activation modules, an output of the multiplication function is an input to an addition function of the at least one of the activation modules. In the same field of endeavor, Kwon teaches wherein, of the at least one of the activation modules, an output of the multiplication function is an input to an addition function of the at least one of the activation modules (Figure 6; ¶ 93 and 94). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Chen in view of Kwon. The advantage is improved video enhancement. As per claim 10, Chen discloses the method according to claim 1. However, Chen does not explicitly teach wherein at least one of the upsample modules comprises a pixel shuffle layer. In the same field of endeavor, Kwon teaches wherein at least one of the upsample modules comprises a pixel shuffle layer (¶ 94). Therefore, it would have been obvious for one of ordinary skill in the art at the time the invention was effectively filed to modify the invention of Chen in view of Kwon. The advantage is improved video enhancement. Regarding claim 16, arguments analogous to those presented for claim 6 are applicable for claim 16. Regarding claim 17, arguments analogous to those presented for claim 7 are applicable for claim 17. Regarding claim 18, arguments analogous to those presented for claim 8 are applicable for claim 18. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to CHIKAODILI E ANYIKIRE whose telephone number is (571)270-1445. The examiner can normally be reached 8 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, David Czekaj can be reached at 571-272-7327. 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. /CHIKAODILI E ANYIKIRE/Primary Examiner, Art Unit 2487
Read full office action

Prosecution Timeline

Apr 02, 2024
Application Filed
May 14, 2025
Non-Final Rejection mailed — §103
Aug 14, 2025
Response Filed
Jan 07, 2026
Final Rejection mailed — §103
Mar 06, 2026
Response after Non-Final Action
Apr 02, 2026
Request for Continued Examination
Apr 08, 2026
Response after Non-Final Action

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12636116
ROBOTIC SURGICAL NAVIGATION USING A PROPRIOCEPTIVE DIGITAL SURGICAL STEREOSCOPIC CAMERA SYSTEM
4y 0m to grant Granted May 26, 2026
Patent 12641224
Intra-Prediction on Non-dyadic Blocks
2y 8m to grant Granted May 26, 2026
Patent 12632029
A METHOD OF MONITORING INDUSTRIAL PROCESSING PROCESSES, CORRESPONDING APPARATUS AND COMPUTER PROGRAM PRODUCT
3y 1m to grant Granted May 19, 2026
Patent 12634436
VIDEO ENCODING/DECODING METHOD AND APPARATUS ADJUSTING NUMBER OF MULTIPLE TRANSFORM SELECTION CANDIDATES IN MULTIPLE TRANSFORM SELECTION
1y 11m to grant Granted May 19, 2026
Patent 12621440
ENCODING APPARATUS, IMAGE CAPTURING APPARATUS, CONTROL METHOD, AND STORAGE MEDIUM
2y 2m to grant Granted May 05, 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

2-3
Expected OA Rounds
75%
Grant Probability
86%
With Interview (+11.5%)
3y 2m (~1y 0m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 1049 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