Prosecution Insights
Last updated: April 19, 2026
Application No. 18/356,612

METHOD AND APPARATUS WITH SEMICONDUCTOR PATTERN CORRECTION

Non-Final OA §103
Filed
Jul 21, 2023
Examiner
LAKHIA, VIRAL S
Art Unit
2431
Tech Center
2400 — Computer Networks
Assignee
Samsung Electronics Co., Ltd.
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
2y 11m
To Grant
99%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allow Rate
518 granted / 591 resolved
+29.6% vs TC avg
Strong +20% interview lift
Without
With
+19.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
14 currently pending
Career history
605
Total Applications
across all art units

Statute-Specific Performance

§101
12.6%
-27.4% vs TC avg
§103
56.0%
+16.0% vs TC avg
§102
11.9%
-28.1% vs TC avg
§112
8.2%
-31.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 591 resolved cases

Office Action

§103
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 . DETAILED ACTION This action is in response to the communication filed on 12/13/2022. Claims 1 - 20 are examined. Claims 1, 3, 5, 6, 9, 10, 12, 14, 15, 18-20 are rejected. Claims 2, 4, 7, 8, 11, 13, 16, 17 are objected. Allowable Subject Matter Claims 2, 4, 7, 8, 11, 13, 16, 17 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Examiner notes that Reason for allowance will be described upon selection of claims. Information Disclosure Statement The information disclosure statement (IDS) submitted on 7/21/2023 and 3/27/2024. Accordingly, the information disclosure statement is being considered by the examiner. Claim Rejections - 35 USC § 103 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. Claims 1, 3, 5, 6, 9, 10, 12, 14, 15, 18-20 are rejected under 35 U.S.C. 103 as being unpatentable by U.S. Publication 2024/0046629 to Lee et al. (hereinafter known as “Lee”) and U.S. Publication 2024/0070466 to Murray et al. (hereinafter known as "Murray”). As per claim 1 Lee teaches, a processor-implemented method, the method comprising: generating a first corrected result image of a first desired pattern image using a backward correction neural network based on the first desired pattern image, the backward correction neural network performing a backward correction of a first process (Lee para 57-58 and 69-70 Fig 3 and 5 teach CNN (convolutional neural network) with backward propagation processes on the generated convolution layer and activation function application unit, and an image matching output unit 360 that matches and outputs features extracted by repetitive machine learning of the CNN repetitive machine learning unit); generating a first simulated result image by executing a forward simulation neural network based on the first corrected result image, the forward simulation neural network performing a forward simulation of a performance of the first process (Lee para 70-72, Fig 3, teaches the CNN repetitive machine learning unit 350 is configured to minimize the loss value of the cost function calculated using the mean square error method through repetitive forward propagation and backward propagation calculation processes); and updating the first corrected result image so that an error between the first desired pattern image and the first simulated result image is reduced (Lee para 43-44 Fig 3 teaches back propagation corrects weight and bias by partially differentiating the convolution calculation factor in the reverse direction of the forward propagation calculation in order to minimize the loss). Lee does not teach however Murray teaches Fig 3 para 48, 53-55 image pattern recognition, pixel enhancements and update of images based on machine learning CNN (neural network). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of Lee-Murray before him or her, to combine Lee’s image analysis based on backward and forward correction neural network (Lee Fig 3) with Murray’s teaching of image pattern recognition, pixel enhancements and update of images based on machine learning CNN (Murray para 48, 53-55). The suggestion/motivation for doing so would have been to enhance image outputs by comparing the generated output with an expected output for the training input, and modifying weights and biases associated with the neurons with the aim of matching (or at least reducing the error between) the generated output and the expected output security of device access based on key-value storage that stores data on a key-value basis (Murray para 3). As per claim 3 combination of Lee-Murray teaches, the method of claim 1, wherein the updating of the first corrected result image comprises: in a state in which parameters of the forward simulation neural network are fixed, adjusting parameters of the backward correction neural network so that the error between the first desired pattern image and the first simulated result image is reduced. (Lee para 41 teaches convolution calculation of the input data and the filter in the convolution layer generation unit 330, zero padding is performed to solve the problem that the edge information of the input data disappears, and the result of the convolution calculation adjusts the size of the output data to the same size as the input value by setting the stride to 1 (stride:=1) when the filter moves within the input data Fig 6A 6B). As per claim 5 combination of Lee-Murray teaches, the method of claim 1, wherein the updating of the first corrected result image comprises updating the first corrected result image based on gradient descent (Lee para 69, FIG. 6B illustrates a backward propagation calculation formula for CNN repetitive machine learning and also illustrates a process of calculating a gradient by taking a partial differentiation to the forward propagation calculation formula in order to correct the weight which is a convolution calculation factor). As per claim 6 combination of Lee-Murray teaches, the method of claim 1, further comprising: finalizing the first corrected result image based on a first result of iteratively updating the first corrected result image; generating a second corrected result image of a second desired pattern image using the backward correction neural network provided a first input based on the second desired pattern image; generating a second simulated result image using the forward simulation neural network provided a second input based on the second corrected result image; and updating the second corrected result image so that an error between the second desired pattern image and the second simulated result image is reduced (Lee para 58-59 and 69-70 teaches the forward propagation constructs a convolutional neural network in a direction in which the size of the input image generated by the numerical simulation is maintained, and performs a convolution calculation. The forward propagation is a process for calculating the loss value after the result values generated through several convolution calculations are compared with the reference value (ground-truth) using the mean square error method. [0059] And, the back propagation corrects weight and bias, which are the convolution factors, by performing the calculation in the reverse direction in order to reduce the calculated error values. The ideal weight and bias can be inferred by repeatedly performing forward propagation and back propagation processes several times, which covers the claimed limitation). As per claim 9 combination of Lee-Murray teaches, the method of claim 1, wherein the first process comprises one of a develop process and an etch process (Lee para 5-6 teaches industrial process of develop and etch process (lithography)). Claim 10, Claim 10 is rejected in accordance with claim 1. Claim 12, Claim 12 is rejected in accordance with claim 3. Claim 14, Claim 14 is rejected in accordance with claim 5. Claim 15, Claim 15 is rejected in accordance with claim 6. Claim 18, Claim 18 is rejected in accordance with claim 9. As per claim 19 Lee teaches, a processor-implemented method, the method comprising: training a backward correction neural network based on input pattern images corresponding to a simulation input of a target process (Lee para 57-58 and 69-70 Fig 3 and 5 teach CNN (convolutional neural network) with backward propagation processes on the generated convolution layer and activation function application unit, and an image matching output unit 360 that matches and outputs features extracted by repetitive machine learning of the CNN repetitive machine learning unit); training a forward simulation neural network based on output pattern images corresponding to a simulation output of the target process (Lee para 70-72, Fig 3, teaches the CNN repetitive machine learning unit 350 is configured to minimize the loss value of the cost function calculated using the mean square error method through repetitive forward propagation and backward propagation calculation processes); generating, by the backward correction neural network, a corrected image based on a pattern image (Lee para 57-58 and 69-70 Fig 3 and 5); generating, by the forward simulation neural network, a simulated result image based on the corrected image (Lee para 70-72, Fig 3); and adjusting parameters of the backward correction neural network according to an error between the simulated result image and the pattern image (Lee para 41 teaches convolution calculation of the input data and the filter in the convolution layer generation unit 330, zero padding is performed to solve the problem that the edge information of the input data disappears, and the result of the convolution calculation adjusts the size of the output data to the same size as the input value by setting the stride to 1 (stride:=1) when the filter moves within the input data Fig 6A 6B). Lee does not teach however Murray teaches Fig 3 para 48, 53-55 image pattern recognition, pixel enhancements and update of images based on machine learning CNN (neural network). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention, having the teachings of Lee-Murray before him or her, to combine Lee’s image analysis based on backward and forward correction neural network (Lee Fig 3) with Murray’s teaching of image pattern recognition, pixel enhancements and update of images based on machine learning CNN (Murray para 48, 53-55). The suggestion/motivation for doing so would have been to enhance image outputs by comparing the generated output with an expected output for the training input, and modifying weights and biases associated with the neurons with the aim of matching (or at least reducing the error between) the generated output and the expected output security of device access based on key-value storage that stores data on a key-value basis (Murray para 3). As per claim 20 combination of Lee-Murray teaches, the method of claim 19, wherein the adjusting of the parameters comprises iteratively updating the parameters to reduce the error to a predetermined threshold (Lee para 63-64 Fig 5-7 teaches convolution calculation of the input data and the filter in the convolution layer generation unit 330, zero padding is performed to solve the problem that the edge information of the input data disappears, and the result of the convolution calculation adjusts the size of the output data to the same size as the input value). Prior Art The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Lee et al US Publication 20240046629 Murray et al US Publication 20240070466 Yang et al US Publication 20230153510 Lin et al US Patent 12100185 Longshaw et al US Publication 20240028722 Chen et al US Publication 20230138380 Zhang et al US Publication 20220319154 Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to VIRAL S LAKHIA whose telephone number is (571)270-3363. The examiner can normally be reached on 8 am - 6 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, Lynn Feild can be reached on 571-272-2092. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /VIRAL S LAKHIA/Primary Examiner, Art Unit 2431
Read full office action

Prosecution Timeline

Jul 21, 2023
Application Filed
Mar 02, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12604190
TECHNIQUES FOR ENABLING COMMUNICATION BETWEEN A PLURALITY OF DISPARATE NETWORKS AND DEVICES UTIILZING VARIOUS CONNECTION TECHNOLOGIES
2y 5m to grant Granted Apr 14, 2026
Patent 12596850
SYSTEMS AND METHODS FOR GENERATING TRUST SCORES AND RELATED RECOMMENDATIONS USING SPDM-ENABLED DEVICES
2y 5m to grant Granted Apr 07, 2026
Patent 12596773
COMMUNICATION CONFIDENTIALITY METHOD FOR APPLICATIONS IN COMMUNICATION CONFIDENTIALITY SYSTEMS AND COMMUNICATION SERVERS
2y 5m to grant Granted Apr 07, 2026
Patent 12591673
DETECTION OF CYBER ATTACKS DRIVEN BY COMPROMISED LARGE LANGUAGE MODEL APPLICATIONS
2y 5m to grant Granted Mar 31, 2026
Patent 12579326
LEVEL SENSOR FOR ACTIVATING AND DEACTIVATING A SAFE OPERATING STATE
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
88%
Grant Probability
99%
With Interview (+19.9%)
2y 11m
Median Time to Grant
Low
PTA Risk
Based on 591 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