DETAILED ACTION
This Office Action is a response to an application filed on 05/01/2024, in which claims 1-20 are pending and ready for examination.
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 .
Information Disclosure Statement
The information disclosure statements (IDS) submitted on 05/01/2024, 09/10/2025, and 01/15/2026 are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Claim interpretation
Claim 20’s recitation of a “non-transitory computer readable storage medium storing a bitstream to be decoded by operation 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 computer readable storage medium storing the bitstream (with the structure implied by the method steps). The structure includes the first and second parameters, current block and other information manipulated by the steps.
To be given patentable weight, the computer readable storage medium (a 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 storage 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 storage medium storing the claimed bitstream in claim 20 merely services as a support for the storage of the bitstream and provides no functional relationship between the stored bitstream and storage medium. Therefor 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). Thus, the claim scope is just a storage medium storing data.
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.
Claims 1-20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Zhang (US 2021/0266577 A1).
Regarding claim 1, Zhang discloses: A method of video decoding, comprising:
obtaining, by a decoder (see Zhang, Fig. 17), one or more first parameters based on a first neighbor block of a current block (see Zhang, paragraph 81-82, affine model information, such as affine model type, of the spatial neighboring affine-coded blocks);
obtaining, by the decoder, one or more second parameters based on the first neighbor block or a second neighbor block of the current block (see Zhang, paragraph 81 and 83, obtaining control point motion information);
constructing, by the decoder, one or more affine models by using the one or more first parameters and the one or more second parameters (see Zhang, paragraph 81, 4-parameter or 6-parameter affine model is constructed); and
obtaining, by the decoder, one or more control point motion vectors (CPMVs) for the current block based on the one or more affine models (see Zhang, paragraph 83, using the CP MVs of the current block in the affine merge mode).
Regarding claim 2, Zhang discloses: The method of claim 1, further comprising: obtaining, by the decoder, the first neighbor block from a plurality of adjacent neighbor blocks and a plurality of non-adjacent neighbor blocks, wherein the plurality of adjacent neighbor blocks are adjacent to the current block, and the plurality of non-adjacent neighbor blocks are respectively located at a number of blocks away from one side of the current block (see Zhang, Fig.4 and Fig. 14 and paragraph 653).
Regarding claim 3, Zhang discloses: The method of claim 1, further comprising: obtaining, by the decoder, the second neighbor block from a plurality of inter-coded neighbor blocks of the current block, wherein the plurality of inter-coded neighbor blocks comprise affine coded blocks and non-affine coded blocks (see Zhang, paragraph 192 and 728).
Regarding claim 4, Zhang discloses: The method of claim 1, further comprising: obtaining, by the decoder, the first neighbor block from a plurality of inter-coded neighbor blocks of the current block, wherein the plurality of inter-coded neighbor blocks comprise affine coded blocks (see Zhang, paragraph 728).
Regarding claim 5, Zhang discloses: The method of claim 1, further comprising:
obtaining, by the decoder, the first neighbor block from a plurality of non-adjacent neighbor blocks (see Zhang, Fig. 14) based on a first scanning rule (see Zhang, paragraph 244), wherein the plurality of non-adjacent neighbor blocks are respectively located at a number of blocks away from one side of the current block (see Zhang, Fig. 14); and
obtaining, by the decoder, the second neighbor block from the plurality of non-adjacent neighbor blocks based on a second scanning rule, wherein the second scanning rule is completely or partially same as the first scanning rule (see Zhang, Fig. 14, and paragraph 113 and 244).
Regarding claim 6, Zhang discloses: The method of claim 1, wherein the one or more first parameters comprise a plurality of non-translational parameters associated with an affine model, and the one or more second parameters comprise a plurality of translational parameters associated with the affine model (see Zhang, paragraph 539-540).
Regarding claim 7, Zhang discloses: The method of claim 2, further comprising: in response to determining that the first neighbor block and the second neighbor block use a same reference picture for at least one motion direction, determining, by the decoder, that the first neighbor block and the second neighbor block are valid (see Zhang, paragraph 110 and 244).
Regarding claim 8, Zhang discloses: The method of claim 7, further comprising: in response to determining that the first neighbor block and the second neighbor block use the same reference picture for one motion direction, determining, by the decoder, that a prediction direction of a motion vector candidate formed based on the one or more CPMVs is uni-prediction and the same reference picture is used for the motion vector candidate for the one motion direction (see Zhang, paragraph 222).
Regarding claim 9, Zhang discloses: The method of claim 7, further comprising: in response to determining that the first neighbor block and the second neighbor block use the same reference picture for both motion directions, determining, by the decoder, that a prediction direction and a reference picture of the current block are respectively same as a prediction direction and a reference picture of the first and second neighbor blocks (see Zhang, paragraph 222-223).
Regarding claim 10, Zhang discloses: The method of claim 2, further comprising: in response to determining that the first neighbor block and the second neighbor block use a same resolution for motion vectors (see Zhang, paragraph 220), determining, by the decoder, that the first neighbor block and the second neighbor block are valid (see Zhang, paragraph 244).
Regarding claim 11, Zhang discloses: The method of claim 1, further comprising: constructing, by the decoder, the one or more affine models based on the one or more first parameters (see Zhang, paragraph 73, 4-parameter or 6-parameter type affine model), the one or more second parameters (see Zhang, paragraph 73-74, motion vector information), a first position of the current block, and a second position of the second neighbor block or the first neighbor block (see Zhang, Fig. 2 and paragraph 74).
Regarding claim 12, Zhang discloses: The method of claim 11, wherein the first position comprises a top-left corner of the current block, and the second position comprises a top-left corner of the first or the second neighbor block (see Zhang, Fig. 2 and paragraph 74).
Regarding claim 13, Zhang discloses: The method of claim 1, wherein the one or more first parameters comprise a plurality of parameters associated with an affine model, and the one or more second parameters comprise a plurality of distance parameters (see Zhang, Fig. 14 and paragraph 226, affine type being 6-parameter or 4-parameter type, distance offset table and the offset direction tables are used accordingly).
Regarding claim 14, Zhang discloses: The method of claim 13, wherein the plurality of distance parameters comprise a first distance parameter indicating a horizontal distance between the current block and the second neighbor block, and a second distance parameter indicating a vertical distance between the current block and the second neighbor block (see Zhang, Fig. 14 and paragraph 223-224, x-dir distance and y-dir distance).
Regarding claim 15, Zhang discloses: The method of claim 13, wherein the plurality of distance parameters comprise a first distance parameter indicating a horizontal distance between the current block and the first neighbor block and a second distance parameter indicating a vertical distance between the current block and the first neighbor block (see Zhang, Fig. 14 and paragraph 223-224, x-dir distance and y-dir distance).
Regarding claims 16-19, claims 16-19 are drawn to an apparatus having limitations similar to the method claimed in claims 1-4 treated in the above rejections. Therefore, apparatus claims 16-19 correspond to method claims 1-4 and are rejected for the same reasons of anticipation as used above. Please see Fig. 17 and paragraph 1091 of Zhang for video coding apparatus and CRM used for video coding.
Regarding claim 20, claim 20 is drawn to a computer readable storage medium having limitations similar to the method claimed in claim 1 treated in the above rejections. Therefore, computer readable storage medium claim 20 correspond to method claim 1 and is rejected for the same reasons of anticipation as used above. Please see Fig. 17 and paragraphs 1091 and 1094 of Zhang for video coding apparatus and CRM used for video coding and storing data.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to MARYAM A NASRI whose telephone number is (571)270-7158. The examiner can normally be reached 10:00-8:00 M-T.
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 5712727383. 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.
/MARYAM A NASRI/Primary Examiner, Art Unit 2483