Prosecution Insights
Last updated: April 19, 2026
Application No. 17/787,886

IMAGE CODING APPARATUS AND METHOD BASED ON SUB-PICTURE

Non-Final OA §102§103§112§DP
Filed
Jun 21, 2022
Examiner
CHANG, DANIEL
Art Unit
2487
Tech Center
2400 — Computer Networks
Assignee
LG Electronics Inc.
OA Round
5 (Non-Final)
64%
Grant Probability
Moderate
5-6
OA Rounds
2y 10m
To Grant
76%
With Interview

Examiner Intelligence

Grants 64% of resolved cases
64%
Career Allow Rate
233 granted / 367 resolved
+5.5% vs TC avg
Moderate +13% lift
Without
With
+13.0%
Interview Lift
resolved cases with interview
Typical timeline
2y 10m
Avg Prosecution
45 currently pending
Career history
412
Total Applications
across all art units

Statute-Specific Performance

§101
5.8%
-34.2% vs TC avg
§103
51.4%
+11.4% vs TC avg
§102
11.4%
-28.6% vs TC avg
§112
17.8%
-22.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 367 resolved cases

Office Action

§102 §103 §112 §DP
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 . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on February 4, 2026 has been entered. Response to Amendment This action is in response to the remark entered on February 4, 2026. Claims 21-22, 24-25 & 29-30 are pending in the instant application. Claims 21 & 29-30 are amended. Claims 1-20, 23, 26 & 27-28 are cancelled. Response to Arguments Applicant's remarks filed 02/04/2026, pages 6-8, regarding the rejections under 35 USC 103 and obviousness-type double rejections of claim 21, and similarly claims 29-30, have been fully considered but they are not persuasive. Applicant asserts that Bross does not suggest Applicant’s newly-recited claim limitations. The Examiner respectfully disagrees because Bross reads upon Applicant’s newly-recited claim limitations. In Section 7.3.2.3 Sequence parameter set RBSP syntax and Section 7.3.2.6, Bross states that within picture header RBSP syntax, computer code is read line-by-line from top to bottom, therefore wherein subpics_present_flag, equal to 1, the computer continues to read downwards until encountering sps_loop_filter_across_virtual_boundaries_disabled _present_flag, reading as the claimed SPS virtual boundary present flag, that automatically is restricted to, or being true(1), and further restricting syntax sps_num_ver/hor _virtual_boundaries as the number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries to being in SPS. Therefore Bross still reads on the newly-recited limitations of wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries, and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. Thus, the rejection of claim 21, and similarly claims 29-30 under 35 U.S.C. § 103, and as obviousness-type double patenting is maintained. Applicant’s remarks filed 02/04/2026, page 8, with respect to the patentability of claims 22 & 24-25 under 35 USC 103 and obviousness-type double patenting have been fully considered, but they are not persuasive. Applicant relies on the patentability of the claims from which these claims depend to traverse the rejection without prejudice to any further basis for patentability of these claims based on the additional elements recited. Examiner cannot concur with the Applicant because the combination of Araki & Bross teaches independent claim 21 as outlined below. Thus, claims 22 & 24-25 are also rejected for the similar reasons as outlined below. Patent US 11,647,232 B2 Claims 21-22 & 29-30 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of US 11,647,232 B2 in view of Bross et al.; “Versatile Video Coding (Draft 7),” JVET-P2001, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, October 1-11, 2019 (hereinafter Bross). Instant Application US 11,647,232 B2 21. An image decoding method performed by a decoding apparatus, comprising: 1. An image decoding method performed by a decoding apparatus, comprising: obtaining image information including residual information through a bitstream; obtaining image information including residual information, […] through a bitstream; generating reconstructed samples of a current picture based on the residual information; and generating reconstructed samples, based on the residual samples […]; and generating modified reconstructed samples based on an in-loop filtering process for the reconstructed samples, generating modified reconstructed samples by performing an in-loop filtering process of the reconstructed samples, wherein the image information includes a sequence parameter set (SPS) and a picture header, and wherein the image information includes a sequence parameter set (SPS), and picture header information referring to the SPS, and wherein the SPS includes a subpicture present flag indicating whether subpicture related information is included in the SPS, wherein the subpicture related information includes information on a number of subpictures and information on positions of the subpictures, wherein when the subpicture present flag indicates that the subpicture related information is included in the SPS, information on positions of virtual boundaries is restricted not to be in the picture header. wherein whether additional virtual boundaries-related information is included in the SPS or the picture header information is determined based on whether reference picture resampling is enabled. wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries. and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. As noted above, although the claims are not identical, they are not patentably distinct from each other because the instant application claims of wherein the SPS includes a subpicture present flag indicating whether subpicture related information is included in the SPS, wherein the subpicture related information includes information on a number of subpictures and information on positions of the subpictures, and wherein when the subpicture present flag indicates that the subpicture related information is included in the SPS wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries. and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. However, these limitations are known in the art as described in Bross. Bross, in Section 7.3.2.3 & Section 7.4.3.3, Sequence parameter set RBSP syntax, teaches of the parameter subpics_present_flag, wherein subpics_present_flag equal to 1 specifies that subpicture parameters are present in in the SPS RBSP syntax, that subsequently leads to the SPS including sps_num_subpics_minus1 specifies the number of subpictures, and subpic_ctu_top_left_x[i] specifies horizontal position of top left CTU of i-th subpicture in unit of CtbSizeY, and subpic_ctu_top_left_y[i] specifies vertical position of top left CTU of i-th subpicture in unit of CtbSizeY, and sps_num_ver/hor _virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries, and Section 7.3.2.6 & Section 7.4.3.6, Picture header RBSP syntax, including syntaxes ph_virtual _boundaries_pos_x and ph_virtual_boundaries_pos_y as information on positions of virtual boundaries, and in Section 7.3.2.6 & Section 7.4.3.6, Picture header RBSP syntax, including syntaxes ph_virtual _boundaries_pos_x and ph_virtual_boundaries _pos_y as information on positions of virtual boundaries, and picture header RBSP syntax, wherein subpics_present_flag, equal to 1 leads to sps_loop_filter_across_virtual _boundaries_disabled_present_flag as claimed SPS virtual boundary present flag, restricted to or being true(1) and restricting syntax sps_num_ver/hor _virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries to being in SPS. It would have been obvious to the person of ordinary skill in the art before the effective filing date of the claimed invention to modify claim 1 of US 11,683,532 B2 to integrate subpicture signaling as described in Bross as above, to specify a video coding technology with a compression capability that is substantially beyond that of the prior generations of such standards, and the second is for this technology to be highly versatile for effective use in a broadened range of applications (Bross, Abstract). Regarding claims 22, although the claims are not identical, the further limitations would have been obvious for the same reasons of obviousness as set forth in the rejections outlined below with respect to Bross. Regarding claim 29, claim 29 is drawn to an image encoding method having limitations similar to the image decoding method of using the same as claimed in claim 21 treated in the above rejection. Therefore, method claim 21 corresponds to method claim 29 and is rejected for the same reasons of obviousness as used above. Regarding claim 30, non-transitory computer-readable storage medium claim 30 corresponds to image encoding method 29, and is rejected for the same reasons of obviousness as listed above. Claim 24-25 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of US 11,647,232 B2 and Bross et al.; “Versatile Video Coding (Draft 7),” JVET-P2001, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, October 1-11, 2019 (hereinafter Bross) in view of Chang et al. (US 2021/0076074 A1 with provisional benefit to 62/909,135) (hereinafter Chang). Regarding claims 24-25, although the claims are not identical, the further limitations would have been obvious for the same reasons of obviousness as set forth in the rejections outlined below with respect to Bross and Chang. These are nonstatutory double patenting rejections. Patent US 11,683,532 B2 Claims 21-22 & 29-30 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of US 11,683,532 B2 in view of Bross et al.; “Versatile Video Coding (Draft 7),” JVET-P2001, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, October 1-11, 2019 (hereinafter Bross). Instant Application US 11,683,532 B2 21. An image decoding method performed by a decoding apparatus, comprising: 1. An image decoding method performed by a decoding apparatus, comprising: obtaining image information including residual information through a bitstream; obtaining image information including residual information through a bitstream; generating reconstructed samples of a current picture based on the residual information; and generating reconstructed samples of a current picture, based on the residual information; and generating modified reconstructed samples based on an in-loop filtering process for the reconstructed samples, generating modified reconstructed samples, based on an in-loop filtering process for the reconstructed samples, wherein the image information includes a sequence parameter set (SPS) and a picture header, and wherein the image information includes a sequence parameter set (SPS) and picture header information referring to the SPS wherein the SPS includes a subpicture present flag indicating whether subpicture related information is included in the SPS, wherein the SPS includes a reference picture resampling enabled flag, wherein the reference picture resampling enabled flag is related to whether reference picture resampling is enabled, wherein the subpicture related information includes information on a number of subpictures and information on positions of the subpictures, wherein the additional virtual boundaries-related information includes information on a number of vertical virtual boundaries, information on positions of the vertical virtual boundaries, information on a number of horizontal virtual boundaries, and information on positions of the horizontal virtual boundaries. wherein when the subpicture present flag indicates that the subpicture related information is included in the SPS, information on positions of virtual boundaries is restricted not to be in the picture header, wherein whether additional virtual boundaries-related information is included in the SPS or the picture header information is determined based on the reference picture resampling enabled flag, and wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries. and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. As noted above, although the claims are not identical, they are not patentably distinct from each other because the instant application claims of wherein the SPS includes a subpicture present flag indicating whether subpicture related information is included in the SPS, wherein the subpicture related information includes information on a number of subpictures, wherein the picture header includes information on positions of virtual boundaries, wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. However, these limitations are known in the art as described in Bross. Bross, in Section 7.3.2.3 & Section 7.4.3.3, Sequence parameter set RBSP syntax, teaches of the parameter subpics_present_flag, wherein subpics_present_flag equal to 1 specifies that subpicture parameters are present in in the SPS RBSP syntax, that subsequently leads to the SPS including sps_num_subpics _minus1 specifies the number of subpictures, and subpic_ctu_top_left_x[ i ] specifies horizontal position of top left CTU of i-th subpicture in unit of CtbSizeY, and subpic_ctu_top_left_y[ i ] specifies vertical position of top left CTU of i-th subpicture in unit of CtbSizeY, and sps_num_ver/hor_virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries_pos(x/y)[i] as info on positions of virtual boundaries, Section 7.3.2.6 & Section 7.4.3.6, Picture header RBSP syntax, including syntaxes ph_virtual _boundaries_pos_x and ph_virtual_boundaries _pos_y as information on positions of virtual boundaries, and picture header RBSP syntax, wherein subpics_present_flag, equal to 1 leads to sps_loop_filter_across_virtual _boundaries_disabled_present_flag as claimed SPS virtual boundary present flag, restricted to or being true(1) and restricting syntax sps_num_ver/hor _virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries to being in SPS. It would have been obvious to the person of ordinary skill in the art before the effective filing date of the claimed invention to modify claim 1 of US 11,683,532 B2 to integrate subpicture signaling as described in Bross as above, to specify a video coding technology with a compression capability that is substantially beyond that of the prior generations of such standards, and the second is for this technology to be highly versatile for effective use in a broadened range of applications (Bross, Abstract). Regarding claims 22, although the claims are not identical, the further limitations would have been obvious for the same reasons of obviousness as set forth in the rejections outlined below with respect to Bross. Regarding claim 29, claim 29 is drawn to an image encoding method having limitations similar to the image decoding method of using the same as claimed in claim 21 treated in the above rejection. Therefore, method claim 21 corresponds to method claim 29 and is rejected for the same reasons of obviousness as used above. Regarding claim 30, non-transitory computer-readable storage medium claim 30 corresponds to image encoding method 29, and is rejected for the same reasons of obviousness as listed above. Claim 24-25 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of US 11,683,532 B2 and Bross et al.; “Versatile Video Coding (Draft 7),” JVET-P2001, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, October 1-11, 2019 (hereinafter Bross) in view of Chang et al. (US 2021/0076074 A1 with provisional benefit to 62/909,135) (hereinafter Chang). Regarding claims 24-25, although the claims are not identical, the further limitations would have been obvious for the same reasons of obviousness as set forth in the rejections outlined below with respect to Bross and Chang. These are nonstatutory double patenting rejections. Claim Rejections - 35 USC § 112 The following is a quotation of the first paragraph of 35 U.S.C. 112(a): (a) IN GENERAL.—The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor or joint inventor of carrying out the invention. The following is a quotation of the first paragraph of pre-AIA 35 U.S.C. 112: The specification shall contain a written description of the invention, and of the manner and process of making and using it, in such full, clear, concise, and exact terms as to enable any person skilled in the art to which it pertains, or with which it is most nearly connected, to make and use the same, and shall set forth the best mode contemplated by the inventor of carrying out his invention. Claims 21-22, 24-25 & 29-30 are rejected under 35 U.S.C. 112(a) or 35 U.S.C. 112 (pre-AIA ), first paragraph, as failing to comply with the written description requirement. The claim(s) contains subject matter which was not described in the specification in such a way as to reasonably convey to one skilled in the relevant art that the inventor or a joint inventor, or for applications subject to pre-AIA 35 U.S.C. 112, the inventor(s), at the time the application was filed, had possession of the claimed invention. Specifically, nowhere in the Specification does the Examiner find any indication that wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. Thus the claims are rejected for failing to comply with the written description requirement by introducing new matter. 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 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. (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 30 is rejected under 35 U.S.C. 102(a)(1) as being anticipated by Araki (US 2017/0099501 A1) (hereinafter Araki). Regarding claim 30, a non-transitory computer-readable storage medium storing a bitstream… 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 storage medium storing the bitstream (with the structure implied by the method steps). The structure includes the information and samples manipulated by the steps. “To be given patentable weight, the printed matter and associated product must be in a functional relationship. A functional relationship can be found where the printed matter performs some function with respect to the product to which it is associated.” MPEP §2111.05(I)(A). When a claimed, “non-transitory computer-readable recording medium,” merely serves as a support for information or data, no functional relationship exists. MPEP §2111.05(III). The non-transitory computer-readable recording medium storing the claimed bitstream in claim 19-20 merely services as a support for the storage of the bitstream and provides no functional relationship between the stored bitstream and storage medium. Therefore the bitstream, which scope is implied by the method steps, is non-functional descriptive material and given no patentable weight. MPEP §2111.05(III). Thus, the claim scope is just a storage medium storing data and is anticipated by Araki which recites in Paragraph [0082]-[0084] & [0262]-[0264], wherein the accumulation buffer reads as the non-transitory computer-readable storage medium accumulating encoding data, wherein buffer is a memory comprising RAM, ROM, hard disk. 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 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 of this title, 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. Claims 21-22 & 29-30 are rejected under 35 U.S.C. 103 as being unpatentable over Araki (US 2017/0099501 A1) (hereinafter Araki) in view of Bross et al.; “Versatile Video Coding (Draft 7),” JVET-P2001, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, October 1-11, 2019 (hereinafter Bross). Regarding claim 21, Araki discloses an image decoding method performed by a decoding apparatus [Abstract, method and device for image decoding], the method comprising: obtaining image information including residual information through a bitstream [Paragraph [0084]-[0089], accumulation buffer receives transmitted encoding data that includes residual data]; generating reconstructed samples of a current picture based on the residual information [Paragraph [0089]-[0090], Computation unit 115 adds difference image (residual information) and prediction image to obtain reconstructed image containing reconstructed samples]; and generating modified reconstructed samples based on an in-loop filtering process for the reconstructed samples [Paragraph [0090]-[0093], Loop filter 116 generates decoded image as modified reconstructed samples by performing loop filter upon reconstructed image as in-loop filtering process], wherein the image information includes a sequence parameter set (SPS) and a picture header [Paragraph [0070], [0081] & [0100]-[0105], bitstream including SPS and slice header]. However, Araki does not explicitly disclose wherein the SPS includes a subpicture present flag indicating whether subpicture related information is included in the SPS, wherein the subpicture related information includes information on a number of subpictures and information on positions of the subpictures, wherein when the subpicture present flag indicates that the subpicture related information is included in the SPS, information on positions of virtual boundaries is restricted not to be included in the picture header, wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries. and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS. Bross teaches wherein the SPS includes a subpicture present flag indicating whether subpicture related information is included in the SPS [Section 7.3.2.3 Sequence parameter set RBSP syntax, subpics_present_flag, wherein subpics_present_flag equal to 1 specifies that subpicture parameters are present in the SPS RBSP syntax], wherein the subpicture related information includes information on a number of subpictures and information on positions of the subpictures [Section 7.3.2.3 & Section 7.4.3.3, Sequence parameter set RBSP syntax, sps_num_subpics_minus1 specifies the number of subpictures, and subpic _ctu_top_left_x[ i ] specifies horizontal position of top left CTU of i-th subpicture in unit of CtbSizeY, and subpic_ctu_top_left_y[ i ] specifies vertical position of top left CTU of i-th subpicture in unit of CtbSizeY], wherein when the subpicture present flag indicates that the subpicture related information is included in the SPS, information on positions of virtual boundaries is restricted not to be included in the picture header [Section 7.3.2.3 Sequence parameter set RBSP syntax, Section 7.3.2.6 Picture header RBSP syntax, wherein subpics_present_flag, equal to 1 leads to sps_loop_filter_across_virtual _boundaries_disabled_present_flag being true and restricting syntax sps_num_ver/hor _virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries to being in SPS, and resulting in if( !sps_loop_filter_across_virtual _boundaries_disabled_present_flag ) within the Picture header to not include information ph_virtual_boundaries_pos_x/y[i]], wherein the SPS includes an SPS virtual boundary present flag related to whether the SPS includes the information on the positions of the virtual boundaries, and wherein the SPS virtual boundary present flag is restricted to have a value of 1 based on the subpicture present flag indicating that the subpicture related information is included in the SPS [Section 7.3.2.3 Sequence parameter set RBSP syntax, Section 7.3.2.6 Picture header RBSP syntax, wherein subpics_present_flag, equal to 1 leads to sps_loop_filter_across_virtual _boundaries_disabled_present_flag as claimed SPS virtual boundary present flag, restricted to or being true(1) and restricting syntax sps_num_ver/hor _virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries to being in SPS]. It would have been obvious to the person of ordinary skill in the art before the effective filing date of the claimed invention to modify the method disclosed by Araki to integrate subpicture signaling as described in Bross as above, to specify a video coding technology with a compression capability that is substantially beyond that of the prior generations of such standards, and the second is for this technology to be highly versatile for effective use in a broadened range of applications (Bross, Abstract). Regarding claim 22, Araki and Bross disclose the image decoding method of claim 21, and are analyzed as previously discussed with respect to the claim. Furthermore, Bross teaches wherein the information on the positions of the virtual boundaries comprises information on positions of vertical virtual boundaries and information on positions of horizontal virtual boundaries [Section 7.3.2.3 Sequence parameter set RBSP syntax, SPS including sps_num_ver/hor _virtual_boundaries as number of virtual boundaries and sps_virtual_boundaries _pos(x/y)[i] as info on positions of virtual boundaries]. It would have been obvious to the person of ordinary skill in the art before the effective filing date of the claimed invention to modify the method disclosed by Araki to integrate subpicture signaling as described in Bross as above, to specify a video coding technology with a compression capability that is substantially beyond that of the prior generations of such standards, and the second is for this technology to be highly versatile for effective use in a broadened range of applications (Bross, Abstract). Regarding claim 29, claim 29 is drawn to an image encoding method having limitations similar to the image decoding method of using the same as claimed in claim 21 treated in the above rejection. Therefore, method claim 21 corresponds to method claim 29 and is rejected for the same reasons of obviousness as used above. Furthermore, Araki discloses of an image encoding method [Paragraph [0241], multi-view image encoding scheme]. Regarding claim 30, non-transitory computer-readable storage medium claim 30 corresponds to image encoding method 29, and is rejected for the same reasons of obviousness as listed above. Furthermore, Araki discloses a non-transitory computer-readable storage medium storing a bitstream generated by an image encoding method [Paragraph [0082]-[0084] & [0262]-[0264], accumulation buffer as non-transitory computer-readable storage medium accumulating encoding data, wherein buffer is a memory comprising RAM, ROM, hard disk]. Claims 24-25 are rejected under 35 U.S.C. 103 as being unpatentable over Araki (US 2017/0099501 A1) (hereinafter Araki) and Bross et al.; “Versatile Video Coding (Draft 7),” JVET-P2001, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 16th Meeting: Geneva, CH, October 1-11, 2019 (hereinafter Bross) in view of Chang et al. (US 2021/0076074 A1 with provisional benefit to 62/909,135) (hereinafter Chang). Regarding claim 24, Araki and Bross disclose the image decoding method of claim 21, and are analyzed as previously discussed with respect to the claim. However neither Araki nor Bross teach or suggest the particulars of claim 24. Chang teaches wherein the current picture comprises the subpictures and tiles, and wherein coding tree units (CTUs) in one tile belong to a same subpicture [Paragraph [0044]-[0047] & [0139]-[0144], supported in Paragraph [0038]-[0040] & [0065]-[0075] in provisional, CTUs belong to a brick that is a row of CTUs within a tile, and tiles are within a subpicture/slice]. It would have been obvious to the person of ordinary skill in the art before the effective filing date of the claimed invention to modify the method disclosed by Araki to integrate subpicture signaling as described in Chang as above, to simplify coder design and avoid inconsistencies that may lead to incorrect encoding or incorrect decoding (Chang, Paragraph [0021]). Regarding claim 25, Araki and Bross disclose the image decoding method of claim 21, and are analyzed as previously discussed with respect to the claim. However neither Araki nor Bross teach or suggest the particulars of claim 25. Chang teaches wherein the current picture comprises the subpictures and tiles, and wherein coding tree units (CTUs) in one subpicture belong to a same tile [Paragraph [0044]-[0047] & [0139]-[0144], supported in Paragraph [0038]-[0040] & [0065]-[0075] in provisional, CTUs belong to a brick that is a row of CTUs that is within a tile, and tiles are within a subpicture/slice]. It would have been obvious to the person of ordinary skill in the art before the effective filing date of the claimed invention to modify the method disclosed by Araki to integrate subpicture signaling as described in Chang as above, to simplify coder design and avoid inconsistencies that may lead to incorrect encoding or incorrect decoding (Chang, Paragraph [0021]). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to DANIEL CHANG whose telephone number is (571)272-5707. The examiner can normally be reached M-Sa, 12PM - 10 PM. 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, David Czekaj can be reached at 571-272-7327. 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. /DANIEL CHANG/Primary Examiner, Art Unit 2487
Read full office action

Prosecution Timeline

Jun 21, 2022
Application Filed
Mar 16, 2024
Non-Final Rejection — §102, §103, §112
Jun 20, 2024
Response Filed
Oct 01, 2024
Final Rejection — §102, §103, §112
Nov 25, 2024
Response after Non-Final Action
Dec 20, 2024
Response after Non-Final Action
Dec 20, 2024
Applicant Interview (Telephonic)
Feb 04, 2025
Request for Continued Examination
Feb 06, 2025
Response after Non-Final Action
May 03, 2025
Non-Final Rejection — §102, §103, §112
Jul 24, 2025
Response Filed
Oct 31, 2025
Final Rejection — §102, §103, §112
Dec 19, 2025
Response after Non-Final Action
Feb 04, 2026
Request for Continued Examination
Feb 20, 2026
Response after Non-Final Action
Mar 21, 2026
Non-Final Rejection — §102, §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12593069
LOW MEMORY DESIGN FOR MULTIPLE REFERENCE LINE SELECTION SCHEME
2y 5m to grant Granted Mar 31, 2026
Patent 12587672
DECOUPLED MODE INFERENCE AND PREDICTION
2y 5m to grant Granted Mar 24, 2026
Patent 12574541
IMAGE PROCESSING METHOD AND ASSOCIATED IMAGE PROCESSING CIRCUIT
2y 5m to grant Granted Mar 10, 2026
Patent 12570145
AUTOSTEREOSCOPIC CAMPFIRE DISPLAY
2y 5m to grant Granted Mar 10, 2026
Patent 12574513
METHOD AND DEVICE FOR ENCODING/DECODING VIDEO SIGNAL BY USING OPTIMIZED CONVERSION BASED ON MULTIPLE GRAPH-BASED MODEL
2y 5m to grant Granted Mar 10, 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

5-6
Expected OA Rounds
64%
Grant Probability
76%
With Interview (+13.0%)
2y 10m
Median Time to Grant
High
PTA Risk
Based on 367 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