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 .
Priority
This application discloses and claims only subject matter disclosed in prior Application No. 17/954,721, filed 09/28/2022, and names the inventor or at least one joint inventor named in the prior application. Accordingly, this application constitutes a continuation.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 03/28/2025 was considered by the examiner.
Drawings
The drawings were received on 01/02/2025. These drawings are acceptable.
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.
Claims 1-20 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-20 of U.S. Patent No. 12,192,510 in view of Seregin et al. US 2018/0278951 A1, hereafter Seregin.
Instant Application 19/008,086
Claim 1
US Patent 12,192,510
Claim 1
A method comprising:
receiving, in a bitstream for a block, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD);
A method comprising: calculating a block vector difference (BVD) between a block vector (BV) and a block vector predictor (BVP);
determining each of a plurality of block vector (BV) candidates based on a sum of the BVP and a different one of a plurality of BVD candidates, wherein each of the plurality of BVD candidates comprises: the first and second component magnitudes of the BVD; and
determining each of a plurality of BV candidates based on a sum of the BVP and a different one of a plurality of BVD candidates, wherein each of the plurality of BVD candidates comprises: a first and a second component magnitude of the BVD; and
a different combination of signs for the first and second component magnitudes; and
a different combination of signs for the first and second component magnitudes; and
determining validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates; and
determining validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates; and
determining a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.
signaling, in a bitstream, a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.
Although the claims at issue are not identical, they are not patentably distinct from each other because claim 1 of the instant application differs from claim 1 of the U.S. Patent in that the instant application includes receiving, in a bitstream for a block, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD). However, this is well known in the art as disclosed by Seregin, which is in the same field of endeavor (decoder may receive information such as an index corresponding to an entry in a candidate list of MVPs…also receives information indicative of the MVD; MVD can include two components: an x-component and a y-component) [0023; 0024]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to receive vector prediction information, the motivation being efficiency [0022].
Instant Application 19/008,086
Claim 2
US Patent 12,192,510
Claim 2
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate of the plurality of BV candidates based on at least: a first value, stored in the reference memory, for a top left sample of a reference block indicated by the BV candidate; and a second value, stored in the reference memory, for a bottom right sample of the reference block indicated by the BV candidate.
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate of the plurality of BV candidates based on at least: a first value, stored in the reference memory, for a top left sample of a reference block indicated by the BV candidate; and a second value, stored in the reference memory, for a bottom right sample of the reference block indicated by the BV candidate.
Instant Application 19/008,086
Claim 3
US Patent 12,192,510
Claim 3
The method of claim 2, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the first and second values not being equal to a default value.
The method of claim 2, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the first and second values not being equal to a default value.
Instant Application 19/008,086
Claim 4
US Patent 12,192,510
Claim 4
The method of claim 3, wherein the default value is -1.
The method of claim 3, wherein the default value is −1.
Instant Application 19/008,086
Claim 5
US Patent 12,192,510
Claim 5
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate, of the plurality of BV candidates, based on a value, stored in the reference memory, for each sample of a reference block indicated by the BV candidate.
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate, of the plurality of BV candidates, based on a value, stored in the reference memory, for each sample of a reference block indicated by the BV candidate.
Instant Application 19/008,086
Claim 6
US Patent 12,192,510
Claim 6
The method of claim 5, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the value, stored in the reference memory, for each sample of the reference block indicated by the BV candidate not being equal to a default value.
The method of claim 5, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the value, stored in the reference memory, for each sample of the reference block indicated by the BV candidate not being equal to a default value.
Instant Application 19/008,086
Claim 7
US Patent 12,192,510
Claim 7
The method of claim 6, wherein the default value is -1.
The method of claim 6, wherein the default value is −1.
Instant Application 19/008,086
Claim 8
US Patent 12,192,510
Claim 8
An apparatus comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to:
An apparatus comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to:
receive, in a bitstream for a block, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD);
calculate a block vector difference (BVD) between a block vector (BV) and a block vector predictor (BVP);
determine each of a plurality of block vector (BV) candidates based on a sum of the BVP and a different one of a plurality of BVD candidates, wherein each of the plurality of BVD candidates comprises: the first and second component magnitudes of the BVD; and a different combination of signs for the first and second component magnitudes; and
determine each of a plurality of BV candidates based on a sum of the BVP and a different one of a plurality of BVD candidates, wherein each of the plurality of BVD candidates comprises: a first and a second component magnitude of the BVD; and a different combination of signs for the first and second component magnitudes; and
determine validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates; and
determine validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates; and
determine a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.
signal, in a bitstream, a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.
Although the claims at issue are not identical, they are not patentably distinct from each other because claim 1 of the instant application differs from claim 1 of the U.S. Patent in that the instant application includes receiving, in a bitstream for a block, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD). However, this is well known in the art as disclosed by Seregin, which is in the same field of endeavor (decoder may receive information such as an index corresponding to an entry in a candidate list of MVPs…also receives information indicative of the MVD; MVD can include two components: an x-component and a y-component) [0023; 0024]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to receive vector prediction information, the motivation being efficiency [0022].
Instant Application 19/008,086
Claim 9
US Patent 12,192,510
Claim 9
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate of the plurality of BV candidates based on at least: a first value, stored in the reference memory, for a top left sample of a reference block indicated by the BV candidate; and a second value, stored in the reference memory, for a bottom right sample of the reference block indicated by the BV candidate.
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate of the plurality of BV candidates based on at least: a first value, stored in the reference memory, for a top left sample of a reference block indicated by the BV candidate; and a second value, stored in the reference memory, for a bottom right sample of the reference block indicated by the BV candidate.
Instant Application 19/008,086
Claim 10
US Patent 12,192,510
Claim 10
The method of claim 2, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the first and second values not being equal to a default value.
The method of claim 2, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the first and second values not being equal to a default value.
Instant Application 19/008,086
Claim 11
US Patent 12,192,510
Claim 11
The method of claim 3, wherein the default value is -1.
The method of claim 3, wherein the default value is −1.
Instant Application 19/008,086
Claim 12
US Patent 12,192,510
Claim 12
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate, of the plurality of BV candidates, based on a value, stored in the reference memory, for each sample of a reference block indicated by the BV candidate.
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate, of the plurality of BV candidates, based on a value, stored in the reference memory, for each sample of a reference block indicated by the BV candidate.
Instant Application 19/008,086
Claim 13
US Patent 12,192,510
Claim 13
The method of claim 5, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the value, stored in the reference memory, for each sample of the reference block indicated by the BV candidate not being equal to a default value.
The method of claim 5, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the value, stored in the reference memory, for each sample of the reference block indicated by the BV candidate not being equal to a default value.
Instant Application 19/008,086
Claim 14
US Patent 12,192,510
Claim 14
The method of claim 6, wherein the default value is -1.
The method of claim 6, wherein the default value is −1.
Instant Application 19/008,086
Claim 15
US Patent 12,192,510
Claim 15
A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of an apparatus, cause the apparatus to:
receive, in a bitstream for a block, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD);
A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of an apparatus, cause the apparatus to:
calculate a block vector difference (BVD) between a block vector (BV) and a block vector predictor (BVP);
determining each of a plurality of block vector (BV) candidates based on a sum of the BVP and a different one of a plurality of BVD candidates, wherein each of the plurality of BVD candidates comprises: the first and second component magnitudes of the BVD; and
determining each of a plurality of BV candidates based on a sum of the BVP and a different one of a plurality of BVD candidates, wherein each of the plurality of BVD candidates comprises: a first and a second component magnitude of the BVD; and
a different combination of signs for the first and second component magnitudes; and
a different combination of signs for the first and second component magnitudes; and
determining validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates; and
determining validities of the plurality of BV candidates based on values of samples, stored in a reference memory, of reference blocks indicated by the plurality of BV candidates; and
determining a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.
signaling, in a bitstream, a sign for at least one of the first and second component magnitudes of the BVD based on the validities of the plurality of BV candidates.
Although the claims at issue are not identical, they are not patentably distinct from each other because claim 1 of the instant application differs from claim 1 of the U.S. Patent in that the instant application includes receiving, in a bitstream for a block, an indication of a block vector predictor (BVP) and a first and a second component magnitude of a block vector difference (BVD). However, this is well known in the art as disclosed by Seregin, which is in the same field of endeavor (decoder may receive information such as an index corresponding to an entry in a candidate list of MVPs…also receives information indicative of the MVD; MVD can include two components: an x-component and a y-component) [0023; 0024]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to receive vector prediction information, the motivation being efficiency [0022].
Instant Application 19/008,086
Claim 16
US Patent 12,192,510
Claim 16
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate of the plurality of BV candidates based on at least: a first value, stored in the reference memory, for a top left sample of a reference block indicated by the BV candidate; and a second value, stored in the reference memory, for a bottom right sample of the reference block indicated by the BV candidate.
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate of the plurality of BV candidates based on at least: a first value, stored in the reference memory, for a top left sample of a reference block indicated by the BV candidate; and a second value, stored in the reference memory, for a bottom right sample of the reference block indicated by the BV candidate.
Instant Application 19/008,086
Claim 17
US Patent 12,192,510
Claim 17
The method of claim 2, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the first and second values not being equal to a default value.
The method of claim 2, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the first and second values not being equal to a default value.
Instant Application 19/008,086
Claim 18
US Patent 12,192,510
Claim 18
The method of claim 3, wherein the default value is -1.
The method of claim 3, wherein the default value is −1.
Instant Application 19/008,086
Claim 19
US Patent 12,192,510
Claim 19
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate, of the plurality of BV candidates, based on a value, stored in the reference memory, for each sample of a reference block indicated by the BV candidate.
The method of claim 1, wherein determining the validities of the plurality of BV candidates comprises determining a validity of a BV candidate, of the plurality of BV candidates, based on a value, stored in the reference memory, for each sample of a reference block indicated by the BV candidate.
Instant Application 19/008,086
Claim 20
US Patent 12,192,510
Claim 20
The method of claim 5, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the value, stored in the reference memory, for each sample of the reference block indicated by the BV candidate not being equal to a default value.
The method of claim 5, wherein determining the validity of the BV candidate comprises determining that the BV candidate is valid based on the value, stored in the reference memory, for each sample of the reference block indicated by the BV candidate not being equal to a default value.
Allowable Subject Matter
Claims 1-20 would be allowable if rewritten or amended to overcome the double patenting rejection, set forth in this Office action.
Citation of Pertinent Prior Art
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure:
He et al. US 2015/0373366 A1 discloses block vector derivation
Rapaka et al. US 2015/0373370 A1 discloses block vector signaling for video coding
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to STEFAN GADOMSKI whose telephone number is (571)270-5701. The examiner can normally be reached Monday - Friday, 12-8PM EST.
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, Jay Patel can be reached at 571-272-2988. 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.
STEFAN GADOMSKI
Primary Examiner
Art Unit 2485
/STEFAN GADOMSKI/Primary Examiner, Art Unit 2485