Prosecution Insights
Last updated: April 19, 2026
Application No. 18/485,531

Transforms and Sign Prediction

Non-Final OA §103
Filed
Oct 12, 2023
Examiner
RETALLICK, KAITLIN A
Art Unit
2482
Tech Center
2400 — Computer Networks
Assignee
Bytedance Inc.
OA Round
3 (Non-Final)
75%
Grant Probability
Favorable
3-4
OA Rounds
2y 7m
To Grant
86%
With Interview

Examiner Intelligence

Grants 75% — above average
75%
Career Allow Rate
388 granted / 515 resolved
+17.3% vs TC avg
Moderate +11% lift
Without
With
+10.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
27 currently pending
Career history
542
Total Applications
across all art units

Statute-Specific Performance

§101
5.8%
-34.2% vs TC avg
§103
58.4%
+18.4% vs TC avg
§102
7.0%
-33.0% vs TC avg
§112
8.6%
-31.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 515 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 01/20/2026 has been entered. Status of the Application Claims 1-20 are currently pending in this application. Allowable Subject Matter Claims 4, 6, 7, and 9-15 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. Response to Arguments Applicant's arguments filed 01/20/2026 have been fully considered but they are not persuasive. On pages 9-12 of the Applicant’s Remarks, the Applicant argues that the combination of Seregin and Zhao fails to disclose the limitation, “wherein the coding information comprises at least one of a quantization parameter (OP), motion information, a color component, a color format, a temporal layer, a slice type, a coding tree depth, a residual coefficient of the video block, a residual coefficient coding mode, or a tree type,” of independent claims 1 and 18-20, and consequently fails to render obvious claims 1-3, 5, 8, and 16- 20. However, the Examiner disagrees with the Applicant’s Remarks. Zhao discloses that the bullets and sub-bullets listed below are generally directed to techniques of this disclosure that generally relate to conditions of using sign prediction. According to these aspects of this disclosure, several conditions may be applied for blocks which can apply sign prediction. These conditions may include, but are not limited to, the block width and height, block area size, transform coefficient frequency locations, last position, intra prediction mode, whether only primary transform is used to code a block, whether only particular transform functions or certain transform subset are used, inverse transform method, whether it is intra or inter coded blocks, or any other decoded information of the current and/or neighbor block(s). [See Zhao, 0236]. Thus, Zhao discloses that any decoded information of the current and/or neighbor block(s) could be used a condition of using sign prediction [See Zhao, 0236]. Further, Zhao discloses that the number of predicted signs (e.g., 0, 1, 2, 3, 4, 5, 6) may depend on decoded/encoded information, including but not limited to intra prediction mode, block width/height, block size, QP, color components, temporal layer, intra/inter coded, whether transform skip/identity transform is applied, whether non-separable secondary transform is applied, quantized coefficients, EMT index, PDPC flag/index [See Zhao, 0263]. Thus, Zhao discloses that decoded information may include QP, color components, and temporal layer [See Zhao, 0263]. One of ordinary skill in the art would have found it obvious that any other decoded information would include QP, color components, or temporal layer information. Therefore, it would have been obvious to one of ordinary skill in the art that the decoded information which include QP, color components, or temporal layer information could be used a condition for using sign prediction. 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-3, 5, 8, and 16-20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Seregin et al. (Hereafter, “Seregin”) [US 2018/0278951 A1] in view of Zhao et al. (Hereafter, “Zhao”) [US 2018/0176582 A1]. In regards to claim 1, Seregin discloses a method of processing video data ([0002] This disclosure relates to video encoding and decoding.), comprising: determining, for a conversion between a video block of a video and a bitstream of the video ([0048] To generate an encoded representation of a picture, video encoder 20 may encode blocks of the picture. Video encoder 20 may include, in a bitstream, an encoded representation of the video block.), whether a sign prediction is applied for one or more residual coefficients in the video block based on a rule ([0135] The following describes some possible MVD sign exceptions (e.g., times when the one or more example MVD component sign prediction techniques may not be used).); and performing the conversion based on the determining, wherein the rule specifies that whether the sign prediction is applied for one or more residual coefficients in the video block is based on coding information for the video block ([0135] The following describes some possible MVD sign exceptions (e.g., times when the one or more example MVD component sign prediction techniques may not be used). MVD sign predictor may not always be efficient. In one example, MVD sign predictor is not used with OBMC since OBMC may smooth the discontinuity measure and selecting the best block reconstruction may not be obvious. [0137] Absolute MV, MVP, MVD can be compared against the threshold, and, based on the comparison results, for example, if smaller or larger, MVD sign prediction is not applied.), Zhao discloses a method of processing video data ([0013] method of coding video data), comprising: determining, for a conversion between a video block of a video and a bitstream of the video, whether a sign prediction is applied for one or more residual coefficients in the video block based on a rule ([0013] determining that a block of the video data is eligible to be coded using sign prediction); and performing the conversion based on the determining, wherein the rule specifies that whether the sign prediction is applied for one or more residual coefficients in the video block is based on coding information for the video block ([0013] performing the sign prediction with respect to one or more transform coefficients of the block only if the block meets a predetermined criterion, where the predetermined criterion is based on at least one of: a width of the block, a height of the block, a coding mode used to code the block, or a position of one or more sign-predicted transform coefficients within the block, and coding the block based on the sign prediction performed with respect to the block [0236] The bullets and sub-bullets listed below are generally directed to techniques of this disclosure that generally relate to conditions of using sign prediction. According to these aspects of this disclosure, several conditions may be applied for blocks which can apply sign prediction. These conditions may include, but are not limited to, the block width and height, block area size, transform coefficient frequency locations, last position, intra prediction mode, whether only primary transform is used to code a block, whether only particular transform functions or certain transform subset are used, inverse transform method, whether it is intra or inter coded blocks, or any other decoded information of the current and/or neighbor block(s).), wherein the coding information comprises at least one of a quantization parameter (QP), motion information, a color component, a color format, a temporal layer, a slice type, a coding tree depth, a residual coefficient of the video block, a residual coefficient coding mode, or a tree type ([0236] The bullets and sub-bullets listed below are generally directed to techniques of this disclosure that generally relate to conditions of using sign prediction. According to these aspects of this disclosure, several conditions may be applied for blocks which can apply sign prediction. These conditions may include, but are not limited to, the block width and height, block area size, transform coefficient frequency locations, last position, intra prediction mode, whether only primary transform is used to code a block, whether only particular transform functions or certain transform subset are used, inverse transform method, whether it is intra or inter coded blocks, or any other decoded information of the current and/or neighbor block(s). [0263] decoded/encoded information, including but not limited to intra prediction mode, block width/height, block size, QP, color components, temporal layer, intra/inter coded, whether transform skip/identity transform is applied, whether non-separable secondary transform is applied, quantized coefficients, EMT index, PDPC flag/index). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Seregin with the teachings of Zhao in order to effectively improve compression and efficiency. In regards to claim 2, the limitations of claim 1 have been addressed. Seregin fails to explicitly disclose wherein the coding information comprises a transform type for the video block. Zhao discloses wherein the coding information comprises a transform type for the video block ([0236] The bullets and sub-bullets listed below are generally directed to techniques of this disclosure that generally relate to conditions of using sign prediction. According to these aspects of this disclosure, several conditions may be applied for blocks which can apply sign prediction. These conditions may include, but are not limited to, the block width and height, block area size, transform coefficient frequency locations, last position, intra prediction mode, whether only primary transform is used to code a block, whether only particular transform functions or certain transform subset are used, inverse transform method, whether it is intra or inter coded blocks, or any other decoded information of the current and/or neighbor block(s). [0245] In another example, sign prediction may be applied only for the blocks that use certain transform core or certain transform set/subset, because it is possible that sign prediction may not work efficiently for all transform basis/cores, and complexity can be reduced by limiting the sign prediction application.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Seregin with the teachings of Zhao in order to effectively improve compression and efficiency. In regards to claim 3, the limitations of claim 2 have been addressed. Seregin fails to explicitly disclose wherein the sign prediction is allowed for the video block, in a case that the transform type for the video block is a low frequency non-separable transform (LFNST). Zhao discloses wherein the sign prediction is allowed for the video block, in a case that the transform type for the video block is a low frequency non-separable transform (LFNST) ([0123] According to some implementations of the cost function measurement aspects of this disclosure, video encoder 22 may determine the number of predicted signs (e.g., 0, 1, 2, 3, 4, 5, 6, etc.) in a way that the number of predicted signs depends on previously-encoded information. Non-limiting examples of previously-encoded information that video encoder 22 may use in determining the number of predicted signs include, but are not limited to, intra prediction mode, block width/height, block size (area), QP, color components, temporal layer, whether the block is intra-coded or inter coded, whether transform skip or identity transform is applied, whether non-separable secondary transform is applied, quantized coefficients, the presence/value of an enhanced multiple transform (EMT) index, or the presence/value of a position-dependent prediction combination (PDPC) flag or index.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Seregin with the determination of the number of predicted signs (0 or more) based on NSST being performed as taught by Zhao in order to effectively improve compression and efficiency. In regards to claim 5, the limitations of claim 1 have been addressed. Seregin fails to explicitly disclose wherein the rule further specifies that a maximum area for the sign prediction is determined based on at least one of configuration, a quantization parameter (QP), and a sequence class, or the maximum area for the sign prediction is signaled at a sequence parameter set (SPS) level in the bitstream. Zhao discloses wherein the rule further specifies that a maximum area for the sign prediction is determined based on at least one of configuration, a quantization parameter (QP), and a sequence class, or the maximum area for the sign prediction is signaled at a sequence parameter set (SPS) level in the bitstream ([0237] a. In one example, sign prediction is not applied if either of block width or block height is larger than a threshold, where the threshold may be pre-defined. (Where otherwise, the sign prediction would be applied according to existing sign prediction technology). Alternatively, the threshold can be configurable and may be signaled. A typical threshold value can be, but is not limited to 4, 8, 16, 32, or 64.). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Seregin with the teachings of Zhao in order to effectively improve compression and efficiency. In regards to claim 8, the limitations of claim 1 have been addressed. Seregin discloses wherein the coding information further comprises at least one of a prediction mode ([0135] In one example, MVD sign predictor is not used with OBMC since OBMC may smooth the discontinuity measure and selecting the best block reconstruction may not be obvious.), a coding tool, information of a neighboring block for the video block. Zhao discloses wherein the coding information further comprises at least one of a prediction mode, a coding tool, or information of a neighboring block for the video block ([0236] The bullets and sub-bullets listed below are generally directed to techniques of this disclosure that generally relate to conditions of using sign prediction. According to these aspects of this disclosure, several conditions may be applied for blocks which can apply sign prediction. These conditions may include, but are not limited to, the block width and height, block area size, transform coefficient frequency locations, last position, intra prediction mode, whether only primary transform is used to code a block, whether only particular transform functions or certain transform subset are used, inverse transform method, whether it is intra or inter coded blocks, or any other decoded information of the current and/or neighbor block(s).). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of Seregin with the teachings of Zhao in order to effectively improve compression and efficiency. In regards to claim 16, the limitations of claim 1 have been addressed. Seregin discloses wherein the conversion includes encoding the video block into the bitstream ([0007] a video coder (e.g., video encoder or video decoder) [0009] a method of encoding video data). In regards to claim 17, the limitations of claim 1 have been addressed. Seregin discloses wherein the conversion includes decoding the video block from the bitstream ([0007] a video coder (e.g., video encoder or video decoder) [0008] a method of decoding video data). Claim 18 lists all the same elements of claim 1, but in apparatus form rather than method form. Therefore, the supporting rationale of the rejection to claim 1 applies equally as well to claim 18. Claim 19 lists all the same elements of claim 1, but in non-transitory computer-readable storage medium form rather than method form. Therefore, the supporting rationale of the rejection to claim 1 applies equally as well to claim 19. Claim 20 lists all the same elements of claim 1, but in non-transitory computer-readable storage medium form rather than method form. Therefore, the supporting rationale of the rejection to claim 1 applies equally as well to claim 20. Contact Information Any inquiry concerning this communication or earlier communications from the examiner should be directed to Kaitlin A Retallick whose telephone number is (571)270-3841. The examiner can normally be reached Monday-Friday 8am-5pm. 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, Chris Kelley can be reached at (571) 272-7331. 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. /KAITLIN A RETALLICK/Primary Examiner, Art Unit 2482
Read full office action

Prosecution Timeline

Oct 12, 2023
Application Filed
Jun 09, 2025
Non-Final Rejection — §103
Sep 10, 2025
Response Filed
Oct 16, 2025
Final Rejection — §103
Dec 22, 2025
Response after Non-Final Action
Jan 20, 2026
Request for Continued Examination
Jan 28, 2026
Response after Non-Final Action
Feb 12, 2026
Non-Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602757
SYSTEM AND COMPUTER-IMPLEMENTED METHOD FOR IMAGE DATA QUALITY ASSURANCE IN AN INSTALLATION ARRANGED TO PERFORM ANIMAL-RELATED ACTIONS, COMPUTER PROGRAM AND NON-VOLATILE DATA CARRIER
2y 5m to grant Granted Apr 14, 2026
Patent 12604045
Encoding Control Method and Apparatus, and Decoding Control Method and Apparatus
2y 5m to grant Granted Apr 14, 2026
Patent 12593058
BITSTREAM MERGING
2y 5m to grant Granted Mar 31, 2026
Patent 12587669
MOTION FLOW CODING FOR DEEP LEARNING BASED YUV VIDEO COMPRESSION
2y 5m to grant Granted Mar 24, 2026
Patent 12587678
INFORMATION PROCESSING APPARATUS AND METHOD THEREOF
2y 5m to grant Granted Mar 24, 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

3-4
Expected OA Rounds
75%
Grant Probability
86%
With Interview (+10.7%)
2y 7m
Median Time to Grant
High
PTA Risk
Based on 515 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