Office Action Predictor
Last updated: April 16, 2026
Application No. 18/870,514

SYSTEMS AND METHODS FOR SIGNALING REFERENCE PICTURE LIST ENTRY INFORMATION IN VIDEO CODING

Non-Final OA §102
Filed
Nov 29, 2024
Examiner
MATT, MARNIE A
Art Unit
2485
Tech Center
2400 — Computer Networks
Assignee
Sharp Kabushiki Kaisha
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
2y 1m
To Grant
96%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allow Rate
402 granted / 456 resolved
+30.2% vs TC avg
Moderate +8% lift
Without
With
+7.6%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 1m
Avg Prosecution
16 currently pending
Career history
472
Total Applications
across all art units

Statute-Specific Performance

§101
5.8%
-34.2% vs TC avg
§103
47.3%
+7.3% vs TC avg
§102
21.8%
-18.2% vs TC avg
§112
14.9%
-25.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 456 resolved cases

Office Action

§102
DETAILED ACTION The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Objections Claim 1 is objected to because of the following informalities: Claim 1 recites “A video encoder of signaling reference picture list entry information for video data, the video encoder comprising:” This should be “A video encoder [of ]signaling reference picture list entry information for video data, the video encoder comprising:” Appropriate correction is required. Claim 2 is objected to because of the following informalities: Claim 2 recites “A video decoder of decoding video data, the video decoder comprising: a processor, and a memory associated with the processor; wherein the processor is configured to:” This should be “A video decoder [of ]decoding video data, the video decoder comprising: a processor, and a memory associated with the processor; wherein the processor is configured to:” Appropriate correction is required. Claim Interpretation Nonfunctional Descriptive Material Claim 3 recites “A non-transitory computer readable recording medium storing a bitstream”. There are no recitations of a processor or other element-merely a bitstream content (a bitstream which is used to reconstruct an image). Under MPEP 2111.05(III), this claim is merely machine-readable media. The Examiner finds that there is no disclosed or claimed functional relationship between the stored bitstream and the medium. Instead, the medium is merely a support or carrier for the bitstream being stored. Therefore, the bitstream stored should not be given patentable weight. See MPEP 2111.05 applying In re Lowry, 32 F.3d 1579, 1583-84, 32 USPQ2d 1031, 1035 (Fed. Cir. 1994); and In re Ngai, 367 F.3d 1336, 70 USPQ2d 1862 (Fed. Cir. 2004). As such, claim 3 is subject to a prior art rejection based on any non-transitory computer readable storage medium known before the earliest effective filing date of the present application. 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)(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. Claim(s) 1-3 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by SJÖBERG, (US 2023/0370627). Regarding claim 1: SJÖBERG teaches a video encoder of signaling reference picture list entry information for video data [¶0015 teaches: The HEVC long-term picture signaling mechanism needs five lists to be generated where each list has detailed description and occupies extensive parts of the specification text.], the video encoder comprising: a processor, and a memory associated with the processor [¶0141 teaches: An encoder can include a processor coupled to a memory, and the processor may be further coupled to a network interface for storage of encoded pictures to a mass memory or for communication through a network.]; wherein the processor is configured to: signal a syntax element specifying a value for a variable specifying an absolute delta picture order count for a short term reference picture [¶0172 teaches: delta_poc_s1_minus1[ i ] plus 1, when i is equal to 0, specifies the difference between the picture order count values of the current picture and the i-th entry in the stRpsIdx-th candidate short-term RPS that has picture order count value greater than that of the current picture, or, when i is greater than 0, specifies the difference between the picture order count values of the i-th entry and the ( i - 1 )-th entry in the current candidate short-term RPS that have picture order count values greater than the picture order count value of the current picture. The value of delta_poc_s1_minus1[ i ] shall be in the range of 0 to 2.sup.15 - 1, inclusive.], wherein the signaled value plus one specifies the value for the variable in a case that a corresponding short term reference picture is a first occurring short term reference picture in a reference picture list [¶0005 teaches: Both encoder and decoder keep track of POC and assign POC values to each picture that is encoded/decoded; and [¶0172 teaches: delta_poc_s1_minus1[ i ] plus 1… current picture, or, when i is greater than 0 (i.e. includes 1 or first occurring short term reference picture)]. Regarding claim 2: this claim recites a decoder which is complementary to the encoder rejected in claim 1. SJÖBERG teaches a video decoder [Both encoder and decoder, ¶0005]. Therefore, the rejection of claim 1 applies equally to this claim. Regarding claim 3: this claim has been interpreted above as nonfunctional descriptive material under MPEP 2111.05(III) and the case law cited therein because claim 3 recites “A non-transitory computer readable recording medium storing a bitstream”. As such, claim 3 is subject to a prior art rejection based on any non-transitory computer readable storage medium known before the earliest effective filing date of the present application. In other words, the proper interpretation of claim 3 is merely a machine-readable media in which the media is merely a support or carrier for the bitstream being stored wherein the bitstream stored and the way such bitstream is generated should not be given patentable weight. SJÖBERG, which is analogous art, discloses non-transitory computer readable storage medium having stored therein a bitstream comprising video information [¶0077 teaches: a computer readable storage medium having stored thereon a bitstream generated according to any of the methods described]. As such, SJÖBERG clearly anticipates the non-transitory, computer-readable storage medium storing a compressed bitstream. Conclusion Prior art not relied upon: Please refer to the references listed in an attached PTO-892 and that are not relied upon for the claim rejections detailed above. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. In particular, WANG et al., (US 2023/0111484) teaches video processing including performing a conversion between a video and a bitstream of the video according to a rule. At least one of the parameter sets of the bitstream includes a general syntax structure; PANG et al., (US 2016/0100189) teaches a video coding device configured to determine a reference picture used for coding the current video block and determine a picture order count (POC) value for the reference picture; QUALCOMM, (CA 2849499) teaches coding reference pictures for a reference picture set; and CHOI et al., (US 2023/0032818) teaches signaling of constraint flags using gate flag in codes video stream. In the case of amending the claimed invention, Applicant is respectfully requested to indicate the portion(s) of the specification which dictate(s) the structure relied on for proper interpretation and also to verify and ascertain the metes and bounds of the claimed invention. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Marnie Matt whose telephone number is (303)297-4255. The examiner can normally be reached Monday - Friday, 8:30-5:00. 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, Jay Patel can be reached on 571-272-2988. 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. /MARNIE A MATT/Primary Examiner, Art Unit 2485
Read full office action

Prosecution Timeline

Nov 29, 2024
Application Filed
Jan 08, 2026
Non-Final Rejection — §102
Apr 01, 2026
Response Filed

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12604246
CHANNEL SWITCHING FOR MULTI-LINK DEVICES
2y 5m to grant Granted Apr 14, 2026
Patent 12593017
METHOD FOR ENCODING AND METHOD FOR DECODING A LUT AND CORRESPONDING DEVICES
2y 5m to grant Granted Mar 31, 2026
Patent 12593033
COLOUR COMPONENT PREDICTION METHOD, ENCODER, DECODER AND STORAGE MEDIUM
2y 5m to grant Granted Mar 31, 2026
Patent 12581121
DEVICE AND METHOD FOR ENCODING VIDEO DATA USING MAXIMUM BIT-DEPTH CONSTRAINT INFORMATION
2y 5m to grant Granted Mar 17, 2026
Patent 12581125
TRUNCATED BIT DEPTH SUPPORT SEI MESSAGES
2y 5m to grant Granted Mar 17, 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
88%
Grant Probability
96%
With Interview (+7.6%)
2y 1m
Median Time to Grant
Low
PTA Risk
Based on 456 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in for Full Analysis

Enter your email to receive a magic link. No password needed.

Free tier: 3 strategy analyses per month