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 .
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 2, 9, 16, 23-25 are rejected under 35 U.S.C. 103 as being unpatentable over Coban (US 2012/0163456) in view of Ko (US 2020/0275124).
For claims 2, 9, 16, and 23-25, Coban discloses an apparatus and method for decoding, and the reciprocal encoding, of a picture from a data stream ([0003]),
wherein the apparatus comprises a processor configured to ([0016] e.g. processor):
determine an intra-coding mode of a block of the picture ([0057] Following intra-predictive or inter-predictive encoding to produce predictive data);
decode a flag from the data stream, the flag indicating whether the block is partitioned; determine that the block is partitioned based on the flag ([0054] For example, a node in the quadtree may include a split flag for the CU, indicating whether the CU corresponding to the node is split into four sub-CUs. Syntax information for a given CU may be defined recursively, and may depend on whether the CU is split into sub-CUs.);
determine a number of partitions into which the block is partitioned based on a width of the block, and a height of the block ([0171] FIGS. 6A-6B are conceptual diagrams that illustrate examples of blocks video data having various sizes, and examples of blocks of video data for which various prediction modes are used to generate prediction data, consistent with the techniques of this disclosure. As shown in FIG. 6A, block 600, e.g., a macroblock, or a TU of a CU of video data, may have a particular size. Assume for this example that the size of block 600 is 2N.times.2N, where N equals to thirty-two. Accordingly, block 600 has a size of 64.times.64. Assume further that block 600 is recursively partitioned, or split, into smaller blocks, including blocks 602-608 also shown in FIG. 6A, as previously described with reference to FIG. 1. Assume, for example, that block 602 has a size of 32.times.32, block 604 has a size of 16.times.16, block 606 has a size of 8.times.8, and block 608 has a size of 4.times.4. In other examples, block 600 may be partitioned into more or fewer smaller blocks than blocks 602-608. In still other examples, block 600 and any partitions thereof may have different sizes than the sizes of blocks 600-608.).
Coban does not expressly disclose based on the intra-coding mode of the block, sequentially reconstruct each partition of the block according to a partition order.
Ko teaches based on the intra-coding mode of the block, sequentially reconstruct each partition of the block according to a partition order ([0129] Referring to FIG. 3, an image 300 is sequentially partitioned in a largest coding unit (LCU), and a LCU unit is determined as a partition structure. Herein, the LCU may be used in the same meaning as a coding tree unit (CTU). A unit partitioning may mean partitioning a block associated with to the unit. In block partition information, information of a unit depth may be included. Depth information may represent a number of times or a degree or both in which a unit is partitioned). It would be obvious to a person with ordinary skill in the art to combine the partition and syntax teachings of Ko with the teachings of Coban to provide the predictable benefit of conforming with video compressions standards, such as those described in the standards defined by MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), the High Efficiency Video Coding (HEVC) standard presently under development, and extensions of such standards.
Allowable Subject Matter
Claims 3-8, 10-15, 17-20 objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure.
Pang; Chao et al. US 20150271515 A1 BLOCK VECTOR CODING FOR INTRA BLOCK COPY IN VIDEO CODING
BARTNIK; Christian et al. US 20140210652 A1 ENTROPY CODING
Joshi; Rajan Laxman et al. US 20130114730 A1 CODING SIGNIFICANT COEFFICIENT INFORMATION IN TRANSFORM SKIP MODE
Wang; Xianglin et al. US 20130107970 A1 TRANSFORM UNIT PARTITIONING FOR CHROMA COMPONENTS IN VIDEO CODING
Guo; Liwei et al. US 20130070848 A1 LINE BUFFER REDUCTION FOR SHORT DISTANCE INTRA-PREDICTION
Chien; Wei-Jung et al. US 20120307894 A1 INTRA PREDICTION MODE CODING WITH DIRECTIONAL PARTITIONS
Any inquiry concerning this communication or earlier communications from the examiner should be directed to NEIL MIKESKA whose telephone number is (571)272-3917. The examiner can normally be reached M-F: 6a - 2p.
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 on (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.
/NEIL R MIKESKA/Primary Examiner, Art Unit 2485
Prosecution Insights