Prosecution Insights
Last updated: April 19, 2026
Application No. 18/857,163

Motion Vector Coding Using A Motion Vector Precision

Final Rejection §102
Filed
Oct 15, 2024
Examiner
HOLDER, ANNER N
Art Unit
2483
Tech Center
2400 — Computer Networks
Assignee
Google LLC
OA Round
2 (Final)
78%
Grant Probability
Favorable
3-4
OA Rounds
3y 1m
To Grant
92%
With Interview

Examiner Intelligence

Grants 78% — above average
78%
Career Allow Rate
575 granted / 734 resolved
+20.3% vs TC avg
Moderate +14% lift
Without
With
+14.0%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
33 currently pending
Career history
767
Total Applications
across all art units

Statute-Specific Performance

§101
7.4%
-32.6% vs TC avg
§103
50.4%
+10.4% vs TC avg
§102
25.9%
-14.1% vs TC avg
§112
3.3%
-36.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 734 resolved cases

Office Action

§102
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 . Information Disclosure Statement The information disclosure statement (IDS) submitted on 1 is in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Response to Arguments Applicant's arguments filed 12/10/25 have been fully considered but they are not persuasive. Applicant argues the cited prior art fails to teach 1) "determine, using the MV precision, whether to omit decoding least significant bits of offset bits of the integer portion and to set the least significant bits of offset nits of the integer portion to a predefined value", 2) "wherein to decode, using the MV precision and the MV class, the at least the subset of bits representing the integer portion of the MVD comprises to infer that at least one least significant bit of bits representing the integer portion of the MVD is zero based on the MV precision" and 3) "decode, from a compressed bitstream and based on the MV precision, a subset of bits of fractional portion of the MVD." In the cited prior art Deng the ”class” refers to a range and multiple sets of ranges may be defined. [¶ 0171] Within the decoding memory K bits are assigned to represent the integer portion and L bits are assigned to represent the fractional portion, wherein K and L are positive integers, cf. e.g. the case of VVC with K = 13 and L = 4, recalled in paragraph. [¶ 0078-0101; ¶ 0173] A parameter L representing precision integer in both positive and negative values; for a precision L ≤ 0 and according to the class, defined by the range, in the case of a decoded or signaled MVD component [¶ 0160], K - |L| bits are decoded for representing the integer part of MVD at decoding, whereas the least significant |L| bits of the K bits used for representing the integer part, are set to 0 in the decoding memory. Deng discloses "the value of MVD component is constrained and/or clipped to be in the range", as "constraining and/or clipping" means in context to set the least significant bits to 0 in the decoding memory. [¶ 0160] Motion vector difference (MVD) is obtained in the encoding/decoding process. The cited prior art fairly suggest and teaches the limitations as presented. Therefore the rejection is maintained. Claim Rejections - 35 USC § 102 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 the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or application, as the case may be, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claim(s) 1-17 and 24-26 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Deng et al. US 2021/0385462. As to claim 1, Deng teaches an apparatus for decoding a current block, comprising: a processor [fig. 2; ¶ 0121] configured to: decode, from a compressed bitstream, a motion vector (MV) class of a motion vector difference (MVD) for the current block, wherein the MV class is indicative of a set of MVDs, each MVD of the set of MVDs corresponds to respective integer portions, and wherein the MVD comprises an integer portion and a fractional portion; [figs. 1-2; ¶ 0004; ¶ 0018; ¶ 0043-0045; ¶ 0078-0101; ¶ 0170-0173] obtaining an MV precision of the MVD; [0078-0101] determine, using the MV precision, whether to omit decoding least significant bits of offset bits of the integer portion and to set the least significant bits of offset bits of the integer portion to a predefined value; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-0165] decode at least some of the offset bits; [¶ 0070-0101] obtaining obtain the integer portion using the at least some of the offset bits and the least significant bits of the integer portion; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-0165; ¶ 0170-0185] determine, using the MV precision, whether to omit decoding and to set, to the predefined value, least significant bits of fractional bits of the fractional portion; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-165; ¶ 0170-0185] decode the at least some of the fractional bits for the fractional portion; [¶ 0070-0101] obtain the fractional portion using the at least some of the fractional bits and the least significant bits of the fractional portion; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-165; ¶ 0170-0185] obtain the MVD using at least the integer portion and the fractional portion; [¶ 0070-0185] obtain a motion vector for the current block using the MVD; [fig. 1; ¶ 0022; ¶ 0025; ¶ 0078-0101; ¶ 0170-0195] and obtain a prediction block for the current block using the motion vector. [fig. 1; ¶ 0041; ¶ 0170-0195] As to claim 2, Deng teaches the limitations of claim 1. Deng teaches wherein the least significant bits of the offset bits of the integer portion constitute 2 bits in a case that the MV precision indicates a 4-integer pixel magnitude. [¶ 0030; ¶ 0042-0045; ¶ 0048; ¶ 0078-0101; ¶ 0160-0165; ¶ 0170-0174] As to claim 3, Deng teaches the limitations of claim 1. Deng teaches wherein the least significant bits of the offset bits of the integer portion constitute 1 bit in a case that the MV precision indicates a 2-integer pixel magnitude. [¶ 0042-0045; ¶ 0048; ¶ 0078-0101; ¶ 0160-0165; ¶ 0170-0174] As to claim 4, Deng teaches the limitations of claim 1. Deng teaches wherein the least significant bits of the fractional portion constitute the least significant bit in a case that the MV precision indicates a precision that is not finer than a ¼ pixel precision. [¶ 0042-0045; ¶ 0055] As to claim 5, Deng teaches the limitations of claim 1. Deng teaches wherein the least significant bits of the fractional portion constitute two least significant bits in a case that the MV precision indicates a precision that is not finer than a ½ pixel precision. [¶ 0042-0045; ¶ 0170-0195] As to claim 6, Deng teaches an apparatus for decoding a current block, comprising: a processor [fig. 2; ¶ 0121] configured to: decode, from a compressed bitstream, a motion vector (MV) class of a motion vector difference (MVD) of the current block, wherein the MV class is indicative of a set of MVDs, and wherein the MVD includes an integer portion; [figs. 1-2; ¶ 0004; ¶ 0018; ¶ 0043-0045; ¶ 0078-0101; ¶ 0170-0173] obtain an MV precision of the MVD; [0078-0101] decode, using the MV precision and the MV class, at least a subset of bits representing the integer portion of the MVD; [figs. 1-2; ¶ 0004; ¶ 0018; ¶ 0043-0045; ¶ 0078-0101; ¶ 0170-0173] obtain the MVD using the bits representing the integer portion of the MVD; [figs. 1-2; ¶ 0004; ¶ 0018; ¶ 0043-0045; ¶ 0078-0101; ¶ 0170-0173] obtain a motion vector for the current block using the MVD; [fig. 1; ¶ 0022; ¶ 0025; ¶ 0078-0101; ¶ 0170-0195] and obtain a prediction block for the current block using the motion vector. [fig. 1; ¶ 0041; ¶ 0170-0195] As to claim 7, Deng teaches the limitations of claim 6. Deng teaches wherein to decode, using the MV precision and the MV class, the at least the subset of bits representing the integer portion of the MVD comprises to: infer that at least one least significant bit of bits representing the integer portion of the MVD is zero based on the MV precision. [¶ 0030; ¶ 0043-0045; ¶ 0048; ¶ 0068-0101; ¶ 0170-0173] As to claim 8, Deng teaches the limitations of claim 6. Deng teaches wherein to decode, using the MV precision and the MV class, the at least the subset of bits representing the integer portion of the MVD comprises to: responsive to determining that the MV precision indicates a 4-integer pixel magnitude, infer that two least significant bits of the bits representing the integer portion are zero. [¶ 0030; ¶ 0043-0045; ¶ 0048; ¶ 0068-0101; ¶ 0170-0173] As to claim 9, Deng teaches the limitations of claim 6. Deng teaches wherein to decode, using the MV precision and the MV class, the at least the subset of bits representing the integer portion of the MVD comprises to: responsive to determining that the MV precision indicates a 2-integer pixel magnitude, infer that one least significant bit of the bits representing the integer portion are zero. [¶ 0030; ¶ 0043-0045; ¶ 0048; ¶ 0068-0101; ¶ 0170-0173] As to claim 10, Deng teaches the limitations of claim 6. Deng teaches wherein the processor is configured to: decode, using the MV precision, at least a subset of bits representing a fractional portion of the MVD. [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-165; ¶ 0170-0185] As to claim 11, Deng teaches the limitations of claim 10. Deng teaches wherein to decode, using the MV precision, the at least the subset of bits representing the fractional portion of the MVD comprises to: responsive to determining that the MV precision indicates a precision that is not finer than a ¼ pixel precision, infer that a least significant bit of the bits representing the fractional portion is zero. [¶ 0030; ¶ 0042-0045; ¶ 0048; ¶ 0055; ¶ 0068-0101; ¶ 0170-0173] As to claim 12, Deng teaches the limitations of claim 10. Deng teaches wherein to decode, using the MV precision, the at least the subset of bits representing the fractional portion of the MVD comprises to: responsive to determining that the MV precision indicates a precision that is not finer than a ½ pixel precision, infer that two least significant bits of the bits representing the fractional portion are zero. [¶ 0030; ¶ 0042-0045; ¶ 0048; ¶ 0068-0101; ¶ 0170-0195] As to claim 13, Deng teaches the limitations of claim 10. Deng teaches wherein to decode, using the MV precision, the at least the subset of bits representing the fractional portion of the MVD comprises to: responsive to determining that the MV precision indicates an integer pixel precision, infer that the bits representing the fractional portion are zero. [¶ 0030; ¶ 0043-0045; ¶ 0048; ¶ 0068-0101; ¶ 0170-0173] As to claim 14, Deng teaches the limitations of claim 6. Deng teaches wherein the processor is configured to: obtain candidate MVs for the MV; [fig. 1; ¶ 0022; ¶ 0025; ¶ 0078-0101; ¶ 0170-0195] and set respective precisions of at least some of the candidate MVs to the MV precision. [¶ 0080-0081; ¶ 0155-0158] As to claim 15, Deng teaches an apparatus comprising: a processor [fig. 2; ¶ 0121] configured to: obtain a motion vector (MV) precision of a motion vector difference (MVD) of a current block; [0078-0101] decode, from a compressed bitstream and based on the MV precision, a subset of bits of a fractional portion of the MVD; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-165; ¶ 0170-0185] set remaining bits of the fractional portion of the MVD to zero; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-165; ¶ 0170-0185] obtaining the MVD using at least the fractional portion; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-165; ¶ 0170-0185] obtaining a motion vector for the current block using the MVD; [fig. 1; ¶ 0022; ¶ 0025; ¶ 0078-0101; ¶ 0170-0195] and obtaining a prediction block for the current block using the motion vector. [fig. 1; ¶ 0041; ¶ 0170-0195] As to claim 16, Deng teaches the limitations of claim 15. Deng teaches wherein the processor is configured to: decode, from the compressed bitstream, an MV class of the MVD, wherein the MV class is indicative of a set of MVDs, each MVD of the set of MVDs corresponds to respective integer portions; [¶ 0042-0045; ¶ 0070-0101; ¶ 0160-0165; ¶ 0170-0185] and decode, from the compressed bitstream, an integer portion of the MVD. [figs. 1-2; ¶ 0004; ¶ 0018; ¶ 0043-0045; ¶ 0078-0101; ¶ 0170-0173] As to claim 17, Deng teaches the limitations of claim 15. Deng teaches wherein the processor is configured to: obtain candidate MVs for the MV; [fig. 1; ¶ 0022; ¶ 0025; ¶ 0078-0101; ¶ 0170-0195] and convert an MV precision of a candidate MV of the candidate MVs to match the MV precision. [¶ 0080-0081; ¶ 0155-0158] As to claim 24, Deng teaches the limitations of claim 15. Deng teaches wherein to decode, from the compressed bitstream and based on the MV precision, the subset of bits of the fractional portion of the MVD, the processor is configured to: responsive to determining that the MV precision indicates a precision that is not finer than a 1/4 pixel precision, infer that a least significant bit of the bits representing the fractional portion is zero. [¶ 0042-0045; ¶ 0055] As to claim 25, Deng teaches the limitations of claim 15. Deng teaches wherein to decode, from the compressed bitstream and based on the MV precision, the subset of bits of the fractional portion of the MVD, the processor is configured to: responsive to determining that the MV precision indicates a precision that is not finer than a 1/2 pixel precision, infer that two least significant bits of the bits representing the fractional portion are zero. [¶ 0042-0045; ¶ 0170-0195] As to claim 26, Deng teaches the limitations of claim 15. Deng teaches wherein to decode, from the compressed bitstream and based on the MV precision, the subset of bits of the fractional portion of the MVD, the processor is configured to: responsive to determining that the MV precision indicates an integer pixel precision, infer that all bits representing the fractional portion are zero. [¶ 0170-0195] Conclusion THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANNER HOLDER whose telephone number is (571)270-1549. The examiner can normally be reached M-F 7:30-4. 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, Joseph Ustaris can be reached at 571.272.7383. 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. /ANNER HOLDER/Primary Examiner, Art Unit 2483
Read full office action

Prosecution Timeline

Oct 15, 2024
Application Filed
Sep 22, 2025
Non-Final Rejection — §102
Dec 04, 2025
Applicant Interview (Telephonic)
Dec 04, 2025
Examiner Interview Summary
Dec 10, 2025
Response Filed
Mar 20, 2026
Final Rejection — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12604033
MOTION VECTOR CODING WITH INPUT MOTION VECTOR DATA
2y 5m to grant Granted Apr 14, 2026
Patent 12593066
IMAGE DECODING APPARATUS AND IMAGE CODING APPARATUS
2y 5m to grant Granted Mar 31, 2026
Patent 12587637
Warped Motion Compensation With Explicitly Signaled Extended Rotations
2y 5m to grant Granted Mar 24, 2026
Patent 12574499
VIDEO ENCODING/DECODING METHOD AND APPARATUS
2y 5m to grant Granted Mar 10, 2026
Patent 12563180
VIDEO CODING APPARATUS AND DECODING APPARATUS
2y 5m to grant Granted Feb 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
78%
Grant Probability
92%
With Interview (+14.0%)
3y 1m
Median Time to Grant
Moderate
PTA Risk
Based on 734 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