Prosecution Insights
Last updated: November 20, 2026
Application No. 19/367,347

Temporal Motion Constrained Sub-picture Signaling In Video Coding

Non-Final OA §102§DOUBLEPATENT
Filed
Oct 23, 2025
Priority
Jan 09, 2019 — provisional 62/790,207 +2 more
Examiner
KWAN, MATTHEW K
Art Unit
2482
Tech Center
2400 — Computer Networks
Assignee
Huawei Technologies Co., Ltd.
OA Round
1 (Non-Final)
72%
Grant Probability
Favorable
1-2
OA Rounds
1y 10m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allowance Rate
276 granted / 386 resolved
+13.5% vs TC avg
Strong +33% interview lift
Without
With
+33.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
19 currently pending
Career history
407
Total Applications
across all art units

Statute-Specific Performance

§101
4.9%
-35.1% vs TC avg
§103
60.8%
+20.8% vs TC avg
§102
11.1%
-28.9% vs TC avg
§112
12.8%
-27.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 386 resolved cases

Office Action

§102 §DOUBLEPATENT
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 . Claim Interpretation The Examiner would like to note that the data of claims 6-10 do not have to be given weight because there is no functional relationship between the medium and the computer in which it is used (see fig. 9), the medium is merely serving as support for information or data (see MPEP 2111.05(III) titled MACHINE-READABLE MEDIA). The non-transitory storage medium serves as a support for the data (i.e. the bitstream) which is not used by the computer for any other purpose. The non-transitory storage medium is merely serving as support for the data. The Examiner recommends adding instructions stored on a non-transitory computer-readable medium which cause a processor to execute the method steps listed in the claim to generate a bitstream. 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 conflicting claims 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); 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 nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) 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 www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 1-5 and 11-15 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 10-14 of U.S. Patent No. 12,477,134 in view of Wu et al. (U.S. 2014/0301464), hereinafter Wu. Wu was cited in the Applicant’s IDS dated 10/30/25. The majority of claims 1-5 and 11-15 are disclosed by claimed 10-14 of U.S. Patent No. 12,477,134. The instant application includes additional limitations in claims 1 and 11 such as one or more processors and sending the bitstream. However, Wu teaches one or more processors ([0035] and fig. 1) and sending the bitstream (figs. 3 and 5a). 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 method taught by the U.S. Patent with the missing limitations as taught by Wu to be able to use video compression to reduce bit rate of digital video (Wu [0002]). As shown above, all of the limitations are known, they can be applied to a known device such as a processor to yield a predictable result of improving coding efficiency. Claims 6-10 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 10-14 of U.S. Patent No. 12,477,134 in view of Haskell et al. (U.S. 2011/0243236), hereinafter Haskell. The majority of claims 6-10 are disclosed by claimed 10-14 of U.S. Patent No. 12,477,134. The instant application includes additional limitations in claim 6 such as a non-transitory storage medium which includes a coded video bitstream. However, Haskell teaches a non-transitory storage medium which includes a coded video bitstream ([0023], [0020] and claim 21). 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 method taught by the U.S. Patent with the missing limitations as taught by Haskell to be able to decode compress video (Haskell [0023]). As shown above, all of the limitations are known, they can be applied to a known device such as a processor to yield a predictable result of improving coding efficiency. Claim Rejections - 35 USC § 102 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)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. (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) 6-10 is/are rejected under 35 U.S.C. 102(a)(1) and (a)(2) as being anticipated by Haskell et al. (U.S. 2011/0243236), hereinafter Haskell. Regarding claim 6, Haskell discloses a non-transitory storage medium which includes a coded video bitstream (Haskell claim 21), wherein the coded video bitstream comprises: a sequence parameter set (SPS) and a first picture, wherein the SPS comprises a first flag, the first flag indicating that a current sub-picture in the first picture is treated as a picture, wherein the SPS further comprises a loop filter across sub-picture boundaries enabled flag (loop_filter_across_subpic_enabled_flag), wherein the loop_filter_across_subpic_enabled_flag specifies that in-loop filtering operations across sub-picture boundaries are enabled when equal to one, wherein the loop_filter_across_subpic_enabled_flag specifies that in-loop filtering operations are not performed across sub-picture boundaries when equal to zero, wherein the SPS further comprises sub-picture identifiers (IDs) for sub-pictures partitioned from the first picture, wherein the SPS further comprises a subpicture identifier length minus 1 (subpic_id_len_minus1), wherein the subpic_id_len_minus1 plus 1 specifies a number of bits used to represent the sub-picture IDs in the SPS, wherein the SPS further comprises a number of subpictures minus one (num_subpicture_minus1), and wherein the num_subpicture_minus1 plus 1 specifies the number of sub-pictures partitioned from the first picture (see Claim Interpretation section above). Regarding claim 7, Haskell discloses the non-transitory storage medium of claim 6, wherein the SPS includes an ith number of flags where i is an index of the current sub-picture (see claim 6 and Claim Interpretation section above). Regarding claim 8, Haskell discloses the non-transitory storage medium of claim 6, wherein the current sub-picture is treated as a picture when the current sub-picture is constrained to contain motion vectors restricted to point to full-sample locations inside the current sub-picture and to fractional-sample locations that require only full-sample locations inside the current sub-picture for interpolation (see claim 6 and Claim Interpretation section above). Regarding claim 9, Haskell discloses the non-transitory storage medium of claim 6, wherein the first flag is a subpic_motion_constrained_flag[ i ] where i is an index of the current sub-picture (see claim 6 and Claim Interpretation section above). Regarding claim 10, Haskell discloses the non-transitory storage medium of claim 6, wherein the SPS further includes a sub-picture size for each sub-picture and a sub-picture location for each sub-picture (see claim 6 and Claim Interpretation section above). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to MATTHEW KWAN whose telephone number is (571)270-7073. The examiner can normally be reached Monday-Friday 9am-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. /MATTHEW K KWAN/Primary Examiner, Art Unit 2482
Read full office action

Prosecution Timeline

Oct 23, 2025
Application Filed
Oct 19, 2026
Non-Final Rejection mailed — §102, §DOUBLEPATENT (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12804197
THREE-DIMENSIONAL DATA ENCODING METHOD, THREE-DIMENSIONAL DATA DECODING METHOD, THREE-DIMENSIONAL DATA ENCODING DEVICE, AND THREE-DIMENSIONAL DATA DECODING DEVICE
2y 11m to grant Granted Nov 17, 2026
Patent 12795175
METHOD, APPARATUS, AND MEDIUM FOR VISUAL DATA PROCESSING
1y 9m to grant Granted Nov 10, 2026
Patent 12795094
METHOD AND APPARATUS FOR ENCODING AND DECODING VIDEO USING SUB-PICTURE PARTITIONING
1y 4m to grant Granted Nov 10, 2026
Patent 12784287
METHODS FOR COMPLEXITY REDUCTION OF NEURAL NETWORK BASED VIDEO CODING TOOLS
2y 8m to grant Granted Nov 03, 2026
Patent 12777189
REFERENCE PICTURE LIST SIGNALING IN VIDEO CODING
3y 11m to grant Granted Oct 27, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
72%
Grant Probability
99%
With Interview (+33.2%)
2y 11m (~1y 10m remaining)
Median Time to Grant
Low
PTA Risk
Based on 386 resolved cases by this examiner. Grant probability derived from career allowance 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