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 filed 12/24/2025 have been fully considered but they are not persuasive
Main Argument (pages 7- 8) under Remarks:
Applicant argues that claim 1 of U.S. Patent No. 12,238,284 does not recite that the second minimum size is set equal to twice as much as a first minimum size.
In response, the examiner respectfully disagrees. Claim 1 of U.S. Patent No. 12,238,284 recites that the first minimum size of a coding unit multiplied by 2, then continues to teaches that the second minimum size of the coding unit multiplied by 4. Therefore the second minimum is twice the first minimum.
Double Patenting
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.
Claim 1-3 rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No. 12,238,284 B2. Although the claims at issue are not identical, they are not patentably distinct from each other because U.S. Patent No. 12,238,284 B2 discloses the same video coding/decoding method configured to hierarchically split a codding node. See Table 1 for more details.
Pending Application
U.S. Patent No. US 12,238,284 B2
Claim 1:
An image decoding apparatus for decoding a picture for each of coding tree units, the image decoding apparatus comprising:
coding node (CN) information decoding circuitry configured to perform a binary tree (BT) split possibility determination based on a width of a target node, a height of the target node, a first minimum size, a first maximum size and a level of hierarchy of the target node,
perform a ternary tree (TT) split possibility determination based on the width of the target node, the height of the target node, a second minimum size, a second maximum size and the level of hierarchy of the target node,
determine whether or not decoding of a partition tree (PT) split flag is required, wherein the PT split flag indicates whether or not the target node is to be split by a binary tree split or a ternary tree split,
decode the PT split flag in a case that decoding of the PT split flag is required,
determine whether or not decoding of a split direction flag is required in a case that the PT split flag indicates that the target node is to be split by the binary tree split or the ternary tree split, wherein the split direction flag indicates a split direction,
decode the split direction flag in a case that decoding of the split direction flag is required,
determine whether or not decoding of a split mode selection flag is required, wherein the split mode selection flag indicates a split method which is the binary tree split or the ternary tree split,
decode the split mode selection flag in a case that decoding of split mode selection flag is required, and
split the target node of the coding tree units by the binary tree split or the ternary tree split based on the split direction flag and the split mode selection flag, wherein
the CN information decoding circuitry further determines additional conditions of the BT split possibility determination, in a case that the target node is a middle node of three nodes obtained by performing the ternary tree split on an immediately higher node, the CN information decoding circuitry prohibits split of the target node by the binary tree split in a direction identical to a direction of the ternary tree split performed on the immediately higher node,
the CN information decoding circuitry determines the BT split possibility determination based on the first minimum size and the CN information decoding circuitry determines the TT split possibility determination based on the second minimum size, where the second minimum size is set equal to twice as much as the first minimum size.
Claim 1:
An image decoding method for decoding a picture for each of coding tree units, the image decoding method comprising:
performing a binary tree (BT) split possibility determination based on (1) a width of a target block or a height of the target block being greater than or equal to a first minimum size of a coding unit multiplied by 2, (2) the width and the height being less than or equal to a first maximum size of the coding unit, and (3) a depth indicating a level of hierarchy of the target block being less than a maximum depth,
performing a ternary tree (TT) split possibility determination based on (1) the width or the height being greater than or equal to a second minimum size of the coding unit multiplied by 4, (2) the width and the height being less than or equal to a second maximum size of the coding unit, and (3) the depth being less than the maximum depth,
determining whether or not decoding of a partition tree (PT) split flag is required, wherein the PT split flag indicates whether or not the target block is to be split by a BT split or a TT split,
decoding the PT split flag in a case that decoding of the PT split flag is required,
in a case that the PT split flag indicates that the target block is to be split by the BT split or the TT split, determining whether or not decoding of a split direction flag is required and decoding the split direction flag in a case that decoding of the split direction flag is required, wherein the spilt direction flag indicates a split direction of the target block,
determining whether or not decoding of a split mode selection flag is required, wherein the split mode selection flag indicates a split method which is the BT split or TT split,
decoding the split mode selection flag in a case that decoding of the split mode selection flag is required,
splitting the target block by the BT split or the TT split based on the split direction flag and the split mode selection flag,
determining an additional condition of the BT split possibility determination,
in a case that the target block is a middle block of three blocks obtained by performing the TT split on an immediately higher block and the immediately higher block is split horizontally by the TT split, prohibiting splitting the target block horizontally by the BT split.
Claim 2:
An image encoding apparatus for encoding a picture for each of coding tree units, the image encoding apparatus comprising:
coding node (CN) information encoding circuitry configured to
perform a binary tree (BT) split possibility determination based on a width of a target node, a height of the target node, a first minimum size, a first maximum size and a level of hierarchy of the target node,
perform a ternary tree (TT) split possibility determination based on the width of the target node, the height of the target node, a second minimum size, a second maximum size and the level of hierarchy of the target node,
determine whether or not encoding of a partition tree (PT) split flag is required, wherein the PT split flag indicates whether or not the target node is to be split by a binary tree split or a ternary tree split,
encode the PT split flag in a case that encoding of the PT split flag is required,
determine whether or not encoding of a split direction flag is required in a case that the PT split flag indicates that the target node is to be split by the binary tree split or the ternary tree split, wherein the split direction flag indicates a split direction,
encode the split direction flag in a case that encoding of the split direction flag is required,
determine whether or not encoding of a split mode selection flag is required, wherein the split mode selection flag indicates a split method which is the binary tree split or the ternary tree split,
encode the split mode selection flag in a case that encoding of split mode selection flag is required, and
split the target node of the coding tree units by the binary tree split or the ternary tree split based on the split direction flag and the split mode selection flag, wherein
the CN information encoding circuitry further determines additional conditions of the BT split possibility determination, in a case that the target node is a middle node of three nodes obtained by performing the ternary tree split on an immediately higher node, the CN information encoding circuitry prohibits split of the target node by the binary tree split in a direction identical to a direction of the ternary tree split performed on the immediately higher node,
the CN information encoding circuitry determines the BT split possibility determination based on the first minimum size and the CN information encoding circuitry determines the TT split possibility determination based on the second minimum size, where the second minimum size is set equal to twice as much as the first minimum size.
Claim 1:
An image decoding method for decoding a picture for each of coding tree units, the image decoding method comprising:
performing a binary tree (BT) split possibility determination based on (1) a width of a target block or a height of the target block being greater than or equal to a first minimum size of a coding unit multiplied by 2, (2) the width and the height being less than or equal to a first maximum size of the coding unit, and (3) a depth indicating a level of hierarchy of the target block being less than a maximum depth,
performing a ternary tree (TT) split possibility determination based on (1) the width or the height being greater than or equal to a second minimum size of the coding unit multiplied by 4, (2) the width and the height being less than or equal to a second maximum size of the coding unit, and (3) the depth being less than the maximum depth,
determining whether or not decoding of a partition tree (PT) split flag is required, wherein the PT split flag indicates whether or not the target block is to be split by a BT split or a TT split,
decoding the PT split flag in a case that decoding of the PT split flag is required,
in a case that the PT split flag indicates that the target block is to be split by the BT split or the TT split, determining whether or not decoding of a split direction flag is required and decoding the split direction flag in a case that decoding of the split direction flag is required, wherein the spilt direction flag indicates a split direction of the target block,
determining whether or not decoding of a split mode selection flag is required, wherein the split mode selection flag indicates a split method which is the BT split or TT split,
decoding the split mode selection flag in a case that decoding of the split mode selection flag is required,
splitting the target block by the BT split or the TT split based on the split direction flag and the split mode selection flag,
determining an additional condition of the BT split possibility determination,
in a case that the target block is a middle block of three blocks obtained by performing the TT split on an immediately higher block and the immediately higher block is split horizontally by the TT split, prohibiting splitting the target block horizontally by the BT split.
Claim 3:
A non-transitory computer-readable recoding medium storing a program for making a computer decode a picture for each of coding tree units, the program making the computer:
perform a binary tree (BT) split possibility determination based on a width of a target node, a height of the target node, a first minimum size, a first maximum size and a level of hierarchy of the target node;
perform a ternary tree (TT) split possibility determination based on the width of the target node, the height of the target node, a second minimum size, a second maximum size and the level of hierarchy of the target node;
determine whether or not decoding of a partition tree (PT) split flag is required, wherein the PT split flag indicates whether or not the target node is to be split by a binary tree split or a ternary tree split;
decode the PT split flag in a case that decoding of the PT split flag is required;
determine whether or not decoding of a split direction flag is required in a case that the PT split flag indicates that the target node is to be split by the binary tree split or the ternary tree split, wherein the split direction flag indicates a split direction;
decode the split direction flag in a case that decoding of the split direction flag is required;
determine whether or not decoding of a split mode selection flag is required, wherein the split mode selection flag indicates a split method which is the binary tree split or the ternary tree split;
decode the split mode selection flag in a case that decoding of split mode selection flag is required; and
split the target node of the coding tree units by the binary tree split or the ternary tree split based on the split direction flag and the split mode selection flag;
wherein the program further makes the computer determine additional conditions of the BT split possibility determination, in a case that the target node is a middle node of three nodes obtained by performing the ternary tree split on an immediately higher node, the CN information decoding circuitry prohibits split of the target node by the binary tree split in a direction identical to a direction of the ternary tree split performed on the immediately higher node, and
the program makes the computer determine the BT split possibility determination based on the first minimum size and the program makes the computer determine the TT split possibility determination based on the second minimum size, where the second minimum size is set equal to twice as much as the first minimum size.
Claim 1:
An image decoding method for decoding a picture for each of coding tree units, the image decoding method comprising:
performing a binary tree (BT) split possibility determination based on (1) a width of a target block or a height of the target block being greater than or equal to a first minimum size of a coding unit multiplied by 2, (2) the width and the height being less than or equal to a first maximum size of the coding unit, and (3) a depth indicating a level of hierarchy of the target block being less than a maximum depth,
performing a ternary tree (TT) split possibility determination based on (1) the width or the height being greater than or equal to a second minimum size of the coding unit multiplied by 4, (2) the width and the height being less than or equal to a second maximum size of the coding unit, and (3) the depth being less than the maximum depth,
determining whether or not decoding of a partition tree (PT) split flag is required, wherein the PT split flag indicates whether or not the target block is to be split by a BT split or a TT split,
decoding the PT split flag in a case that decoding of the PT split flag is required,
in a case that the PT split flag indicates that the target block is to be split by the BT split or the TT split, determining whether or not decoding of a split direction flag is required and decoding the split direction flag in a case that decoding of the split direction flag is required, wherein the spilt direction flag indicates a split direction of the target block,
determining whether or not decoding of a split mode selection flag is required, wherein the split mode selection flag indicates a split method which is the BT split or TT split,
decoding the split mode selection flag in a case that decoding of the split mode selection flag is required,
splitting the target block by the BT split or the TT split based on the split direction flag and the split mode selection flag,
determining an additional condition of the BT split possibility determination,
in a case that the target block is a middle block of three blocks obtained by performing the TT split on an immediately higher block and the immediately higher block is split horizontally by the TT split, prohibiting splitting the target block horizontally by the BT split.
Table 1
Conclusion
THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to MAHMOUD KAMAL ABOUZAHRA whose telephone number is (703)756-1694. The examiner can normally be reached M-F 7:00 AM to 5:00 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, 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.
/MAHMOUD KAMAL ABOUZAHRA/Examiner, Art Unit 2486
/JAMIE J ATALA/Supervisory Patent Examiner, Art Unit 2486