Abstract: A method stereoscopically reproduces still or moving pictures on an individual screen. Images are arranged next to one another on a screen by software for a left and a right stereoscopic presentation. So that for the two eyes of the observer the correct image is visible in each case, an optical accessory is attached to the screen. This features at a distance between the eyes of the observer lenses which sharply display to the observer the two subimages shown on the screen. Depending on the size of the screen the optical path of the two subimages may be diverted by optical components.

Abstract: A method is described for transmitting a byte stream (1) from a transmitter unit to a receiver unit in a network protocol, with the following steps: Removal of at least one data area (4a,4b) of the byte stream (1) from the byte stream, Transmission to the receiving unit of information relating to which data area (4a,4b) or which data areas (4a,4b) has or have been removed from the byte stream (1) and/or relating to the way in which the shortened byte stream is to be further processed, Transmission of the byte stream (5) shortened by at least one data area (4a,4b) to the receiver unit, which, from the information and the shortened byte stream, determines and further processes the at least one data area removed by the transmitter unit.

Abstract: Disclosed are methods and devices for compressing and decompressing video data streams, according to which the statistical relationship between image symbols and the context assigned thereto is used for compression. Particularly disclosed is a context-sensitive encoding unit in which the image symbols filed in an image storage are assigned to different encoding branches via a context switch, where they are encoded and compressed by a Golomb encoder and a run length encoder.

Abstract: The invention relates to an encoding method, which uses statistical characteristics of all types of network protocols without requiring specific knowledge of the definitions of individual protocol fields. Network protocols in general contain long contiguous sections, which remain unchanged. Said sections are therefore predicted from the preceding header and do not need to be transmitted. The position of the modified and unmodified fields is also predicted, so that in most cases, transmission of the position co-ordinates is not necessary. Said principle, together with a corresponding differential encoding, achieves a high data compression, as only the modified data and a small amount of overhead need to be transmitted.

Abstract: The invention relates to a video signal decoder for generating a video image that consists of cumulative image data blocks, of a differential image comprising differential image data blocks and motion vectors, and of a down-sampling device (28) that down-samples the cumulative image data blocks for producing reduced reference image data blocks. The video signal decoder further comprises a reference image data memory (30) for intermediate storage of the reduced reference data blocks, an up-sampling devices that up-samples the reduced reference image data blocks that are read out from the reference image data memory and that are motion-compensated by means of the motion vectors, thereby producing reference image data blocks. A reconstruction filter (36) filters the reference image data blocks produced by up-sampling and produces predecessor image data blocks, said reference image data blocks being filtered by interpolation within the data block limits.

Abstract: To allow an individual picture (1) which comprises picture values (3) grouped together into blocks (2) to be quickly compressed with good picture quality, the picture values (3) are quantized block by block by a quantization factor, with the data volume represented by quantized picture values (3) dropping as the quantization factor rises. After the picture values (3) in a block (2) have been quantized, an actual data volume is determined which corresponds to that data volume represented by the last block (2) quantized which is related to the number of picture values (3) in the last block (2) quantized, and a target data volume is determined which corresponds to that volume of storage space which is available for the picture values (3) still to be quantized and which is related to the number of picture values (3) still to be quantized. If the actual data volume is larger than the target data volume the quantization factor is raised, and vice versa.

Abstract: According to the invention, at least one image region is selected from each temporally preceding image that is considered, and the associated image information is stored with an item of allocation information. At least one mixed image is formed from the item of image information while taking the respective item of allocation information into account. The mixed image is used within the scope of a motion estimation, of a motion compensation or of an error masking for an image.

Abstract: In order to realize effective picture compression without significantly impairing the resolution, it is proposed that the picture to be compressed be subdivided into a plurality of picture areas, for example into picture blocks each having 16×16 pixels, and the picture areas be subdivided into a plurality of layers, in particular into three layers, which correspond to different sampling patterns. The pixels (13-15) of a layer are in each case predicted from adjacent pixels of the other layers, in particular of the already previously processed and coded layers, the prediction area being coded. The invention is suitable in particular for use in video coders or video decoders with motion-compensated prediction, in order to compress the reference picture to be stored in a reference picture memory (5).

Abstract: Individual data packets are transmitted together with information about the end of a respective data packet, without padding, and then virtual padding is effected for generating redundant packets. At the receiver, the data packets are obtained using the information about the respective end of packet if no packet was lost, and are only expanded by padding if a packet has been lost and can be reconstructed by one or more redundant packets.

Abstract: The present invention relates to a method of filtering edges of a picture block with an edge-smoothing filter. The selection of the edge-smoothing filter depends on the size of the movement vector associated with each picture block BV to clarify the picture image and increase image quality. Alternatively, the selection of the edge-smoothing filter depends on the picture quality or both picture quality and the movement vector.

Abstract: An A. Lempel and J. Ziv code is frequently used for coding a sequence of elements of, for example, coefficients of a discrete cosine transform for image values of picture elements of a reproduced image. An extremely fast code generation process is disclosed for this. In coding steps, code words are marked at coding sites in accordance with the partial sequences found. The coding steps are linked by coding step pointers. The sequence of elements from a primary sequence can be converted into elements from a reduced set of elements using escape sequences.

Abstract: A 16.times.16 picture block of an HDTV television picture is transformed with a discrete cosine transformation as a 16.times.16 frame block or is separately transformed in respectively two 16.times.8 field blocks according to a decision method. Picture value differences between pairs of field picture elements of two picture lines of the same field are absolutely summed up to form a field sum. Likewise, picture value differences between pairs of frame picture elements of two picture lines of the frame are absolutely summed up to form a frame sum. The frame sum multiplied by a frame weighting factor is subtracted from the field sum to form what may be a positive decision result. Given a positive decision result, the frame is transformed; otherwise, the two fields are separately transformed.