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 .
Double Patenting
The non-statutory 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 non-statutory obviousness-type 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); InreGoodman, 11 F.3d 1046,29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225USPQ645 (Fed. Cir. 1985); In re Van Omum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In reVogel, 422F.2d 438,164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) maybe used to overcome an actual or provisional rejection based on a non-statutory double
patenting ground provided the conflicting application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement.
Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b).
Claims 1-6 rejected on the ground of non-statutory obviousness-type double patenting as being unpatentable over claims 1-6 of US patent No. 12,132,890 although the conflicting claims are not identical, they are not patentably distinct from each other because they claim the same scope, of, the invention, but using different variations of the claim language.
Instant Application-18/930,108
Conflicting U.S. Patent No. 12,132,890
1. A method for transmitting an encoded bitstream for decoding by a compatible decoder, the encoded bitstream including a current picture, the current picture further including a current block having at least a first partition boundary partitioning the block into first and second non-rectangular regions, and a second partition boundary, intersecting the at least first partition boundary, partitioning the second non-rectangular region to partition the current block into three portions in which the decoder is configured to: receive the encoded bitstream including a current picture, the current picture further including a current block having at least a first partition boundary partitioning the block into first and second non-rectangular regions, and a second partition boundary, intersecting the at least first partition boundary, partitioning the second non-rectangular region to partition the current block into three portions; determine a first predictor for use within the first non-rectangular region using a first motion vector selected from a first list of motion vector candidates; determine a second predictor for use within the second non-rectangular region using a second motion vector selected from a second list of motion vector candidates; and decode the current block using the first predictor and the second predictor, wherein decoding further comprises smoothing the first predictor and the second predictor across the at least first partition boundary.
1. An encoder comprising circuitry configured to encode a bitstream for decoding by a compatible decoder, in which the decoder is configured to: receive the encoded bitstream including a current picture, the current picture further including a current block having at least a first partition boundary partitioning the block into first and second non-rectangular regions, and a second partition boundary, intersecting the at least first partition boundary, partitioning the second non-rectangular region to partition the current block into three portions; determine a first predictor for use within the first non-rectangular region using a first motion vector selected from a first list of motion vector candidates; determine a second predictor for use within the second non-rectangular region ,using a second motion vector selected from a second list of motion vector candidates; and decode the current block using the first predictor and the second predictor, wherein decoding further comprises smoothing the first predictor and the second predictor across the at least first partition boundary.
2. The method of claim 1 wherein the current block is a current coding tree unit.
2. The encoder of claim 1 wherein the current block is a current coding tree unit.
3. The method of claim 1 wherein the first partition includes a first geometric partition.
3.The encoder of claim 1 wherein the first partition includes a first geometric partition.
4. The method of claim 1 wherein the second partition includes a second geometric partition
4.The encoder of claim 1 wherein the second partition includes a second geometric partition.
5. A method of transmitting an encoded bitstream, the encoded bitstream including a current picture, the current picture including a current block having a block size of N×N where N is equal to 64 or 128, and having at least a first geometric partition boundary partitioning the block into first and second non-rectangular regions, and a second geometric partition boundary, intersecting the at least first geometric partition boundary, partitioning the second non-rectangular region to partition the current block into three portions An encoder comprising circuitry configured to encode a bitstream for decoding by a compatible decoder, in which the decoder is configured to: receive the encoded bitstream; determine a first predictor for use within the first non-rectangular region using a first motion vector selected from a first list of motion vector candidates; determine a second predictor for use within the second non-rectangular region using a second motion vector selected from a second list of motion vector candidates; and decode the current block using the first predictor and the second predictor, wherein decoding further comprises smoothing the first predictor and the second predictor across the at least first geometric partition boundary.
5. An encoder comprising circuitry configured to encode a bitstream for decoding by a compatible decoder, in which the decoder is configured to: receive the encoded bitstream, wherein the bitstream includes a current picture, the current picture including a current block having a block size of N×N where N is equal to 64 or 128, and having at least a first geometric partition boundary partitioning the block into first and second non-rectangular regions, and a second geometric partition boundary, intersecting the at least first geometric partition boundary, partitioning the second non-rectangular region to partition the current block into three portions; determine a first predictor for use within the first non-rectangular region using a first motion vector selected from a first list of motion vector candidates; determine a second predictor for use within the second non-rectangular region using a second motion vector selected from a second list of motion vector candidates; and decode the current block using the first predictor and the second predictor, wherein decoding further comprises smoothing the first predictor and the second predictor across the at least first geometric partition boundary.
6. The method of claim 5 wherein the current block is a current coding tree unit.
6. The encoder of claim 5 wherein the current block is a current coding tree unit.
It would have been obvious to a person having ordinary skill in the art, at the time the invention was made, to combine the teachings of current Application 18/930,108 although the conflicting claims are not identical, they are not patentably distinct from each other, because they are obvious variations of each other.
Allowable Subject Matter
Claims 1-6 would be allowable pending the non-statutory double patenting rejection.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to TSION B OWENS whose telephone number is (571)272-3934. The examiner can normally be reached Monday-Friday 8:00-4:00.
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.
/TSION B OWENS/Primary Examiner, Art Unit 2487