Abstract: The synchronization of data segments is particularly necessary for the use of small screens. A method and a device are disclosed for synchronizing content-dependent first data segments of a first data file and content-dependent second data segments of a second data file, the first and second data segments being respectively output in sequence according to their chronological order in such a way that based on a predeterminable assignment rule for the first and second data segments, each second data segment is output together with a corresponding first data segment.

Abstract: For a compressed video stream formed of a sequence of compressed data packets, each compressed packet is assigned to a frame by processing the undecoded data packet. A frame includes packets. A first plurality of frames is assigned to a first sliding window and a second plurality of frames is assigned to a second sliding window. The first and second sliding windows have different frames. A first window indicator is calculated by determining a first indicator representing an average number of packets per frame within the first window, and/or a second indicator representing size information of the data within the first window. A second window indicator is calculated by determining a third indicator representing an average number of packets per frame within the second window, and/or a fourth indicator representing size information of the data within the second window. The first and the second window indicators are compared.

Abstract: Methods and devices transform image data, which are transformed by a compression filter before being compressed and stored in a reference image memory. In an extension, an inverse transformation to that of the compression filter is performed by a decompression filter when image data from the reference memory are read out and decompressed. The methods and devices can be used for image compression methods and image decompression methods that use reference image memories.

Abstract: Multiple cameras are configured for use in video analytics. A single configuration tool is provided. The interrelationships between cameras are included within the configuration. Using a combination of text entry fields, registration of the cameras on a floor or other map, and marking on images from the cameras, an efficient workflow for configuration may be provided.

Abstract: An encoder encodes a video signal formed of video frames, each including image blocks. The encoder includes a processing unit which calculates at least one high resolution reference image block on the basis of previously encoded image blocks by executing a super resolution algorithm to perform a local motion compensation; and a motion compensation unit which calculates on the basis of the calculated high resolution reference image block a temporal predictor which is subtracted from a current image block of the video signal. Together, the encoder and a corresponding decoder improve the signal quality of a video signal significantly.

Abstract: In a method for the video coding of image sequences images in the image sequence are coded in a scaled manner, in such a way that the video data produced contains information which permits the images to be represented in a plurality of differing stages of image resolution, the latter being defined by the number of pixels per image representation. The coding is block-based, in such a way that to describe a displacement of parts of one of the images, said displacement being contained in the image sequence, at least one block structure that describes the displacement is created. Said block structure is configured from one block, which is subdivided into sub-blocks, whereby some of the sub-blocks are further subdivided into successively smaller sub-blocks. A first block structure is temporarily created for at least one first resolution stage and a second block structure is created for a second resolution stage, the first resolution stage having a lower number of pixels than the second resolution stage.

Abstract: A prediction error (eq[x,y]) is added to a predicted frame ({circumflex over (f)}[x,y]) or a predicted block for receiving a decoded frame (gq[x,y]) or a decoded block to be further used in a prediction loop by an encoder or to be sent to the output of a decoder. The reference frame (gq[x,y]) or the reference block includes a useful signal part and a noise signal part. The reference frame (gq[x,y]) or reference block pass through a dedicated noise reducing filter to reduce or eliminate the noise signal part of the reference frame (gq[x,y]) or reference block.

Abstract: In video coding image sequences, images are coded in a scaled manner to obtain video data which represents the image in multiple steps from a defined image resolution or image quality (e.g., according to the data rate), and the resolution is defined by the number of image pixels of each represented image. Coding is block-based, i.e., for a description of an approximate movement of parts of one of the images in the image sequence, at least one block structure is produced describing the movement. The block structure produced includes a block divided into partial blocks which are in turn divided into sub-blocks. A first block structure is produced temporally for at least one first resolution level and a second block structure is produced for a second resolution level. The first resolution level has a lower image pixel number and/or image quality than the second resolution level.

Abstract: Annotation of a sequence of digitized images in multimedia data is aided by a computer analyzing the multimedia data to identify one or more objects and assigning each object to a respective role. The role assignment is determined by processing context information representing a model of the multimedia data.

Abstract: An image block is encoded by an inter-layer prediction into a first encoded image block and also encoded into a second encoded image block based on an encoding mode that excludes inter-layer prediction. The encoded first and second image blocks are decoded into reconstructed first and second image blocks, respectively. The first encoded image block is inserted into the encoded video stream. When encoding image blocks by an encoding mode that references the reconstructed first image block, the reference to the reconstructed second image block is changed. The image block encoded in this way is inserted into the encoded video data stream to achieve both a high compression rate with high image quality and low complexity in transcoding that can be used with different end devices by a scalable encoded video data stream, such as a video-on-demand service.

Abstract: A series of decoded images is generated from a series of original images encoded by a first encoding technique following movement-compensated, predictive encoding, where a starting image of a group of successive original images that are to be encoded is defined by a second encoding technique following movement-compensated, temporally filtered partial band encoding based on a determined encoding property of a decoded image of the group of images that are to be encoded, the decoded image is used for generating an output image having a low resolution level, before the images are encoded. At least one output image is generated on each level of resolution from the successive original images of the group of from at least one decoded image during image encoding. The decoded images are provided only with a reduced quality while the reconstituted images are of great quality.

Abstract: Disclosed is an image encoding method in which a series of decoded images are generated from a series of original images with the aid of a first encoding process. Furthermore, a series of second images are generated from an image group of the series of original images with the aid of an INTER encoding mode of the second encoding process, at least one decoded image being used as a reference image. The reference image represents an original image area is to be encoded. A image decoding method decodes second images generated by the image encoding method.

Abstract: The present invention relates to a method for coding positions of data elements in a data structure. According to the method, position codes are associated with the data elements in a pre-determined sequence, the position codes being selected in such a way that, if the lengths of the position codes are unlimited, many other position codes can be arbitrarily allocated between the positions of two data elements in order to code positions of other data elements. The present invention also relates to a method for coding positions of data elements in a data structure, whereby position codes are associated with the data elements in a pre-determined sequence, the position codes being selected in such a way that other position codes can be allocated between the positions of two adjacent data elements in order to code positions of other data elements, at least one other position code being longer than the longest position codes of the two adjacent data elements.

Abstract: A method for the temporal synchronization of data packets of at least one media data flow with scene data files describing at least one scene and/or the data packets of said data files, in a unidirectional broadcast system. The data packets of the media data flow are each provided with a first time mark relating to a first reference time, and the scene data files and/or the data packets thereof are each provided with a second time mark relating to a second reference time. At least one time mark allocation data flow is transmitted from the transmitter to the receiver, the first time marks of the media data flow and the second time marks of the scene data files and/or the data packets thereof being respectively associated with a third time mark relating to a third reference time.

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML-document corresponds to a tree-like data structure including a plurality of tree nodes, is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; extending an existing schema by utilizing unused schema branch codes in a tree node for extensions with new elements until the unused schema branch codes are all used up, and increasing a bit length of the schema branch code as necessary; and communicating a bit length change to a decoder for correctly decoding the content description in the binary representation.

Abstract: A schema definition, which is known to the encoder and to the decoder or transmitted from the encoder to the decoder, specifies information for calculating code concerning the elements or data types contained in the name subspace and enabling this information to be clearly assigned in this manner to each code in the name subspace. Only a portion of the entire name space including the number of the elements or data types lacking for the code calculation have to be transmitted for the configuration of a code which generally means a significantly smaller volume of data than the volume of data that would be required for the entire name space. In addition, the code tables are smaller than in entirely known name spaces which requires less storage space in the codec and enables a faster encoding and decoding.

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML-document corresponds to a tree-like data structure including a plurality of tree nodes, is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; extending an existing schema by utilizing unused schema branch codes in a tree node for extensions with new elements until the unused schema branch codes are all used up, and increasing a bit length of the schema branch code as necessary; and communicating a bit length change to a decoder for correctly decoding the content description in the binary representation.

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML document corresponds to a tree-like data structure is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema, providing the tree nodes in the binary representation with tree branch codes, providing that the respective tree branch code has a schema branch code and, when there are multiple occurrences of an associated child node based on the definition of the schema, a position code, and re-sorting a complete path such that all the position codes are moved to an end of the respective complete path, thereby enabling simpler filtering of the binary representation.

Abstract: A method is provided for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML document corresponds to a tree-like data structure. The method includes providing that each tree node represents an element of the content description and has a structure defined in a schema; providing the tree nodes in the binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code and, when appropriate, a position code; forming first and second tables for the schema branch codes when each node is being coded, the first table including complex elements containing child elements and the second table including complex elements as well as attributes and simple elements which represent leaves of the tree-like data structure; and forming a complete path by chaining together tree nodes in the binary representation.

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML document corresponds to a tree-like data structure, is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in the binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; and decoding, via a decoder within a telecommunications device, paths with new elements, which does not conform to a previous schema, by communicating to the decoder one of (a) the associated tree structure nodes beforehand, and (b) a completely new schema.