Prosecution Insights
Last updated: April 19, 2026
Application No. 18/923,584

IMAGE ENCODING/DECODING METHOD AND DEVICE, AND RECORDING MEDIUM IN WHICH BITSTREAM IS STORED

Non-Final OA §102§103
Filed
Oct 22, 2024
Examiner
HOLDER, ANNER N
Art Unit
2483
Tech Center
2400 — Computer Networks
Assignee
ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
OA Round
1 (Non-Final)
78%
Grant Probability
Favorable
1-2
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 §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 . Priority Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55. Information Disclosure Statement The information disclosure statement (IDS) submitted on are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Allowable Subject Matter Claim is 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. Claim Interpretation Claim 9 recitation of “a bitstream that is generated by an image encoding method, the image encoding method comprising…” is a product by process claim limitation where the product is the bitstream and the process is the method steps to generate the bitstream. MPEP §2113 recites “Product-by-Process claims are not limited to the manipulations of the recited steps, only the structure implied by the steps”. Thus, the scope of the claim is the recording medium storing the bitstream (with the structure implied by the method steps). The structure includes the current block, merge list and other information manipulated by the steps. To be given patentable weight, recording medium and the bitstream (i.e. descriptive material) must be in a functional relationship. A functional relationship can be found where the descriptive material performs some function with respect to the recording medium to which it is associated. See MPEP §2111.05(I)(A). When a claimed “computer-readable medium merely serves as a support for information or data, no functional relationship exists”. MPEP §2111.05(III). The recording medium storing the claimed bitstream in claim 9 merely services as a support for the storing of the bitstream and provides no functional relationship between the stored bitstream and recording medium. Therefore the structure of the bitstream, which scope is implied by the method steps, is non-functional descriptive material and given no patentable weight. MPEP §2111.05(III). 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) 9 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Ikai et al. US 2018/0041762. As to claim 9, Oh teaches a computer-readable recording medium storing a bitstream that is generated by an image encoding method, the image encoding method comprising: constructing a merge candidate list of a current block; in response to a merge mode with prediction unit partitioning being applied to the current block, selecting two merge candidates from the merge candidate list of the current block; obtaining two motion information of the current block from the two merge candidates; and generating a prediction block of the current block based on the two motion information of the current block, wherein two pieces of index information are explicitly encoded for selecting the two merge candidates from the merge candidate list block, the motion information of the current block is used to update the candidate list, and the candidate list is used for inter prediction of a block to be decoded after the current block. [¶ 0416; see Claim Interpretation above] Claim(s) 1-5 and 8 is/are rejected under 35 U.S.C. 102(a)(2) as being anticipated by Oh et al. US 2018/0152710. As to claim 1, Oh teaches a method of decoding an image, the method comprising: constructing a merge candidate list of a current block; [fig. 3; fig. 12; abstract; ¶ 0081-0086; ¶ 0114-0116] in response to a merge mode with prediction unit partitioning being applied to the current block, selecting two merge candidates from the merge candidate list of the current block; [fig. 3; fig. 12; abstract; ¶ 0050-0051; ¶ 0081-0086; ¶ 0114-0116] obtaining two motion information of the current block from the two merge candidates; [fig. 3; fig. 12; ¶ 0051; ¶ 0081-0086] and generating a prediction block of the current block based on the two motion information of the current block, wherein two pieces of index information are explicitly signaled for selecting the two merge candidates from the merge candidate list. [abstract; ¶ 0031-0033; ¶ 0052-0055; ¶ 0081-0086; ¶ 0105-0116] As to claim 2, Oh teaches the limitations of claim 1. Oh teaches wherein the prediction block of the current block is generated based on a first reference block specified by first motion information of the current block and a second reference block specified by second motion information of the current block. [¶ 0032; ¶ 0049-0052; ¶ 0102-0106] As to claim 3, Oh teaches the limitations of claim 1. Oh teaches wherein the two merge candidates are selected from a reduced merge candidate list, a number of merge candidates included in the reduced merge candidate list being smaller than a number of merge candidates included in the merge candidate list. [¶ 0081-0086; ¶ 0114-0117] As to claim 4, Oh teaches the limitations of claim 3. Oh teaches wherein the number of merge candidates in the reduced merge candidate list is determined based on information representing a difference between the number of merge candidates in the reduced merge candidate list and the number of merge candidates included in the merge candidate list. [¶ 0082-0084; ¶ 0115-0116] As to claim 5, Oh teaches the limitations of claim 1. Oh teaches wherein after inserting at least one spatial merge candidate and the temporal merge candidate to the merge candidate list, the merge candidate list is updated based on a motion information candidate list, the motion information candidate list including motion information candidates derived from blocks decoded before the current block. [¶ 0007-0008; ¶ 0081-0086; ¶ 0115-0117] As to claim 8, Oh teaches a method of encoding an image, the method comprising: constructing a merge candidate list of a current block; [fig. 3; fig. 12; abstract; ¶ 0081-0086; ¶ 0114-0116] in response to a merge mode with prediction unit partitioning being applied to the current block, selecting two merge candidates from the merge candidate list of the current block; [fig. 3; fig. 12; abstract; ¶ 0050-0051; ¶ 0081-0086; ¶ 0114-0116] obtaining two motion information of the current block from the two merge candidates; [fig. 3; fig. 12; ¶ 0051; ¶ 0081-0086] and generating a prediction block of the current block based on the two motion information of the current block, wherein two pieces of index information are explicitly encoded for selecting the two merge candidates from the merge candidate list. [abstract; ¶ 0031-0033; ¶ 0052-0055; ¶ 0081-0086; ¶ 0105-0116] 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. Claim(s) 6 is/are rejected under 35 U.S.C. 103 as being unpatentable over Oh et al. US 2018/0152710 in view of Li et al. US 10,397,603. As to claim 6, Oh teaches the limitations of claim 5. Oh teaches wherein the merge candidate list of the current block is updated by adding at least one motion information candidate included in the motion information candidate list as a new merge candidate. [¶ 0007-0008; ¶ 0081-0086; ¶ 0115-0117] Oh does not explicitly teach wherein, for two motion information candidates in the motion information candidate list, whether a motion information candidate is available as the new merge candidate or not is determined based on a result of a redundancy check with merge candidates in the merge candidate list, and wherein, for remaining motion information candidates excluding the two motion information candidates in the motion information candidate list, whether a motion information candidate is available as the new merge candidate or not is determined regardless of the result of the redundancy check with the merge candidates in the merge candidate list. Li teaches wherein, for two motion information candidates in the motion information candidate list, whether a motion information candidate is available as the new merge candidate or not is determined based on a result of a redundancy check with merge candidates in the merge candidate list, [col. 22 lines 48-57; col. 24 lines 1-50] and wherein, for remaining motion information candidates excluding the two motion information candidates in the motion information candidate list, whether a motion information candidate is available as the new merge candidate or not is determined regardless of the result of the redundancy check with the merge candidates in the merge candidate list. [col. 22 lines 48-57; col. 24 lines 1-50] It would have been obvious to one of ordinary skill in the art before the effective filing date to incorporate the techniques of Li with the teachings of Oh allowing for improved coding efficiency. Conclusion 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 22, 2024
Application Filed
Dec 27, 2025
Non-Final Rejection — §102, §103 (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

1-2
Expected OA Rounds
78%
Grant Probability
92%
With Interview (+14.0%)
3y 1m
Median Time to Grant
Low
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