Telefonaktiebolaget Lm Ericsson (publ)

Per Thorell

Andreas Rossholm

Torbj&ouml;rn Einarsson

Filippo Passaggio

Harald Gustafsson

Sanbao Xu

Göran Roth

Jan-Ove Johansson

The invention relates to a method for estimation of interframe motion fields operating on a stream of video frames, and more particularly for accelerating video output in multiframe super-resolution thus improving the efficiency of the multiframe integration. Relative motion field estimation is used between neighboring or close images instead of with respect to a reference image, for at least some of the frames within an integration window (TOI). The integration window is slid along the time axis each time by one (or two or a few) frames so that the current integration window preferably covers the majority of the frames in the previous integration window. Using relative motion estimation and then (tracking and) summing up the related motion fields enables, in each recursion, the absolute motion fields in a new integration window to be obtained without re-computing all the motion fields of earlier frames in the new integration window.

Method and apparatus for estimation of interframe motion fields

A method for encoding a video sequence of video frames. Each video frame includes a plurality of macro blocks. One video frame of the video sequence is encoded based on a first quantization parameter value for generating a first bit stream of encoded macro blocks (). Transmission of a subset of the encoded macro blocks from the first bit stream is initiated (). It is determined if the first bit stream exceeds a bit budget. If the first bit stream is determined to exceed the bit budget, a second quantization parameter value, which is larger than the first quantization parameter value, is generated. Otherwise, the second quantization parameter value, which is smaller than the first quantization parameter value, is generated. At least a part of the video frame is encoded based on the second quantization parameter value for generating a second bit stream of encoded macro blocks (). The first bit stream and the second bit stream are then merged (). An apparatus for performing the method is also disclosed.

Method and apparatus for video encoding

Digital image and/or video data is processed wherein a frame of the data comprises a plurality of rows and columns of pixels with data for each pixel including a luminance value and a chrominance value. Chrominance values and luminance values may be received for a current pixel and at least one adjacent pixel, and the chrominance values of the current pixel and the at least one adjacent pixel may be compared. The luminance value of the current pixel may be filtered wherein a strength of filtering the luminance value is based on the comparison of the chrominance values of the current and at least one adjacent pixels.

Methods of processing digital image and/or video data including luminance filtering based on chrominance data and related systems and computer program products

A method and apparatus for processing a digital image in a Mobile Equipment operating in a telecommunications network. The digital image includes a frame of data having a plurality of pixels with data. The data of each pixel has a luminance value and a chrominance value. The method begins by obtaining chrominance value for a specified pixel of the digital image. Responsive to the obtained chrominance value, a strength to filter the specified pixel of digital image is determined. The specified pixel is then selectively and adaptively filtered at the determined strength of the filter. Preferably, chrominance values and luminance values for the specified pixel and an adjacent pixel is determined. A threshold for a variation in the range between a highest chrominance level and a lowest chrominance level of the specified pixel and the adjacent pixel is then set. The variation for the specified pixel is determined, and responsive to the value of the variation, low-pass filtering of the specified pixel is applied.

Apparatus and method for increasing coding efficiency with an adaptive pre-filter

A central software development system comprises a code processor and a code authenticator. The code processor converts modified free source code received by the system to program code such as executable code or bytecode. The code authenticator selectively signs the program code using an encryption key associated with one or more devices for which the program code is designed, e.g., a computer or mobile phone. The central system may also include a code scanner. The code scanner verifies the modified free source code, e.g., by scanning the modified free source code or intermediate code generated by the code processor for impermissible code patterns. The code authenticator signs the program code if the modified free source code is verified. The impermissible code patterns may correspond to at least one of proprietary, malicious or virulent code sequences.

Maintaining code integrity in a central software development system

A method of determining whether to generate a video refresh request includes receiving a packet and performing at least one of determining whether the received packet contains an error and determining whether a packet prior to the received packet was lost. Responsive to a determination that the received packet contains an error, an error index is increased. Responsive to a determination that a packet prior to the received packet has been lost, the error index is increased. Responsive to a determination that the received packet does not contain an error and that a packet prior to the received packet has not been lost, the error index is decreased.

Method of and system for video fast update

In a method and a device for coding binary matrices, in particular sparse binary matrices, a matrix is gradually partitioned into sub-matrices During the gradual partitioning the number of binary ones are counted for each resulting sub-matrix. If a resulting sub-matrix does not consist of mixed symbols no further partitioning of that sub-matrix is required. The counted number of binary ones for each sub-matrix is then coded and transmitted. The method provides an efficient coding particularly for sparse binary matrices such as bi-level images or bit maps.

Lossless image compression with tree coding

In a method and a device for transforming a stream of digital numbers, the correlation between successive numbers is utilized in order to obtain a new stream having a very low correlation between the numbers, whereby the sequence of numbers can be coded much more efficiently from a compression point of view. The numbers are for this purpose coded with the difference between a predicted number (s&prime;(i)) and the actual number (s(i)) taking into account that the sequence does not need to be possible to decode in reverse order. The non-reversible codes can also be applied in lossy data compression schemes. Such schemes can change in accordance with the currently available bandwidth in order to obtain a graceful degradation and optimal bandwidth usage when the compressed data stream is transmitted over a channel having a time varying bandwidth. A general method and device for reversible coding are also provided.

Growing community of inventors

Lund, Sweden

Per Thorell