Abstract:
Transform unit (TU) partition method and apparatus depending on the coding unit (CU) partition and prediction unit (PU) partition are disclosed. In one embodiment, the maximum TU size is restricted to the minimum of PU width and height, except for a 2N×2N coding unit with the 2N×2N partition type. In another embodiment, the maximum TU size equals to maximum of PU width and height, and the minimum TU size equals to minimum of the PU width and height, except for a 2N×2N coding unit with the 2N×2N partition type. In yet another embodiment, the maximum TU size is equal to the maximum of PU width and height, and the minimum TU size is equal to the minimum of PU width and height except for a 2N×2N CU with 2N×2N partition type.
Abstract:
In HEVC (High Efficiency Video Coding), a 2N×2N coding unit can be partitioned into various partition types hierarchically. The coding system uses a criterion to determine the best partition, where RD-rate is often used as the criterion. N×N partition at level k becomes redundant if 2N×2N at level k+1 will be evaluated. In order to eliminate the above redundancy, the allowable partition sizes are constrained according to a method previously disclosed. In the current invention, the complexity is further reduced. According to one embodiment, N×N partition is not allowed for any INTER mode regardless of the coding unit size. Furthermore, flexibility is provided so that either the method and apparatus with further complexity reduction can be selected or an alternative method and apparatus can be selected. Syntaxes to support embodiments according to the present invention are also disclosed.
Abstract:
A method for identifying an actual view order of image frames of a stereo image pair includes at least the following steps: receiving the image frames; obtaining image characteristics by analyzing the image frames according to an assumed view order; and identifying the actual view order by checking the image characteristics. In addition, a machine readable medium storing a program code is provided. The program causes a processor to perform at least the following steps for identifying an actual view order of image frames of a stereo image pair when executed by the processor: receiving the image frames; obtaining image characteristics by analyzing the image frames according to an assumed view order; and identifying the actual view order by checking the image characteristics.
Abstract:
A method and system for processing transform blocks according to quantization matrices in a video coding system are disclosed. Embodiments of the present invention derive one or more derived quantization matrices from one or more initial quantization matrices or from one previously derived quantization matrix. In one embodiment, the initial quantization matrices include a 4×4 and 8×8 quantization matrices, which can be either default or user-defined. All quantization matrices larger than 8×8 can be derived from the 4×4 and 8×8 initial quantization matrices. Non-square quantization matrices can be derived from at least one initial square quantization matrix or at least one derived square quantization matrix. Individual initial quantization matrices may be used to derive respective larger quantization matrices. Furthermore, the individual initial quantization matrices may be derived from larger quantization matrices designed for corresponding transform sizes. Syntax design to enable the quantization matrix representation is also disclosed.
Abstract:
A method and apparatus for Intra prediction of a block based on neighboring pixels around the block are disclosed. Embodiments according to the present invention use square blocks as well as non-square blocks for Intra prediction. For a 2N×2N Luma CU (coding unit), the CU can be partitioned into 2N×N, N×2N, 2N×2N or N×N PUs. The 2N×N and N×2N PUs can be further processed by either square transforms only or both non-square and square transforms. In one embodiment, the 2N×N PU or the N×2N PU is processed as two N×N TUs (transform units) and each of the N×N TU is further split into smaller N×N TUs based on quad-tree split. In another embodiment, the 2N×N and N×2N PUs are processed as two 2N×0.5N and 0.5N×2N TUs respectively.
Abstract:
A alloy and a process of forming a alloy are disclosed. The alloy has a predetermined grain boundary morphology. The alloy includes by weight greater than about 0.06 percent carbon, up to about 0.0015 percent sulfur, less than about 16 percent chromium, between about 39 percent and about 44 percent nickel, between about 2.5 percent and about 3.3 percent niobium, between about 1.4 percent and about 2 percent titanium, up to about 0.5 percent aluminum, up to about 0.006 percent boron, up to about 0.3 percent copper, up to about 0.006 percent nitrogen, and greater than about 0.5 percent molybdenum.
Abstract:
Corrupted subdivision s of streaming data are concealed using a matching subdivision in a previously reconstructed reference picture. The matching subdivision is located by applying a recovered motion vector to a co-located subdivision in the reference picture for which motion vector information has been lost. The recovered motion vector is obtained using a reference motion vector from an available neighboring subdivision of the co-located subdivision. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. This abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
Abstract:
A circuit layout structure includes a metal interlayer dielectric layer surrounding a metal interconnect and a metal pattern within a scrub line. The scrub line is in the vicinity of the metal interlayer dielectric layer and the metal interconnect. The metal pattern or the metal interconnect are suitably segregated to reduce a capacitance charging effect.
Abstract:
Methods and apparatus for concealing corrupted blocks of streaming data are disclosed. It is determined whether a subdivision of the streaming data is a corrupt subdivision. The corrupt subdivision is concealed using a previously reconstructed or concealed subdivision in a manner that does not require information from pairs of direct neighbor subdivisions that have not been previously reconstructed or concealed.
Abstract:
A method and apparatus for adaptive inter prediction mode coding are disclosed. In the current HEVC, a fixed set of variable length codes is used for the underlying video data, which may not optimally match the statistics of underlying video data. Consequently, the compression efficiency associated with the fixed set of variable length codes will be compromised. Accordingly, an adaptive coding scheme for inter prediction modes is disclosed. The variable length codes used for each inter prediction mode in each coding unit depth is adaptively determined by its respective statistics. The statistics can be measured as the frequency of occurrence of each mode. In one embodiment according to the present invention, counters are used to collect the statistics. According to one embodiment of the present invention, the statistics of inter prediction modes are collected from the previous slice and the set of variable length codes is determined for the subsequent slice (immediately following the previous slice) accordingly. According to another embodiment of the present invention, the statistics of inter prediction modes are updated for each coding unit and the variable length code for each mode is adjusted according to the statistics change during the coding process. According to another embodiment of the present invention, the variable length code for each mode is reset in the beginning of each slice. The reset code word table is either a predefined code word table for whole sequence or a code word table determined by the previous slice.