Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

High quality image processing

a high-quality, image-encoding technology, applied in the field of image processing, can solve the problems of block artifacts, block size restriction, block artifacts, etc., and achieve the effect of efficient image encoding and image decoding, and efficient image processing

Inactive Publication Date: 2009-04-09
TELEFON AB LM ERICSSON (PUBL)
View PDF0 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

The present invention provides a high-quality image processing and compression scheme that can be used in existing compression methods. The invention involves decomposing an image into multiple blocks, each containing multiple image elements, and using a color modifying code to modify the color representations of these elements along an extension vector. This results in a surface in color space that is defined by the modified color representations and the direction vector. The invention also provides a method for approximating the colors of image elements using multiple color points on a surface in color space. The use of multiple color modifiers and a direction vector allows for a more accurate representation of the colors of the image. The invention can be used in both lossy and lossless compression methods.

Problems solved by technology

However, a memory lookup in the palette is required, and the palette is restricted in size.
One disadvantage of S3TC is that only four colors can be used per block.
The major problem in terms of quality with this method is that the chrominance is heavily quantized, which may introduce block artifacts.
Despite the relative high quality obtainable by PACKMAN, iPACKMAN and S3TC, this quality is still not enough for some applications.
However, one of the problems of running the user interface on the 3D hardware is the limited memory bandwidth.
Furthermore, it is expected that the quality of today's texture compression schemes may not be good enough for compression of user interface constants and textures.
For example, icons and other small graphical symbols are usually very colorful and of high contrast, which does not work well with most compression schemes.
The are also applications, such as games on personal computers and game consoles, where compression of some textures with the most widely used scheme, S3TC, does not give enough quality.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • High quality image processing
  • High quality image processing
  • High quality image processing

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0190]An example of a decompression procedure for the image block illustrated in FIG. 9 is given herein. Assume that the image block has the following binary compressed representation:

10110 010110 01101 01110 100011 00001 10 10 00 01 11 00 00 11 10 10 01 00 11 00 11 01bin

00010010 01011101 110 001 111 001 011 101 000 111 101 110 100 001 011 100 001 101bin

[0191]The color components of the two color components are first expanded from RGB565 into RGB888, by replicating the three or two most significant bits to the components. For example, 10110bin becomes 1011010bin and 010110bin becomes 01011001bin. This means that the two basic colors CV0, CV1 are obtained from the color codeword:

101100bin 10110101bin=181

010110bin 01011001bin=89

01101bin 01101011bin=107

CV0=(181, 89, 107)

[0192]01110bin 01110011bin=115

100011bin 10001110bin=142

00001bin 00001000bin=4

CV1=(115, 142, 4)

[0193]The two first color representations are then (181, 89, 107) and (115, 142, 4). The other two representations CV2 an...

example 2

[0196]An example of a decompression procedure for the image block illustrated in FIG. 16 is given herein. Assume that the image block has the following binary compressed representation:

1011 0010 0000 0000 0111 0100 011 000 10 10 00 01 11 00 00 11 10 10 01 00 11 00 11 01 1 0bin

00010010 01011101 110 001 111 001 011 101 000 111 101 110 100 001 011 100 001 101bin

[0197]The eight possible green component values are calculated based on the minimum and maximum green component of the second codeword in way similar to determining the different color modifiers in Example 1 above. This will result in G0=18, G1=93, G2=28, G3=38, G4=49, G5=60, G6=71 and G7=81. The first image element in the block has color index 110bin, which implies that green component G6 should be used. Since the first image element belongs to the first 2×4 (vertical, due to flipbit=1bin) sub-block, the red R0 and blue B0 components of the first color codeword having the following bit patterns should be used 1011bin and 0111...

example 3

[0199]An example of a decompression procedure for the image block illustrated in FIG. 17 is given herein. Assume that the image block has the following binary compressed representation:

10110 010 00000 000 01110 100 011 000 10 10 00 01 11 00 00 11 10 10 01 00 11 00 11 01 0 1bin

01000010 01011101 110 001 111 001 011 101 000 111 101 110 100 001 011 100 001 101bin

[0200]In this example, the flipbit=0bin, implying that the image block consists of two 4×2 sub-blocks and the diffbit=1bin, representing the differential mode of iPACKMAN.

[0201]Firstly a starting green component is determined based on the first portion of the second color codeword, i.e. 01000010bin=66. The second part represents a table index to a table comprising multiple sets of green component modifiers. Assume that the table index of 01011101bin represents the green modifier set of [−42, −36, −27, −15, 15, 27, 36, 42]. The last image element in the block has color index 101bin, which represents a green modifier of −27. The...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

In a high quality image-encoding scheme an input image is decomposed into several image blocks comprising multiple image elements. The image blocks are encoded into encoded block representations. Such a block representation comprises two color codewords, a color modifying codeword and optionally a sequence of color indices and color modifier indices. The color codewords define multiple discrete color representations along a line in color space. The color modifying codeword represents a set of multiple color modifiers for modifying the multiple color representations along at least one extension vector to obtain, for each color representation, a set of multiple color points. These color points of the multiple sets are located on a surface defined by the multiple color representations and the at least one extension vector. The colors of the image elements in the block are then approximated by these color points on the surface.

Description

TECHNICAL FIELD[0001]The present invention generally refers to image processing, and in particular to methods and systems for encoding and decoding images at a high image quality.BACKGROUND[0002]Presentation and rendering of images and graphics on data processing systems and user terminals, such as computers, and in particular on mobile terminals have increased tremendously the last years. For example, three-dimensional (3D) graphics and images have a number of appealing applications on such terminals, including games, 3D maps and messaging, screen savers and man-machine interfaces.[0003]A 3D graphics rendering process typically comprises three sub-stages. Briefly, a first stage, the application stage, creates several triangles. The corners of these triangles are transformed, projected and lit in a second stage, the geometry stage. In a third stage, the rasterization stage, images, often denoted textures, can be “glued” onto the triangles, increasing the realism of the rendered imag...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(United States)
IPC IPC(8): G06K9/36
CPCG06T9/005H04N19/176H04N19/186H04N19/593H04N19/70
Inventor STROM, JACOB
Owner TELEFON AB LM ERICSSON (PUBL)
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products