Abstract: The motion of image content such as a point of interest in a video frames sequence is tracked using sub-pixel resolution motion estimation in forward and/or backward direction. The motion of image content or a point of interest between a reference frame and a following frame is estimated, starting from an integer pixel position in the reference frame. If the motion vector has a position between integer pixel positions, the coordinates of that motion vector are replaced by an adjacent integer pixel position in the following or previous frame, and the error value between these coordinates and the replacement coordinates is stored. Thereafter the following or previous frame is defined as the current frame, the motion of the object is estimated between the replacement coordinates in the current frame and a following frame, and the stored error value is added in opposite direction to the corresponding motion vector, so as to get a corresponding precise motion vector.

Abstract: There is provided a method for estimating motion between successive frames. A first motion vector is estimated using a measurement window and search range in a first level of hierarchy, defining a second measurement window and search range for a second level of hierarchy, the second measurement window and search range being smaller than the first measurement window and search range, providing an energy dependent value for the second measurement window, comparing the energy dependent value with a threshold value and determining as resultant motion vector: a) either the sum of the first motion vector and a second motion vector estimated within the second measurement window, if the energy dependent value exceeds the threshold value or b) the first motion vector if the energy dependent value does not exceed the threshold value.

Abstract: In hierarchical motion estimation, in each motion estimation hierarchy level, a pixel block matcher for comparing correspondingly sampled pixel values of a current image and a delayed previous image is used in order to compute a motion vector for every pixel. By evaluating displaced frame differences in the measurement window, a segmentation of the measurement window into different moving object regions is performed. The corresponding segmentation information is stored, and the stored segmentation information is used as an initial segmentation mask for motion estimation in the following finer level of the motion estimation hierarchy. In the following finer level of the motion estimation hierarchy an updated segmentation information is determined. This processing continues until the finest level of said motion estimation hierarchy is reached. The resulting segmentation information values of successive search window positions can be combined.

Abstract: In hierarchical motion estimation motion vectors are refined in successive levels of increasing search window pixel density and/or decreasing search window size. Within each hierarchical level, after finding an optimum vector at at least one pixel, based on the optimum vector, the absolute displaced frame difference or displaced frame difference for each pixel of the search window is determined. Within the search window, two or more groups of these pixels are determined, wherein each of these pixel groups is characterized by a different range of absolute displaced frame difference values or displaced frame difference values for the pixels. A segmentation of the search window into different moving object regions is carried out by forming pixel areas according to the groups, which areas represent a segmentation mask for the search window. For at least one of the segmentation areas a corresponding motion vector is estimated.

Abstract: The motion of image content such as a point of interest in a video frames sequence is tracked using sub-pixel resolution motion estimation in forward and/or backward direction. The motion of image content or a point of interest between a reference frame and a following frame is estimated, starting from an integer pixel position in the reference frame. If the motion vector has a position between integer pixel positions, the coordinates of that motion vector are replaced by an adjacent integer pixel position in the following or previous frame, and the error value between these coordinates and the replacement coordinates is stored. Thereafter the following or previous frame is defined as the current frame, the motion of the object is estimated between the replacement coordinates in the current frame and a following frame, and the stored error value is added in opposite direction to the corresponding motion vector, so as to get a corresponding precise motion vector.

Abstract: In accordance with an exemplary embodiment of the present invention, a method for measuring a quality parameter of an optical storage system comprising a non-diffraction-limited optical storage medium and a readout device, the method comprising the process of deriving an impulse response of the optical storage system, and the process of analyzing the impulse response to determine at least one of a width of the impulse response and a skewness of the impulse response as the quality parameter.

Abstract: A method for superimposing noise on an image of a sequence of images and an apparatus configured to perform this method are described. After receiving a user input to select one of a plurality of noise profiles via an input the selected noise profile is retrieved from a data source via a data interface. Parameters of the retrieved noise profile are then displayed to the user via an output. Responsive to a user input to modify one or more of the parameters of the retrieved noise profile, a processor generates a modified noise profile. A noise sample generator then generates a noise sample in accordance with the modified noise profile, which is superimposed on the image by an image processor.

Abstract: A method for generating a noise profile of noise in an image sequence and an apparatus configured to generate such a noise profile are described. An image sequence is retrieved via an input. An image analyzer then determines image regions in the image sequence suitable for measuring noise properties. A noise analyzer measures noise properties in the determined image regions. The measured noise properties are provided to a profile generator, which determines a noise profile from the measured noise properties.

Abstract: A distributed storage system able to support real-time recording of streaming data shall be provided. Therefore, on the basis of Material Exchange Format (MXF) formatted files a data stream is packed into at least a first MXF formatted file and a second formatted MXF file. First connection data are inserted into the first MXF formatted file, wherein this first connection data points to the second MXF formatted file. Furthermore, second connection data are inserted into the second MXF formatted file, wherein the second connection data points to the first MXF formatted file. These connection data inserted as metadata into the MXF formatted files enable both seamless real-time stream recording and stream-able data playback.

Abstract: The optical storage medium comprises a substrate layer, a data layer having a pit/land data structure with data arranged in tracks on the substrate layer and a nonlinear layer with a super-resolution material, wherein the data structure comprises diffractive pits and lands having a size above an optical resolution limit of a pickup for reading of the data and super-resolution pits and lands having a size below the optical resolution limit, said pits and lands having a defined length with regard to a channel bit length. A diffractive land preceding a super-resolution pit is changed by a first length depending on the laser power of the pickup, and/or a diffractive pit preceding a super-resolution land is changed by the first length depending on the laser power of the pickup, to compensate a phase shift of the super-resolution pit, respectively super-resolution land.

Abstract: In accordance with an exemplary embodiment of the present invention, a method for measuring a quality parameter of an optical storage system comprising a non-diffraction-limited optical storage medium and a readout device, the method comprising the process of deriving an impulse response of the optical storage system, and the process of analyzing the impulse response to determine at least one of a width of the impulse response and a skewness of the impulse response as the quality parameter.

Abstract: The optical storage medium comprises a substrate layer, a data layer having a pit/land data structure with data arranged in tracks on the substrate layer and a nonlinear layer with a super-resolution material, wherein the data structure comprises diffractive pits and lands having a size above an optical resolution limit of a pickup for reading of the data and super-resolution pits and lands having a size below the optical resolution limit, said pits and lands having a defined length with regard to a channel bit length. A diffractive land preceding a super-resolution pit is changed by a first length depending on the laser power of the pickup, and/or a diffractive pit preceding a super-resolution land is changed by the first length depending on the laser power of the pickup, to compensate a phase shift of the super-resolution pit, respectively super-resolution land.

Abstract: Search in stocks of data, particularly on optical media, is intended to be optimized in terms of the time required for the search. It is therefore proposed that the search be carried out in two steps. In a first search step, the entire database is scanned on the disk storage medium. In a second search step, executed in parallel, intermediate results from the first search step are searched. This allows the number of skips on a disk to be reduced, which results in increases of speed, particularly in the case of optical drives.

Abstract: In current Distributed Storage Systems, applications may determine the device on which data shall be stored. The invention provides a method for automatically selecting an individual storage device within a DSS. A method for automatically classifying a node in a network comprises determining data classes, automatically classifying data of said data classes stored on a node, determining the amount of stored data per data class, calculating data dominance values for each of the data classes, receiving a request that indicates a data type according to one of said data classes, and providing said dominance value according to the requested data class. Further, a method for automatically organizing nodes in a network comprises receiving a request for storing data of a particular data type, transmitting the request to storage nodes, receiving from the storage nodes respective dominance values, and selecting the node with the highest dominance value for storing the data.

Abstract: A logical quality-of-service management method for peer-to-peer networks uses a special group service for QoS management within peer-groups. This group service determines and assigns a budget per time unit for each peer. Such time unit may be in the range of milliseconds or few seconds. It may also determine a group budget for the peer-group. While a peer uses bandwidth, i.e. while it sends or receives data, its budget is decreased. When a peer has exhausted its budget, it has to lower its priority for transferring or receiving data. Each peer is responsible for keeping its own budget. If a peer does not keep the conditions, other peers may have the right to deny the data transfer from that peer. The QoS service function is advertised in peer-group advertisement messages.

Abstract: The handling of metadata being provided in different formats shall be simplified. Therefore, it is suggested to provide metadata in a first metadata structure having a first format and providing a second metadata structure having a first format and providing a second metadata structure having a second format, wherein link data are deposited in the second metadata structure. The link data point to metadata in the first metadata structure. Thus, it is possible to trealize synchronous and automatic editing of metadata and its mirror metadata.

Abstract: The use of disk-assisted, dynamic databases is to be optimized. To this end, provision is made for new data intended to update an old stock of data to have a second index, relating to the new data, generated for them, and for said second index to be stored on the disk storage medium as a supplement to the first index relating to the old stock of data. This allows the number of write access operations to the disk storage medium to be reduced. This is particularly advantageous for optical media, whose useful life can be increased as a result.

Abstract: When recording packetized real-time streaming data, e.g. multimedia data, it is in general not possible to know in advance the size of the data stream, and thus the required storage area. Therefore the storage device may be full before the data stream is completely stored. The disclosed method for storing and retrieving the remaining part of the data stream on another storage device uses metadata tags (10,11) and data buffers (IB1,IB2) to split a data stream seamlessly into chunks while recording it, and distribute the chunks in real-time to different connected storage devices (D1,D2), so that the chunks can be seamlessly concatenated again in real-time for replaying the stream. The metadata tags (10,11) contain identifiers for the successive storage node (N2) and/or the preceding storage node (N1) and for the last stored application packet.

Abstract: Search in stocks of data, particularly on optical media, is intended to be optimized in terms of the time required for the search. It is therefore proposed that the search be carried out in two steps. In a first search step, the entire database is scanned on the disk storage medium. In a second search step, executed in parallel, intermediate results from the first search step are searched. This allows the number of skips on a disk to be reduced, which results in increases of speed, particularly in the case of optical drives.

Abstract: The generation of metadata shall be simplified. Therefore, a method is presented in which a metadata-template is filled with selected essence and MD-links obtained from a list of links to essence and/or a list of current metadata. Furthermore, it is possible to obtain the MD-links from further metadata or essences directly or indirectly linked with the selected essence.