Prosecution Insights
Last updated: July 17, 2026
Application No. 18/364,293

Image Encoding/Decoding Method, Apparatus, and Recording Medium for Storing Bitstream

Non-Final OA §103
Filed
Aug 02, 2023
Priority
Jan 02, 2017 — RE 10-2017-0000205 +4 more
Examiner
PRINCE, JESSICA MARIE
Art Unit
2486
Tech Center
2400 — Computer Networks
Assignee
LX Semicon Co., Ltd.
OA Round
4 (Non-Final)
77%
Grant Probability
Favorable
4-5
OA Rounds
2m
Est. Remaining
93%
With Interview

Examiner Intelligence

Grants 77% — above average
77%
Career Allowance Rate
555 granted / 721 resolved
+19.0% vs TC avg
Strong +16% interview lift
Without
With
+15.6%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
21 currently pending
Career history
747
Total Applications
across all art units

Statute-Specific Performance

§101
1.8%
-38.2% vs TC avg
§103
79.0%
+39.0% vs TC avg
§102
7.2%
-32.8% vs TC avg
§112
5.1%
-34.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 721 resolved cases

Office Action

§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 . Response to Arguments Applicant’s arguments with respect to claim(s) 1-3, 6-10, 13-15, and 18-19 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claim(s) 1-3, 6, 8-10, 13, 15, 18 is/are rejected under 35 U.S.C. 103 as being unpatentable over Li et al., (U.S. Pub. No. 2017/0208336 A1) in view of Piao et al., (U.S. Pub. No. 2019/0281285 A1). As per claim 1, Li teaches an image decoding method performed by a decoding apparatus (abstract and fig. 9): receiving partition information for a current coding block ([0055], [0135-0136]); partitioning the current coding block into a plurality of sub-coding blocks based on the partition information (figs. 4-7; [0078-0079]); performing intra prediction for each of the plurality of sub-coding blocks ([0053]; figs. 1, 9); generating a reconstructed picture based on the intra prediction ([0063], [0083]; figs. 1, 9), wherein the current coding block includes three sub-coding blocks partitioned from the current coding blocks ([0085], [0088-0089], and figs. 4-7). Li does not explicitly disclose current coding bock is directly partitioned into a first sub-coding block having a rectangular shape, a second sub-coding block having a square block, and a third sub-coding block having a square shape, and wherein a size of the current coding block is 2Nx2N, a size of the first sub-coding block is 2NxN, a size of the second sub-coding block is NxN and a size of the third sub-coding block is NxN, and wherein the first sub-coding block, the second sub-coding block and the third sub-coding block are symmetrical with respect to a vertical center line of the current coding block. However, Piao teaches the current coding block is directly partitioned into a first sub-coding block having a first rectangular shape, a second sub-coding block having a square block, and a third sub-coding block having a square shape, and wherein a size of the current block is 2Nx2N, a size of the first sub-coding block is 2NxN, a size of the second sub-coding block is NxN and a size of the third sub-coding block is NxN ([0077], [0085], and at least figs. 9- 10, and wherein the first sub-coding block, the second sub-coding block and the third sub-coding block are symmetrical with respect to a vertical center line of the current coding block (figs. 9-10). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to incorporate the teachings of Piao with Li for the benefit of improving coding efficiency. As per claim 2, Li (modified by Piao) as a whole teaches everything as claimed above, see claim 1. In addition, Li teaches wherein the current coding block is partitioned into the three sub-coding blocks in a vertical direction (figs 4-. 7; [0073-0074], [0078-0079], [0120]). As per claim 3, Li (modified by Piao) as a whole teaches everything as claimed above, see claim 1. In addition, Li teaches wherein the current coding block is partitioned into the three sub-coding blocks in a horizontal direction (figs. 4-7; [0073-0074], [0078-0079], [0120]). As per claim 6, Li (modified by Piao) as a whole teaches everything as claimed above, see claim 1. In addition, Li teaches wherein depths of the first sub-coding block, the second sub-coding block, and the third sub-coding block are the same (fig. 4B el. 57-59). As per claim 8, Li teaches an image encoding method performed by an image encoding apparatus ([0009] and figs. 1 and 8), the image decoding method comprising: partitioning a current coding block into a plurality of sub-coding blocks (figs. 2, 4A-7, abstract, [0007], [0047-0049], [0073], [0079]), performing intra prediction for each of the plurality of sub-coding blocks ([0053]; figs. 1, 9); and encoding image information comprising partition information for the plurality of sub-coding block ([0007], [0049-0050], [0073] and fig. 4B); wherein the current coding block is partitioned into three sub-coding block includes three sub-coding blocks partitioned from the current block (fig. 4A-6E). Li does not explicitly disclose current coding bock is directly partitioned into a first sub-coding block having a rectangular shape, a second sub-coding block having a square block, and a third sub-coding block having a square shape, and wherein a size of the current coding block is 2Nx2N, a size of the first sub-coding block is 2NxN, a size of the second sub-coding block is NxN and a size of the third sub-coding block is NxN, and wherein the first sub-coding block, the second sub-coding block, and the third sub-coding block are symmetrical with respect to a vertical center line of the current coding block. However, Piao teaches the current coding block is directly partitioned into a first sub-coding block having a first rectangular shape, a second sub-coding block having a square block, and a third sub-coding block having a square shape, and wherein a size of the current block is 2Nx2N, a size of the first sub-coding block is 2NxN, a size of the second sub-coding block is NxN and a size of the third sub-coding block is NxN ([0077], [0085], and at least figs. 9- 10, and wherein the first sub-coding block, the second sub-coding block and the third sub-coding block are symmetrical with respect to a vertical center line of the current coding block (figs. 9-10). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to incorporate the teachings of Piao with Li for the benefit of improving coding efficiency. As per claim 9, which is the corresponding image encoding method with the limitations of the decoding method as recited in claim 2, thus the rejection and analysis made for claim 2 also applies here. As per claim 10, which is the corresponding image encoding method with the limitations of the decoding method as recited in claim 3, thus the rejection and analysis made for claim 3 also applies here. As per claim 13, which is the corresponding image encoding method with the limitations of the decoding method as recited in claim 6, thus the rejection and analysis made for claim 6 also applies here. As per claim 15, Li teaches a transmission method for image data, the method comprising: obtaining a bitstream for the image data (figs. 1, 8, 11), wherein the bitstream is generated based on partitioning a current coding block into a plurality of sub-coding blocks (figs. 2, 4A-7, 10A-11 and [0007], [0047-0049], [0073], [0079]), performing intra prediction for each of the plurality of sub-coding blocks ([0053]; figs. 1, 9, 11); and encoding image information comprising partition information for the plurality of sub-coding blocks (([0007], [0049-0050], [0073] and figs. 4B, 10A-10B); and transmitting the image data comprising the bitstream (figs. 1 and 8), wherein the current coding block includes three sub-coding blocks partitioned from the current coding block (fig. 4A-6E). Li does not explicitly disclose current coding bock is directly partitioned into a first sub-coding block having a rectangular shape, a second sub-coding block having a square block, and a third sub-coding block having a square shape, and wherein a size of the current coding block is 2Nx2N, a size of the first sub-coding block is 2NxN, a size of the second sub-coding block is NxN and a size of the third sub-coding block is NxN, and wherein the first sub-coding block, the second sub-coding block and the third sub-coding block are symmetrical with respect to a vertical center line of the current coding block. However, Piao teaches the current coding block is directly partitioned into a first sub-coding block having a first rectangular shape, a second sub-coding block having a square block, and a third sub-coding block having a square shape, and wherein a size of the current block is 2Nx2N, a size of the first sub-coding block is 2NxN, a size of the second sub-coding block is NxN and a size of the third sub-coding block is NxN ([0077], [0085], and at least figs. 9- 10, and wherein the first sub-coding block, the second sub-coding block and the third sub-coding block are symmetrical with respect to a vertical center line of the current coding block (figs. 9-10). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to incorporate the teachings of Piao with Li for the benefit of improving coding efficiency. As per claim 18, which is the corresponding transmission method with the limitations of the decoding method as recited in claim 6, thus the rejection and analysis made for claim 6 also applies here. Claim(s) 7, 14 and 19 is/are rejected under 35 U.S.C. 103 as being unpatentable over Li et al., in view of Piao et al., (U.S. Pub. No. 2019/0281285 A1) and further in view of Kim et al., (U.S. Pub. No. 2015/0358618 A1). As per claim 7, Li (modified by Piao) as a whole teaches everything as claimed above, see claim 1. Li does not explicitly disclose wherein the intra prediction for the plurality of sub-blocks are performed based on a raster scan order. However, Kim teaches wherein the intra prediction for the plurality of sub-blocks are performed based on a raster scan order (figs. 4-6; [0056], [0066] and [0076]). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the invention to incorporate the teachings of Kim with Li (modified by Piao) in order to improve the accuracy of prediction on a current block to be encoded or decoded in encoding or decoding an image, and thus provide a satisfactory image reproduction quality for the image by improved coding efficiency, [0008]. As per claim 14, which is the corresponding image encoding method with the limitations of the decoding method as recited in claim 7, thus the rejection and analysis made for claim 7 also applies here. As per claim 19, which is the corresponding transmission method with the limitations of the decoding method as recited in claim 7, thus the rejection and analysis made for claim 7 also applies here. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JESSICA PRINCE whose telephone number is (571)270-1821. The examiner can normally be reached M-F 7:30-3:30 P.M.. 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, Jamie Atala can be reached on 571-272-7384. 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. JESSICA PRINCE Examiner Art Unit 2486 /JESSICA M PRINCE/Primary Examiner, Art Unit 2486
Read full office action

Prosecution Timeline

Show 2 earlier events
Mar 21, 2025
Non-Final Rejection mailed — §103
Jun 23, 2025
Response Filed
Aug 19, 2025
Final Rejection mailed — §103
Oct 20, 2025
Request for Continued Examination
Oct 29, 2025
Response after Non-Final Action
Dec 17, 2025
Non-Final Rejection mailed — §103
Mar 17, 2026
Response Filed
Jun 03, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12676961
DEVICE AND METHOD FOR DECODING VIDEO DATA
2y 0m to grant Granted Jul 07, 2026
Patent 12647557
METHOD AND APPARATUS FOR PROCESSING IMAGE SIGNAL
1y 8m to grant Granted Jun 02, 2026
Patent 12641241
APPARATUS AND METHOD FOR IMAGE CODING BASED ON FILTERING
1y 8m to grant Granted May 26, 2026
Patent 12634498
VIDEO ENCODING/DECODING METHOD, DEVICE, AND RECORDING MEDIUM STORING BITSTREAM THEREIN
1y 9m to grant Granted May 19, 2026
Patent 12627829
SYSTEMS AND METHODS FOR OPTICAL FLOW-BASED MOTION VECTOR REFINEMENT
2y 1m to grant Granted May 12, 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

4-5
Expected OA Rounds
77%
Grant Probability
93%
With Interview (+15.6%)
3y 2m (~2m remaining)
Median Time to Grant
High
PTA Risk
Based on 721 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