Prosecution Insights
Last updated: April 19, 2026
Application No. 17/637,180

INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND COMPUTER PROGRAM

Non-Final OA §103
Filed
Feb 22, 2022
Examiner
CHOI, YUK TING
Art Unit
2164
Tech Center
2100 — Computer Architecture & Software
Assignee
NEC Corporation
OA Round
3 (Non-Final)
72%
Grant Probability
Favorable
3-4
OA Rounds
3y 3m
To Grant
99%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allow Rate
466 granted / 652 resolved
+16.5% vs TC avg
Strong +37% interview lift
Without
With
+37.4%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
29 currently pending
Career history
681
Total Applications
across all art units

Statute-Specific Performance

§101
16.8%
-23.2% vs TC avg
§103
55.0%
+15.0% vs TC avg
§102
13.5%
-26.5% vs TC avg
§112
6.8%
-33.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 652 resolved cases

Office Action

§103
DETAILED ACTION Response to Amendment 1. This office action is in response to applicant’s communication filed on 01/06/2025 in response to PTO Office Action mailed 05/08/2025. The Applicant’s remarks and amendments to the claims and/or the specification were considered with the results as follows. 2. In response to the last Office Action, claims 1, 11 and 12 are amended. Claims 3, 4, 6, 7 are canceled. As a result, claims 1, 2 and 8-12 are pending in this office action. 3. The 35 USC 101 rejections have been withdrawn due to the amendment filed on 01/06/2026. Response to Arguments 4. Applicant's arguments with respect to 35 USC 103 rejections have been fully considered but are moot in view of new ground (s) of rejection. 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 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. . Claims 1, 5, 9, 11 and 12 are rejected under 35 U.S.C. 103 as being unpatentable by Sethi et al. (US 2018/0232883 A1), hereinafter Sethi and in view of Ratner et al. (US 20200065636 A1), hereinafter Ratner. Referring to claims 1, 11 and 12, Sethi discloses an information processing apparatus comprising: a camera (See para. [0046], a system comprises one or more digital cameras for image capturing images); a display, at least one memory configured to store instructions (See para. [0046] and para. [0047], a computing system includes one or more processors 132, a memory 134, a display 136, a user interface 138); and at least one processor (See para. [0004], a processor) configured to execute the instructions to: sequentially acquire a plurality of elements included in sequential data, each element being an image signal acquired via the camera (See para. [0006], para. [0007] and para. [0046], the system’s imaging apparatus comprises a microscope with optical zoom and a camera for capturing one or more images of the patient tissue) calculate, based on at least two elements of the plurality of elements, a classification indicator indicating which one of a plurality of classes the sequential data belongs to (See para. [0071], the system’s POI classifier learns to predict labels for central pixel of input sub-image windows of pre-processed tissue image); execute a first process of setting the classification indicator to a predetermined value […] (See para. [0077], the system sets label at each POI location to a disease class); and determine an interval including an element of a detection-target class, based on the classification indicator; output a result to the display showing that the predetermined condition is that the classification indicator crosses a threshold value, wherein the threshold value determines that the classification indicator leans to a detection-target class or a class other than the detection-target class (See para. [0081], para. [0083] and Figure 7, one or more classification maps 208 may be given as input to a nearest neighbor graph formation module 602 within the class aggregator 210, which connects two POIs using the edge of a graph 603 if one of them is among the nearest k neighbors, where k is usually around, the system examines each vertex or POI in the graph 603 and assigns it a class and confidence based on the class with highest probability, for example, the disease class scores are arranged in a matrix whose rows are disease classes, and columns are confidence intervals, while each entry is the percent of POIs across one or more tissue images with that disease classification and confidence equal to or larger than the threshold for that column. Also, note in para. [0083], a local classification module samples multiple sized sub-image windows 750 and 752 from the pre-processed image 722 using the location map 742, a local classifier may take each set of windows centered at each POI and produces class probability maps 760, in which a local classification probability for a POI is shown as a pie chart 762. such class probability maps can be aggregated using a disease class aggregator module into disease class scores 770, where proportion of POIs representing each disease class 772, 774, 776 (including “no cancer” 772), along with their confidence intervals 782, 784, 786, are shown). Sethi does not explicitly disclose execute a first process of resetting the classification indicator to a predetermined value when a predetermined condition is satisfied. Rainer discloses resetting the classification indicator to a predetermined value when a predetermined condition is satisfied (See para. [0029], a multi-task image classifier program 132 adjusts the analysis of an image tagged with a BIRADS value of 4, where the prediction vector was {0, 0, 0}, indicating that the image meets a threshold condition). Therefore, it 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 was made to modify the classifier of Sethi to reset a classification indicator when a predetermined condition is satisfied, taught by Rainer. Skilled artisan would have been motivated to refine the classifier to get more accurate predictions (See Rainer, para. [0029]). In addition, all references (Sethi and Rainer) teach features that are directed to analogous art and they are directed to the same field of endeavor, such as classifying image data. This close relation between both references highly suggests an expectation of success. As to claim 5, Sethi in view of Rainer disclose wherein the predetermined value is an initial value of the classification indicator (See para. [0029], a multi-task image classifier program 132 adjusts the analysis of an image tagged with a BIRADS value of 4, where the prediction vector was {0, 0, 0}, indicating that the image meets a threshold condition). Therefore, it 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 was made to modify the classifier of Sethi to reset a classification indicator when a predetermined condition is satisfied, taught by Rainer. Skilled artisan would have been motivated to refine the classifier to get more accurate predictions (See Rainer, para. [0029]). In addition, all references (Sethi and Rainer) teach features that are directed to analogous art and they are directed to the same field of endeavor, such as classifying image data. This close relation between both references highly suggests an expectation of success. As to claim 9, Sethi in view of Rainer discloses wherein the predetermined condition is that a predetermined number of elements are acquired (See para. [0029], a multi-task image classifier program 132 adjusts the analysis of an image tagged with a BIRADS value of 4, where the prediction vector was {0, 0, 0}, indicating that the image meets a predetermined number of elements). Therefore, it 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 was made to modify the classifier of Sethi to reset a classification indicator when a predetermined condition is satisfied, taught by Rainer. Skilled artisan would have been motivated to refine the classifier to get more accurate predictions (See Rainer, para. [0029]). In addition, all references (Sethi and Rainer) teach features that are directed to analogous art and they are directed to the same field of endeavor, such as classifying image data. This close relation between both references highly suggests an expectation of success. Claim 2 is rejected under 35 U.S.C. 103 as being unpatentable over Sethi (US 2018/0232883 A1) and in view of Ratner (US 20200065636 A1) and further in view of Unser (US 2015/0332414 A1). As to claim 2, Unser discloses determine that interval is the interval including an element of the detection-target class when the classification indicator exceeds a first threshold value, and to determine that interval ceases to be the interval including an element of the detection-target class when the classification indicator falls below a second threshold value after the classification indicator exceeds the first threshold value (See para. [0035], para. [0051]-para. [0053] and para. [0057], determining that the transaction data which associated with a particular time period has probability scores larger than a threshold for an associated score and the scores that exceed the threshold value are selected for further analysis, the differential of the selected scores if determine along with a threshold variance for the probability of each score, if the score differential exceeds the threshold variance, then the highest score is selected, and the score’s associated item type or category within the particular time period is identified as the object of the transaction. If the differential does not exceed the threshold variance [e.g., the second threshold], no prediction is made [e.g., ceases to be target class including the particular time interval]). Therefore, it 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 was made to modify the system of Sethi to further determine an interval including an element of the detection-target class when the classification indicator exceeds a first threshold value, as taught by Unser. Skilled artisan would have been motivated to provide user with accurate predictions (See Unser, para. [0006]). In addition, all references (Unser, Sethi and Rainer) teach features that are directed to analogous art and they are directed to the same field of endeavor, such as data classification. This close relation between all references highly suggests an expectation of success. Claim 8 is rejected under 35 U.S.C. 103 as being unpatentable over Sethi (US 2018/0232883 A1) and in view of Ratner (US 20200065636 A1) and further in view of Baker (2020/0143240 A1), hereinafter Baker. As to claim 8, Sethi does not explicitly disclose wherein the predetermined condition is that a slope of the classification indicator exceeds a fifth threshold value. Baker discloses the predetermined condition is that a slope of the classification indicator (See para. [0135] and Figure 12, detecting a specified slope of a data item exceeds a specification threshold which indicates the data item is misclassified). Therefore, it 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 was made to modify the system of Unser to include a slope predetermined condition, taught by Baker. Skilled artisan would have been motivated to classify data items correctly (See Baker, para. [0004]). In addition, all references (Baker, Sethi and Rainer) teach features that are directed to analogous art and they are directed to the same field of endeavor, such as analyzing data using predictive analytic systems. This close relation between both references highly suggests an expectation of success. Claim 10 is rejected under 35 U.S.C. 103 as being unpatentable over Sethi (US 2018/0232883 A1) and in view of Ratner (US 20200065636 A1) and further in view of Lin (US 2007/0091187 A1). As to claim 10, Unser discloses calculate a likelihood ratio indicating a likelihood that each of the plurality of elements belongs to a class of the plurality of classes (See para. [0057] and para. [0058], provide a likelihood indicator that the particular category of product purchased in transaction was a computer, the higher value likelihood indicator represents a game station). Unser does not explicitly disclose calculate, as the classification indicator, a consolidated likelihood ratio indicating a likelihood that the data belongs to a class of the plurality of classes, based on the likelihood ratios. Lin discloses calculate, as the classification indicator, a consolidated likelihood ratio indicating a likelihood that the data belongs to a class of the plurality of classes, based on the likelihood ratios (See para. [0005], obtaining an accumulated likelihood ratio to determine whether the data belongs to a defective class or a normal class). Therefore, it 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 was made to modify the system of Unser to include consolidated likelihood ratio, taught by Lin. Skilled artisan would have been motivated to avoid estimation bias (See Lin, para. [0005]). In addition, all references (Lin, Sethi and Ratner) teach features that are directed to analogous art and they are directed to the same field of endeavor, such as analyzing data using predictive analytic systems. This close relation between all references highly suggests an expectation of success. Any inquiry concerning this communication or earlier communications from the examiner should be directed to YUK TING CHOI whose telephone number is (571)270-1637. The examiner can normally be reached Monday-Friday 9am-6pm. 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, AMY NG can be reached on 5712701698. 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. /YUK TING CHOI/Primary Examiner, Art Unit 2164
Read full office action

Prosecution Timeline

Feb 22, 2022
Application Filed
May 05, 2025
Non-Final Rejection — §103
Aug 12, 2025
Examiner Interview Summary
Aug 12, 2025
Applicant Interview (Telephonic)
Sep 08, 2025
Response Filed
Oct 02, 2025
Final Rejection — §103
Jan 06, 2026
Request for Continued Examination
Jan 14, 2026
Response after Non-Final Action
Mar 09, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591610
SYSTEMS AND METHODS FOR REMOVING NON-CONFORMING WEB TEXT
2y 5m to grant Granted Mar 31, 2026
Patent 12579156
SYSTEMS AND METHODS FOR VISUALIZING ONE OR MORE DATASETS
2y 5m to grant Granted Mar 17, 2026
Patent 12562753
SYSTEM AND METHOD FOR MULTI-TYPE DATA COMPRESSION OR DECOMPRESSION WITH A VIRTUAL MANAGEMENT LAYER
2y 5m to grant Granted Feb 24, 2026
Patent 12536282
METHODS AND APPARATUS FOR MACHINE LEARNING BASED MALWARE DETECTION AND VISUALIZATION WITH RAW BYTES
2y 5m to grant Granted Jan 27, 2026
Patent 12511258
DYNAMIC STORAGE OF SEQUENCING DATA FILES
2y 5m to grant Granted Dec 30, 2025
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

3-4
Expected OA Rounds
72%
Grant Probability
99%
With Interview (+37.4%)
3y 3m
Median Time to Grant
High
PTA Risk
Based on 652 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