Prosecution Insights
Last updated: April 19, 2026
Application No. 18/928,918

SIMPLIFIED HISTORY BASED MOTION VECTOR PREDICTION

Non-Final OA §DP
Filed
Oct 28, 2024
Examiner
RAHAMAN, SHAHAN UR
Art Unit
2426
Tech Center
2400 — Computer Networks
Assignee
Bytedance Inc.
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
2y 11m
To Grant
88%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allow Rate
479 granted / 633 resolved
+17.7% vs TC avg
Moderate +13% lift
Without
With
+12.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
51 currently pending
Career history
684
Total Applications
across all art units

Statute-Specific Performance

§101
4.7%
-35.3% vs TC avg
§103
50.0%
+10.0% vs TC avg
§102
14.7%
-25.3% vs TC avg
§112
15.1%
-24.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 633 resolved cases

Office Action

§DP
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 Following prior arts are considered pertinent to applicant's disclosure. US 10491902 B1 (hereinafter Xu; provisional application 62/698,559 relied upon in the analysis) Zhang et. al. “CE4-related: History-based Motion Vector Prediction” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 11th Meeting: Ljubljana, SI, 10-18 July 2018 (Section “2. Proposed method”, Figs.2-3) Allowable Subject Matter Claims 1-20 are allowable over prior art. The following is an examiner’s statement of reasons for allowance: The primary reason for allowance of independent claim 1 is that the “wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction” limitations in the context of other limitations in the claim, considering the claim as a whole, is not anticipated nor is obvious over the prior art of record or prior art found during Examiner’s search. Other Independent Claims are allowable for similar reason. Depended claims are allowable, at least, because of their dependence on the allowable independent claim. For instance, Xu teaches a rule of updating one or more history-based motion vector predictor (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion [(“Method 1” of pages 4-5 describes based on uni-prediction or bi-prediction new MV are added to the existing one; list teaches table)] Zhang et. al. teaches updating HMVP candidate tables and various rules to update it (Section “2. Proposed method”, Figs.2-3) However, none of the prior art alone or in a combination teaches “wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction”. 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 claims at issue 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); and 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 a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO internet Web site contains terminal disclaimer forms which may be used. Please visit http://www.uspto.gov/forms/. The filing date of the application will determine what form 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 http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-19 of U.S. Patent No. 12132889. Although the claims at issue are not identical, they are not patentably distinct from each other. For instance, instant independent claim 1 taught by patented claim combinations of 1 & 2. Similarly instant claims 19 and 20 are obvious over patented claims 18 & 2 and 19 & 2 respectively (see the table below). Instant dependent claims are obvious variation of or combinations of patented claims Ap. No. 18/928,918 US Patent No. 12132889 1. A method of video processing, comprising: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction: and selectively updating the one or more HMVP tables based on the determining. 19. An apparatus for video processing, comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction; and selectively update the one or more HMVP tables based on the determining. 20. A non-transitory computer-readable medium having code stored thereupon, the code including instructions causing a processor to implement a method of video processing, wherein the method comprises: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction; and selectively updating the one or more HMVP tables based on the determining. 1. A method of video processing, comprising: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion; and selectively updating the one or more HMVP tables based on the determining, wherein the method further comprises: maintaining one or more tables with one or more first motion candidates derived from one or more previous blocks, wherein arrangement of the first motion candidates in the table is based on a sequence of addition of the first motion candidates into the table, wherein the first motion candidate in the table comprises motion information and generalized bi-prediction (GBi) information, wherein the GBi information indicates coding unit (CU)-level weights which are assigned to prediction blocks generated from a bi-prediction step of a corresponding previous block; and constructing a first motion candidate list based on the one or more tables. 2. The method of claim 1, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to the prediction direction being a uni-direction. 18. An apparatus for video processing, comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion; and selectively update the one or more HMVP tables based on the determining, wherein the instructions upon execution by the processor further cause the processor to: maintain one or more tables with one or more first motion candidates derived from one or more previous blocks, wherein arrangement of the first motion candidates in the table is based on a sequence of addition of the first motion candidates into the table, wherein the first motion candidate in the table comprises motion information and generalized bi-prediction (GBi) information, wherein the GBi information indicates coding unit (CU)-level weights which are assigned to prediction blocks generated from a bi-prediction step of a corresponding previous block; and construct a first motion candidate list based on the one or more tables. 2. The method of claim 1, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to the prediction direction being a uni-direction. 19. A non-transitory computer-readable storage medium having code stored thereupon, the code including instructions causing a processor to implement a method of video processing, wherein the method comprises: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion; and selectively updating the one or more HMVP tables based on the determining, wherein the method further comprises: maintaining one or more tables with one or more first motion candidates derived from one or more previous blocks, wherein arrangement of the first motion candidates in the table is based on a sequence of addition of the first motion candidates into the table, wherein the first motion candidate in the table comprises motion information and generalized bi-prediction (GBi) information, wherein the GBi information indicates coding unit (CU)-level weights which are assigned to prediction blocks generated from a bi-prediction step of a corresponding previous block; and constructing a first motion candidate list based on the one or more tables. 2. The method of claim 1, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to the prediction direction being a uni-direction. Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-20 of U.S. Patent No. 11616945. Although the claims at issue are not identical, they are not patentably distinct from each other. For instance, instant independent claims (i.e. claims 1, 19 & 20) are obvious variation of patented claims 1, 17 & 18 (see the table below). Instant dependent claims are obvious variation of or combinations of patented claims Ap. No. 18/928,918 US Patent No. 11616945 1. A method of video processing, comprising: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction: and selectively updating the one or more HMVP tables based on the determining. 19. An apparatus for video processing, comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction; and selectively update the one or more HMVP tables based on the determining. 20. A non-transitory computer-readable medium having code stored thereupon, the code including instructions causing a processor to implement a method of video processing, wherein the method comprises: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream of the video, whether a rule of updating one or more history-based motion vector prediction (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to a prediction direction being a uni-direction; and selectively updating the one or more HMVP tables based on the determining. 1. A method of video processing, comprising: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream representation of the video, whether a rule of updating one or more history based motion vector predictor (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion; and selectively updating the one or more HMVP tables based on the determining, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to the prediction direction being a uni-direction, or specifies to update the one or more HMVP tables due to the prediction direction being a bi-prediction. 17. An apparatus for video processing, comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: determine, after a conversion between a video block of a video comprising multiple blocks and a bitstream representation of the video, whether a rule of updating of one or more history based motion vector predictor (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion; and selectively update the one or more HMVP tables based on the determining, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to the prediction direction being a uni-direction, or specifies to update the one or more HMVP tables due to the prediction direction being a bi-prediction. 18. A non-transitory computer-readable medium having code stored thereupon, the code including instructions causing a processor to implement a method of video processing, wherein the method comprises: determining, after a conversion between a video block of a video comprising multiple blocks and a bitstream representation of the video, whether a rule of updating of one or more history based motion vector predictor (HMVP) tables with HMVP candidates is satisfied, wherein the rule of updating is based on a prediction direction used for the conversion; and selectively updating the one or more HMVP tables based on the determining, wherein the rule of updating specifies to skip updating the one or more HMVP tables due to the prediction direction being a uni-direction, or specifies to update the one or more HMVP tables due to the prediction direction being a bi-prediction. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Shahan Rahaman whose telephone number is (571)270-1438. The examiner can normally be reached on 7am - 3:30pm. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Nasser Goodarzi can be reached at telephone number (571) 272-4195. 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 Patent Center. Status information for published applications may be obtained from Patent Center. Status information for unpublished applications is available through Patent Center for authorized users only. Should you have questions about access to Patent Center, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). 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) Form at https://www.uspto.gov/patents/uspto-automated- interview-request-air-form. /SHAHAN UR RAHAMAN/Primary Examiner, Art Unit 2426
Read full office action

Prosecution Timeline

Oct 28, 2024
Application Filed
Jan 29, 2026
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12599294
IMAGE-RECORDING DEVICE FOR IMPROVED LOW LIGHT INTENSITY IMAGING AND ASSOCIATED IMAGE-RECORDING METHOD
2y 5m to grant Granted Apr 14, 2026
Patent 12602765
DEFECT INSPECTION SYSTEM AND DEFECT INSPECTION METHOD
2y 5m to grant Granted Apr 14, 2026
Patent 12598328
VIDEO SIGNAL PROCESSING METHOD AND DEVICE
2y 5m to grant Granted Apr 07, 2026
Patent 12593035
IMAGE ENCODING/DECODING METHOD AND DEVICE
2y 5m to grant Granted Mar 31, 2026
Patent 12586224
THREE-DIMENSIONAL SCANNING SYSTEM AND METHOD FOR OPERATING SAME
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

1-2
Expected OA Rounds
76%
Grant Probability
88%
With Interview (+12.6%)
2y 11m
Median Time to Grant
Low
PTA Risk
Based on 633 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