Method and system for signal processing, for instance for mobile 3D graphic pipelines, and computer program product therefor

1. A method, comprising:

under control of a computing device, rendering a primitive of an image to be displayed, the primitive having an area and the rendering including:

locating pixels that fall within the area of said primitive; and

for each pixel located in said area,

generating a set of associated sub-pixels of the pixel, the sub-pixels comprised of color components;

creating an adaptively filtered set of sub-pixels for the pixel by adaptively filtering said set of associated sub-pixels and a set of neighboring sub-pixels of one or more neighboring pixels adjacent to the pixel, wherein the creating the adaptively filtered set of sub-pixels includes computing each of the sub-pixels of the adaptively filtered set based at least in part on determining distances between at least some of the sub-pixels of the set of associated sub-pixels and sub-pixels of the set of neighboring sub-pixels, the distances being based on the color components of the at least some of the sub-pixels of the set of associated sub-pixels and sub-pixels of the set of neighboring sub-pixels;

computing a final pixel for display by subjecting said adaptively filtered set of sub-pixels to further filtering; and

displaying the final pixel on a display of the computing device.

2. The method of claim 1 , wherein said primitive is a triangle.

3. The method of claim 1 , wherein each pixel includes a set of red, green, blue, and alpha components.

4. The method of claim 1 , wherein said step of locating the pixels that fall within the primitive area is performed as a rasterization step.

5. The method of claim 1 , wherein said set of associated sub-pixels is generated by a rasterization algorithm.

6. The method of claim 1 , wherein said set of associated sub-pixels fulfils at least one of the following:

the set includes two associated sub-pixels; and

the set includes associated sub-pixels placed on pixel edges.

7. The method of claim 1 , wherein the generating the set of associated sub-pixels further includes compressing the sub-pixels in said set of associated sub-pixels, and wherein the creating the adaptively filtered set of sub-pixels further includes decompressing at least one set of associated sub-pixels.

8. The method of claim 7 , wherein the compressing the sub-pixels in said set of associated sub-pixels further includes converting the sub-pixels between a first format and a second format, said second format being a format compressed via vector quantization, wherein said vector quantization includes repeatedly applying a scalar quantizer with a quantization step determined in an adaptive way.

9. The method of claim 7 , wherein each sub-pixel includes a set of red, green, blue, and alpha components and said compressing includes taking, for each sub-pixel, two of said components and compressing these two components to an amount of bits equal to an amount of bits of an uncompressed sub-pixel component.

10. The method of claim 1 further comprising, between said steps of generating a set of associated sub-pixels and said step of adaptively filtering, the step of storing said associated sub-pixels in a frame buffer.

11. The method of claim 10 , further comprising compressing the sub-pixels in said set of associated sub-pixels, wherein the storing step includes storing said associated sub-pixels in the frame buffer in a compressed format resulting from said compressing.

12. The method of claim 11 , further comprising:

reading said associated sub-pixels from said frame buffer; and at least one of the steps of:

further processing information related to said associated sub-pixels in a graphic pipeline, and

decompressing said associated sub-pixels in order to generate corresponding uncompressed sub-pixel information.

13. The method of claim 1 , wherein said adaptively filtering step includes, for a first sub-pixel of said adaptively filtered set, the operations of computing said first sub-pixel by:

If (distance(A,D)<=distance(C,B)) and (distance(A,D)<=distance(A,C))

Then AA=median(E,N,C)

Else

If (distance(C,B)<=distance(A,D)) and (distance(C,B)<=distance(A,C))

Then AA=median(E,N,A)

Else

If (([distance(A,C)+distance(B,D)]/2<=distance(A,D)) and

([distance(A,C)+distance(B,D)]/2<=distance(C,B))) or

(([distance(A,B)+distance(C,D)]/2<=distance(A,D)) and ([distance(A,B)+distance(C,D)]/2 distance(C,B)))

Then AA=(A+C+N+E)/4

where AA is said first sub-pixel, A, B, C, and D are the sub-pixels of said set of associated sub-pixels, and E and N are sub-pixels in said set of neighboring sub-pixels, while median and distance are median and distance operators.

14. The method of claim 13 , wherein said adaptively filtering step includes, for a second sub-pixel of said adaptively filtered set, the operations of computing said second adaptively filtered sub-pixel by:

If (distance(A,D)<=distance(C,B)) and (distance(A,D)<=distance(A,B))

Then BB=median(F,G,B)

Else

If (distance(C,B)<=distance(A,D)) and (distance(C,B)<=distance(A,B))

Then BB=median(F,G,A)

Else

If [distance(A,C)+distance(B,D)]/2<=distance(A,D) and

[distance(A,C)+distance(B,D)]/2<=distance(C,B) or

[distance(A,B)+distance(C,D)]/2<=distance(A,D) and [distance(A,B)+distance(C,D)]/2 distance(C,B)

Then BB=(A+F+B+G)/4

where BB is said second sub-pixel, and F and G are sub-pixels of said set of neighboring sub-pixels.

15. The method of claim 14 , wherein said adaptively filtering step includes, for a third sub-pixel of said adaptively filtered set, the operations of computing said third sub-pixel by:

If distance(A,D)<=distance(C,B) and distance(A,D)<=distance(C,D)

Then CC=median(C,M,L)

Else

If distance(C,B)<=distance(A,D) and distance(C,B)<=distance(C,D)

Then CC=median(M,L,D)

Else

If [distance(A,C)+distance(B,D)]/2<=distance(A,D) and

[distance(A,C)+distance(B,D)]/2<=distance(C,B) or

[distance(A,B)+distance(C,D)F 2 <=distance(A,D) and [distance(A,B)+distance(C,D)]/2 distance(C,B)

Then CC=(C+M+L+D)/4 where CC is said third sub-pixel, and M and L are sub-pixels of said set of neighboring sub-pixels.

16. The method of claim 15 , wherein said adaptively filtering step includes, for a fourth sub-pixel of said adaptively filtered set, the operations of computing said fourth sub-pixel by:

If distance(A,D)<=distance(C,B) and distance(A,D)<=distance(B,D)

Then DD=median(B,H,I)

Else

If distance(C,B)<=distance(A,D) and distance(C,B)<=distance(B,D)

Then DD=median(H,I,D)

Else

If [distance(A,C)+distance(B,D)]/2<=distance(A,D) and

[distance(A,C)+distance(B,D)]/2<=distance(C,B) or

[distance(A,B)+distance(C,D)]/2<=distance(A,D) and [distance(A,B)+distance(C,D)]/2 distance(C,B)

Then DD=(B+D+I+H)/4

where DD is said fourth sub-pixel, and H and I are sub-pixels of said set of neighboring sub-pixels.

17. The method of claim 13 , wherein each sub-pixel includes a set of red, green, blue, and alpha components and the median of three sub-pixels is a new sub-pixel composed by red, green, and blue components where:

the red component of the new sub-pixel is the median of the red components of the three sub-pixels;

the green component of the new sub-pixel is the median of the green components of the three sub-pixels; and

the blue component of the new sub-pixel is the median of the blue components of the three sub-pixels.

18. The method of claim 13 , wherein each sub-pixel includes a set of red, green, and blue components and the distance between two of the sub-pixels is defined as:

square root of ((Red pixel1−Red pixel2)*(Red pixel1−Red pixel2)+(Green pixel1−Green pixel2)*(Green pixel1−Green pixel2)+(Blue pixel1−Blue pixel2)*(Blue pixel1−Blue pixel2)), wherein Red pixel1, Green pixel1, and Blue pixel1 are the red, green, and blue components of a first one of the two sub-pixels and Red pixel2, Green pixel2, and Blue pixel2 are the red, green, and blue components of a second one of the two sub-pixels.

19. The method of claim 13 , wherein each sub-pixel includes a set of red, green, and blue components and the distance between two of the sub-pixels is defined as:

absolute value (Red pixel1−Red pixel2)+absolute value (Green pixel1−Green pixel2)+absolute value (Blue pixel1−Blue pixel2), wherein Red pixel1, Green pixel1, and Blue pixel1 are the red, green, and blue components of a first one of the two sub-pixels and Red pixel2, Green pixel2, and Blue pixel2 are the red, green, and blue components of a second one of the two sub-pixels.

20. The method of claim 1 , wherein said step of computing the final pixel for display includes:

obtaining multiplication results by multiplying each of the sub-pixels of said set of associated sub-pixels, said set of neighboring sub-pixels, and said adaptively filtered set of sub-pixels by respective coefficients;

obtaining a first sum by adding together the multiplication results;

obtaining a second sum by adding together the coefficients; and

dividing the first sum by the second sum.

21. The method of claim 1 , wherein said step of computing the final pixel for display includes;

determining a maximum or minimum sub-pixel pair by finding either a maximum or a minimum distance between (A, D), (C, B), (AA, DD), (BB, CC), where (A, B, C, D) are the sub-pixels of said set of associated sub-pixels and said set of neighboring sub-pixels while (AA, BB, CC, DD) are the sub-pixels of said adaptively filtered set of sub-pixels; and

computing the final pixel as an average of the sub-pixels of the maximum or minimum sub-pixel pair.

22. The method of claim 1 , wherein said step of computing a final pixel for display includes interpolating the sub-pixels of said adaptively filtered set of sub-pixels by using for each of them, four close surrounding sub-pixels.

23. A system for rendering a primitive of an image to be displayed, the primitive having an area, the system comprising:

locating means for locating pixels that fall within the area of said primitive;

generating means for generating for each said pixel located in said area a set of associated sub-pixels of the pixel, the sub-pixels comprised of color components;

adaptive filtering means for creating for each of the pixels a respective adaptively filtered set of sub-pixels for the pixel by adaptively filtering said set of associated sub-pixels and a set of neighboring sub-pixels of one or more neighboring pixels adjacent to the pixel, wherein the adaptive filtering means is configured to compute each of the sub-pixels of the respective adaptively filtered set at least in part by determining distances between at least some of the associated sub-pixels and neighboring sub-pixels, the distances being based on the color components of the at least some of the associated sub-pixels and neighboring sub-pixels;

computing means for computing for each of the pixels a final pixel for display by subjecting said respective adaptively filtered set of sub-pixels of the pixel to further filtering; and

a frame buffer memory for storing for each of the pixels said respective set of associated sub-pixels.

24. The system of claim 23 , wherein the primitive is a triangle.

25. The system of claim 23 , wherein each pixel includes a set of red, green, blue and alpha components.

26. The system of claim 23 , wherein the locating means include a rasterizer module configured for locating the pixels that fall within said primitive area.

27. The system of claim 23 , wherein the generator means include a rasterizer module configured for generating said set of associated sub-pixels.

28. The system of claim 23 , wherein said set of associated sub-pixels fulfils at least one of the following:

the set includes two associated sub-pixels; and

the set includes associated sub-pixels placed on pixel edges.

29. The system of claim 23 , further comprising a processing module configured for compressing the sub-pixels in said set of associated sub-pixels.

30. The system of claim 29 , wherein said processing module is configured for converting the sub-pixels in said set between a first format and a second format, said second format being a format compressed via vector quantization, wherein said vector quantization results from repeated application of a scalar quantizer with a quantization step determined in an adaptive way.

31. The system of claim 29 , wherein each sub-pixel includes a set of red, green, blue and alpha components and said processing module is configured for taking for each sub-pixel two of said components and compressing these two components to an amount of bits equal to an amount of bits of an uncompressed sub-pixel component.

32. The system of claim 23 , further comprising a processing module configured for producing compressed sub-pixels by compressing the sub-pixels in said set of associated sub-pixels, wherein said compressed sub-pixels are stored in said frame buffer memory.

33. The system of claim 23 , further comprising:

a read module configured for reading said associated sub-pixels from said frame buffer memory; and at least one of:

a graphic pipeline configured for further processing information related to said associated sub-pixels, and

a decoder configured for decompressing said associated sub-pixels in order to generate corresponding uncompressed sub-pixel information.

34. The system of claim 23 , wherein, for a first sub-pixel of said respective adaptively filtered set, said adaptive filtering means include means for performing:

If (distance(A,D)<=distance(C,B)) and (distance(A,D)<=distance(A,C))

Then AA=median(E,N,C)

Else

If (distance(C,B)<=distance(A,D)) and (distance(C,B)<=distance(A,C))

Then AA=median(E,N,A)

Else

If a[distance(A,C)+distance(B,D)]/2<=distance(A,D)) and

([distance(A,C)+distance(B,D)]/2<=distance(C,B))) or

(([distance(A,B)+distance(C,D)]/2<=distance(A,D)) and ([distance(A,B)+distance(C,D)]/2 distance(C,B)))

Then AA=(A+C+N+E)/4

where AA is said first sub-pixel, A, B, C, and D are the sub-pixels of said set of associated sub-pixels, and E and N are sub-pixels in said set of neighboring pixels, while median and distance are median and distance operators.

35. The system of claim 34 , wherein, for a second sub-pixel of said respective adaptively filtered set, said adaptive filtering means include means for performing:

If (distance(A,D)<=distance(C,B)) and (distance(A,D)<=distance(A,B))

Then BB=median(F,G,B)

Else

If (distance(C,B)<=distance(A,D)) and (distance(C,B)<=distance(A,B))

Then BB=median(F,G,A)

Else

If [distance(A,C)+distance(B,D)]/2<=distance(A,D) and

[distance(A,C)+distance(B,D)]/2<=distance(C,B) or

[distance(A,B)+distance(C,D)]/2<=distance(A,D) and [distance(A,B)+distance(C,D)]/2 distance(C,B)

Then BB=(A+F+B+G)/4

where BB is said second sub-pixel, and F and G are sub-pixels of said set of neighboring sub-pixels.

36. The system of claim 35 , wherein, for a third sub-pixel of said respective adaptively filtered set, said adaptive filtering means include means for performing:

If distance(A,D)<=distance(C,B) and distance(A,D)<=distance(C,D)

Then CC=median(C,M,L)

Else

If distance(C,B)<=distance(A,D) and distance(C,B)<=distance(C,D)

Then CC=median(M,L,D)

Else

If [distance(A,C)+distance(B,D)]/2<=distance(A,D) and

[distance(A,C)+distance(B,D)]/2<=distance(C,B) or

[distance(A,B)+distance(C,D)]/2<=distance(A,D) and [distance(A,B)+distance(C,D)]/2 distance(C,B)

Then CC=(C+M+L+D)/4

where CC is said third sub-pixel, and M and L are sub-pixels of said set of neighboring sub-pixels.

37. The system of claim 36 , wherein, for a fourth sub-pixel of said respective adaptively filtered set, said adaptive filtering means include means for performing:

If distance(A,D)<=distance(C,B) and distance(A,D)<=distance(B,D)

Then DD=median(B,H,I)

Else

If distance(C,B)<=distance(A,D) and distance(C,B)<=distance(B,D)

Then DD=median(H,I,D)

Else

If [distance(A,C)+distance(B,D)]/2<=distance(A,D) and

[distance(A,C)+distance(B,D)]/2<=distance(C,B) or

[distance(A,B)+distance(C,D)]/2<=distance(A,D) and [distance(A,B)+distance(C,D)]/2 distance(C,B)

Then DD=(B+D+I+H)/4

where DD is said fourth sub-pixel, and I and H are sub-pixels of said set of neighboring sub-pixels.

38. The system of claim 34 , wherein each sub-pixel includes a set of red, green, and blue components and the median of three of the sub-pixels is a new sub-pixel composed by red, green, and blue components where:

the red component of the new sub-pixel is the median of the red components of the three sub-pixels;

the green component of the new sub-pixel is the median of the green components of the three sub-pixels;

the blue component of the new sub-pixel is the median of components of the three sub-pixels.

39. The system of claim 34 , wherein each sub-pixel includes a set of red, green, and blue components and the distance between two of the sub-pixels is defined as:

square root of ((Red pixel1−Red pixel2)*(Red pixel 1−Red pixel2)+(Green pixel1−Green pixel2)*(Green pixel1−Green pixel2)+(Blue pixel1−Blue pixel2)*(Blue pixel1−Blue pixel2)), wherein Red pixel1, Green pixel1, and Blue pixel1 are the red, green, and blue components of a first one of the two sub-pixels and Red pixel2, Green pixel1, and Blue pixel2 are the red, green, and blue components of a second one of the two sub-pixels.

40. The system of claim 34 , wherein each sub-pixel includes a set of red, green, and blue components and the distance between two of the sub-pixels is defined as:

absolute value(Red pixel1−Red pixel2)+absolute value (Green pixel1−Green pixel2)+absolute value (Blue pixel1−Blue pixel2), wherein Red pixel1, Green pixel1, and Blue pixel1 are the red, green, and blue components of a first one of the two sub-pixels and Red pixel2, Green pixel2, and Blue pixel2 are the red, green, and blue components of a second one of the two sub-pixels.

41. The system of claim 23 , wherein the computing means includes:

means for obtaining multiplication results by multiplying each of said the sub-pixels of said set of associated sub-pixels, said set of neighboring sub-pixels, and each sub-pixel of said respective adaptively filtered set of sub-pixels, by a respective coefficient;

obtaining a first sum by adding together the multiplication results;

obtaining a second sum by adding together the coefficients; and

dividing the first sum by the second sum.

42. The system of claim 23 , wherein the computing means includes means for:

determining a maximum or minimum sub-pixel pair by finding either a maximum or a minimum distance between (A, D), (C, B), (AA, DD), (BB, CC), where (A, B, C, D) are the sub-pixels of said set of associated sub-pixels and said set of neighboring sub-pixels while (AA, BB, CC, DD) are the sub-pixels of said respective adaptively filtered set of sub-pixels; and

computing the final pixel as an average of the sub-pixels of the maximum or minimum sub-pixel pair.

43. The system of claim 23 , wherein the computing means includes means for interpolating the sub-pixels of said respective adaptively filtered set of sub-pixels by using for each of them, four close surrounding sub-pixels.

44. A computer-readable medium comprising code portions that cause a computer to implement a method for rendering a primitive of an image to be displayed, the primitive having an area, the method including:

locating pixels that fall within the area of said primitive; and

for each pixel located in said area,

generating a set of associated sub-pixels of the pixel, the sub-pixels comprised of color components;

creating an adaptively filtered set of sub-pixels for the pixel by adaptively filtering said set of associated sub-pixels and a set of neighboring sub-pixels of one or more neighboring pixels adjacent to the pixel, wherein the creating the adaptively filtered set of sub-pixels includes computing each of the sub-pixels of the adaptively filtered set based at least in part on determining distances between at least some of the sub-pixels of the set of associated sub-pixels and sub-pixels of the set of neighboring sub-pixels, the distances being based on the color components of the at least some of the sub-pixels of the set of associated sub-pixels and sub-pixels of the set of neighboring sub-pixels; and

computing a final pixel for display by subjecting said adaptively filtered set of sub-pixels to further filtering.

45. The computer-readable medium of claim 44 , wherein the method further includes:

compressing the sub-pixels in said set of associated sub-pixels; and

storing said associated sub-pixels in a frame buffer in a compressed format resulting from said compressing.

46. The computer-readable medium of claim 45 , wherein the method further includes:

reading said associated sub-pixels from said frame buffer; and at least one of the steps of:

further processing information related to said associated sub-pixels in a graphic pipeline, and

decompressing said associated sub-pixels in order to generate corresponding uncompressed sub-pixel information.

47. The computer-readable medium of claim 44 , wherein said adaptively filtering step includes, for a first sub-pixel of said adaptively filtered set, the operations of computing said first sub-pixel by:

If (distance(A,D)<=distance(C,B)) and (distance(A,D)<=distance(A,C))

Then AA=median(E,N,C)

Else

If (distance(C,B)<=distance(A,D)) and (distance(C,B)<=distance(A,C))

Then AA=median(E,N,A)

Else

If (([distance(A,C)+distance(B,D)]/2<=distance(A,D)) and

([distance(A,C)+distance(B,D)]/2<=distance(C,B))) or

(([distance(A,B)+distance(C,D)]/2<=distance(A,D)) and ([distance(A,B)+distance(C,D)]/2 distance(C,B)))

Then AA=(A+C+N+E)/4

where AA is said first sub-pixel, A, B, C, and D are the sub-pixels of said set of associated sub-pixels, and E and N are sub-pixels in said set of neighboring sub-pixels, while median and distance are median and distance operators.

48. A computing system, comprising:

one or more processors;

a frame buffer memory;

a rasterizer module configured to, when executed by at least one of the processors, locate pixels that fall within an area of a primitive of an image to be displayed; and for each pixel located in the area, generate a set of associated sub-pixels of the pixel, the sub-pixels comprised of color components and store the associated sub-pixels in the frame buffer; and

a graphic pipeline module configured to, when executed by at least one of the processors, for each of the pixel to be displayed: read the set of associated sub-pixels corresponding to the pixel from the frame buffer; create an adaptively filtered set of sub-pixels for the pixel by adaptively filtering the set of associated sub-pixels and a set of neighboring sub-pixels from one or more neighboring pixels adjacent to the pixel, the set of neighboring sub-pixels comprising sub-pixels generated for the one or more neighboring pixels; and compute a final pixel for display by subjecting the adaptively filtered set of sub-pixels to further filtering, wherein the graphic pipeline is further configured to, as part of creating the adaptively filtered set of sub-pixels, compute each of the sub-pixels of the adaptively filtered set based at least in part on determining distances between at least some of the sub-pixels of the set of associated sub-pixels and at least some sub-pixels of the set of neighboring sub-pixels, the distances being based on the color components of the at least some of the sub-pixels of the set of associated sub-pixels and the at least some sub-pixels of the set of neighboring sub-pixels.

49. A method, comprising:

under control of a computing device, rendering a primitive of an image to be displayed, the primitive having an area and the rendering including:

locating pixels that fall within the area of said primitive; and

for each pixel located in said area,

generating a set of associated sub-pixels of the pixel, the sub-pixels comprised of color components;

creating an adaptively filtered set of sub-pixels for the pixel by adaptively filtering said set of associated sub-pixels and a set of neighboring sub-pixels of one or more neighboring pixels adjacent to the pixel;

computing a final pixel for display by subjecting said adaptively filtered set of sub-pixels to further filtering, the computing of the final pixel for display includes determining a maximum or minimum sub-pixel pair by finding either a maximum or a minimum distance between (A, D), (C, B), (AA, DD), (BB, CC), where (A, B, C, D) are the sub-pixels of said set of associated sub-pixels and said set of neighboring sub-pixels while (AA, BB, CC, DD) are the sub-pixels of said adaptively filtered set of sub-pixels, and computing the final pixel as an average of the sub-pixels of the maximum or minimum sub-pixel pair; and

displaying the final pixel on a display of the computing device.

50. The method of claim 49 , wherein the generating the set of associated sub-pixels further includes compressing the sub-pixels in said set of associated sub-pixels, and wherein the creating the adaptively filtered set of sub-pixels further includes decompressing at least one set of associated sub-pixels.

51. The method of claim 49 further comprising, between said steps of generating a set of associated sub-pixels and said step of adaptively filtering, the step of storing said associated sub-pixels in a frame buffer.

52. The method of claim 51 , further comprising compressing the sub-pixels in said set of associated sub-pixels, wherein the storing step includes storing said associated sub-pixels in the frame buffer in a compressed format resulting from said compressing.

53. The method of claim 52 , further comprising:

reading said associated sub-pixels from said frame buffer; and at least one of the steps of:

further processing information related to said associated sub-pixels in a graphic pipeline, and

decompressing said associated sub-pixels in order to generate corresponding uncompressed sub-pixel information.

54. A system for rendering a primitive of an image to be displayed, the primitive having an area, the system comprising:

locating means for locating pixels that fall within the area of said primitive;

generating means for generating for each said pixel located in said area a set of associated sub-pixels of the pixel, the sub-pixels comprised of color components;

adaptive filtering means for creating for each of the pixels a respective adaptively filtered set of sub-pixels for the pixel by adaptively filtering said set of associated sub-pixels and a set of neighboring sub-pixels of one or more neighboring pixels adjacent to the pixel;

computing means for computing for each of the pixels a final pixel for display by subjecting said respective adaptively filtered set of sub-pixels of the pixel to further filtering; and

a frame buffer memory for storing for each of the pixels said respective set of associated sub-pixels,

wherein the computing means includes:

means for obtaining multiplication results by multiplying each of said the sub-pixels of said set of associated sub-pixels, said set of neighboring sub-pixels, and each sub-pixel of said respective adaptively filtered set of sub-pixels, by a respective coefficient;

obtaining a first sum by adding together the multiplication results;

obtaining a second sum by adding together the coefficients; and

dividing the first sum by the second sum.

55. The system of claim 54 , further comprising a processing module configured for producing compressed sub-pixels by compressing the sub-pixels in said set of associated sub-pixels, wherein said compressed sub-pixels are stored in said frame buffer memory.

56. The system of claim 54 , further comprising:

a read module configured for reading said associated sub-pixels from said frame buffer memory; and at least one of

a graphic pipeline configured for further processing information related to said associated sub-pixels, and

a decoder configured for decompressing said associated sub-pixels in order to generate corresponding uncompressed sub-pixel information.