USRE44138E1 - Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices - Google Patents
Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices Download PDFInfo
- Publication number
- USRE44138E1 USRE44138E1 US13/301,526 US201113301526A USRE44138E US RE44138 E1 USRE44138 E1 US RE44138E1 US 201113301526 A US201113301526 A US 201113301526A US RE44138 E USRE44138 E US RE44138E
- Authority
- US
- United States
- Prior art keywords
- matrix
- value
- dequantization
- quantization
- quantization parameter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime, expires
Links
- 238000000034 method Methods 0.000 title claims abstract description 122
- 238000012545 processing Methods 0.000 title abstract description 18
- 238000013139 quantization Methods 0.000 claims description 158
- 239000011159 matrix material Substances 0.000 claims description 98
- 238000010606 normalization Methods 0.000 claims description 38
- 230000009466 transformation Effects 0.000 claims description 35
- OSWPMRLSEDHDFF-UHFFFAOYSA-N methyl salicylate Chemical compound COC(=O)C1=CC=CC=C1O OSWPMRLSEDHDFF-UHFFFAOYSA-N 0.000 claims description 9
- 230000001419 dependent effect Effects 0.000 claims description 8
- 241000023320 Luma <angiosperm> Species 0.000 claims description 7
- 230000001131 transforming effect Effects 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 abstract description 28
- 230000008569 process Effects 0.000 description 30
- 238000010586 diagram Methods 0.000 description 15
- 230000009467 reduction Effects 0.000 description 10
- 238000007906 compression Methods 0.000 description 8
- 230000006835 compression Effects 0.000 description 8
- 230000008901 benefit Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000000737 periodic effect Effects 0.000 description 4
- 230000002441 reversible effect Effects 0.000 description 4
- RTZKZFJDLAIYFH-UHFFFAOYSA-N Diethyl ether Chemical compound CCOCC RTZKZFJDLAIYFH-UHFFFAOYSA-N 0.000 description 2
- 238000007792 addition Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000002123 temporal effect Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000017105 transposition Effects 0.000 description 2
- VYZAMTAEIAYCRO-UHFFFAOYSA-N Chromium Chemical compound [Cr] VYZAMTAEIAYCRO-UHFFFAOYSA-N 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009432 framing Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/14—Conversion to or from non-weighted codes
- H03M7/24—Conversion to or from floating-point codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/124—Quantisation
- H04N19/126—Details of normalisation or weighting functions, e.g. normalisation matrices or variable uniform quantisers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/136—Incoming video signal characteristics or properties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/18—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a set of transform coefficients
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/184—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being bits, e.g. of the compressed video stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
Definitions
- This invention generally relates to video compression techniques and, more particularly, to a method for reducing the bit size required in the computation of video coding transformations.
- a video information format provides visual information suitable to activate a television screen, or store on a video tape.
- video data is organized in a hierarchical other.
- a video sequence is divided into group of frames, and each group can be composed of a series of single frames.
- Each frame is roughly equivalent to a still picture, with the still pictures being updated often enough to simulate a presentation of continuous motion.
- a frame is further divided into slices, or horizontal sections which helps system design of error resilience. Each slice is coded independently so that errors do not propagate across slices.
- a slice consists of macroblocks.
- a macroblock is made up of 16 ⁇ 16 luma pixels and a corresponding set of chrome pixels, depending on the video format.
- a macroblock always has an integer number of blocks, with the 8 ⁇ 8 pixel matrix being the smallest coding unit.
- Video compression is a critical component for any application which requires transmission or storage of video data. Compression techniques compensate for motion by reusing stored information in different areas of the frame (temporal redundancy). Compression also occurs by transforming data in the spatial domain to the frequency domain.
- Hybrid digital video compression exploiting temporal redundancy by motion compensation and spatial redundancy by transformation, such as Discrete Cosine Transform (DCT), has been adapted in H.26P and MPEG-X international standards as the basis.
- DCT Discrete Cosine Transform
- DCT inverse discrete cosine transform
- IDCT inverse discrete cosine transform
- Digital video (DV) codecs are one example of a device using a DCT-based data compression method.
- the image frame is divided into N by N blocks of pixel information including, for example, brightness and color data for each pixel.
- a common block size is eight pixels horizontally by eight pixels vertically.
- the pixel blocks are then “shuffled” so that several blocks from different portions of the image are grouped together. Shuffling enhances the uniformity of image quality.
- a motion detector looks for the difference between two fields of a frame. The motion information is sent to the next processing stage. In the next stage, pixel information is transformed using a DCT.
- An 8-8 DCT takes eight inputs and returns eight outputs in both vertical and horizontal directions. The resulting DCT coefficients are then weighted by multiplying each block of DCT coefficients by weighting constants.
- the weighted DCT coefficients are quantized in the next stage. Quantization rounds off each DCT coefficient within a certain range of values to be the same number. Quantizing tends to set the higher frequency components of the frequency matrix to zero, resulting in much less data to be stored. Since the human eye is most sensitive to lower frequencies, however, very little perceptible image quality is lost by this stage.
- the quantization stage includes converting the two-dimensional matrix of quantized coefficients to a one-dimensional linear stream of data by reading the matrix values in a zigzag pattern and dividing the one-dimensional linear stream of quantized coefficients into segments, where each segment consists of a string of zero coefficients followed by a non-zero quantized coefficient.
- Variable length coding VLC then is performed by transforming each segment, consisting of the number of zero coefficients and the amplitude of the non-zero coefficient in the segment, into a variable length codeword.
- a framing process packs every 30 blocks of variable length coded quantized coefficients into five fixed-length synchronization blocks.
- Decoding is essentially the reverse of the encoding process described above.
- the digital stream is first deframed.
- Variable length decoding VLD
- VLD Variable length decoding
- IDCT inverse discrete cosine transform
- the inverse weights are the multiplicative inverses of the weights that were applied in the encoding process.
- the output of the inverse weighting function is then processed by the IDCT.
- Type I algorithms are easy to implement on a parallel machine, that is, a computer formed of a plurality of processors operating simultaneously in parallel. For example, when using N parallel processors to perform a matrix multiplication on N ⁇ N matrices, N column multiplies can be simultaneously performed. Additionally, a parallel machine can be designed so as to contain special hardware or software instructions for performing fast matrix transposition.
- type I algorithms One disadvantage of type I algorithms is that more multiplications are needed.
- type II algorithms typically require fewer instructions (92 versus 112) and, in particular, fewer costly multiplications (24 versus 48).
- Type II algorithms are very difficult to implement efficiently on a parallel machine.
- Type II algorithms tend to reorder the data very frequently and reordering data on a parallel machine is very time-intensive.
- the present invention is an improved process for video compression.
- Typical video coding algorithms predict one frame from previously coded frames.
- the error is subjected to a transform and the resulting values are quantized.
- the quantizer controls the degree of compression.
- the quantizer controls the amount of information used to represent the video and the quality of the reconstruction.
- the problem is the interaction of the transform and quantization in video coding.
- the transform typically the discrete cosine transform
- the result of the transform is quantized in standard ways using scalar or vector quantization.
- MPEG-1, MPEG-2, MPEG-4, H.261, H.263, the definition of the inverse transform has not been bit exact. This allows the implementer some freedom to select a transform algorithm suitable for their platform.
- a drawback of this approach is the potential for encoder/decoder mismatch damaging the prediction loop. To solve this mismatch problem portions of the image are periodically coded without prediction.
- Current work, for example H.26L has focused on using integer transforms that allow bit exact definition.
- Integer transforms may not normalized.
- the transform is designed so that a final shift can be used to normalize the results of the calculation rather than intermediate divisions.
- Quantization also requires division.
- H.26L provides an example of how these integer transforms are used along with quantization.
- H.26L Test Model Long-term 8 normalization is combined with quantization and implemented via integer multiplications and shifts following forward transform and quantization and following dequantization and inverse transform.
- H.26L TML uses two arrays of integers A(QP) and B(QP) indexed by quantization parameter (QP), see Table 1. These values are constrained by the relation shown below in Equation 1.
- TML quantization parameters QP A TML (QP) B TML (QP) 0 620 3881 1 553 4351 2 492 4890 3 439 5481 4 391 6154 5 348 6914 6 310 7761 7 276 8718 8 246 9781 9 219 10987 10 195 12339 11 174 13828 12 155 15523 13 138 17435 14 123 19561 15 110 21873 16 98 24552 17 87 27656 18 78 30847 19 69 34870 20 62 38807 21 55 43747 22 49 49103 23 44 54683 24 39 61694 25 35 68745 26 31 77615 27 27 89113 28 24 100253 29 22 109366 30 19 126635 31 17 141533
- Transform coding in H.26L uses a 4 ⁇ 4 block size and an integer transform matrix T, Equation 2.
- the transform coefficients K are calculated as in Equation 3.
- the quantization levels, L are calculated by integer multiplication.
- the levels are used to calculate a new set of coefficients, K′. Additional integer matrix transforms followed by a shift are used to calculate the reconstructed values X′.
- the encoder is allowed freedom in calculation and rounding of the forward transform. Both encoder and decoder must compute exactly the same answer for the inverse calculations.
- the dynamic range required during these calculations can be determined.
- the primary application involves 9-bit input, 8 bits plus sign, the dynamic range required by intermediate registers and memory accesses is presented in Table 2.
- the present invention combines quantization and normalization, to eliminate the growth of dynamic range of intermediate results. With the present invention the advantages of bit exact inverse transform and quantization definitions are kept, while controlling the bit depth required for these calculations. Reducing the required bit depth reduces the complexity required of a hardware implementation and enables efficient use of single instruction multiple data (SIMD) operations, such as the Intel MMX instruction set.
- SIMD single instruction multiple data
- a method for the quantization of a coefficient.
- the method comprises: receiving a coefficient K; receiving a quantization parameter (QP); forming a quantization value (L) from the coefficient K using a mantissa portion (Am(QP)) and an exponential portion (x Ae(QP) ).
- the value of x is 2.
- forming a quantization value (L) from the coefficient K includes:
- the method further comprises: normalizing the quantization value by 2 N as follows:
- receiving a coefficient K includes receiving a coefficient matrix K[i][j]. Then, forming a quantization value (L) from the coefficient matrix K[i][j] includes forming a quantization value matrix (L[i][j]) using a mantissa portion matrix Am(QP)[i][j]) and an exponential portion matrix (x Ae(QP)[i][j] ).
- FIG. 1 is a flowchart illustrating the present invention method for the quantization of a coefficient.
- FIG. 2 is a diagram showing embodiments of the present invention comprising systems and methods for video encoding wherein a quantization parameter may be established based on user inputs;
- FIG. 3 is a diagram showing embodiments of the present invention comprising systems and methods for video decoding
- FIG. 4 is diagram showing embodiments of the present invention comprising storing encoder output on a computer-readable storage media
- FIG. 5 is a diagram showing embodiments of the present invention comprising sending encoder output over a network
- FIG. 6 is a diagram showing embodiments of quantization methods and apparatuses of the present invention comprising a first mantissa portion processing means and a first exponential portion processing means;
- FIG. 7 is a diagram showing embodiments of quantization methods and apparatuses of the present invention comprising a first mantissa portion processing means and a first shifting portion processing means;
- FIG. 8 is a diagram showing embodiments of dequantization methods and apparatuses of the present invention comprising a second mantissa portion processing means and a second exponential portion processing means;
- FIG. 9 is a diagram showing embodiments of dequantization methods and apparatuses of the present invention comprising a second mantissa portion processing means and a second shifting portion processing means;
- FIG. 10 is diagram showing prior art methods comprising dequantization, inverse transformation, and normalization (Prior Art);
- FIG. 11 is a diagram showing embodiments of the present invention comprising factorization of an equivalent of a dequantization scaling factor
- FIG. 12 is a diagram showing embodiments of the present invention comprising factorization thereby achieving a reduction in bit depth for inverse transformation calculations and reduce memory requirements for dequantization parameter storage;
- FIG. 13 is a diagram showing embodiments of the present invention comprising a normalization process independent of quantization parameter (QP);
- FIG. 14 is diagram showing embodiments of the present invention comprising frequency dependent quantization
- FIG. 15 is a diagram showing prior art methods comprising quantization (Prior Art).
- FIG. 16 is a diagram showing embodiments of the present invention comprising factorization of an equivalent of a quantization scaling factor.
- Equation 4 The dynamic range requirements of the combined transform and quantization is reduced by factoring the quantization parameters A(QP) and B(QP) into a mantissa and exponent terms as shown in Equation 4. With this structure, only the precision due to the mantissa term needs to be preserved during calculation. The exponent term can be included in the final normalization shift. This is illustrated in the sample calculation Equation 5.
- a set of quantization parameters is presented that reduce the dynamic range requirement of an H.26L decoder to 16-bit memory access.
- the memory access of the inverse transform is reduced to 16 bits.
- Equation 5 the transform calculations can be modified to reduce the dynamic range as shown in Equation 5. Note how only the mantissa values contribute to the growth of dynamic range. The exponent factors are incorporated into the final normalization and do not impact the dynamic range of intermediate results.
- each element of each matrix is factored into a mantissa and an exponent term as illustrated in the equations below, Equation 8.
- a structure is also defined for the mantissa values. For each index pair (i,j), the mantissa values are periodic with period P. This is summarized by the structural equation, Equation 10. With this structure, there are P independent matrices for A mantissa and P independent matrices for B mantissa reducing memory requirements and adding structure to the calculations.
- the inverse transform may include integer division that requires rounding. In cases of interest, the division is by a power of 2. The rounding error is reduced by designing the dequantization factors to be multiples of the same power of 2, giving no remainder following division.
- Equation 11 Dequantization using the mantissa values B mantissa (QP) gives dequantized values that are normalized differently depending upon QP. This must be compensated for following the inverse transform. A form of this calculation is shown in Equation 11.
- Equation 13 An example follows that illustrates the present invention use of quantization matrices.
- the forward and inverse transforms defined in Equation 13 need a quantization matrix rather than a single scalar quantization value.
- Sample quantization and dequantization parameters are given.
- T forward ( 1 1 1 1 1 2 1 - 1 - 2 1 - 1 - 1 - 1 1 1 - 2 2 - 1 )
- T reverse ( 2 2 2 1 2 1 - 2 - 2 2 - 2 - 2 2 2 - 1 2 - 1 )
- Equation 19 The description of dequantization, inverse transform, and normalization for this example is given below, Equation 19 and 20.
- FIG. 1 is a flowchart illustrating the present invention method for the quantization of a coefficient. Although this method is depicted as a sequence of numbered steps for clarity, no order should be inferred from the numbering unless explicitly stated. It should be understood that some of these steps may be skipped, performed in parallel, or performed without the requirement of maintaining a strict order of sequence.
- the methods start at Step 100 .
- Step 102 supplies a coefficient K.
- Step 104 supplies a quantization parameter (QP).
- Step 106 forms a quantization value (L) from the coefficient K using a mantissa portion (Am(QP)) and an exponential portion (x Ae(QP) ).
- the exponential portion (x Ae(QP) ) includes x being the value 2.
- Step 106 forming a quantization value (L) from the coefficient K using a mantissa portion (Am(QP)) and an exponential portion (x Ae(QP) ) in Step 106 includes:
- Step 108 normalizes the quantization value by 2N as follows:
- receiving a coefficient K in Step 102 includes receiving a coefficient matrix K[i][j]. Then, forming a quantization value (L) from the coefficient matrix K[i][j] using a mantissa portion (Am(QP) and an exponential portion (x Ae(QP) ) in Step 106 includes forming a quantization value matrix (L[i][j]) using a mantissa portion matrix (Am(QP)[i][j]) and an exponential portion matrix (x Ae(QP)[i][j] ).
- forming a quantization value matrix (L[i] [j]) using a mantissa portion matrix (Am(QP)[i][j]) and an exponential portion matrix (x Ae(QP)[i][j] ) includes, for each particular value of QP, every element in the exponential portion matrix being the same value.
- Step 110 forms a dequantization value (X1) from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (xBe(QP)). Again, the exponential portion (x Be(QP) ) typically includes x being the value 2.
- forming a dequantization value (X1) from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (2 Be(QP) ) includes:
- Step 112 of denormalizing the quantization value by 2 N as follows:
- forming a dequantization value (X1), from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (x Be(QP) ) in Step 110 includes forming a dequantization value matrix (X1[i][j]) using a mantissa portion matrix (Bm(QP)[i][j]) and an exponential portion matrix (x Be(QP)[i][j] ).
- forming a dequantization value matrix (X1[i][j]) using a mantissa portion matrix (Bm(QP)[i][j]) and an exponential portion matrix (x Be(QP)[i][j] ) includes, for each particular value of QP, every element in the exponential portion matrix being the same value.
- Another aspect of the invention includes a method for the dequantization of a coefficient.
- the process is essentially the same as Steps 110 and 112 above, and is not repeated in the interest of brevity.
- a method for the quantization of a coefficient has been presented.
- An example is given illustrating a combined dequantization and normalization procedure applied to the H.26L video coding standard with a goal of reducing the bit-depth required at the decoder to 16 bits.
- the present invention concepts can also be used to meet other design goals within H.26L. In general, this invention has application to the combination of normalization and quantization calculations.
- Embodiments of the present invention may be implemented as hardware, firmware, software and other implementations. Some embodiments may be implemented on general purpose computing devices or on computing devices specifically designed for implementation of these embodiments. Some embodiments may be stored in memory as a means of storing the embodiment or for the purpose of executing the embodiment on a computing device.
- Some embodiments of the present invention comprise systems and methods for video encoding, as shown in FIG. 2 .
- image data 130 it subtracted from 132 with data representing prior video frames 145 resulting in a differential image 133 , which is sent to a transform module 134 .
- Transform module 134 may use DCT or other transform methods to transform the image.
- the result of the transform process will be coefficients (K), which are then sent to a quantization module 136 for quantization.
- Quantization module 136 may have other inputs, such as user inputs 131 for establishing quantization parameters (QPs) and for other input. Quantization module 136 may use the transformation coefficients and the quantization parameters to determine quantization levels (L) in the video image. Quantization module 136 may use methods employing a mantissa portion and an exponential portion, however, other quantization methods may also be employed in the quantization modules 136 of embodiments of the present invention. These quantization levels 135 and quantization parameters 133 are output to a coding module 131 as well as a dequantization module (DQ) 140 .
- DQ dequantization module
- Output to the coding module 138 is encoded and transmitted outside the encoder for immediate decoding or storage.
- Coding module 131 may use variable length coding (VLC) in its coding processes.
- Coding module 138 may use arithmetic coding in its coding process.
- Output from quantization module 136 is also received at dequantization module 140 to begin reconstruction of the image. This is done to keep an accurate accounting of prior frames.
- Dequantization module 140 performs a process with essentially the reverse effect as quantization module 136 .
- Quantization levels or values (L) are dequantized yielding transform coefficients.
- Dequantization modules 140 may use methods employing a mantissa portion and an exponential portion as described herein.
- the transform coefficients output from dequantization module 140 are sent to an inverse transformation (IT) module 142 where they are inverse transformed to a differential image 141 .
- This differential image 141 is then combined with data from prior image frames 145 to form a video frame 149 that may be input to a frame memory 146 for reference to succeeding frames.
- Video frame 149 may also serve as input to a motion estimation module 147 , which also receives input image data 130 . These inputs may be used to predict image similarities and help compress image data. Output from motion estimation module 147 is sent to motion compensation module 148 and combined with output data from coding module 138 , which is sent out for later decoding and eventual image viewing.
- Motion compensation module 148 uses the predicted image data to reduce frame data requirements; its output is subtracted from input image data 130 .
- Some embodiments of the present invention comprise systems and methods for video decoding, as shown in FIG. 3 .
- a decoder of embodiments of the present invention may receive encoded image data 150 to a decoder module 152 .
- Encoded image data 150 may comprise data that has been encoded by an encoder 100 such as that described with reference to FIG. 2 .
- Decoder module 152 may employ variable length decoding methods if they were used in the encoding process. Other decoding methods may also be used as dictated by the type of encoded data 150 . Decoding module 152 performs essentially the reverse process as coding module 138 . Output from decoding module 152 may comprise quantization parameters 156 and quantization values 154 . Other output may comprise motion estimation data and image prediction data that may be sent directly to a motion compensation module 166 .
- quantization parameters 156 and quantization values 154 are output to a dequantization module 158 , where quantization values are converted back to transform coefficients. These coefficients are then sent to an inverse transformation module 160 for conversion back to spatial domain image data 161 .
- the motion compensation unit 166 uses motion vector data and the frame memory 164 to construct a reference image 165 .
- Image data 161 represents a differential image that must be combined 162 with prior image data 165 to form a video frame 163 .
- This video frame 163 is output 168 for further processing, display or other purposes and may be stored in frame memory 164 and used for reference with subsequent frames.
- image data 102 may be sent to an encoder or encoding portion 104 for the various transformation, quantization, encoding and other procedures typical of video encoding as described above for some embodiments of the present invention.
- Output from the encoder may then be stored on any computer-readable storage media 106 .
- Storage media 106 may act as a short-term buffer or as a long-term storage device.
- encoded video data may be read from storage media 106 and decoded by a decoder or decoding portion 108 for output 110 to a display or other device.
- image data 112 may be sent to an encoder or encoding portion 114 for the various transformation, quantization, encoding and ether procedures typical of video encoding as described above for some embodiments of the present invention.
- Output from the encoder may then be sent over a network, such as a LAN, WAN or the Internet 116 .
- a storage device such as storage media 106 may be part of a network.
- Encoded video data may be received and decoded by a decoder or decoding portion 118 , which also communicates with network 116 . Decoder 118 may then decode the data for local consumption 120 .
- a quantization method or apparatus comprises a mantissa portion 172 and an exponential portion 174 .
- Quantization parameters 176 are input to both portions 172 & 174 .
- a coefficient K 170 is input to the mantissa portion 172 where it is modified using the quantization parameter and other values as explained above. The result of this operation is combined with the result produced in the exponential portion using the quantization parameter thereby producing a quantization level or value L 178 .
- a quantization method or apparatus comprises a mantissa portion 182 and a shifting portion 184 .
- Quantization parameters 186 are input to both portions 182 & 184 .
- a coefficient, K 180 is input to the mantissa portion 182 where it is modified using the quantization parameter and other values as explained above.
- the result of this operation is further processed in the shifting portion using the quantization parameter thereby producing a quantization level or value, L 188 .
- Some embodiments of the present invention comprise a dequantization method or apparatus with a mantissa portion 192 and an exponential portion 194 .
- Quantization parameters 196 are input to both portions 192 & 194 .
- a quantization value, L 190 is input to the mantissa portion 192 where it is modified using the quantization parameter and other values as explained above.
- the result of this operation is further processed in the exponential portion using the quantization parameter thereby producing a coefficient, X1 198 .
- Some embodiments of the present invention comprise a dequantization method or apparatus with a mantissa portion 202 and a shifting portion 204 .
- Quantization parameters 206 are input to both portions 202 & 204 .
- a quantization value, L 200 is input to the mantissa portion 202 where it is modified using the quantization parameter and other values as explained above.
- the result of this operation is further processed in the exponential portion using the quantization parameter thereby producing a coefficient, X1 208 .
- Some embodiments of the present invention may be stored on computer-readable media such as magnetic media, optical media, and other media as well as combinations of media. Some embodiments may also be transmitted as signals across networks and communication media. These transmissions and storage actions may take place as part of operation of embodiments of the present invention or as a way of transmitting the embodiment to a destination.
- a reduction in bit depth for inverse transformation calculations is achieved.
- the processes of these embodiments, illustrated in FIG. 11 begin with input in the form of an array of quantized coefficient levels c ⁇ 220 , and a quantization parameter QP 222 similar to typical prior art methods.
- the equivalent of a dequantization scaling factor S QP is factored 223 & 225 into a mantissa portion R QP 236 and an exponential portion E QP 238 .
- the mantissa portion 236 is used during dequantization 240 to calculate the reconstructed transform coefficients ( ⁇ tilde over (w) ⁇ ⁇ ) 242 , which are used in the inverse transformation process 228 to calculate reconstructed samples ( ⁇ tilde over (x) ⁇ ′ ⁇ ) 244 . These reconstructed samples may then be normalized using the exponential portion 238 according to Equation 26, thereby yielding reconstructed samples (x′′ ⁇ ) 234 .
- the values of ⁇ tilde over (w) ⁇ ⁇ and ⁇ tilde over (x) ⁇ ′ ⁇ require E QP fewer bits for representation than the corresponding values w ⁇ and x′ ⁇ . This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as shown in Equations 24-26.
- ⁇ tilde over (w) ⁇ ⁇ C ⁇ ⁇ R QP Equation 24
- a reduction in bit depth for inverse transformation calculations is achieved together with a reduction in memory needed to store dequantization parameters.
- the processes of these embodiments, illustrated in FIG. 12 begin with input in the form of an array of quantized coefficient levels c ⁇ 220 , a quantization parameter QP 222 similar to typical prior art methods. However, in these embodiments, an additional parameter P is used and the equivalent of a dequantization scaling factor S QP is factored 227 & 229 into a mantissa portion R QP 236 and an exponential portion E QP 238 .
- the mantissa portion, R QP 236 doubles with each increment of QP by P.
- the exponential portion E QP 238 is periodic with period P.
- the mantissa portion 236 is used during dequantization 240 to calculate the reconstructed transform coefficients ( ⁇ tilde over (w) ⁇ ⁇ ) 242 , which are used in the inverse transformation process 228 to calculate reconstructed samples ( ⁇ tilde over (x) ⁇ ′ ⁇ ) 244 . These reconstructed samples may then be normalized using the exponential portion 238 according to Equation 28, thereby yielding reconstructed samples, x′′ ⁇ 234 . Using these methods, the values of ⁇ tilde over (w) ⁇ ⁇ and ⁇ tilde over (x) ⁇ ′ ⁇ require E QP fewer bits for representation.
- a reduction in bit depth for inverse transformation calculations is achieved together with a reduction in memory needed to store dequantization parameters.
- the normalization process is independent of QP. This eliminates the need to communicate an exponential value for use in the normalization process.
- the exponential portion, previously described as E QP is held constant and incorporated into normalization 248 thereby negating the need to transmit the value as is done in previously described embodiments.
- the processes of these embodiments, illustrated in FIG. 13 begin with input in the form of an array of quantized coefficient levels c ⁇ 220 , a quantization parameter QP 222 similar to typical prior art methods. Some of these embodiments implement the parameter P as described above.
- the equivalent of a dequantization scaling factor S QP is factored 227 & 229 into a mantissa portion R QP 236 and a constant exponential portion E QP that is incorporated into normalization 248 .
- the mantissa portion, RQP 236 may double with each increment of QP by P as previously described.
- the exponential portion E QP 238 is constant.
- the mantissa portion 236 is used during dequantization 240 to calculate the reconstructed transform coefficients ( ⁇ tilde over (w) ⁇ ⁇ ) 242 , which are used in the inverse transformation process 228 to calculate reconstructed samples ( ⁇ tilde over (x) ⁇ ′ ⁇ ) 244 .
- a reduction in bit depth for inverse transformation calculations is achieved together with a reduction in memory needed to store dequantization parameters and the normalization process is independent of QP thereby eliminating the need to communicate an exponential value for use in the normalization process.
- These embodiments also express the quantization scaling factor mantissa portion as a matrix. This matrix format allows frequency dependent quantization, which allows the processes of these embodiments to be used in coding schemes that comprise frequency-dependent transformation.
- the exponential portion, previously described as E QP may be held constant and incorporated into normalization 248 as previously explained.
- the processes of these embodiments, illustrated in FIG. 14 begin with input in the form of an array of quantized coefficient levels c ⁇ 220 , and a quantization parameter QP 222 similar other methods. Some of these embodiments may implement the parameter P as described above.
- the equivalent of a dequantization scaling factor S ⁇ QP is factored 254 into a mantissa portion R ⁇ QP 252 and a constant exponential portion E QP that is incorporated into normalization 248 .
- the mantissa portion, R ⁇ QP 252 may double with each increment of QP by P as previously described.
- the exponential portion E QP is constant.
- the mantissa portion 252 is used during dequantization 250 to calculate the reconstructed transform coefficients ( ⁇ tilde over (w) ⁇ ⁇ ) 242 , which are used in the inverse transformation process 228 to calculate reconstructed samples ( ⁇ tilde over (x) ⁇ ′ ⁇ ) 244 .
- reconstructed samples may then be normalized using the constant exponential portion that is incorporated into normalization 248 according to Equation 27, thereby yielding reconstructed samples, x′′ ⁇ 234 .
- the values of ⁇ tilde over (w) ⁇ ⁇ and ⁇ tilde over (x) ⁇ ′ ⁇ require E QP fewer bits for representation.
- This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as described above and in Equations 25, 27 & 29.
- Typical methods of quantization may be expressed mathematically in equation form. These methods, as illustrated in FIG. 15 , may begin with input in the form of a coefficient (k) 256 and a quantization parameter 222 .
- the coefficient 256 is multiplied by a quantization factor 262 to give the value g 264 according to Equation 31.
- the value g 264 is normalized 266 to give the quantized coefficient level c 220 according to Equation 32.
- g k ⁇ S QP Equation 31
- a quantization scaling factor S QP is factored into a mantissa portion R QP 274 and an exponential portion E QP 276 .
- the mantissa portion R QP 274 is periodic with period P.
- the exponential portion 276 decreases by one for each increment of QP by P.
- the mantissa portion 274 is used during quantization 278 to calculate the scaled transform coefficient ( ⁇ tilde over (g) ⁇ ) 280 according to Equation 33.
- the scaled transform coefficient may then be normalized 282 using the exponential portion 276 according to Equation 34, thereby yielding the quantized coefficient level (c) 220 .
- the value of ⁇ tilde over (g) ⁇ 280 requires E QP fewer bits for representation than a corresponding value g 264 generated through known methods. Values of R 274 and E 276 need only be stored for QP in one period [1, P] reducing the memory requirements. This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as shown in Equations 33 & 34.
- ⁇ tilde over (g) ⁇ k ⁇ R QP % P Equation 33
- c ⁇ tilde over (g) ⁇ >>(M ⁇ E QP ) Equation 34
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Image Processing (AREA)
- Television Signal Processing For Recording (AREA)
- Analogue/Digital Conversion (AREA)
Abstract
Embodiments of the present invention comprise systems and methods for processing of data related to video wherein reduced bit depth intermediate calculations are enabled.
Description
This application is a continuation of U.S. patent application Ser. No. 10/326,459 entitled, METHODS AND SYSTEMS FOR EFFICIENT VIDEO-RELATED DATA PROCESSING, invented by Louis Kerofsky, filed Dec. 20, 2002 now U.S. Pat. No. 7,170,942, which is a continuation of U.S. patent application Ser. No. 10/139,036 entitled, METHOD FOR REDUCED BIT-DEPTH QUANTIZATION, invented by Louis Kerofsky, filed May 2, 2002 now U.S. Pat. No. 7,123,655, which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/319,018 entitled, METHODS AND SYSTEMS FOR VIDEO CODING WITH JOINT QUANTIZATION AND NORMALIZATION PROCEDURES, invented by Louis Kerofsky, filed Nov. 30, 2001, and also claims the benefit of U.S. Provisional Patent Application Ser. No. 60/311,436 entitled, REDUCED BIT-DEPTH QUANTIZATION, invented by Louis Kerofsky, filed Aug. 9, 2001.This Application is a Divisional Reissue Application of Continuation Reissue application Ser. No. 12/837,154, filed Jul. 15, 2010 now U.S. Pat. No. Re. 43,091, of Reissue application Ser. No. 12/689,897, filed Jan. 19, 2010 now U.S. Pat. No. Re. 42,745, which itself is a reissue of U.S. Pat. No. 7,400,682 entitled SYSTEMS AND METHODS FOR REDUCED BIT-DEPTH PROCESSING IN VIDEO-RELATED DATA WITH FREQUENCY WEIGHTING MATRICES, which is a continuation of U.S. patent application Ser. No. 10/326,459 entitled, METHODS AND SYSTEMS FOR EFFICIENT VIDEO-RELATED DATA PROCESSING, invented by Louis Kerofsky, filed Dec. 20, 2002 now U.S. Pat. No. 7,170,942, which is a continuation of U.S. patent application Ser. No. 10/139,036 entitled, METHOD FOR REDUCED BIT-DEPTH QUANTIZATION, invented by Louis Kerofsky, filed May 2, 2002 now U.S. Pat. No. 7,123,655, which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/319,018 entitled, METHODS AND SYSTEMS FOR VIDEO CODING WITH JOINT QUANTIZATION AND NORMALIZATION PROCEDURES, invented by Louis Kerofsky, filed Nov. 30, 2001, and also claims the benefit of U.S. Provisional Patent Application Ser. No. 60/311,436 entitled, REDUCED BIT-DEPTH QUANTIZATION, invented by Louis Kerofsky, filed Aug. 9, 2001. More than one Divisional Reissue Application has been filed for the reissue of application Ser. No. 12/837,154. The reissue applications are application Ser. No. 13/301,526 (the present application), Ser. Nos. 13/301,430, 13/301,476, and 13/301,502, all of which are divisional reissues of application Ser. No. 12/837,154, and all of which were filed on Nov. 21, 2011.
1. Field of the Invention
This invention generally relates to video compression techniques and, more particularly, to a method for reducing the bit size required in the computation of video coding transformations.
2. Description of the Related Art
A video information format provides visual information suitable to activate a television screen, or store on a video tape. Generally, video data is organized in a hierarchical other. A video sequence is divided into group of frames, and each group can be composed of a series of single frames. Each frame is roughly equivalent to a still picture, with the still pictures being updated often enough to simulate a presentation of continuous motion. A frame is further divided into slices, or horizontal sections which helps system design of error resilience. Each slice is coded independently so that errors do not propagate across slices. A slice consists of macroblocks. In H.26P and Motion Picture Experts Group (MPEG)-X standards, a macroblock is made up of 16×16 luma pixels and a corresponding set of chrome pixels, depending on the video format. A macroblock always has an integer number of blocks, with the 8×8 pixel matrix being the smallest coding unit.
Video compression is a critical component for any application which requires transmission or storage of video data. Compression techniques compensate for motion by reusing stored information in different areas of the frame (temporal redundancy). Compression also occurs by transforming data in the spatial domain to the frequency domain. Hybrid digital video compression, exploiting temporal redundancy by motion compensation and spatial redundancy by transformation, such as Discrete Cosine Transform (DCT), has been adapted in H.26P and MPEG-X international standards as the basis.
As stated in U.S. Pat. No. 6,317,767 (Wang), DCT and inverse discrete cosine transform (IDCT) are widely used operations in the signal processing of image data. Both are used, for example, in the international standards for moving picture video compression put forth by the MPEG. DCT has certain properties that produce simplified and efficient coding models. When applied to a matrix of pixel data, the DCT is a method of decomposing a block of data into a weighted sum of spatial frequencies, or DCT coefficients. Conversely, the IDCT is used to transform a matrix of DCT coefficients back to pixel data.
Digital video (DV) codecs are one example of a device using a DCT-based data compression method. In the blocking stage, the image frame is divided into N by N blocks of pixel information including, for example, brightness and color data for each pixel. A common block size is eight pixels horizontally by eight pixels vertically. The pixel blocks are then “shuffled” so that several blocks from different portions of the image are grouped together. Shuffling enhances the uniformity of image quality.
Different fields are recorded at different time incidents. For each block of pixel data, a motion detector looks for the difference between two fields of a frame. The motion information is sent to the next processing stage. In the next stage, pixel information is transformed using a DCT. An 8-8 DCT, for example, takes eight inputs and returns eight outputs in both vertical and horizontal directions. The resulting DCT coefficients are then weighted by multiplying each block of DCT coefficients by weighting constants.
The weighted DCT coefficients are quantized in the next stage. Quantization rounds off each DCT coefficient within a certain range of values to be the same number. Quantizing tends to set the higher frequency components of the frequency matrix to zero, resulting in much less data to be stored. Since the human eye is most sensitive to lower frequencies, however, very little perceptible image quality is lost by this stage.
The quantization stage includes converting the two-dimensional matrix of quantized coefficients to a one-dimensional linear stream of data by reading the matrix values in a zigzag pattern and dividing the one-dimensional linear stream of quantized coefficients into segments, where each segment consists of a string of zero coefficients followed by a non-zero quantized coefficient. Variable length coding (VLC) then is performed by transforming each segment, consisting of the number of zero coefficients and the amplitude of the non-zero coefficient in the segment, into a variable length codeword. Finally, a framing process packs every 30 blocks of variable length coded quantized coefficients into five fixed-length synchronization blocks.
Decoding is essentially the reverse of the encoding process described above. The digital stream is first deframed. Variable length decoding (VLD) then unpacks the data so that it may be restored to the individual coefficients. After inverse quantizing the coefficients, inverse weighting and an inverse discrete cosine transform (IDCT) are applied to the result. The inverse weights are the multiplicative inverses of the weights that were applied in the encoding process. The output of the inverse weighting function is then processed by the IDCT.
Much work has been done studying means of reducing the complexity in the calculation of DCT and IDCT. Algorithms that compute two-dimensional IDCTs are called “type I” algorithms. Type I algorithms are easy to implement on a parallel machine, that is, a computer formed of a plurality of processors operating simultaneously in parallel. For example, when using N parallel processors to perform a matrix multiplication on N×N matrices, N column multiplies can be simultaneously performed. Additionally, a parallel machine can be designed so as to contain special hardware or software instructions for performing fast matrix transposition.
One disadvantage of type I algorithms is that more multiplications are needed. The computation sequence of type I algorithms involves two matrix multiplies separated by a matrix transposition which, if N=4, for example, requires 64 additions and 48 multiplications for a total number of 112 instructions. It is well known by those skilled in the art that multiplications are very time-consuming for processors to perform and that system performance is often optimized by reducing the number of multiplications performed.
A two-dimensional IDCT can also be obtained by converting the transpose of the input matrix into a one-dimensional vector using an L function. Next, the tensor product of constant a matrix is obtained. The tensor product is then multiplied by the one-dimensional vector L. The result is converted back into an N×N matrix using the M function. Assuming again that N=4, the total number of instructions used by this computational sequence is 92 instructions (68 additions and 24 multiplications). Algorithms that perform two-dimensional IDCTs using this computational sequence are called “type II” algorithms. In type II algorithms, the two constant matrices are grouped together and performed as one operation. The advantage of type II algorithms is that they typically require fewer instructions (92 versus 112) and, in particular, fewer costly multiplications (24 versus 48). Type II algorithms, however, are very difficult to implement efficiently on a parallel machine. Type II algorithms tend to reorder the data very frequently and reordering data on a parallel machine is very time-intensive.
There exist numerous type I and type II algorithms for implementing IDCTs, however, dequantization has been treated as an independent step depending upon DCT and IDCT calculations. Efforts to provide bit exact DCT and IDCT definitions have led to the development of efficient integer transforms. These integer transforms typically increase the dynamic range of the calculations. As a result, the implementation of these algorithms requires processing and storing data that consists of more than 16 bits.
It would be advantageous if intermediate stage quantized coefficients could be limited to a maximum size in transform processes.
It would be advantageous if a quantization process could be developed that was useful for 16-bit processors.
It would be advantageous if a decoder implementation, dequantization, and inverse transformation could be implemented efficiently with a 16-bit processor. Likewise, it would be advantageous if the multiplication could be performed with no more than 16 bits, and if memory access required no more than 16 bits.
The present invention is an improved process for video compression. Typical video coding algorithms predict one frame from previously coded frames. The error is subjected to a transform and the resulting values are quantized. The quantizer controls the degree of compression. The quantizer controls the amount of information used to represent the video and the quality of the reconstruction.
The problem is the interaction of the transform and quantization in video coding. In the past the transform and quantizer have been designed independently. The transform, typically the discrete cosine transform, is normalized. The result of the transform is quantized in standard ways using scalar or vector quantization. In prior work, MPEG-1, MPEG-2, MPEG-4, H.261, H.263, the definition of the inverse transform has not been bit exact. This allows the implementer some freedom to select a transform algorithm suitable for their platform. A drawback of this approach is the potential for encoder/decoder mismatch damaging the prediction loop. To solve this mismatch problem portions of the image are periodically coded without prediction. Current work, for example H.26L, has focused on using integer transforms that allow bit exact definition. Integer transforms may not normalized. The transform is designed so that a final shift can be used to normalize the results of the calculation rather than intermediate divisions. Quantization also requires division. H.26L provides an example of how these integer transforms are used along with quantization.
In H.26L Test Model Long-term 8, normalization is combined with quantization and implemented via integer multiplications and shifts following forward transform and quantization and following dequantization and inverse transform. H.26L TML uses two arrays of integers A(QP) and B(QP) indexed by quantization parameter (QP), see Table 1. These values are constrained by the relation shown below in Equation 1.
TABLE 1 |
TML quantization parameters |
QP | ATML(QP) | BTML(QP) |
0 | 620 | 3881 |
1 | 553 | 4351 |
2 | 492 | 4890 |
3 | 439 | 5481 |
4 | 391 | 6154 |
5 | 348 | 6914 |
6 | 310 | 7761 |
7 | 276 | 8718 |
8 | 246 | 9781 |
9 | 219 | 10987 |
10 | 195 | 12339 |
11 | 174 | 13828 |
12 | 155 | 15523 |
13 | 138 | 17435 |
14 | 123 | 19561 |
15 | 110 | 21873 |
16 | 98 | 24552 |
17 | 87 | 27656 |
18 | 78 | 30847 |
19 | 69 | 34870 |
20 | 62 | 38807 |
21 | 55 | 43747 |
22 | 49 | 49103 |
23 | 44 | 54683 |
24 | 39 | 61694 |
25 | 35 | 68745 |
26 | 31 | 77615 |
27 | 27 | 89113 |
28 | 24 | 100253 |
29 | 22 | 109366 |
30 | 19 | 126635 |
31 | 17 | 141533 |
A(QP)·B(QP)·6762≈240.
Normalization and quantization are performed simultaneously using these integers and divisions by powers of 2. Transform coding in H.26L uses a 4×4 block size and an integer transform matrix T, Equation 2. For a 4×4 block X, the transform coefficients K are calculated as in Equation 3. From the transform coefficients, the quantization levels, L, are calculated by integer multiplication. At the decoder the levels are used to calculate a new set of coefficients, K′. Additional integer matrix transforms followed by a shift are used to calculate the reconstructed values X′. The encoder is allowed freedom in calculation and rounding of the forward transform. Both encoder and decoder must compute exactly the same answer for the inverse calculations.
Y=T·X
K=Y·TT
L=(ATML(QP)·K)/220
K′=BTML(QP)·L
Y′=TT·K′
X′=(Y′·T)/220
-
- Where the intermediate result Y is the result of a one dimensional transform and the intermediate result Y′ is the result of a one dimensional inverse transform.
The dynamic range required during these calculations can be determined. The primary application involves 9-bit input, 8 bits plus sign, the dynamic range required by intermediate registers and memory accesses is presented in Table 2.
TABLE 2 |
Dynamic range of TML transform and inverse transform (bits) |
9-bit input | LUMA Transform | Inverse Transform | |
Register | 30 | 27 | |
Memory | 21 | 26 | |
To maintain bit-exact definitions and incorporate quantization, the dynamic range of intermediate results can be large since division operations are postponed. The present invention combines quantization and normalization, to eliminate the growth of dynamic range of intermediate results. With the present invention the advantages of bit exact inverse transform and quantization definitions are kept, while controlling the bit depth required for these calculations. Reducing the required bit depth reduces the complexity required of a hardware implementation and enables efficient use of single instruction multiple data (SIMD) operations, such as the Intel MMX instruction set.
Accordingly, a method is provided for the quantization of a coefficient. The method comprises: receiving a coefficient K; receiving a quantization parameter (QP); forming a quantization value (L) from the coefficient K using a mantissa portion (Am(QP)) and an exponential portion (xAe(QP)). Typically, the value of x is 2.
In some aspects of the method, forming a quantization value (L) from the coefficient K includes:
In other aspects, the method further comprises: normalizing the quantization value by 2N as follows:
In some aspects, forming a quantization value includes forming a set of recursive quantization factors with a period P, where A(QP+P)=A(QP)/x. Therefore, forming a set of recursive quantization factors includes forming recursive mantissa factors, where Am(QP)=Am(QP mod P). Likewise, forming a set of recursive quantization factors includes forming recursive exponential factors, where Ae(QP)=Ae(QP mod P)−QP/P.
More specifically, receiving a coefficient K includes receiving a coefficient matrix K[i][j]. Then, forming a quantization value (L) from the coefficient matrix K[i][j] includes forming a quantization value matrix (L[i][j]) using a mantissa portion matrix Am(QP)[i][j]) and an exponential portion matrix (xAe(QP)[i][j]).
Likewise, forming a quantization value matrix (L[i][j]) using a mantissa portion matrix (Am(QP)[i][j]) and an exponential portion matrix (xAe(QP)[i][j]) includes, for each particular value of QP, every element in the exponential portion matrix being the same value. Every element in the exponential portion matrix is the same value for a period (P) of QP values, where Ae(QP)=Ae(P*(QP/P)).
Additional details of the above-described method, including a method for forming a dequantization value (X1), from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (xBe(QP)), are provided below.
The dynamic range requirements of the combined transform and quantization is reduced by factoring the quantization parameters A(QP) and B(QP) into a mantissa and exponent terms as shown in Equation 4. With this structure, only the precision due to the mantissa term needs to be preserved during calculation. The exponent term can be included in the final normalization shift. This is illustrated in the sample calculation Equation 5.
Aproposed(QP)=Amantissa(QP)·2A
Bproposed(QP)=Bmantissa(QP)·2B
Y=T·X
K=Y·TT
L=(Amantissa(QP)·K)/220−A
K′=TT·L
Y′=K′·T
X′=(Bmantissa(QP)·Y′)/220−B
To illustrate the present invention, a set of quantization parameters is presented that reduce the dynamic range requirement of an H.26L decoder to 16-bit memory access. The memory access of the inverse transform is reduced to 16 bits. Values for Amantissa, Aexponent, Bmantissa, Bexponent, Aproposed, Bproposed are defined for QP=0-5 as shown in Table 3. Additional values are determined by recursion, as shown in Equation 6. The structure of these values makes it possible to generate new quantization values in addition to those specified.
TABLE 3 |
Quantization values 0-5 for TML |
QP | Amantissa | Aexponent | Bmantissa | Bexponent | Aproposed | Bproposed |
0 | 5 | 7 | 235 | 4 | 640 | 3760 |
1 | 9 | 6 | 261 | 4 | 576 | 4176 |
2 | 127 | 2 | 37 | 7 | 508 | 4736 |
3 | 114 | 2 | 165 | 5 | 456 | 5280 |
4 | 25 | 4 | 47 | 7 | 400 | 6016 |
5 | 87 | 2 | 27 | 8 | 348 | 6912 |
Amantissa(QP+6)=Amantissa(QP)
Bmantissa(QP+6)=Bmantissa(QP)
Aexp onent(QP+6)=Aexp onent(QP)−1
Bexp onent(QP+6)=Bexp onent(QP)+1
Using the defined parameters, the transform calculations can be modified to reduce the dynamic range as shown in Equation 5. Note how only the mantissa values contribute to the growth of dynamic range. The exponent factors are incorporated into the final normalization and do not impact the dynamic range of intermediate results.
With these values and computational method, the dynamic range at the decoder is reduced so only 16-bit memory access is needed as seen in Table 4.
TABLE 4 |
Dynamic range with low-bit depth quantization (OP > 6) |
8-bit | LUMA Transform | LUMA Inverse Transform | ||
Register | 28 | 24 | ||
Memory | 21 | 16 | ||
Several refinements can be applied to the joint quantization/normalization procedure described above. The general technique of factoring the parameters into a mantissa and exponent forms the basis of these refinements.
The discussion above assumes all basis functions of the transform have an equal norm and are quantized identically. Some integer transforms have the property that different basis functions have different norms. The present invention technique has been generalized to support transforms having different norms by replacing the scalars A(QP) and B(QP) above by matrices A(QP)[i][j] and B(QP)[i][j]. These parameters are linked by a normalization relation of the form shown below, Equation 7, which is more general than the single relation shown in Equation 1.
A(QP)[i][j]·B(QP)[i][j]=N[i][j]
Following the method previously described, each element of each matrix is factored into a mantissa and an exponent term as illustrated in the equations below, Equation 8.
A(QP)[i][j]=Amantissa(QP)[i][j]·2A
B(QP)[i][j]=Bmantissa(QP)[i][j]·2B
A large number of parameters are required to describe these quantization and dequantization parameters. Several structural relations can be used to reduce the number of free parameters. The quantizer growth is designed so that the values of A are halved after each period P at the same time the values of B are doubled maintaining the normalization relation. Additionally, the values of Aexponent(QP)[i][j] and Bexponent(QP)[i][j] are independent of i, j and (QP) in the range [0,P−1]. This structure is summarized by structural equations, Equation 9. With this structure there are only two parameters Aexponent[0] and Bexponent[0].
Aexp onent(QP)[i][j]=Aexp onent[0]−QP/P
Bexp onent(QP)[i][j]=Bexp onent[0]−QP/P
Bexponent(QP)[i][j]=Bexponent[0]+QP/P
A structure is also defined for the mantissa values. For each index pair (i,j), the mantissa values are periodic with period P. This is summarized by the structural equation, Equation 10. With this structure, there are P independent matrices for Amantissa and P independent matrices for Bmantissa reducing memory requirements and adding structure to the calculations.
Amantissa(QP)[i][j]=Amantissa(QP % P)[i][j]
Bmantissa(QP)[i][j]=Bmantissa(QP % P)[i][j]
The inverse transform may include integer division that requires rounding. In cases of interest, the division is by a power of 2. The rounding error is reduced by designing the dequantization factors to be multiples of the same power of 2, giving no remainder following division.
Dequantization using the mantissa values Bmantissa(QP) gives dequantized values that are normalized differently depending upon QP. This must be compensated for following the inverse transform. A form of this calculation is shown in Equation 11.
K[i][j]=Bmantissa(QP % P)[i][j]·Level[i][j]
X=(T−1·K·T)/2(N−QP/P)
To eliminate the need for the inverse transform to compensate for this normalization difference, the dequantization operation is defined so that all dequantized values have the same normalization. The form of this calculation is shown in Equation 12.
K[i][j]=Bmantissa(QP % P)[i][j]·Level[i][j]
X=(T−1·K·T)/2N
An example follows that illustrates the present invention use of quantization matrices. The forward and inverse transforms defined in Equation 13 need a quantization matrix rather than a single scalar quantization value. Sample quantization and dequantization parameters are given. Equation 14 and 16, together with related calculations, illustrate the use of this invention. This example uses a period P=6.
Q(m)[i][j]=Mm.0 for (i, j)={(0, 0), (0, 2), (2, 0), (2, 2)}
Q(m)[i][j]=Mm.1 for (i, j)={(1, 1), (1, 3), (3, 1), (3, 3)}
Q(m)[i][j]=Mm.2 otherwise
R(m)[i][j]=Sm.0 for (i, j)={(0, 0), (0, 2), (2, 0), (2, 2)}
R(m)[i][j]=Sm.1 for (i, j)={(1, 1), (1, 3), (3, 1), (3, 3)}
R(m)[i][j]=Sm.2 otherwise
The description of the forward transformation and forward quantization, Equation 18, are given below assuming input is in X, quantization parameter QP.
K=Tforward·X·Tforward T
period=QP/6
phase=QP−6·period
Level[i][j]=(Q(phase)[i][j]·K[i][j])/2(17+period)
The description of dequantization, inverse transform, and normalization for this example is given below, Equation 19 and 20.
period=QP/6
phase=QP−6·period
K[i][j]=R(phase)[i][j]·Level[i][j]·period
X′=Treverse·K·Treverse T
X″[i][j]=X′[i][j]/27
In some aspects of the method, forming a quantization value (L) from the coefficient K using a mantissa portion (Am(QP)) and an exponential portion (xAe(QP)) in Step 106 includes:
Some aspects of the method include a further step. Step 108 normalizes the quantization value by 2N as follows:
In other aspects, forming a quantization value in Step 106 includes forming a set of recursive quantization factors with a period P, where A(QP+P)=A(QP)/x. Likewise, forming a set of recursive quantization factors includes forming recursive mantissa factors, where Am(QP)=Am(QP mod P). Then, forming a set of recursive quantization factors includes forming recursive exponential factors, where Ae(QP)=Ae(QP mod P)−QP/P.
In some aspects, forming a quantization value includes forming a set of recursive quantization factors with a period P, where A(QP+P)=A(QP)/2. In other aspects, forming a set of recursive quantization factors includes forming recursive mantissa factors, where P=6. Likewise, forming a set of recursive quantization factors includes forming recursive exponential factors, where P=6.
In some aspects of the method, receiving a coefficient K in Step 102 includes receiving a coefficient matrix K[i][j]. Then, forming a quantization value (L) from the coefficient matrix K[i][j] using a mantissa portion (Am(QP) and an exponential portion (xAe(QP)) in Step 106 includes forming a quantization value matrix (L[i][j]) using a mantissa portion matrix (Am(QP)[i][j]) and an exponential portion matrix (xAe(QP)[i][j]). Likewise, forming a quantization value matrix (L[i] [j]) using a mantissa portion matrix (Am(QP)[i][j]) and an exponential portion matrix (xAe(QP)[i][j]) includes, for each particular value of QP, every element in the exponential portion matrix being the same value. Typically, every element in the exponential portion matrix is the same value for a period (P) of QP values, where Ae(QP)=Ae(P*(QP/P)).
Some aspects of the method include a further step. Step 110 forms a dequantization value (X1) from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (xBe(QP)). Again, the exponential portion (xBe(QP)) typically includes x being the value 2.
In some aspects of the method, forming a dequantization value (X1) from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (2Be(QP)) includes:
Other aspects of the method include a further step, Step 112, of denormalizing the quantization value by 2N as follows:
In some aspects, forming a dequantization value in Step 110 includes forming a set of recursive dequantization factors with a period P, where B(QP+P)=x*B(QP). Then, forming a set of recursive dequantization factors includes forming recursive mantissa factors, where Bm(QP)=Bm(QP mod P). Further, forming a set of recursive dequantization factors includes forming recursive exponential factors, where Be(QP)=Be(QP mod P)+QP/P.
In some aspects, forming a set of recursive quantization factors with a period P includes the value of x being equal to 2, and forming recursive mantissa factors includes the value of P being equal to 6. Then, forming a set of recursive dequantization factors includes forming recursive exponential factors, where Be(QP)=Be(QP mod P)+QP/P.
In some aspects of the method, forming a dequantization value (X1), from the quantization value, using a mantissa portion (Bm(QP)) and an exponential portion (xBe(QP)) in Step 110 includes forming a dequantization value matrix (X1[i][j]) using a mantissa portion matrix (Bm(QP)[i][j]) and an exponential portion matrix (xBe(QP)[i][j]). Likewise, forming a dequantization value matrix (X1[i][j]) using a mantissa portion matrix (Bm(QP)[i][j]) and an exponential portion matrix (xBe(QP)[i][j]) includes, for each particular value of QP, every element in the exponential portion matrix being the same value. In some aspects, every element in the exponential portion matrix is the same value for a period (P) of QP values, where Be(QP)=Be(P*(QP/P)).
Another aspect of the invention includes a method for the dequantization of a coefficient. However, the process is essentially the same as Steps 110 and 112 above, and is not repeated in the interest of brevity.
A method for the quantization of a coefficient has been presented. An example is given illustrating a combined dequantization and normalization procedure applied to the H.26L video coding standard with a goal of reducing the bit-depth required at the decoder to 16 bits. The present invention concepts can also be used to meet other design goals within H.26L. In general, this invention has application to the combination of normalization and quantization calculations.
Embodiments of the present invention may be implemented as hardware, firmware, software and other implementations. Some embodiments may be implemented on general purpose computing devices or on computing devices specifically designed for implementation of these embodiments. Some embodiments may be stored in memory as a means of storing the embodiment or for the purpose of executing the embodiment on a computing device.
Some embodiments of the present invention comprise systems and methods for video encoding, as shown in FIG. 2 . In these embodiments, image data 130 it subtracted from 132 with data representing prior video frames 145 resulting in a differential image 133, which is sent to a transform module 134. Transform module 134 may use DCT or other transform methods to transform the image. Generally, the result of the transform process will be coefficients (K), which are then sent to a quantization module 136 for quantization.
Output to the coding module 138 is encoded and transmitted outside the encoder for immediate decoding or storage. Coding module 131 may use variable length coding (VLC) in its coding processes. Coding module 138 may use arithmetic coding in its coding process.
Output from quantization module 136 is also received at dequantization module 140 to begin reconstruction of the image. This is done to keep an accurate accounting of prior frames. Dequantization module 140 performs a process with essentially the reverse effect as quantization module 136. Quantization levels or values (L) are dequantized yielding transform coefficients. Dequantization modules 140 may use methods employing a mantissa portion and an exponential portion as described herein.
The transform coefficients output from dequantization module 140 are sent to an inverse transformation (IT) module 142 where they are inverse transformed to a differential image 141. This differential image 141 is then combined with data from prior image frames 145 to form a video frame 149 that may be input to a frame memory 146 for reference to succeeding frames.
Some embodiments of the present invention comprise systems and methods for video decoding, as shown in FIG. 3 . A decoder of embodiments of the present invention may receive encoded image data 150 to a decoder module 152. Encoded image data 150 may comprise data that has been encoded by an encoder 100 such as that described with reference to FIG. 2 .
Typically, quantization parameters 156 and quantization values 154 are output to a dequantization module 158, where quantization values are converted back to transform coefficients. These coefficients are then sent to an inverse transformation module 160 for conversion back to spatial domain image data 161.
The motion compensation unit 166 uses motion vector data and the frame memory 164 to construct a reference image 165.
In some embodiments of the present invention, as illustrated in FIG. 4 , image data 102 may be sent to an encoder or encoding portion 104 for the various transformation, quantization, encoding and other procedures typical of video encoding as described above for some embodiments of the present invention. Output from the encoder may then be stored on any computer-readable storage media 106. Storage media 106 may act as a short-term buffer or as a long-term storage device.
When desired, encoded video data may be read from storage media 106 and decoded by a decoder or decoding portion 108 for output 110 to a display or other device.
In some embodiments of the present invention, as illustrated in FIG. 5 , image data 112 may be sent to an encoder or encoding portion 114 for the various transformation, quantization, encoding and ether procedures typical of video encoding as described above for some embodiments of the present invention. Output from the encoder may then be sent over a network, such as a LAN, WAN or the Internet 116. A storage device such as storage media 106 may be part of a network. Encoded video data may be received and decoded by a decoder or decoding portion 118, which also communicates with network 116. Decoder 118 may then decode the data for local consumption 120.
In some embodiments of the present invention, as illustrated in FIG. 6 , a quantization method or apparatus comprises a mantissa portion 172 and an exponential portion 174. Quantization parameters 176 are input to both portions 172 & 174. A coefficient K 170 is input to the mantissa portion 172 where it is modified using the quantization parameter and other values as explained above. The result of this operation is combined with the result produced in the exponential portion using the quantization parameter thereby producing a quantization level or value L 178.
In some embodiments of the present invention, as illustrated in FIG. 7 , a quantization method or apparatus comprises a mantissa portion 182 and a shifting portion 184. Quantization parameters 186 are input to both portions 182 & 184. A coefficient, K 180 is input to the mantissa portion 182 where it is modified using the quantization parameter and other values as explained above. The result of this operation is further processed in the shifting portion using the quantization parameter thereby producing a quantization level or value, L 188.
Some embodiments of the present invention, as illustrated in FIG. 8 , comprise a dequantization method or apparatus with a mantissa portion 192 and an exponential portion 194. Quantization parameters 196 are input to both portions 192 & 194. A quantization value, L 190 is input to the mantissa portion 192 where it is modified using the quantization parameter and other values as explained above. The result of this operation is further processed in the exponential portion using the quantization parameter thereby producing a coefficient, X1 198.
Some embodiments of the present invention, as illustrated in FIG. 9 , comprise a dequantization method or apparatus with a mantissa portion 202 and a shifting portion 204. Quantization parameters 206 are input to both portions 202 & 204. A quantization value, L 200 is input to the mantissa portion 202 where it is modified using the quantization parameter and other values as explained above. The result of this operation is further processed in the exponential portion using the quantization parameter thereby producing a coefficient, X1 208.
Some embodiments of the present invention may be stored on computer-readable media such as magnetic media, optical media, and other media as well as combinations of media. Some embodiments may also be transmitted as signals across networks and communication media. These transmissions and storage actions may take place as part of operation of embodiments of the present invention or as a way of transmitting the embodiment to a destination.
Typical methods of dequantization, inverse transformation, and normalization may be expressed mathematically in equation form. These methods, as illustrated in FIG. 10 , may begin with input in the form of an array of quantized coefficient levels c α 220, and a quantization parameter QP 222. A dequantization scaling value S QP 224 is then calculated 221 using the quantization parameter QP 222. Quantized coefficient levels 220 are scaled 227 by S QP 224 to give transform coefficients wα 226 according to Equation 21. These transform coefficients 226 are then inverse transformed 228 to compute scaled samples x′α 230 as shown in Equation 22. The scaled samples 230 may then be normalized 232 to give reconstructed samples, x″α 234 according to Equation 23.
wα=cα·SQP Equation 21
wα=cα·SQP Equation 21
x″α=(x′α+f)>>M Equation 23
In embodiments of the present invention, a reduction in bit depth for inverse transformation calculations is achieved. The processes of these embodiments, illustrated in FIG. 11 , begin with input in the form of an array of quantized coefficient levels c α 220, and a quantization parameter QP 222 similar to typical prior art methods. However, in these embodiments, the equivalent of a dequantization scaling factor SQP is factored 223 & 225 into a mantissa portion R QP 236 and an exponential portion E QP 238. The mantissa portion 236 is used during dequantization 240 to calculate the reconstructed transform coefficients ({tilde over (w)}α) 242, which are used in the inverse transformation process 228 to calculate reconstructed samples ({tilde over (x)}′α) 244. These reconstructed samples may then be normalized using the exponential portion 238 according to Equation 26, thereby yielding reconstructed samples (x″α) 234. Using these methods, the values of {tilde over (w)}α and {tilde over (x)}′α require EQP fewer bits for representation than the corresponding values wα and x′α. This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as shown in Equations 24-26.
{tilde over (w)}α=Cα·RQP Equation 24
{tilde over (w)}α=Cα·RQP Equation 24
x″α=[{tilde over (x)}′α+(f<<EQP)]>>(M−EQP) Equation 26
In embodiments of the present invention, a reduction in bit depth for inverse transformation calculations is achieved together with a reduction in memory needed to store dequantization parameters. The processes of these embodiments, illustrated in FIG. 12 , begin with input in the form of an array of quantized coefficient levels c α 220, a quantization parameter QP 222 similar to typical prior art methods. However, in these embodiments, an additional parameter P is used and the equivalent of a dequantization scaling factor SQP is factored 227 & 229 into a mantissa portion R QP 236 and an exponential portion E QP 238. The mantissa portion, R QP 236, doubles with each increment of QP by P. The exponential portion E QP 238 is periodic with period P. The mantissa portion 236 is used during dequantization 240 to calculate the reconstructed transform coefficients ({tilde over (w)}α) 242, which are used in the inverse transformation process 228 to calculate reconstructed samples ({tilde over (x)}′α) 244. These reconstructed samples may then be normalized using the exponential portion 238 according to Equation 28, thereby yielding reconstructed samples, x″α 234. Using these methods, the values of {tilde over (w)}α and {tilde over (x)}′α require EQP fewer bits for representation. This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as shown in Equations 25, 27 & 28. Values of R and E need only be stored for QP in one period [1, P] reducing the memory requirements.
{tilde over (w)}α=cα·RQP % P>>(QP/P) Equation 27
x″α=[{tilde over (x)}′α+(f<<EQP % P)]>>(M−EQP % P) Equation 28
{tilde over (w)}α=cα·RQP % P>>(QP/P) Equation 27
x″α=[{tilde over (x)}′α+(f<<EQP % P)]>>(M−EQP % P) Equation 28
In embodiments of the present invention, a reduction in bit depth for inverse transformation calculations is achieved together with a reduction in memory needed to store dequantization parameters. Additionally, the normalization process is independent of QP. This eliminates the need to communicate an exponential value for use in the normalization process. In these embodiments, the exponential portion, previously described as EQP is held constant and incorporated into normalization 248 thereby negating the need to transmit the value as is done in previously described embodiments. The processes of these embodiments, illustrated in FIG. 13 , begin with input in the form of an array of quantized coefficient levels c α 220, a quantization parameter QP 222 similar to typical prior art methods. Some of these embodiments implement the parameter P as described above. In these embodiments, the equivalent of a dequantization scaling factor SQP is factored 227 & 229 into a mantissa portion R QP 236 and a constant exponential portion EQP that is incorporated into normalization 248. The mantissa portion, RQP 236, may double with each increment of QP by P as previously described. The exponential portion E QP 238 is constant. The mantissa portion 236 is used during dequantization 240 to calculate the reconstructed transform coefficients ({tilde over (w)}α) 242, which are used in the inverse transformation process 228 to calculate reconstructed samples ({tilde over (x)}′α) 244. These reconstructed samples may then be normalized using the constant exponential portion that is incorporated into normalization 248 according to Equation 27, thereby yielding reconstructed samples, x″α 234. Using these methods, the values of {tilde over (w)}α and {tilde over (x)}′α require EQP fewer bits for representation. This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as shown for other embodiments above in Equations 25, 27 & 29. For embodiments that employ periodic values related to the parameter P, values of R need only be stored for QP in one period [1, P] reducing the memory requirements. The constant value for E simplifies the process by eliminating the need to transmit E to the normalization process 248.
x″α=({tilde over (x)}′α+2z)>>{tilde over (M)} Equation 29
x″α=({tilde over (x)}′α+2z)>>{tilde over (M)} Equation 29
In further embodiments of the present invention, a reduction in bit depth for inverse transformation calculations is achieved together with a reduction in memory needed to store dequantization parameters and the normalization process is independent of QP thereby eliminating the need to communicate an exponential value for use in the normalization process. These embodiments also express the quantization scaling factor mantissa portion as a matrix. This matrix format allows frequency dependent quantization, which allows the processes of these embodiments to be used in coding schemes that comprise frequency-dependent transformation.
In these embodiments, the exponential portion, previously described as EQP may be held constant and incorporated into normalization 248 as previously explained. The processes of these embodiments, illustrated in FIG. 14 , begin with input in the form of an array of quantized coefficient levels c α 220, and a quantization parameter QP 222 similar other methods. Some of these embodiments may implement the parameter P as described above.
In these embodiments, the equivalent of a dequantization scaling factor Sα QP is factored 254 into a mantissa portion R α QP 252 and a constant exponential portion EQP that is incorporated into normalization 248. The mantissa portion, R α QP 252, may double with each increment of QP by P as previously described. The exponential portion EQP is constant. The mantissa portion 252 is used during dequantization 250 to calculate the reconstructed transform coefficients ({tilde over (w)}α) 242, which are used in the inverse transformation process 228 to calculate reconstructed samples ({tilde over (x)}′α) 244. These reconstructed samples may then be normalized using the constant exponential portion that is incorporated into normalization 248 according to Equation 27, thereby yielding reconstructed samples, x″α 234. Using these methods, the values of {tilde over (w)}α and {tilde over (x)}′α require EQP fewer bits for representation. This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as described above and in Equations 25, 27 & 29. In these embodiments the dequantization scaling factor portion is expressed as a matrix. This format is expressed in Equation 30 with the subscript α.
{tilde over (w)}α=cα·Rα QP % P>>(QP/P) Equation 30
{tilde over (w)}α=cα·Rα QP % P>>(QP/P) Equation 30
Typical methods of quantization may be expressed mathematically in equation form. These methods, as illustrated in FIG. 15 , may begin with input in the form of a coefficient (k) 256 and a quantization parameter 222. The coefficient 256 is multiplied by a quantization factor 262 to give the value g 264 according to Equation 31. The value g 264 is normalized 266 to give the quantized coefficient level c 220 according to Equation 32.
g=k·SQP Equation 31
c=g>>M Equation 32
In embodiments of the present invention, a reduction in bit depth for quantization calculations is achieved together with a reduction in memory needed to store quantization parameters. The processes of these embodiments, illustrated inFIG. 16 , may begin with input in the form of coefficient (k) 256 and a quantization parameter QP 222. However, in these embodiments, an additional parameter P is used in processing. The equivalent of a quantization scaling factor SQP is factored into a mantissa portion R QP 274 and an exponential portion E QP 276. The mantissa portion R QP 274 is periodic with period P. The exponential portion 276 decreases by one for each increment of QP by P. The mantissa portion 274 is used during quantization 278 to calculate the scaled transform coefficient ({tilde over (g)}) 280 according to Equation 33. The scaled transform coefficient may then be normalized 282 using the exponential portion 276 according to Equation 34, thereby yielding the quantized coefficient level (c) 220. Using these methods, the value of {tilde over (g)} 280 requires EQP fewer bits for representation than a corresponding value g 264 generated through known methods. Values of R 274 and E 276 need only be stored for QP in one period [1, P] reducing the memory requirements. This factorization enables mathematically equivalent calculation of the reconstructed samples using lower intermediate precision as shown in Equations 33 & 34.
{tilde over (g)}=k·RQP % P Equation 33
c={tilde over (g)}>>(M−EQP) Equation 34
g=k·SQP Equation 31
c=g>>M Equation 32
In embodiments of the present invention, a reduction in bit depth for quantization calculations is achieved together with a reduction in memory needed to store quantization parameters. The processes of these embodiments, illustrated in
{tilde over (g)}=k·RQP % P Equation 33
c={tilde over (g)}>>(M−EQP) Equation 34
Other variations and embodiments of the invention will occur to those skilled in the art.
Claims (17)
1. A method for dequantization and inverse transformation, said method comprising:
(a) receiving a matrix of quantized coefficient levels;
(b) receiving at least one quantization parameter (QP);
(c) determining a reconstructed transform coefficient (RTC) matrix wherein each value in said quantized coefficient level matrix is scaled by a value in a scaling matrix which is dependent on QP % P, where P is a constant value;
(d) computing scaled reconstructed samples (SRS) by performing an inverse transformation on said RTC matrix values; and
(e) computing reconstructed samples, by normalizing the SRS values.
2. A method as described in claim 1 wherein P=6.
3. A method as described in claim 1 wherein said scaling matrix is a 4×4 matrix.
4. A method as described in claim 1 wherein said scaling matrix is an 8×8 matrix.
5. A method as described in claim 1 wherein said at least one quantization parameter (QP) comprises a chroma quantization parameter.
6. A method as described in claim 1 wherein said at least one quantization parameter (QP) comprises a luma quantization parameter.
7. A method as described in claim 1 wherein said at least one quantization parameter (QP) comprises a chroma quantization parameter for each chroma channel.
8. A method as described in claim 1 wherein said at least one quantization parameter (QP) comprises a chroma quantization parameter for each chroma channel and a luma quantization parameter.
9. A method for dequantization and inverse transformation, said method comprising:
(a) receiving a matrix of quantized coefficient levels (QCL matrix);
(b) receiving a quantization parameter (QP);
(c) calculating a scaling matrix using a weighting matrix scaled by a dequantization matrix selected using QP % P;
(d) determining a reconstructed transform coefficient (RTC) matrix wherein said QCL matrix is scaled by said scaling matrix;
(e) computing scaled reconstructed samples (SRS) by performing an inverse transformation on said RTC matrix values; and
(f) computing reconstructed samples, by normalizing the SRS values with a constant shift operation.
10. A method as described in claim 9 further comprising shifting said RTC matrix values by a value dependent on QP/P before said computing scaled reconstructed samples.
11. A method for dequantization and inverse transformation, said method comprising:
(a) fixing a limited set of scaling matrices, wherein each of said scaling matrices in said limited set of scaling matrices is dependent on an associated quantization parameter QP and an associated constant parameter P according to the relation QP % P;
(b) receiving a quantized coefficient level (QCL) matrix;
(c) determining a reconstructed transform coefficient (RTC) matrix wherein each value in said quantized coefficient level matrix is scaled by a value in a scaling matrix that is selected from said limited set of scaling matrices;
(d) computing scaled reconstructed samples (SRS) by performing an inverse transformation on said RTC matrix values; and
(e) computing reconstructed samples, by normalizing the SRS values.
12. An apparatus for dequantization and inverse transformation, said apparatus comprising:
(a) a QCL receiver for receiving a matrix of quantized coefficient levels (QCLs);
(b) a QP receiver for receiving at least one quantisation parameter (QP);
(c) a processor, wherein said processor is capable of determining a reconstructed transform coefficient (RTC) matrix wherein each value in said quantized coefficient level matrix is scaled by a value in a scaling matrix which is dependent on QP % P, where P is a constant value;
(d) said processor comprising a further capability of computing scaled reconstructed samples (SRS) by performing an inverse transformation on said RTC matrix values; and
(e) said processor comprising the capability of computing reconstructed samples, by normalizing said SRS values.
13. A computer-readable medium encoded with computer executable instructions for dequantization and inverse transformation, said instructions comprising:
(a) receiving a matrix of quantized coefficient levels;
(b) receiving at least one quantization parameter (QP);
(c) determining a reconstructed transform coefficient (RTC) matrix wherein each value in said quantized coefficient level matrix is scaled by a value in a scaling matrix which is dependent on QP % P, where P is a constant value;
(d) computing scaled reconstructed samples (SRS) by performing an inverse transformation on said RTC matrix values; and
(e) computing reconstructed samples, by normalizing the SRS values.
14. An image decoding apparatus for obtaining a decoded image by decoding an encoded data, comprising:
a decoding module for decoding a quantization parameter QP and a quantized value L[i][j] from data coded in a block unit by dividing an image;
a dequantization module for dequantizing the quantized value L[i][j] to derive a transform coefficient K[i][j];
an inverse transformation module for inverse integer transforming the transform coefficient derived by the dequantization module; and
a normalization module for normalizing the inverse integer transformed transform coefficient by the inverse transformation module, wherein
the inverse integer transform is executed by an inverse transform matrix in which a different basis function has a different norm,
the dequantization module uses a mantissa portion matrix element Bm(QP)[i][j] which is a function of the quantization parameter QP and a constant B to derive the transform coefficient K[i][j] as follows:
K[i][j]=[L[i][j]×Bm(QP)[i][j]]<<(B+QP/P)
K[i][j]=[L[i][j]×Bm(QP)[i][j]]<<(B+QP/P)
(where “<<” is a left shift operation),
the mantissa portion matrix element Bm(QP)[i][j], concerning QP, has a function form:
Bm(QP)[i][j]=Bm(QP mod P)[i][j]
Bm(QP)[i][j]=Bm(QP mod P)[i][j]
(where P is a constant), and
the mantissa portion matrix element Bm(QP)[i][j], with use of a P×3 matrix element SQP,0, SQP,1, SQP,2, is represented as:
Bm(QP)[i][j]=SQP,0 (where (i,j) are both even numbers)
Bm(QP)[i][j]=SQP,1 (where (i,j) are both odd numbers)
Bm(QP)[i][j]=SQP,2 (where (i,j) are other than the above-described cases),
Bm(QP)[i][j]=SQP,0 (where (i,j) are both even numbers)
Bm(QP)[i][j]=SQP,1 (where (i,j) are both odd numbers)
Bm(QP)[i][j]=SQP,2 (where (i,j) are other than the above-described cases),
so that the normalization module normalizes the inverse integer transformed transform coefficient by a shift operation with use of 2N (where N is a natural number).
15. An image decoding apparatus as defined in claim 14, wherein the inverse transform matrix is a 4×4 matrix, and the constant P is 6.
16. An image decoding method for obtaining a decoded image by decoding an encoded data, comprising:
a decoding step for decoding a quantization parameter QP and a quantized value L[i][j] from data coded in a block unit by dividing an image;
a dequantization step for dequantizing the quantized value L[i][j] to derive a transform coefficient K[i][j];
an inverse transformation step for inverse integer transforming the transform coefficient derived by the dequantization step; and
a normalization step for normalizing the inverse integer transformed transform coefficient by the inverse transformation step, wherein
the inverse integer transform is executed by an inverse transform matrix in which a different basis function has a different norm,
the dequantization step uses a mantissa portion matrix element Bm(QP)[i][j] which is a function of the quantization parameter QP and a constant B to derive the transform coefficient K[i][j] as follows:
K[i][j]=[L[i][j]×Bm(QP)[i][j]]<<(B+QP/P)
K[i][j]=[L[i][j]×Bm(QP)[i][j]]<<(B+QP/P)
(where “<<” is a left shift operation),
the mantissa portion matrix element Bm(QP)[i][j], concerning QP, has a function form:
Bm(QP)[i][j]=Bm(QP mod P)[i][j]
Bm(QP)[i][j]=Bm(QP mod P)[i][j]
(where P is a constant), and
the mantissa portion matrix element Bm(QP)[i][j], with use of a P×3 matrix element SQP,0, SQP,1, SQP,2, is represented as:
Bm(QP)[i][j]=SQP,0 (where (i,j) are both even numbers)
Bm(QP)[i][j]=SQP,1 (where (i,j) are both odd numbers)
Bm(QP)[i][j]=SQP,2 (where (i,j) are other than the above-described cases),
Bm(QP)[i][j]=SQP,0 (where (i,j) are both even numbers)
Bm(QP)[i][j]=SQP,1 (where (i,j) are both odd numbers)
Bm(QP)[i][j]=SQP,2 (where (i,j) are other than the above-described cases),
so that the normalization step normalizes the inverse integer transformed transform coefficient by a shift operation with use of 2N (where N is a natural number).
17. An image decoding method as defined in claim 16, wherein the inverse transform matrix is a 4×4 matrix, and the constant P is 6.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/301,526 USRE44138E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Applications Claiming Priority (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US31143601P | 2001-08-09 | 2001-08-09 | |
US31901801P | 2001-11-30 | 2001-11-30 | |
US10/139,036 US7123655B2 (en) | 2001-08-09 | 2002-05-02 | Method for reduced bit-depth quantization |
US10/326,459 US7170942B2 (en) | 2001-08-09 | 2002-12-20 | Systems and methods for efficient video-related data processing |
US10/931,558 US7400682B2 (en) | 2001-08-09 | 2004-08-31 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US12/689,897 USRE42745E1 (en) | 2001-08-09 | 2010-01-19 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US12/837,154 USRE43091E1 (en) | 2001-08-09 | 2010-07-15 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,526 USRE44138E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/931,558 Reissue US7400682B2 (en) | 2001-08-09 | 2004-08-31 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Publications (1)
Publication Number | Publication Date |
---|---|
USRE44138E1 true USRE44138E1 (en) | 2013-04-09 |
Family
ID=27385275
Family Applications (15)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/139,036 Expired - Lifetime US7123655B2 (en) | 2001-08-09 | 2002-05-02 | Method for reduced bit-depth quantization |
US10/261,884 Expired - Lifetime US7130348B2 (en) | 2001-08-09 | 2002-09-30 | Systems and methods for reduced bit-depth processing in video-related data |
US10/261,440 Expired - Lifetime US7106795B2 (en) | 2001-08-09 | 2002-09-30 | Systems and methods for enabling reduced bit-depth processing and memory reduction in video-related data processing |
US10/326,459 Expired - Lifetime US7170942B2 (en) | 2001-08-09 | 2002-12-20 | Systems and methods for efficient video-related data processing |
US10/931,558 Ceased US7400682B2 (en) | 2001-08-09 | 2004-08-31 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US12/689,897 Expired - Lifetime USRE42745E1 (en) | 2001-08-09 | 2010-01-19 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US12/837,154 Expired - Lifetime USRE43091E1 (en) | 2001-08-09 | 2010-07-15 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,502 Expired - Lifetime USRE44234E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,430 Expired - Lifetime USRE44285E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,472 Expired - Lifetime USRE44319E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,526 Expired - Lifetime USRE44138E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/901,316 Expired - Lifetime USRE44891E1 (en) | 2001-08-09 | 2013-05-23 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US14/207,043 Ceased USRE46370E1 (en) | 2001-08-09 | 2014-03-12 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US15/400,121 Expired - Lifetime USRE47277E1 (en) | 2001-08-09 | 2017-01-06 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US15/400,111 Expired - Lifetime USRE47258E1 (en) | 2001-08-09 | 2017-01-06 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Family Applications Before (10)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/139,036 Expired - Lifetime US7123655B2 (en) | 2001-08-09 | 2002-05-02 | Method for reduced bit-depth quantization |
US10/261,884 Expired - Lifetime US7130348B2 (en) | 2001-08-09 | 2002-09-30 | Systems and methods for reduced bit-depth processing in video-related data |
US10/261,440 Expired - Lifetime US7106795B2 (en) | 2001-08-09 | 2002-09-30 | Systems and methods for enabling reduced bit-depth processing and memory reduction in video-related data processing |
US10/326,459 Expired - Lifetime US7170942B2 (en) | 2001-08-09 | 2002-12-20 | Systems and methods for efficient video-related data processing |
US10/931,558 Ceased US7400682B2 (en) | 2001-08-09 | 2004-08-31 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US12/689,897 Expired - Lifetime USRE42745E1 (en) | 2001-08-09 | 2010-01-19 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US12/837,154 Expired - Lifetime USRE43091E1 (en) | 2001-08-09 | 2010-07-15 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,502 Expired - Lifetime USRE44234E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,430 Expired - Lifetime USRE44285E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US13/301,472 Expired - Lifetime USRE44319E1 (en) | 2001-08-09 | 2011-11-21 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Family Applications After (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/901,316 Expired - Lifetime USRE44891E1 (en) | 2001-08-09 | 2013-05-23 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US14/207,043 Ceased USRE46370E1 (en) | 2001-08-09 | 2014-03-12 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US15/400,121 Expired - Lifetime USRE47277E1 (en) | 2001-08-09 | 2017-01-06 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
US15/400,111 Expired - Lifetime USRE47258E1 (en) | 2001-08-09 | 2017-01-06 | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Country Status (14)
Country | Link |
---|---|
US (15) | US7123655B2 (en) |
EP (6) | EP2262113B1 (en) |
JP (16) | JP3678365B2 (en) |
KR (3) | KR100811986B1 (en) |
CN (5) | CN100571394C (en) |
AT (2) | ATE549861T1 (en) |
CA (12) | CA2886119C (en) |
CY (2) | CY1120069T1 (en) |
DE (1) | DE60232681D1 (en) |
DK (5) | DK1459449T3 (en) |
ES (6) | ES2662250T3 (en) |
HK (5) | HK1108786A1 (en) |
PT (5) | PT3121966T (en) |
WO (1) | WO2003017497A1 (en) |
Families Citing this family (55)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100531566B1 (en) * | 1997-10-23 | 2005-11-29 | 미쓰비시덴키 가부시키가이샤 | Image decoder |
US7123655B2 (en) * | 2001-08-09 | 2006-10-17 | Sharp Laboratories Of America, Inc. | Method for reduced bit-depth quantization |
US7185037B2 (en) * | 2001-08-23 | 2007-02-27 | Texas Instruments Incorporated | Video block transform |
US6882685B2 (en) * | 2001-09-18 | 2005-04-19 | Microsoft Corporation | Block transform and quantization for image and video coding |
US7242713B2 (en) * | 2002-05-02 | 2007-07-10 | Microsoft Corporation | 2-D transforms for image and video coding |
JP4617644B2 (en) | 2003-07-18 | 2011-01-26 | ソニー株式会社 | Encoding apparatus and method |
US7756351B2 (en) * | 2003-12-19 | 2010-07-13 | Stmicroelectronics, Inc. | Low power, high performance transform coprocessor for video compression |
EP2373033A3 (en) * | 2004-01-30 | 2011-11-30 | Panasonic Corporation | Picture coding and decoding method, apparatus, and program thereof |
US7487193B2 (en) * | 2004-05-14 | 2009-02-03 | Microsoft Corporation | Fast video codec transform implementations |
JP4704333B2 (en) | 2004-06-08 | 2011-06-15 | パナソニック株式会社 | Image encoding device, image decoding device, and integrated circuit used in the same |
WO2006007279A2 (en) * | 2004-06-18 | 2006-01-19 | Thomson Licensing | Method and apparatus for video codec quantization |
WO2006033953A1 (en) * | 2004-09-16 | 2006-03-30 | Thomson Licensing | Video codec with weighted prediction utilizing local brightness variation |
US7444030B2 (en) * | 2004-11-12 | 2008-10-28 | Micron Technology, Inc. | Image encoding with dynamic buffer-capacity-level-based compression adjustment |
US7634148B2 (en) * | 2005-01-07 | 2009-12-15 | Ntt Docomo, Inc. | Image signal transforming and inverse-transforming method and computer program product with pre-encoding filtering features |
US7492821B2 (en) * | 2005-02-08 | 2009-02-17 | International Business Machines Corporation | System and method for selective image capture, transmission and reconstruction |
US7493960B2 (en) * | 2005-09-20 | 2009-02-24 | Schlumberger Technology Corporation | Apparatus and method to connect two parts without rotation |
US7689052B2 (en) * | 2005-10-07 | 2010-03-30 | Microsoft Corporation | Multimedia signal processing using fixed-point approximations of linear transforms |
KR100996704B1 (en) * | 2006-11-06 | 2010-11-25 | 삼성전자주식회사 | Method for Transmitting Buffer Size Information |
CN101227601B (en) * | 2007-01-15 | 2011-09-14 | 飞思卡尔半导体公司 | Equipment and method for performing geometric transformation in video rendition |
US8942289B2 (en) * | 2007-02-21 | 2015-01-27 | Microsoft Corporation | Computational complexity and precision control in transform-based digital media codec |
US8559499B2 (en) | 2007-10-26 | 2013-10-15 | Zoran (France) S.A. | Frame buffer compression for video processing devices |
RU2471306C2 (en) * | 2008-06-27 | 2012-12-27 | Сони Корпорейшн | Device of image processing and method of image processing |
US8755515B1 (en) | 2008-09-29 | 2014-06-17 | Wai Wu | Parallel signal processing system and method |
US8451892B2 (en) * | 2009-06-30 | 2013-05-28 | Oracle America, Inc. | Method and system for linear quantization and dequantization |
JP2010009624A (en) * | 2009-10-07 | 2010-01-14 | Ntt Docomo Inc | Image signal conversion method, image signal reverse conversion method, image encoding device, image decoding device, image encoding method, image decoding method, image encoding program, and image decoding program |
JP5253433B2 (en) | 2010-02-19 | 2013-07-31 | 富士フイルム株式会社 | Preparation method of lithographic printing plate |
JP2012095053A (en) * | 2010-10-26 | 2012-05-17 | Toshiba Corp | Stream transmission system, transmitter, receiver, stream transmission method, and program |
JP5741076B2 (en) | 2010-12-09 | 2015-07-01 | ソニー株式会社 | Image processing apparatus and image processing method |
US20120183044A1 (en) * | 2011-01-18 | 2012-07-19 | Louis Joseph Kerofsky | Video decoder with reduced dynamic range transform with memory storing |
US9807395B2 (en) * | 2011-01-18 | 2017-10-31 | Dolby International Ab | Video decoder with reduced dynamic range transform with inverse transform shifting memory |
US20120183045A1 (en) * | 2011-01-18 | 2012-07-19 | Louis Joseph Kerofsky | Video decoder with reduced dynamic range transform including clipping |
EP2678944B1 (en) * | 2011-02-25 | 2019-11-06 | BlackBerry Limited | Methods and devices for data compression using offset-based adaptive reconstruction levels |
US20120230395A1 (en) * | 2011-03-11 | 2012-09-13 | Louis Joseph Kerofsky | Video decoder with reduced dynamic range transform with quantization matricies |
US20120307889A1 (en) * | 2011-06-01 | 2012-12-06 | Sharp Laboratories Of America, Inc. | Video decoder with dynamic range adjustments |
US8571099B2 (en) * | 2011-06-01 | 2013-10-29 | Sharp Laboratories Of America, Inc. | Decoder with dynamic range compensation |
CA3007186C (en) | 2011-06-30 | 2019-10-15 | Samsung Electronics Co., Ltd. | Video encoding method with bit depth adjustment for fixed-point conversion and apparatus therefor, and video decoding method and aparatus therefor |
US20130083845A1 (en) * | 2011-09-30 | 2013-04-04 | Research In Motion Limited | Methods and devices for data compression using a non-uniform reconstruction space |
US10277915B2 (en) | 2011-11-07 | 2019-04-30 | Qualcomm Incorporated | Signaling quantization matrices for video coding |
JP6221207B2 (en) | 2012-06-08 | 2017-11-01 | ソニー株式会社 | Image processing apparatus and method, and program |
KR101277093B1 (en) * | 2012-07-16 | 2013-06-20 | 한국전자통신연구원 | Method and apparatus for encoding and decoding using adaptive bit depth decreasing |
US9674538B2 (en) * | 2013-04-08 | 2017-06-06 | Blackberry Limited | Methods for reconstructing an encoded video at a bit-depth lower than at which it was encoded |
US20140301447A1 (en) * | 2013-04-08 | 2014-10-09 | Research In Motion Limited | Methods for reconstructing an encoded video at a bit-depth lower than at which it was encoded |
JP6204171B2 (en) * | 2013-12-03 | 2017-09-27 | 株式会社シキノハイテック | Image encoding apparatus and image decoding apparatus |
US10417525B2 (en) | 2014-09-22 | 2019-09-17 | Samsung Electronics Co., Ltd. | Object recognition with reduced neural network weight precision |
CN108141505B (en) * | 2015-10-30 | 2020-11-06 | 爱克发医疗保健公司 | Compression and decompression method for high bit depth medical gray level image |
US20200400730A1 (en) * | 2018-03-06 | 2020-12-24 | Xi'an Daheng Tiancheng It Co., Ltd. | Frequency spectrum monitoring data structured representation method, and data processing method and compression method |
US11303912B2 (en) * | 2018-04-18 | 2022-04-12 | Qualcomm Incorporated | Decoded picture buffer management and dynamic range adjustment |
US10755469B2 (en) * | 2018-12-28 | 2020-08-25 | Intel Corporation | Apparatus and method for ray tracing instruction processing and execution |
WO2021051044A1 (en) | 2019-09-14 | 2021-03-18 | Bytedance Inc. | Quantization parameter offset for chroma deblocking filtering |
WO2021072177A1 (en) | 2019-10-09 | 2021-04-15 | Bytedance Inc. | Cross-component adaptive loop filtering in video coding |
JP2022552338A (en) | 2019-10-14 | 2022-12-15 | バイトダンス インコーポレイテッド | Joint coding of chroma residuals and filtering in video processing |
EP4055827A4 (en) | 2019-12-09 | 2023-01-18 | ByteDance Inc. | Using quantization groups in video coding |
CN114902657A (en) | 2019-12-31 | 2022-08-12 | 字节跳动有限公司 | Adaptive color transform in video coding and decoding |
US11259024B2 (en) * | 2020-06-05 | 2022-02-22 | Tencent America LLC | Quantizer design |
CN111769891B (en) * | 2020-06-16 | 2022-08-26 | 西安大衡天成信息科技有限公司 | Tensor decomposition-based frequency spectrum monitoring big data processing system and processing method |
Citations (28)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1990009022A1 (en) | 1989-01-27 | 1990-08-09 | Dolby Laboratories Licensing Corporation | Low bit rate transform coder, decoder and encoder/decoder for high-quality audio |
WO1990009064A1 (en) | 1989-01-27 | 1990-08-09 | Dolby Laboratories Licensing Corporation | Low time-delay transform coder, decoder, and encoder/decoder for high-quality audio |
JPH03270573A (en) | 1990-03-20 | 1991-12-02 | Fujitsu Ltd | Picture data coding device and picture data decoding device |
JPH04222121A (en) | 1990-12-22 | 1992-08-12 | Casio Comput Co Ltd | Data compressor |
JPH0595483A (en) | 1991-10-02 | 1993-04-16 | Ricoh Co Ltd | Device and method for picture compression |
US5230038A (en) | 1989-01-27 | 1993-07-20 | Fielder Louis D | Low bit rate transform coder, decoder, and encoder/decoder for high-quality audio |
GB2264609A (en) | 1992-02-28 | 1993-09-01 | Ricoh Kk | Data compression |
JPH05307467A (en) | 1991-07-16 | 1993-11-19 | Lsi Logic Corp | Method and device for executing quantization |
CA2221181A1 (en) | 1992-06-26 | 1993-12-27 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
JPH0653839A (en) | 1992-07-29 | 1994-02-25 | Casio Comput Co Ltd | Data compressing device |
JPH0677842A (en) | 1992-08-28 | 1994-03-18 | Mitsubishi Electric Corp | Quantizer |
US5345408A (en) | 1993-04-19 | 1994-09-06 | Gi Corporation | Inverse discrete cosine transform processor |
JPH0799578A (en) | 1993-09-28 | 1995-04-11 | Nec Corp | Picture processing device |
US5471412A (en) | 1993-10-27 | 1995-11-28 | Winbond Electronic Corp. | Recycling and parallel processing method and apparatus for performing discrete cosine transform and its inverse |
US5479364A (en) | 1992-06-26 | 1995-12-26 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
US5640159A (en) | 1994-01-03 | 1997-06-17 | International Business Machines Corporation | Quantization method for image data compression employing context modeling algorithm |
US5754457A (en) | 1996-03-05 | 1998-05-19 | Intel Corporation | Method for performing an inverse cosine transfer function for use with multimedia information |
US5764553A (en) | 1996-02-28 | 1998-06-09 | Lsi Logic Corporation | Generalized data processing path for performing transformation and quantization functions for video encoder systems |
US5822003A (en) | 1994-10-31 | 1998-10-13 | Girod; Bernd | Method and apparatus for performing fast reduced coefficient discrete cosine transforms |
US5845112A (en) | 1997-03-06 | 1998-12-01 | Samsung Electronics Co., Ltd. | Method for performing dead-zone quantization in a single processor instruction |
KR0172902B1 (en) | 1995-09-12 | 1999-03-20 | 구자홍 | Mpeg encoder |
US6081552A (en) | 1998-01-13 | 2000-06-27 | Intel Corporation | Video coding using a maximum a posteriori loop filter |
US6160920A (en) | 1998-09-15 | 2000-12-12 | Winbond Electronics Corp. | Cosine transforming and quantizing device, method of reducing multiplication operations in a video compressing apparatus |
US6212236B1 (en) | 1997-03-26 | 2001-04-03 | Matsushita Electric Industrial Co., Ltd. | Image decoding apparatus |
US20030099291A1 (en) | 2001-08-09 | 2003-05-29 | Kerofsky Louis J. | Systems and methods for enabling reduced bit-depth processing and memory reduction in video-related data processing |
US20040013202A1 (en) | 2002-04-23 | 2004-01-22 | Nokia Corporation | Method and device for indicating quantizer parameters in a video coding system |
JP2004506990A (en) | 2000-08-12 | 2004-03-04 | ローベルト ボツシユ ゲゼルシヤフト ミツト ベシユレンクテル ハフツング | Integer approximation of transform coefficients and encoder and decoder |
US6876703B2 (en) | 2000-05-11 | 2005-04-05 | Ub Video Inc. | Method and apparatus for video coding |
Family Cites Families (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA222118A (en) | 1922-08-08 | Richmond Glass Perley | Heel covering apparatus | |
BE1000643A5 (en) * | 1987-06-05 | 1989-02-28 | Belge Etat | METHOD FOR CODING IMAGE SIGNALS. |
CA2027705C (en) * | 1989-10-17 | 1994-02-15 | Masami Akamine | Speech coding system utilizing a recursive computation technique for improvement in processing speed |
JP2861264B2 (en) * | 1990-05-28 | 1999-02-24 | 富士通株式会社 | Method for manufacturing semiconductor device |
JPH0648289A (en) | 1992-08-04 | 1994-02-22 | Tokico Ltd | Master cylinder |
JP2714520B2 (en) | 1992-08-28 | 1998-02-16 | 株式会社日立製作所 | Mounting component mounting / dismounting device |
JP3270573B2 (en) | 1993-06-08 | 2002-04-02 | 松下冷機株式会社 | Air conditioner |
US5699064A (en) * | 1994-08-01 | 1997-12-16 | Matsushita Electric Industrial Co., Ltd. | Oversampling D/A converter using a bidirectional shift register |
DE19509117C2 (en) * | 1995-03-17 | 1997-02-27 | Bosch Gmbh Robert | Procedure for monitoring the transmission quality of digitized signals |
CN1178616A (en) * | 1995-03-17 | 1998-04-08 | 罗伯特·博施有限公司 | Process for monitoring quantisation quality in digital data |
US5629778A (en) * | 1995-05-15 | 1997-05-13 | Polaroid Corporation | Method and apparatus for reduction of image data compression noise |
US5892518A (en) * | 1995-07-28 | 1999-04-06 | Matsushita Electric Industrial Co., Ltd. | Image generating apparatus with pixel calculation circuit including texture mapping and motion compensation |
JP3249729B2 (en) * | 1995-10-24 | 2002-01-21 | シャープ株式会社 | Image encoding device and image decoding device |
KR100203710B1 (en) * | 1996-04-30 | 1999-06-15 | 전주범 | Improved image coding system having functions for controlling generated amount of coded bit stream |
JP3774954B2 (en) * | 1996-10-30 | 2006-05-17 | 株式会社日立製作所 | Video encoding method |
US6052490A (en) * | 1997-02-14 | 2000-04-18 | At&T Corp. | Video coder employing pixel transposition |
JP2942222B2 (en) * | 1997-08-11 | 1999-08-30 | 株式会社つくばソフト研究所 | Communication device for color images and grayscale images |
KR100249229B1 (en) * | 1997-08-13 | 2000-03-15 | 구자홍 | Down Conversion Decoding Apparatus of High Definition TV |
US6243730B1 (en) | 1999-05-04 | 2001-06-05 | Sony Electronics, Inc. | Methods and systems for performing short integer chen IDCT algorithm with fused multiply/add |
JP4503136B2 (en) | 2000-05-17 | 2010-07-14 | 文化シヤッター株式会社 | Sliding door free stop device and sliding door device |
US6920175B2 (en) * | 2001-01-03 | 2005-07-19 | Nokia Corporation | Video coding architecture and methods for using same |
US6765963B2 (en) * | 2001-01-03 | 2004-07-20 | Nokia Corporation | Video decoder architecture and method for using same |
US8374237B2 (en) * | 2001-03-02 | 2013-02-12 | Dolby Laboratories Licensing Corporation | High precision encoding and decoding of video images |
US7295609B2 (en) * | 2001-11-30 | 2007-11-13 | Sony Corporation | Method and apparatus for coding image information, method and apparatus for decoding image information, method and apparatus for coding and decoding image information, and system of coding and transmitting image information |
JP4504192B2 (en) | 2002-09-16 | 2010-07-14 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | Secure access to subscription modules |
KR20040076034A (en) * | 2003-02-24 | 2004-08-31 | 삼성전자주식회사 | Method and apparatus for encoding video signal with variable bit rate |
JP4222121B2 (en) | 2003-06-20 | 2009-02-12 | 大正製薬株式会社 | Partition insertion device |
KR20090063761A (en) | 2007-12-14 | 2009-06-18 | 삼성전자주식회사 | Display device |
JP2010052603A (en) * | 2008-08-28 | 2010-03-11 | Iseki & Co Ltd | Traveling device of working vehicle |
-
2002
- 2002-05-02 US US10/139,036 patent/US7123655B2/en not_active Expired - Lifetime
- 2002-08-08 CN CNB2007101270065A patent/CN100571394C/en not_active Expired - Lifetime
- 2002-08-08 CA CA2886119A patent/CA2886119C/en not_active Expired - Lifetime
- 2002-08-08 PT PT161863535T patent/PT3121966T/en unknown
- 2002-08-08 CN CN2008101761517A patent/CN101399989B/en not_active Expired - Lifetime
- 2002-08-08 CA CA2841701A patent/CA2841701C/en not_active Expired - Lifetime
- 2002-08-08 CA CA2737889A patent/CA2737889C/en not_active Expired - Lifetime
- 2002-08-08 CN CN200710127007XA patent/CN101087421B/en not_active Expired - Lifetime
- 2002-08-08 CA CA2737888A patent/CA2737888C/en not_active Expired - Lifetime
- 2002-08-08 ES ES16186353.5T patent/ES2662250T3/en not_active Expired - Lifetime
- 2002-08-08 DK DK02755888T patent/DK1459449T3/en active
- 2002-08-08 WO PCT/JP2002/008146 patent/WO2003017497A1/en active Application Filing
- 2002-08-08 EP EP10179630.8A patent/EP2262113B1/en not_active Expired - Lifetime
- 2002-08-08 CA CA002454626A patent/CA2454626C/en not_active Expired - Lifetime
- 2002-08-08 KR KR1020067005094A patent/KR100811986B1/en active IP Right Grant
- 2002-08-08 PT PT05008245T patent/PT1587216E/en unknown
- 2002-08-08 AT AT05008245T patent/ATE549861T1/en active
- 2002-08-08 CA CA2946246A patent/CA2946246C/en not_active Expired - Lifetime
- 2002-08-08 AT AT02755888T patent/ATE434288T1/en active
- 2002-08-08 ES ES06019033.7T patent/ES2661930T3/en not_active Expired - Lifetime
- 2002-08-08 EP EP05008245A patent/EP1587216B1/en not_active Expired - Lifetime
- 2002-08-08 DE DE60232681T patent/DE60232681D1/en not_active Expired - Lifetime
- 2002-08-08 EP EP06019033.7A patent/EP1753243B1/en not_active Expired - Lifetime
- 2002-08-08 CA CA2996825A patent/CA2996825C/en not_active Expired - Lifetime
- 2002-08-08 ES ES10179630.8T patent/ES2621677T3/en not_active Expired - Lifetime
- 2002-08-08 ES ES05008245T patent/ES2380936T3/en not_active Expired - Lifetime
- 2002-08-08 CA CA2576161A patent/CA2576161C/en not_active Expired - Lifetime
- 2002-08-08 CA CA2776992A patent/CA2776992C/en not_active Expired - Lifetime
- 2002-08-08 KR KR1020077029950A patent/KR100880305B1/en active IP Right Grant
- 2002-08-08 DK DK16186353.5T patent/DK3121966T3/en active
- 2002-08-08 JP JP2003521476A patent/JP3678365B2/en not_active Expired - Lifetime
- 2002-08-08 DK DK10179630.8T patent/DK2262113T3/en active
- 2002-08-08 PT PT101796308T patent/PT2262113T/en unknown
- 2002-08-08 KR KR1020047001865A patent/KR100591653B1/en active IP Right Grant
- 2002-08-08 ES ES02755888T patent/ES2328118T3/en not_active Expired - Lifetime
- 2002-08-08 EP EP16186353.5A patent/EP3121966B1/en not_active Expired - Lifetime
- 2002-08-08 ES ES10179636.5T patent/ES2587957T3/en not_active Expired - Lifetime
- 2002-08-08 CN CNB028195949A patent/CN100442669C/en not_active Expired - Lifetime
- 2002-08-08 CN CN200810176150.2A patent/CN101399988B/en not_active Expired - Lifetime
- 2002-08-08 CA CA2801972A patent/CA2801972C/en not_active Expired - Lifetime
- 2002-08-08 DK DK10179636.5T patent/DK2262114T3/en active
- 2002-08-08 DK DK06019033.7T patent/DK1753243T3/en active
- 2002-08-08 CA CA2946257A patent/CA2946257C/en not_active Expired - Lifetime
- 2002-08-08 CA CA2737864A patent/CA2737864C/en not_active Expired - Lifetime
- 2002-08-08 EP EP10179636.5A patent/EP2262114B1/en not_active Expired - Lifetime
- 2002-08-08 PT PT60190337T patent/PT1753243T/en unknown
- 2002-08-08 EP EP02755888A patent/EP1459449B1/en not_active Expired - Lifetime
- 2002-08-08 PT PT101796365T patent/PT2262114T/en unknown
- 2002-09-30 US US10/261,884 patent/US7130348B2/en not_active Expired - Lifetime
- 2002-09-30 US US10/261,440 patent/US7106795B2/en not_active Expired - Lifetime
- 2002-12-20 US US10/326,459 patent/US7170942B2/en not_active Expired - Lifetime
-
2004
- 2004-08-31 US US10/931,558 patent/US7400682B2/en not_active Ceased
-
2005
- 2005-01-26 JP JP2005017867A patent/JP3862725B2/en not_active Expired - Lifetime
- 2005-04-07 HK HK08101547.8A patent/HK1108786A1/en not_active IP Right Cessation
- 2005-04-07 HK HK05102900.0A patent/HK1070479A1/en not_active IP Right Cessation
- 2005-04-07 HK HK08101515.6A patent/HK1108785A1/en not_active IP Right Cessation
- 2005-09-16 JP JP2005269639A patent/JP4030558B2/en not_active Expired - Lifetime
-
2007
- 2007-05-30 JP JP2007143499A patent/JP4067558B2/en not_active Expired - Lifetime
- 2007-12-12 JP JP2007320421A patent/JP4745325B2/en not_active Expired - Lifetime
-
2009
- 2009-06-12 JP JP2009140874A patent/JP4745425B2/en not_active Expired - Lifetime
- 2009-07-29 HK HK09106972.0A patent/HK1129014A1/en not_active IP Right Cessation
- 2009-07-29 HK HK09106973.9A patent/HK1129015A1/en not_active IP Right Cessation
- 2009-09-28 JP JP2009223111A patent/JP2010035192A/en not_active Withdrawn
- 2009-10-05 JP JP2009231685A patent/JP4745433B2/en not_active Expired - Lifetime
- 2009-10-05 JP JP2009231695A patent/JP4745434B2/en not_active Expired - Lifetime
- 2009-10-07 JP JP2009233389A patent/JP2010045825A/en active Pending
- 2009-10-07 JP JP2009233465A patent/JP4745435B2/en not_active Expired - Lifetime
- 2009-10-07 JP JP2009233469A patent/JP2010045827A/en not_active Withdrawn
- 2009-10-08 JP JP2009234067A patent/JP2010050992A/en not_active Withdrawn
- 2009-10-08 JP JP2009234065A patent/JP2010050991A/en not_active Withdrawn
- 2009-10-08 JP JP2009234070A patent/JP4745436B2/en not_active Expired - Lifetime
-
2010
- 2010-01-19 US US12/689,897 patent/USRE42745E1/en not_active Expired - Lifetime
- 2010-03-10 JP JP2010052603A patent/JP2010158055A/en not_active Withdrawn
- 2010-07-15 US US12/837,154 patent/USRE43091E1/en not_active Expired - Lifetime
-
2011
- 2011-11-21 US US13/301,502 patent/USRE44234E1/en not_active Expired - Lifetime
- 2011-11-21 US US13/301,430 patent/USRE44285E1/en not_active Expired - Lifetime
- 2011-11-21 US US13/301,472 patent/USRE44319E1/en not_active Expired - Lifetime
- 2011-11-21 US US13/301,526 patent/USRE44138E1/en not_active Expired - Lifetime
-
2013
- 2013-05-23 US US13/901,316 patent/USRE44891E1/en not_active Expired - Lifetime
-
2014
- 2014-03-12 US US14/207,043 patent/USRE46370E1/en not_active Ceased
-
2017
- 2017-01-06 US US15/400,121 patent/USRE47277E1/en not_active Expired - Lifetime
- 2017-01-06 US US15/400,111 patent/USRE47258E1/en not_active Expired - Lifetime
-
2018
- 2018-03-07 CY CY20181100282T patent/CY1120069T1/en unknown
- 2018-03-07 CY CY20181100281T patent/CY1120067T1/en unknown
Patent Citations (39)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO1990009064A1 (en) | 1989-01-27 | 1990-08-09 | Dolby Laboratories Licensing Corporation | Low time-delay transform coder, decoder, and encoder/decoder for high-quality audio |
JPH04503136A (en) | 1989-01-27 | 1992-06-04 | ドルビー・ラボラトリーズ・ランセンシング・コーポレーション | Short-delay transform coders, decoders, and encoder-decoders for high-quality audio |
JPH04504192A (en) | 1989-01-27 | 1992-07-23 | ドルビー・ラボラトリーズ・ランセンシング・コーポレーション | Low bitrate conversion coders, decoders, and encoders/decoders for high quality audio |
US5230038A (en) | 1989-01-27 | 1993-07-20 | Fielder Louis D | Low bit rate transform coder, decoder, and encoder/decoder for high-quality audio |
WO1990009022A1 (en) | 1989-01-27 | 1990-08-09 | Dolby Laboratories Licensing Corporation | Low bit rate transform coder, decoder and encoder/decoder for high-quality audio |
JPH03270573A (en) | 1990-03-20 | 1991-12-02 | Fujitsu Ltd | Picture data coding device and picture data decoding device |
JPH04222121A (en) | 1990-12-22 | 1992-08-12 | Casio Comput Co Ltd | Data compressor |
JPH05307467A (en) | 1991-07-16 | 1993-11-19 | Lsi Logic Corp | Method and device for executing quantization |
JPH0595483A (en) | 1991-10-02 | 1993-04-16 | Ricoh Co Ltd | Device and method for picture compression |
JPH0646269A (en) | 1992-02-28 | 1994-02-18 | Ricoh Co Ltd | Expansion method and compression method for still picture data or device executing the methods |
GB2264609A (en) | 1992-02-28 | 1993-09-01 | Ricoh Kk | Data compression |
US5590067A (en) | 1992-06-26 | 1996-12-31 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
US5594678A (en) | 1992-06-26 | 1997-01-14 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
US5596517A (en) | 1992-06-26 | 1997-01-21 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
US5479364A (en) | 1992-06-26 | 1995-12-26 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
CA2221181A1 (en) | 1992-06-26 | 1993-12-27 | Discovision Associates | Method and arrangement for transformation of signals from a frequency to a time domain |
JPH0653839A (en) | 1992-07-29 | 1994-02-25 | Casio Comput Co Ltd | Data compressing device |
JPH0677842A (en) | 1992-08-28 | 1994-03-18 | Mitsubishi Electric Corp | Quantizer |
US5345408A (en) | 1993-04-19 | 1994-09-06 | Gi Corporation | Inverse discrete cosine transform processor |
JPH0799578A (en) | 1993-09-28 | 1995-04-11 | Nec Corp | Picture processing device |
US5748793A (en) | 1993-09-28 | 1998-05-05 | Nec Corporation | Quick image processor of reduced circuit scale with high image quality and high efficiency |
US5471412A (en) | 1993-10-27 | 1995-11-28 | Winbond Electronic Corp. | Recycling and parallel processing method and apparatus for performing discrete cosine transform and its inverse |
US5640159A (en) | 1994-01-03 | 1997-06-17 | International Business Machines Corporation | Quantization method for image data compression employing context modeling algorithm |
US5822003A (en) | 1994-10-31 | 1998-10-13 | Girod; Bernd | Method and apparatus for performing fast reduced coefficient discrete cosine transforms |
KR0172902B1 (en) | 1995-09-12 | 1999-03-20 | 구자홍 | Mpeg encoder |
US5764553A (en) | 1996-02-28 | 1998-06-09 | Lsi Logic Corporation | Generalized data processing path for performing transformation and quantization functions for video encoder systems |
US5754457A (en) | 1996-03-05 | 1998-05-19 | Intel Corporation | Method for performing an inverse cosine transfer function for use with multimedia information |
US5845112A (en) | 1997-03-06 | 1998-12-01 | Samsung Electronics Co., Ltd. | Method for performing dead-zone quantization in a single processor instruction |
US6212236B1 (en) | 1997-03-26 | 2001-04-03 | Matsushita Electric Industrial Co., Ltd. | Image decoding apparatus |
US6081552A (en) | 1998-01-13 | 2000-06-27 | Intel Corporation | Video coding using a maximum a posteriori loop filter |
US6160920A (en) | 1998-09-15 | 2000-12-12 | Winbond Electronics Corp. | Cosine transforming and quantizing device, method of reducing multiplication operations in a video compressing apparatus |
US6876703B2 (en) | 2000-05-11 | 2005-04-05 | Ub Video Inc. | Method and apparatus for video coding |
JP2004506990A (en) | 2000-08-12 | 2004-03-04 | ローベルト ボツシユ ゲゼルシヤフト ミツト ベシユレンクテル ハフツング | Integer approximation of transform coefficients and encoder and decoder |
US20040046754A1 (en) | 2000-08-12 | 2004-03-11 | Claudia Mayer | Method for carrying out integer approximation of transform coefficients, and coder and decoder |
US6856262B2 (en) | 2000-08-12 | 2005-02-15 | Robert Bosch Gmbh | Method for carrying out integer approximation of transform coefficients, and coder and decoder |
US20030123553A1 (en) | 2001-08-09 | 2003-07-03 | Kerofsky Louis Joseph | Systems and methods for efficient video-related data processing |
US20030112876A1 (en) | 2001-08-09 | 2003-06-19 | Sharp Laboratories Of America, Inc. | Systems and methods for reduced bit-depth processing in video-related data |
US20030099291A1 (en) | 2001-08-09 | 2003-05-29 | Kerofsky Louis J. | Systems and methods for enabling reduced bit-depth processing and memory reduction in video-related data processing |
US20040013202A1 (en) | 2002-04-23 | 2004-01-22 | Nokia Corporation | Method and device for indicating quantizer parameters in a video coding system |
Non-Patent Citations (20)
Title |
---|
"H. 26L Test Model Long Term No. 8(TML-8) Drafto" ITU-T Telecommunication Standarization Sector of ITU, Genevam CH, Apr. 2, 2001, pp. 1-54 XP001089814. |
Bjontegaard, "H.26L Test Model Long Term No. 7 (TML-7) Draft0", ITU-Telecommunications Standardization Sector, Study Group 16, Video Coding Experts Group (VCEG), Document VCEG-M81, Thirteenth Meeting, Austin, Texas, USA, Apr. 2-4, 2001, pp. 1-36. |
Bjontegaard, "H.26L Test Model Long Term No. 8 (TML-8) Draft0", ITU-Telecommunications Standardization Sector, Study Group 16, Video Coding Experts Group (VCEG), Document VCEG-Nxx, Apr. 2, 2001 (Generated: Jun. 28, 2001), pp. 1-46. |
Extended European Search Report, dated Nov. 4, 2010, for European Application No. 10179630.8. |
Extended European Search Report, dated Nov. 4, 2010, for European Application No. 10179636.5. |
Gisele Bjontegard, "H.26L Test Model Long Term No. 8 (TML-8) draft0", document VCEG-M81, ITU-T Video Coding Experts Group (VCEG), Austin, Texas, Apr. 2001. |
Hallapuro et al., "Low Complexity (I)DCT", ITU-Telecommunications Standardization Sector, Study Group 16 Question 6, Video Coding Experts Group (VCEG), 15th Meeting: Pattaya, Thailand, Dec. 4-6, 2001, pp. 1-11. |
Hallapuro et al., "Low Complexity Transform and Quantization-Part II: Extensions," Document: JVT-B039, Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6), 2nd Meeting: Geneva, CH, Jan. 29-Feb. 1, 2002, pp. 1-14. |
Hallapuro, et al., "Low Complexity Transform and Quantization-Part 1: Basic Implementation," Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JCTI/SC29/WG11 and ITU-T SG16 Q.6), Document: JVT-B038, XP030005037, Jan. 14, 2002, pp. 1-18. |
Joint Video Team, T. Wiegand (Contact), "Draft ITU-T Recommendation H.264 (a.k.a. "H.26L")", ITU-Telecommunications Standardization Sector, Study Group 16 Question 6, Video Coding Experts Group (VCEG), Document: VCEG-P07, 16th Meeting: Fairfax, Virginia, USA, May 6-10, 2002, 141 pages. |
Kerofsky et al., "Reduced Bit-Depth Quantization," ITU-Telecommunications Standardization Sector, Study Group 16 Question 6, Video Coding Experts Group (VCEG), Document VCEG-N20, Fourteenth Meeting: Santa Barbara, CA, USA, Sep. 24-27, 2001, pp. 1-14. |
Kerofsky L., Lei S.; "Reduced bit- depth quantization" Document VCEG-N20, ITU-Telecommuncations Standardization Sector, Study Group 16 Question 6: Video Coding Experts Group (VCEG), 'Online! Sep. 24, 2001, pp. 1-14, XP002332051 Santa Barbara, CA USA Retrieved from thr internet: URL: ftp3.itu.int/av-arch/video-site/0109-SAN/vceg-n20.DOC> Retrieved on Jun. 8, 2008! Section "Introduction", pp. 1-2 Section "Proposed Quantization values", pp. 3-4 Section "Appendix", Table 10 and Equations 4,5. |
Kerofsky, "Modifications to the JVT IDCT", Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6), Document: JVT-C25, 3rd Meeting: Fairfax, Virginia, USA, May 6-10, 2002, pp. 1-14. |
Kerofsky, "Notes on JVT IDCT", Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6), Document: JVT-C24, 3rd Meeting: Fairfax, Virginia, USA, May 6-10, 2002, pp. 1-8. |
Klomp et al., "TE1: Cross-Checking Results of DMVD Proposal JCTVC-B076 (MediaTek Inc.)", Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, Document: JCTVC-B119, 2nd Meeting: Geneva, CH, Jul. 21-28, 2010, 1 page. |
Korean Office Action, dated Jan. 13, 2006, for Korean Application No. 10-2004-7001865 (English translation only provided). |
Lepley et al., "Report on Core Experiment CodEff9: Integer Quantization", Coding of Still Pictures, ISO/IEC JTC1/SC29/WG1 (ITU-T SG8), XP017205064, Oct. 21, 1998, 5 pages. |
Liang et al., "A 16-bit Architecture for H.26L, Treating DCT Transforms and Quantization", ITU-Telecommunications Standardization Sector, Study Group 16 Question 6, Video Coding Experts Group (VCEG), Document VCEG-M16, XP002332050, Austin, TX, USA, Apr. 2-4, 2001, pp. 1-17. |
Liang J. , Tran T. , Topiwala P .: "a 16-bit architecture for H .26L, treating DCT transforms and quantization" Document VCEG-M16 , ITU-Elecommuntcations Standardization Sector,Study Group 16 Question 6, Video Coding Experts Group (VCEG), 'Online!Apr. 2, 2001, pp. 1-17, XP002332050 Austin, Texes, USA Rerieved from the Internet ; URL: http://www.ensc.sfu.ca/people/faculty/jiel/papers/H26L--Proposal.doc !retrieved on Jun. 8, 2005 abstract Section "Introduction", p. 1 Section 1.2 "Quantization in TML 5.2", pp. 2-3 Section 2.4 "Scaling factors and Quantization", pp. 6-7. |
Sun et al., "Global Motion Vector Coding (GMVC)", ITU-Telecommunications Standardization Sector, Study Group 16 Question 6, Video Coding Experts Group (VCEG), Document: VCEG-O20, Fifteenth Meeting: Pattaya, Thailand, Dec. 4-7, 2001, pp. 1-10. |
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
USRE47277E1 (en) | Systems and methods for reduced bit-depth processing in video-related data with frequency weighting matrices |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: DOLBY LABORATORIES LICENSING CORPORATION, CALIFORN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHARP KABUSHIKI KAISHA;REEL/FRAME:036724/0111 Effective date: 20150929 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 |