CTNF 19/271,427 CTNF 83615 DETAILED ACTION Notice of Pre-AIA or AIA Status 07-03-aia AIA 15-10-aia The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA. Specification 06-11 AIA The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed. Double Patenting 08-33 AIA The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg , 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman , 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi , 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum , 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel , 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington , 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA/25, or PTO/AIA/26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. 08-36 AIA Claim s 1-15 rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1-15 of U.S. Patent No. 12,388,955 B2) in view of Son et al., (U.S. Pub. No. 2018/0091810 A1) . As per claim 1, Ryu teaches a video decoding method (claim 1), comprising: acquiring quad-partitioning information of a block (claim 1, “acquiring quad-partitioning information of a block”); acquiring non-quad-partitioning information of the block in case the acquired quad-partitioning information of the block does not indicate that the block is divided into four partitions (claim 1, claim 1, “acquiring non-quad-partitioning information of the block in case the acquired quad-partitioning information of the block does not indicate that the block is divided into four partitions”); dividing, based on the non-quad-partitioning information or the quad-partitioning information, the block into a plurality of partitions (claim 1, “dividing, based on the non-quad-partitioning information or the quad-partitioning information, the block into a plurality of partitions”); generating a prediction partition of a current partition among the plurality of partitions by performing prediction for the current partition (claim 1, “generating a prediction partition of a current partition among the plurality of partitions by performing prediction for the current partition”); generating a residual partition of the current partition by performing inverse quantization and inverse transform for the current partition (claim 1, “generating a residual partition of the current partition by performing inverse quantization and inverse transform for the current partition”); and reconstructing the current partition based on the prediction partition and the residual partition (claim 1, “and reconstructing the current partition based on the prediction partition and the residual partition”) wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partitioning direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or tri-partitioning (claim 1, “wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partitioning direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or a tri-partitioning”); wherein the bi-partitioning is a portioning type of dividing the block into two partitions of a same size and partitioned depth and tri-partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth (claim 1, “wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth”), wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size (claim 1, “wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size”), wherein the partitioning number information is acquired after acquiring the partition direction information (claim 1, “wherein the partitioning number information is acquired after acquiring the partitioning direction information”), wherein the partitioning direction information and the partitioning number information are both 1 bit flags, respectively (claim 1, “and wherein the partitioning direction information and the partitioning number information are both 1 bit flags, respectively”). Ryu does not explicitly wherein the quad-partitioning information is 1 bit flag, and wherein the four partitioning include a first partitions include a first partitioning having a size of ¼ of the block, a second partitioning having a size of ¼ of the block, a third partition having a size of ¼ of the block, and fourth partition having a size of ¼ of the block. However, Son teaches wherein the quad-partitioning information is 1 bit flag, and wherein the four partitioning include a first partitions include a first partitioning having a size of ¼ of the block, a second partitioning having a size of ¼ of the block, a third partition having a size of ¼ of the block, and fourth partition having a size of ¼ of the block (fig. 3,[0117-0118]). 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 Wang with Ryu in order to improve coding efficiency, [0004]. Claim 2 of the instant application corresponds to claim 2 of U.S. Patent No. 12,388,995 B2. Claim 3 of the instant application corresponds to claim 3 of U.S. Patent No. 12,388,995 B2. Claim 4 of the instant application corresponds to claim 4 of U.S. Patent No. 12,388,995 B2. Claim 5 of the instant application corresponds to claim 5 of U.S. Patent No. 12,388,955 B2. Claim 6 of the instant application is the corresponding video encoding method with the limitations of the video decoding method as recited in claim 1, thus the rejection and analysis made for claim 1 also applies. In addition, Claim 6 of the instant application corresponds to claim 6 of U.S. Patent No. 12,388,955 B2. Claim 7 of the instant application corresponds to claim 7 of U.S. Patent No. 12,388,995 B2. Claim 8 of the instant application corresponds to claim 8 of U.S. Patent No. 12,388,995 B2. Claim 9 of the instant application corresponds to claim 9 of U.S Patent No. 12,388,995 B2. Claim 10 of the instant application corresponds to claim 10 of U.S. Patent No. 12,388,995 B2. Claim 11 of the instant application is the corresponding method for transmitting a bitstream with the limitations of the video decoding method as recited in claim 1, thus the rejection and analysis made for claim 1 also applies here. In addition, claim 11 of the instant application corresponds to claim 11 of U.S. Patent No. 12,388,995 B2. Clam 12 of the instant application corresponds to claim to claim 12 of U.S. Patent No. 12,388,995 B2. Claim 13 of the instant application corresponds to claim 13 of U.S. Patent No. 12,388,995 B2. Claim 14 of the instant application corresponds to claim 14 of U.S. Patent No. 12,388,995 B2. Claim 15 of the instant application corresponds to claim 15 of U.S. Patent No. 12,388,995 B2 . 08-36 AIA Claim s 1-10 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1-10 of U.S. Patent No. 11,870,990 B2 in view of Wang et al., (U.S. Pub. No. 201/0324420 A1) . As per claim 1 , Ryu teaches a video decoding method (claim 1, “a video decoding method”), comprising; acquiring quad-partitioning information of a block (claim 1, “acquiring quad-partitioning information of a block”); acquiring non-quad-partitioning information of the block in case the acquired quad-partitioning information of the block does not indicate that the block is divided into four partitions (claim 1, “acquiring non-quad-partitioning information of the block in case the acquired quad-partitioning information of the block does not indicate that the block is divided into four partitions”); dividing, based on the non-quad-partitioning information or the quad-partitioning information, the block into a plurality of partitions (claim 1, “dividing, based on the non-quad-partitioning information, the block into a plurality of partitions”); generating a prediction partition of a current partition among the plurality of partitions by performing prediction for the current partition (claim 1, “generating a prediction partition of a current partition of a current partition among the plurality of partitions by performing prediction for the current partition”); and reconstructing the current partition based on the prediction partition (claim 1, “and reconstructing the current partition based on the prediction partition”) wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partition direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partition number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or a tri-partitioning (claim 1, “wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partitioning direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or a tri-partitioning”); wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a partitions of same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth (claim 1, “wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth”), wherein a center partitioning of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size (claim 1 “wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size”), wherein the partitioning number information is acquired after acquiring the portioning direction information (claim 1, “wherein the partitioning number information is acquired after acquiring the partitioning direction information”). Ryu does not explicitly disclose generating residual partition of the current partition by performing inverse quantization and inverse transform for the current partition; and reconstructing the current partition based on the prediction partition and the residual partition, wherein the quad-partitioning information is 1 bit flag, and wherein the four partitions include a first partition having a size of ¼ of the block, a second partitioning having a size of ¼ of the block, a third partitioning having a size of ¼ of the block, and a fourth partitioning having a size of ¼ of the block. However, Wang teaches generating residual partition of the current partition by performing inverse quantization and inverse transform for the current partition (fig. 3),and reconstructing the current partition based on the prediction partition and the residual partition (fig. 3), wherein the quad-partitioning information is 1 bit flag, and wherein the four partitions include a first partition having a size of ¼ of the block, a second partitioning having a size of ¼ of the block, a third partitioning having a size of ¼ of the block, and a fourth partitioning having a size of ¼ of the block (fig. 3-4 and [0117-0118]). 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 Son with Ryu for the benefit of improving coding efficiency. Claim 2 of the instant application corresponds to claim 2 of U.S. Patent No.11,870,990 B2. Claim 3 of the instant application corresponds to claim 3 of U.S. Patent No. 11,870,990 B2. Claim 4 of the instant application corresponds to claim 4 of U.S. Patent No. 11,870,990 B2. Claim 5 of the instant application corresponds to claim 5 of U.S. Patent No. 11,870,990 B2. Claim 6 of the instant application is the corresponding video encoding method with the limitations of the video decoding method as recited in claim 1, thus the rejection and analysis made for claim 1 also applies. In addition, Claim 6 of the instant application corresponds to claim 6 of U.S. Patent No. 11,870,990 B2. Claim 7 of the instant application corresponds to claim 7 of U.S. Patent No.11,870,990 B2. Claim 8 of the instant application corresponds to claim 8 of U.S. Patent No. 11,870,990 B2. Claim 9 of the instant application corresponds to claim 9 of U.S. Patent No. 11,870,990 B2. Claim 10 of the instant application corresponds to claim 10 of U.S. Patent No. 11,870,990 B2 . 08-36 AIA Claim s 1-6 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1-6 of U.S. Patent No. 11,563,941 B2 in view of Wang et al., (U.S. Pub. No. 2018/0324420 A1) . As per claim 1 , Ryu teaches a video decoding method (claim 1, “a video decoding method, comprising”) comprising: acquiring quad-partitioning information of the block in case the acquired quad-partitioning information of the block does not indicate that the block is divided into four partitions (claim 1, “acquiring non-quad-partitioning information for non-quad-partitioning o f a block based on quad-partitioning information of the block indicating whether to divide the block into four partitions”); acquiring non-quad-partitioning information of the block in case the acquired quad-partitioning information of the block does not indicate that the block is divided into four partitions (claim 1, “acquiring non-quad-partitioning information for non-quad-partitioning of a block based on quad-partitioning information of the block indicating whether to divide the block into four partitions”); dividing, based on the non-quad-partitioning information or the quad-partitioning information the block into a plurality of partitions (claim 1, “dividing, based on the non-quad-partitioning information, the block into a plurality of partitions”), generating a residual partition of the current partition by performing inverse quantization and inverse transform for the current partition (generating a residual signal of a current partition among the plurality of partitions by performing inverse-quantization and inverse-transform on quantized coefficients of the current partition) ; and reconstructing the current partition based on the residual partition (claim 1, “and generating a reconstructed signal of the current partition based on the residual signal”), wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partition direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or a tri-partitioning (claim 1, “wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partitioning direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or a tri-partitioning”), wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same portioning depth (claim 1, “wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth”), wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size (claim 1, “wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size”), wherein the partitioning number information is acquired after acquiring the partitioning direction information (claim 1, “wherein the partitioning number information is acquired after acquiring the partitioning direction information”), wherein the partitioning direction information and the partitioning number information are both 1 bit flags (claim 1, “ and wherein the partitioning direction information and the partitioning number information are 1 bit flags, respectively”). Ryu does not explicitly disclose generating a prediction partition of a current partition among the plurality of partitions by performing prediction for the current partition; and reconstructing the current partition based on the prediction partition and the residual partition; and wherein the quad-partitioning is 1 bit flag, and wherein the four partitions include a first partition having a size of 1/4 of the block, a second partition having a size of 1/4 of the block, a third partitioning having a size of 1/4 of the block, and a fourth partition having a size of 1/4 of the block. However, Wang teaches generating a prediction partition of a current partition among the plurality of partitions by performing prediction for the current partition (fig. 3) and reconstructing the current partition based on the prediction partition and the residual partition (fig. 3); and wherein the quad-partitioning is 1 bit flag, and wherein the four partitions include a first partition having a size of 1/4 of the block, a second partition having a size of 1/4 of the block, a third partitioning having a size of 1/4 of the block, and a fourth partition having a size of 1/4 of the block ([0117-0118] and figs. 4-5). 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 Wang with Ryu for the benefit of improving decoding efficiency. Claim 2 of the instant application corresponds to claim 2 of U.S. Patent No.11,563,941 B2. Claim 3 of the instant application corresponds to claim 3 of U.S. Patent No. 11,563,941 B2. Claim 4 of the instant application corresponds to claim 4 of U.S. Patent No. 11,563,941 B2. Claim 5 of the instant application corresponds to claim 5 of U.S. Patent No. 11,563,941 B2. As per claim 6 , Ryu teaches a video encoding method (claim 6, “A video encoding method”), comprising: dividing, based on the non-quad-partitioning information or the quad-partitioning information, the block into a plurality of partitions (claim 6, “generating a bitstream by encoding the quantized coefficients of the current partition, wherein non-quad-partitioning information for non- quad-partitioning of the block is encoded based on whether to divide the block into four partitions”); generating a prediction partition of a current partition among the plurality of partitions by performing prediction for the current partition (claim 6), generating a residual partition of the current partition ( claim 6, “generating a residual signal of a current partition among the plurality of partitions based on a prediction signal of the current partition”); wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partitioning direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is bi-partition or a tri-partitioning (claim 6, “wherein non-quad-partitioning information for non-quad-partitioning of the block is encoded based on whether to divide the block into four partitions, wherein the non-quad-partitioning information includes partitioning direction information indicating whether a partitioning direction of the non-quad-partitioning for the block is a vertical direction or a horizontal direction and partitioning number information indicating whether the non-quad-partitioning for the block is a bi-partitioning or a tri-partitioning”) wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth (claim 6, “wherein the bi-partitioning is a partitioning type of dividing the block into two partitions of a same size and partitioning depth and the tri-partitioning is a partitioning type of dividing the block into three partitions of a same partitioning depth”), wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size (claim 6, “wherein a center partition of the three partitions has a size equal to a sum of a size of the other two of the three partitions, and the other two of the three partitions have a same size,”), wherein the partitioning number information is encoded after encoding the partitioning direction information (claim 6, “wherein the partitioning number information is encoded after encoding the partitioning direction information”); wherein the partitioning direction information and the partitioning number information are both 1 bit flags, respectively (claim 6, and wherein the partitioning direction information and the partitioning number information are 1 bit flags, respectively). Ryu does not explicitly disclose encoding quad-partitioning information of a block; encoding non-quad-partitioning information of the block in case the block is not divided into four partitions, reconstructing the current partition based on the predicted partition and the residual partition, wherein the quad-partitioning is 1 bit flag, and wherein the four partitions include a first partition having a size of 1/4 of the block, a second partition having a size of 1/4 of the block, a third partitioning having a size of 1/4 of the block, and a fourth partition having a size of 1/4 of the block. However, Wang teaches encoding quad-partitioning information of a block ([0117-0118]); encoding non-quad-partitioning information of the block in case the block is not divided into four partitions ([0117-0118]); generating a residual partition of the current partition by performing inverse quantization and inverse transform for the current partition (fig. 3); and wherein the quad-partitioning is 1 bit flag, and wherein the four partitions include a first partition having a size of 1/4 of the block, a second partition having a size of 1/4 of the block, a third partitioning having a size of 1/4 of the block, and a fourth partition having a size of 1/4 of the block ([0117-0118] and figs. 4-5). 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 Wang with Ryu for the benefit of improving decoding efficiency . Conclusion 07-96 AIA The prior art made of record and not relied upon is considered pertinent to applicant's disclosure : Song et al., (U.S. Pub. No. 2018/0091810 A1), “Method for Processing Video Signal and Device Thereof” 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 at 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 Application/Control Number: 19/271,427 Page 2 Art Unit: 2486 Application/Control Number: 19/271,427 Page 3 Art Unit: 2486 Application/Control Number: 19/271,427 Page 4 Art Unit: 2486 Application/Control Number: 19/271,427 Page 5 Art Unit: 2486 Application/Control Number: 19/271,427 Page 6 Art Unit: 2486 Application/Control Number: 19/271,427 Page 7 Art Unit: 2486 Application/Control Number: 19/271,427 Page 8 Art Unit: 2486 Application/Control Number: 19/271,427 Page 9 Art Unit: 2486 Application/Control Number: 19/271,427 Page 10 Art Unit: 2486 Application/Control Number: 19/271,427 Page 11 Art Unit: 2486 Application/Control Number: 19/271,427 Page 12 Art Unit: 2486 Application/Control Number: 19/271,427 Page 13 Art Unit: 2486
Prosecution Insights