Abstract:
An intra prediction method includes: based on a specific transform unit size, estimating a plurality of best intra prediction modes of a plurality of second blocks, wherein a first block is composed of the second blocks, the first block supports a first block configuration and a second block configuration, the first block configuration represents a size of the first block, and the second block configuration represents a size of each second block; and checking similarity of the best intra prediction modes of the second blocks for selectively replacing the second block configuration by the first block configuration for the first block.
Abstract:
One exemplary video encoding method has the following steps: determining a size of a parallel motion estimation region according to encoding related information; and encoding a plurality of pixels by at least performing motion estimation based on the size of the parallel motion estimation region. One exemplary video decoding method has the following steps: decoding a video parameter stream to obtain a decoded size of a parallel motion estimation region; checking validity of the decoded size of the parallel motion estimation region, and accordingly generating a checking result; when the checking result indicates that the decoded size of the parallel motion estimation region is invalid, entering an error handling process to decide a size of the parallel motion estimation; and decoding a plurality of pixels by at least performing motion estimation based on the decided size of the parallel motion estimation region.
Abstract:
A method of binarizing an input symbol using a hybrid Truncated Rice/k-th order exp-Golomb binarization scheme with a Rice Parameter includes: determining a threshold; comparing the input symbol with the threshold; constructing a codeword using a Truncated Rice (TR) binarization process for the input symbol when a comparison result belongs to a first type of comparison result; and constructing a codeword with an initial prefix and a suffix for the input symbol when the comparison result belongs to a second type of comparison result; wherein the suffix is constructed using an exp-Golomb binarization process.
Abstract:
An image encoding method with rate control includes at least the following steps: defining a plurality of candidate bit budgets corresponding to different pre-defined maximum encoded bit lengths for one coding unit respectively; when encoding pixel data of a plurality of pixels within a current coding unit of an access unit of a frame, determining a target bit budget selected from the candidate bit budgets and allocating the target bit budget to the current coding unit; and outputting encoded pixel data of the pixels within the current coding unit that is generated from the encoder, wherein a bit length of the encoded pixel data is smaller than or equal to the target bit budget.
Abstract:
An image compression method includes at least the following steps: receiving a plurality of pixels of a frame, wherein pixel data of each pixel has a plurality of color channel data corresponding to a plurality of different color channels, respectively; encoding the pixel data of each pixel and generating bit-streams corresponding to the plurality of color channel data of the pixel, wherein the bit-streams corresponding to the plurality of color channel data of the pixel are separated; packing bit-streams of a same color channel data of different pixels into color channel bit-stream segments, wherein each of the bit-stream segments has a same predetermined size; and concatenating color channel bit-stream segments of the different color channels into a final bit-stream. Alternatively, color channel bit-stream segments of the same pixel are concatenated into a concatenated bit-stream portion, and concatenated bit-stream portions of different pixels are concatenated into a final bit-stream.
Abstract:
Electronic devices for de-quantization are disclosed. In one configuration, the electronic device includes a local storage storing a plurality of first user-defined sub-factors and a plurality of second sub-factors and a plurality of default de-quantization scales; a first multiplier connected to the local storage and generating a plurality of user-defined de-quantization scales by multiplying the first user-defined sub-factors and the second sub-factors; a multiplexer connected to the local storage and the first multiplier and selectively outputting one of the generated user-defined de-quantization scales and the stored default de-quantization scales for a block of a macro-block (MB) of a bitstream to be decoded; and a second multiplier connected to the multiplexer and generating a plurality of inverse quantized coefficients by multiplying the output de-quantization scales from the multiplexer by the quantized coefficients.
Abstract:
An image compression method includes at least the following steps: receiving a plurality of pixels of a frame, wherein pixel data of each pixel has a plurality of color channel data corresponding to a plurality of different color channels, respectively; encoding the pixel data of each pixel and generating bit-streams corresponding to the plurality of color channel data of the pixel, wherein the bit-streams corresponding to the plurality of color channel data of the pixel are separated; packing bit-streams of a same color channel data of different pixels into color channel bit-stream segments, wherein each of the bit-stream segments has a same predetermined size; and concatenating color channel bit-stream segments of the different color channels into a final bit-stream. Alternatively, color channel bit-stream segments of the same pixel are concatenated into a concatenated bit-stream portion, and concatenated bit-stream portions of different pixels are concatenated into a final bit-stream.
Abstract:
A method and apparatus for a multiple-channel image/video coding system are disclosed. A residue generation process is applied to the image/video data to generate residue data. A set of integer operations is applied to the residue data across the input channels to generate residue transformed data having multiple output channels. In one embodiment, the residue transformed data associated with a first output channel is related to the difference between a first residue data associated with a first input channel and a second residue data associated with a second input channel. In another embodiment, the residue transformed data associated with a second output channel is related to the second difference between a threshold and a third residue data associated with a third input channel, and wherein the threshold corresponds to the first truncated or rounded average of the first residue data and the second residue data.
Abstract:
A method and apparatus of image data compression and decompression are disclosed. According to an embodiment of the present invention, the compression method partitions the image data into access units and encodes each access unit into a bitstream according to a target bit budget. Each access unit is encoded using first data compression to generate a first bitstream and the residual data is further encoded using second data compression to generate a second bitstream if the first bitstream is smaller than the target bit budget. In one example, the second data compression comprises bit plane coding applied to bit plane-ordered data, wherein the bit plane-ordered data is generated by scanning from a most significant bit to a least significant bit of the residual data in a bit plane-wise order. The decompression method comprises steps to recover reconstructed data from the first and second bitstreams.
Abstract:
An image compression method has at least the following steps: receiving source pixel data of a plurality of blocks of a frame; when a lossless compression mode is enabled for the frame, bypassing a source quantization operation and applying a lossless compression kernel to source pixel data of each of the blocks; and when a lossy compression mode is enabled for the frame, applying the source quantization operation to the source pixel data of each of the blocks to generate input pixel data of each of the blocks, and applying the lossless compression kernel to the input pixel data of each of the blocks. For example, the source quantization operation employs an adaptive quantization parameter for each of the blocks such that a size of compressed data of the frame generated under the lossy compression mode does not exceed a bit budget.