摘要:
A method and system for reducing the number of mathematical operations required in the JPEG decoding process without substantially impacting the quality of the image displayed is disclosed. Embodiments provide an efficient JPEG decoding process for the purposes of displaying an image on a display smaller than the source image, for example, the screen of a handheld device. According to one aspect of the invention, this is accomplished by reducing the amount of processing required for dequantization and inverse DCT (IDCT) by effectively reducing the size of the image in the quantized, DCT domain prior to dequantization and IDCT. This can be done, for example, by discarding unnecessary DCT index rows and columns prior to dequantization and IDCT. In one embodiment, columns from the right, and rows from the bottom are discarded such that only the top left portion of the block of quantized, and DCT coefficients are processed.
摘要:
A method and system for reducing the number of mathematical operations required in the JPEG decoding process without substantially impacting the quality of the image displayed is disclosed. Embodiments provide an efficient JPEG decoding process for the purposes of displaying an image on a display smaller than the source image, for example, the screen of a handheld device. According to one aspect of the invention, this is accomplished by reducing the amount of processing required for dequantization and inverse DCT (IDCT) by effectively reducing the size of the image in the quantized, DCT domain prior to dequantization and IDCT. This can be done, for example, by discarding unnecessary DCT index rows and columns prior to dequantization and IDCT. In one embodiment, columns from the right, and rows from the bottom are discarded such that only the top left portion of the block of quantized, and DCT coefficients are processed.
摘要:
An iterative rate-distortion optimization algorithm for MPEG I/II Layer-3 (MP3) encoding based on the method of Lagrangian multipliers. Generally, an iterative method is performed such that a global quantization step size is determined while scale factors are fixed, and thereafter the scale factors are determined while the global quantization step size is fixed. This is repeated until a calculated rate-distortion cost is within a predetermined threshold. The methods are demonstrated to be computationally efficient and the resulting bit stream is fully standard compatible.
摘要翻译:基于拉格朗日乘数法的MPEG I / II Layer-3(MP3)编码的迭代速率失真优化算法。 通常,执行迭代方法,使得在比例因子固定的同时确定全局量化步长,此后在全局量化步长固定的同时确定比例因子。 直到计算出的速率 - 失真成本在预定的阈值内为止。 这些方法被证明在计算上是有效的,并且所得到的比特流是完全标准兼容的。
摘要:
An iterative rate-distortion optimization algorithm for MPEG I/II Layer-3 (MP3) encoding based on the method of Lagrangian multipliers. Generally, an iterative method is performed such that a global quantization step size is determined while scale factors are fixed, and thereafter the scale factors are determined while the global quantization step size is fixed. This is repeated until a calculated rate-distortion cost is within a predetermined threshold. The methods are demonstrated to be computationally efficient and the resulting bit stream is fully standard compatible.
摘要翻译:基于拉格朗日乘数法的MPEG I / II Layer-3(MP3)编码的迭代速率失真优化算法。 通常,执行迭代方法,使得在比例因子固定的同时确定全局量化步长,此后在全局量化步长固定的同时确定比例因子。 直到计算出的速率 - 失真成本在预定的阈值内为止。 这些方法被证明在计算上是有效的,并且所得到的比特流是完全标准兼容的。
摘要:
A method for optimization of rate-distortion for Advanced Audio Coding (AAC). The method provides for the identification of quantized spectral coefficient sequences for optimization of rate-distortion. The method also provides joint optimization of scale factors, Huffman codebooks and quantized spectral coefficient sequences for minimization of a rate-distortion cost. The method provides an iterative rate-distortion optimization algorithm for AAC encoding. In each iteration, the method first finds the optimal scale factors and quantized spectral coefficients when Huffman codebooks are fixed, then updates Huffman codebooks and quantized spectral coefficients given the optimized scale factors. The iterations may be applied until a predetermined threshold is attained.
摘要:
An iterative rate-distortion optimization algorithm for MPEG I/II Layer-3 (MP3) encoding based on the method of Lagrangian multipliers. Generally, an iterative method is performed such that a global quantization step size is determined while scale factors are fixed, and thereafter the scale factors are determined while the global quantization step size is fixed. This is repeated until a calculated rate-distortion cost is within a predetermined threshold. The methods are demonstrated to be computationally efficient and the resulting bit stream is fully standard compatible.
摘要翻译:基于拉格朗日乘数法的MPEG I / II Layer-3(MP3)编码的迭代速率失真优化算法。 通常,执行迭代方法,使得在比例因子固定的同时确定全局量化步长,此后在全局量化步长固定的同时确定比例因子。 直到计算出的速率 - 失真成本在预定的阈值内为止。 这些方法被证明在计算上是有效的,并且所得到的比特流是完全标准兼容的。
摘要:
An improved fast N-point MDCT process and encoder/decoder is disclosed. The N-point MDCT may be realized through an N/2-point DCT algorithm. The N/2 DCT transform matrix is directly factored and the factored DCT transform matrices are used to develop a set of equations for realizing the N-point MDCT coefficients from an input sequence. The factoring of the DCT transform matrix may include expressing the DCT transform as a multiplication of matrices and exploiting mirror images within the matrices. It may further include simplifying at least one of the matrices by eliminating a variable based on trigonometric identity
摘要翻译:公开了一种改进的快速N点MDCT处理和编码器/解码器。 N点MDCT可以通过N / 2点DCT算法来实现。 N / 2 DCT变换矩阵被直接考虑,并且因子DCT变换矩阵用于开发用于从输入序列实现N点MDCT系数的一组方程。 DCT变换矩阵的分解可以包括将DCT变换表示为矩阵的乘法和利用矩阵内的镜像。 它可以进一步包括通过基于三角形识别来消除变量来简化矩阵中的至少一个
摘要:
A method of decoding data that is encoded with a set of prefix codes begins by receiving the data at a computing device, and then compiling native machine code from the prefix code set for execution by a processing unit of the computing device. The machine code implements a binary tree of prefix codes that corresponds to the prefix code set. The data is decoded by traversing the prefix code tree, which is effected by executing the machine code with the processing unit.
摘要:
A method of decoding data that is encoded with a set of prefix codes begins by receiving the data at a computing device, and then compiling native machine code from the prefix code set for execution by a processing unit of the computing device. The machine code implements a binary tree of prefix codes that corresponds to the prefix code set. The data is decoded by traversing the prefix code tree, which is effected by executing the machine code with the processing unit.