Patent Application
20060044325
The invention relates to a method for applying dithering to a transfer function used for processing video data. Moreover, the present invention relates to a corresponding device for applying dithering to video data.
A PDP (plasma display panel) uses a matrix array of discharge cells, which can only be “ON”, or “OFF”. Also unlike a CRT or LCD in which grey levels are expressed by analogue control of the light emission, a PDP controls the grey level by modulating the number of light pulses per frame (sustain pulses). This time-modulation will be integrated by the eye over a period corresponding to the eye time response. Since the video amplitude is portrayed by the number of light pulses, occurring at a given frequency, more amplitude means more light pulses and thus more “ON” time. For this reason, this kind of modulation is also known as PWM, pulse width modulation.
This PWM is responsible for one of the PDP image quality problems: the poor grey scale portrayal quality, especially in the darker regions of the picture. Indeed, contrarily to CRTs where luminance is approximately quadratic to the applied cathode voltage, luminance is linear to the number of discharge pulses. Therefore an approximately digital quadratic degamma function has to be applied to video (generally done by a Look-Up Table). To avoid losing amplitude resolution due to this degamma function, a dithering method has to be used.
Dithering is a well-known technique used to reduce the effects of quantization due to a limited number of displayed resolution bits. There are mainly two kinds of dithering used for PDP:
The teaching of the present document aims at reducing the dithering noise appearing with matrix dithering. Error diffusion noise cannot be reduced by the method described here.
Matrix dithering can in principle bring back as many bits as wanted. However, the dithering noise frequency decreases and therefore the noise becomes more noticeable with an increasing number of dithering bits. In practice with matrix dithering, 3 bits of dithering can be used at the most, because the more bits one uses, the more visible the pattern is.
The reason for this is that if 3 bits are used for dithering, there will be 8 different dithering patterns, as shown in
Another aspect is that if 3 bits of dithering are used, the pattern of ½(1st bit of dithering) is quite invisible, the patterns of ¼and ¾(2nd bit of dithering) are a bit more visible, while the patterns of ⅛, ⅜, ⅝ and ⅞ (3rd bit of dithering) can be more visible and awkward (compare
The values 0, ¼, ½, ¾ and 1 in each cell of the 4×4 matrix dithering blocks mean that the level 1 is activated 0, 1, 2, 3 or 4 times during the 4 frames. According to this example, the levels ⅛, ⅜, ⅝ and ⅞ are less fine (and so more visible and cumbersome) than the others patterns of dithering.
The typical block structure of the data processing before the coding step is shown in
The choice of a dither pattern is made by the degamma LUT, where the dithering bits appear. The matrix dithering block only applies the matrix pattern corresponding to the dithering bits.
The problem is that dithering bits are really required in the low levels (because of the degamma function), but in the higher levels they are not really necessary, and can on the contrary be unwanted since they add some patterns without adding levels. This will be better explained by an example. The degamma function is defined as follows:
wherein YI is the input data and YA the output data of the degamma block 1. Y is the usual exponent of the degamma function. In the example Y=2.2
Even with 3 bits of dithering, some levels between 0 and 21 have the same output, which means loss of levels. But after level 122, all outputs are different even without dithering. This means that without dithering there is no loss of levels but without dithering there is also more quantization noise.
In the higher levels, dithering can be useful to reduce quantization noise, but it is not necessary to have 3 bits of dithering. However, for example, input levels between 182 and 189 are all using the 3rd bit of dithering as shown in Table 1, which is an extract of Table 3 given in Annex.
So for these high levels dither patterns are used, which can be awkward.
In view of that, the object of the present invention is to provide a method and a device which enable an improved dithering of quantization steps.
According to the present invention this object is solved by a method for processing video data by applying a transfer function on said video data, a dithering being applied to said transfer function. For applying said dithering to the transfer function, the method comprises the following steps:
For example, if output values are 12.125 and 12.875, the values equal to and/or lying between these output values are:
The intermediate value using the least number of bits is 12.5.
Furthermore, there is provided a device for processing video data having processing means for applying a transfer function on said video data and dithering means for applying dithering to said transfer function, wherein said dithering means associates a first output value and a second output value to a discrete input value of said transfer function, chooses an intermediate value being equal to and/or lying between said first output value and said second output value that uses the least number of dithering bits and takes said intermediate value as an output value for said discrete input value.
The advantage of the inventive method and device is that the dithering noise can be reduced tremendously.
The transfer function may be a degamma function. The effect of the quantization of the degamma function is often very disturbing. Thus, an improved dithering of the degamma function values has a very positively effect.
The transfer function may be provided by a look-up table. Such LUT improves the processing speed.
In a specific embodiment the first and the second output values are calculated by modifying a parameter of the transfer function. Especially, the input parameter of the transfer function may be modified. The modification may be performed by adding and subtracting a modifying value to or from the parameter, so that the first and the second output values are obtained by the modified parameter. By doing so an acceptable error will be specified.
If there are a plurality of intermediate values with the same least number of used dithering bits, the value which lies closer to the discrete function value may be chosen as intermediate value. With that, further errors are avoided.
The present invention is illustrated along with the attached drawings showing in:
The present invention is based on the following knowledge.
Only a small shift of 0.05 of the input, which corresponds to a small error on the input, would lead to levels using only 1 bit of dithering. So worse dither pattern indicated in table 1 can be avoided without adding significant quantization noise, as shown in the following table 2.
In fact, globally the rounding process makes the probability that the value added by dithering is equal either to 0/8, ⅛, 2/8, ⅜, 4/8, ⅝, 6/8, or ⅞ the same for all levels. So, in principle, the probability that a level uses the 3rd dithering bit (i.e. value added by dithering is equal to ⅛, ⅜, ⅝ or ⅞) is ½.
When generating the degamma LUT, there are always rounding errors. Now, the idea is to play on this error in order to privilege better dither patterns. In other words, the error has to be estimated and limited.
The error on the output (quantization error) is not easy to estimate because this error is always relatively smaller in the higher levels than in the low levels (in case of standard encoding). The estimation is worse in case of Gravity Center Coding (cf. patent application EP1256924) or Metacode (cf. patent application EP1353315), because of the non uniform distribution of the levels and the resulting non-uniformity of the quantization error.
For these reasons, it is easier to consider an error on the input. Specifically, it is easier to estimate and to limit the error.
So the first step S1 as shown in
With this two limit curves, two output values Y−τ and Y+τ other than the value YA can be defined for each input value YI. Table 3, given in Annex, shows the corresponding input values YI (first column) and output values YA (second and fifth column) of the degamma block 1. The third and fourth column of Table 3 represent the values Y−τ and Y+τ of the limit curves. Each degamma output value consists of a 8 bit integer and a 3 bit dithering value.
According to the present invention for each input value an intermediate value between Y−τ and Y+τ using the least dithering bits is chosen (compare step S2). This can be seen for instance in the rows of input values 20 and 30. Said intermediate value is chosen as output value for the considered input value YI. When there are different values having the same number of dithering bits, the closer to the real value has to be chosen. However, if for an actual input value there is an output value between Y−τ and Y+τ having less dithering that the values Y−τ and Y+τ, this value must be chosen. The row of input value 146 shows such an example. Additionally, it has to be regarded to use different output values as far as possible (compare optimized output values for the input values 26 and 27).
With the standard method (compare second column of Table 3) 131 levels (respectively 61, 28 and 36) are using the 3rd dithering bit (respectively 2nd, 1st and no dithering bit), with the inventively optimized approach only 28 (respectively 63 and 70, and 95).
The invention can be applied to presently available processing devices without hardware amendment, because only a change of the content of the LUT is necessary. However, advanced processing devices may be able to calculate the optimized LUT automatically. In this case specific calculation means are necessary to perform the method shown in
| Number | Date | Country | Kind |
|---|---|---|---|
| 04292087.6 | Aug 2004 | EP | regional |
