摘要:
A prediction unit is identified within a picture of a video sequence. The prediction unit is bordered by neighboring prediction units within the picture. The neighboring prediction units include first and second neighboring prediction units that are separated from one another by at least a third neighboring prediction unit. A subset of the neighboring prediction units is scanned to identify an MVP candidate. The subset includes at least the first and second neighboring prediction units and excludes at least the third neighboring prediction unit. An encoder calculates a difference between a motion vector of the MVP candidate and a motion vector of the prediction unit, and encodes the difference and an index to identify the MVP candidate. A decoder decodes the difference, and calculates the motion vector of the prediction unit by adding the difference to the motion vector of the MVP candidate.
摘要:
A method of quantization matrix compression in a video encoder is provided that includes preprocessing a quantization matrix by performing at least one selected from down-sampling the quantization matrix and imposing 135 degree symmetry on the quantization matrix, performing zigzag scanning on the pre-processed quantization matrix to generate a one dimensional (1D) sequence, predicting the 1D sequence to generate a residual 1D sequence, and coding the residual 1D sequence using kth order exp-Golomb coding to generate a compressed quantization matrix, wherein k≧0.
摘要:
A method of compressing an image data block is provided that includes computing a pixel residual for each pixel in the image data block except a non-residual pixel, computing a compression level for the image data block based on a minimum pixel residual value and a maximum pixel residual value of the pixel residuals, encoding a compression flag for the image data block, wherein the compression flag includes an indicator identifying the compression level and a first portion of bits from the non-residual pixel, and generating a compressed block comprising a second portion of bits from the non-residual pixel and the pixel residuals encoded using fixed length coding based on the compression level.
摘要:
Methods for improved parallel motion estimation are provided that decouple the merging candidate list derivation and motion estimation for merge mode and skip mode and the advanced motion vector predictor (AMVP) candidate list construction from regular motion estimation to increase the coding quality in parallel motion estimation while meeting throughput requirements. This decoupling may be accomplished by modifying the availability rules for spatial motion data (SMD) positions for construction of the candidate lists. As part of the decoupling, largest coding units (LCUs) of a picture may be divided into non-overlapping parallel motion estimation regions (PMER) of equal size. Within a PMER, motion estimation for merge mode, skip mode, and normal inter-prediction mode may be performed in parallel for all the prediction units (PUs) in the PMER.
摘要:
A method and apparatus for a low complexity transform unit partitioning structure for High Efficiency Video Coding (HEVC). The method includes determining prediction unit size of a coding unit, and setting the size of transform unit size of Y, U and V according to the prediction unit size of the coding unit.
摘要:
Modify H.263-type quantization with an adaptive quantization parameter floor; this limits clipping of quantized DCT coefficients and consequent artifacts. The maximum absolute level of AC coefficients of a DCT transformed macroblock provides a minimum quantization parameter from integer division by 256 when the quantized levels are clipped to a range such as −127 to +127.
摘要:
Low complexity (16 bit arithmetic) H.264 video compression replaces a single quantization table for all quantization parameters with multiple quantization tables and thereby equalizes quantization shifts and round-off additions; this eliminates the need for 32-bit accesses.
摘要:
A low-complexity method for prevention of H.264 start code emulation by bit-handling routines with additional functionality. The low-complexity is achieved by employing a start code pre-determination scheme, which saves bitstream handling complexity by about 50% and 30% on the encoder and decoder sides, respectively. The start code emulation prevention has been embedded into the low-level bitstream handling routines. By doing so it avoids the use of the second bitstream buffer, maintains the decoder ability of using a circular bitstream buffer, and satisfies the BURST-aligned SDRAM access requirement.
摘要:
The in-loop deblocking filter for H.264 video coding has additional buffers for in-place filtering and minimizing memory transfers. One buffer holds a reconstructed macroblock plus columns of the left prior macroblock pixels for vertical edge filtering and plus rows of the top macroblock pixels for horizontal edge filtering; and the other buffer holds the bottom pixel rows of all of the macroblocks of the preceding row of macroblocks.
摘要:
The memory access efficiency for video decoding is maximized by interleaved storage of luminance and chrominance data. Macroblocks of luminance and chrominance interleave to blocks of 16×32 by repeating chrominance rows.