Translation of "Run length encoding" in German

With run length encoding consecutive equivalent image symbols are counted and encoded by the occurrence number.

When this is the case in more than five DPCM values, then the run-length encoding of line 5.5 of FIG.

The two methods Run Length Encoding and LZSS are generally known in the literature.

For example, many popular modern compression schemes, such as LZW or run-length encoding, make use of the similarity of adjacent data to compress.

At least in one region of the memory 5, run length encoding of graphical data has been provided in which the first code of each line of the encoding indicates the number of pixels to be printed per column, and control codes are available in the hexadecimal display, for instance for the beginning of a window, the end of a column, and the end of an image.

To maximize the compression benefits of the lexicographical order with respect to run-length encoding, it is best to use low-cardinality columns as the first sort keys.

The TGA image size is usually large, since the compression is very weak (Run Length Encoding - RLE).

A further parameter, which can be used for identification of pattern 5, is the run length encoding.

The run length encoding is provided to describe the beginning section of a sound onset (or also of another sound event or pattern).

If a transmission error occurs, because of the Huffman and run length encoding the image is normally completely destroyed, the remaining bits are useless and cannot be correctly assigned owing to the lack of interpretation.

The overall efficiency is poor (low compression), however, owing to a lack of redundancy encoding (Huffman and run length encoding).

The method according to claim 1, wherein the pixel values of the pixel groups are further compressed by run length encoding or other compression methods.

The method of claim 1, wherein the pixel values are further compressed by run length encoding or other compression methods.

In the last step, the values for T(i), with depletion-laden compression processes such as Huffmann encoding, arithmetical coding and run length encoding, can be further compressed.

Since after transformation most spectral coefficients are zero, the spectral coefficients are grouped together during subsequent execution of the method by run length encoding and subsequently encoded with the aid of a code table with variable-length code words. SUMMARY OF THE INVENTION

In a preferred embodiment binary symbols are distributed on the encoding branches and subsequently subjected to run length encoding, in which the number of consecutive identical symbols is counted and encoded by a number assigned to the symbol.

This embodiment of the method exploits the situation whereby in a specific context a large number of identical symbols occur which can be effectively encoded by run length encoding.

The fact that the image symbols are sorted into the encoding branches depending on the relevant context, so that groups of image symbols are present in the encoding branches, each of which features a large number of identical image symbols creates the condition for effective run length encoding.

Golumb encoding is especially suitable for encoding run length symbols since run length encoding of the binary image symbols produces an practically geometrical distribution of the run length symbols.

In this case however the run length encoding mentioned is not effective since the full spectral coefficients can assume a large number of values, so that an extremely extensive alphabet is produced.

However, they can be compressed using simple lossless run-length encoding, which can result in greatly reduced file sizes.

The tool can also be used to repair RLE (Run-Length Encoding) compressed PSD file.

The TGA image size is usually big, as the compression is very weak (Run Length Encoding - RLE).

It is also possible to create GIFs using a patent-free run length encoding but this doesn't achieve the compression that one normally expects in a GIF.