Abstract: The embodiments relate to an encoder for encoding a bitstream representing a sequence of pictures of a video stream. The encoder is operative to divide the pictures into blocks of different types, such as coding units CUs, prediction units PUs, and transform units TUs, which are associated with each other. Two sizes are possible for the blocks and the possible combinations are restricted to three cases: 1) all blocks are of large size, 2) the CUs and PUs have large size, while associated TUs have small size, 3) all blocks are of small size. The possible combinations are defined for a part of a picture and compared against each other using a decision tree. In this way an advantageous block size configuration for encoding the bitstream is determined at a reduced computational cost.

Abstract: The present embodiments introduce a new type of random access point in video bitstreams that can be used for random access operations but can be represented in encoded form at a lower bit-cost as compared to IRAP pictures. The random access point is a dependent random access point (DRAP) picture that is encoded and decoded using an IRAP picture and/or a previous, according to a decoding order, DRAP picture as sole reference picture(s) for the DRAP picture. The DRAP picture is encoded as a trailing picture that may be used for reference and constitutes a random access point in a video bitstream.

Abstract: The present embodiments introduce a new type of random access point in video bitstreams that can be used for random access operations but can be represented in encoded form at a lower bit-cost as compared to IRAP pictures. The random access point is a dependent random access point (DRAP) picture that is encoded and decoded using an IRAP picture as sole reference picture for the DRAP picture. The DRAP picture is encoded as a trailing picture that may be used for reference and constitutes a random access point in a video bitstream.

Abstract: A multi-view display controller determines view angles for each view of a multi-view media content for each viewer watching a multi-view display. The view angles determined for a viewer collectively define a viewer cone that displays the views onto the viewer. Media data of the multi-view media content is output together with information of the determined view angles to the multi-view display in order to allow each viewer to have the same experience of displayed media content regardless of where the viewer is positioned relative to the multi-view display.

Abstract: The present embodiments introduce a new type of random access point in video bitstreams that can be used for random access operations but can be represented in encoded form at a lower bit cost as compared to IRAP pictures. The random access point is a dependent random access point (DRAP) picture that is encoded and decoded as a temporal predictive picture using an IRAP picture and/or a previous, according to a decoding order, DRAP picture as sole reference picture(s) for the DRAP picture. The DRAP picture constitutes a random access point in a video bitstream.

Abstract: A tile of pixels is encoded by variable length encoding blocks of pixels constituting different subsets of the tile to form sequences of symbols as encoded representations of the pixel values. A respective size indication is determined for each set of at least block. A size indication is representative of a compression ratio of a combined sequence corresponding to the at least one sequence of symbols obtained for the at least one block of the set. The combined sequences are arranged in a pixel value buffer in a buffer memory. The size indication determined for a given set is also stored in the pixel value buffer in the buffer memory to precede, according to a reading order of the pixel value buffer, the combined sequence of the given set.

Abstract: Embodiments of the present disclosure relate to a method and arrangement for texture compression. An image block is divided into two half-blocks which are either living, also referred to as flipped configuration, or standing, also referred to as the non-flipped configuration. An estimate is generated for whether the flipped or the non-flipped configuration provides the best result for compressing a block. Compression is only executed for the configuration that is estimated to give the best result for the block.

Abstract: According to embodiments of the present invention, the user-to-user delay and the zapping delay are reduced by a network element which is configured to provide at least one segment that is a shorter version of the actual segment and where the shorter version of the actual segment begins with a key frame or contains key frames only. By providing the at least one segment being a shorter version of the actual segment, wherein a key frame is inserted in the beginning of the segment, the delay, when zapping to a new channel, can be reduced, since a key frame will be accessible with a reduced time delay. Further the user-to-user delay is also reduced since the segment to be joined is shorter. Hence, the time difference occurring when a first user joins in the beginning of a segment and when another user joins at the end of the segment is reduced when the segments are shorter.

Abstract: Video encoder and decoder and methods therein for transform skipped encoding and decoding of blocks of pixels. The methods comprises a modified use of an existing context model associated with transform coefficients, for deriving contexts for a bitmask indicating which residual values (i.e. not transform coefficients), in a transform skipped residual block, that are greater than one. The methods are applicable to video coding schemes such as HEVC.

Abstract: A first and a second data value are co-compressed by generating a sequence of symbols having a most significant symbol that is the most significant symbol of a compressed representation of the first data value and a least significant symbol that is the most significant symbol of a compressed representation of the second data value. The compressed representation of the first data value corresponds to at least a portion of the symbols of the sequence of symbols starting from the most significant symbol and extending towards the least significant symbol in a first reading direction. The compressed representation of the second data value also corresponds to at least a portion of the symbols of the sequence of symbols, however, starting from the least significant symbol and extending in an opposite reading direction towards the most significant symbol.

Abstract: A compressing of a texel block consisting of two texel sub-bocks involves determining respective value codewords and table codewords for the two texel sub-blocks. The value codewords represent respective base texel values and the table codewords represent respective modifier sets comprising multiple value modifiers for modifying the base texel value associated with the given texel sub-block. Each texel in the texel block is assigned a texel index associated with one of the value modifiers of the modifier set for the texel sub-block to which the texel belongs or indicates that the base texel value of the other texel sub-block is to be used for the texel.

Abstract: In an image-encoding scheme, an input image is decomposed into several image blocks comprising multiple image elements. The image blocks are encoded into encoded block representations. In this encoding, color weights are assigned to the image elements in the block based on their relative positions in the block. At least two color codeword are determined, at least partly based on the color weights. These codewords are representations of at least two color values. The original colors of the image elements are represented by color representations derivable from combinations of the at least two color values weighted by the assigned color weights.

Abstract: Embodiments relate to compression and decompression of textures. A texel block (10) is compressed by specifying two major directions in the texel block (10) and defining the profiles of how the texel values change along the respective directions. The resulting compressed texel block (30) comprises two value codewords (31, 32), two line codewords (35-38) and a function codeword (33, 34). The two value codewords (31, 32) are employed to calculate two texel values for the texel block (10). The line codewords (35-38) are employed to determine equations of two lines (20, 22) coinciding with the two major directions in the texel block (10). Signed distances are calculated for each texel (12) from the texel position in the texel block (10) and to the two lines (20, 22). The signed distances are input to a function defined by the function codeword (33, 34) to output two values from which weights are calculated and applied to the two texel values in order to get a representation of the texel value of a texel (12).

Abstract: In an image-encoding scheme, an input image is decomposed into several image blocks comprising multiple image elements. The image blocks are encoded into encoded block representations. In this encoding, color weights are assigned to the image elements in the block based on their relative positions in the block. At least two color codeword are determined, at least partly based on the color weights. These codewords are representations of at least two color values. The original colors of the image elements are represented by color representations derivable from combinations of the at least two color values weighted by the assigned color weights.

Abstract: The embodiments of the present invention reduce the compression time in order to achieve a faster texture compression. That is achieved by guessing, i.e. estimating the best table or tables (e.g. from tables 0 to 7) representing luminance information, and to only execute the compression for the table(s) estimated to provide the best luminance information.

Abstract: A face data acquirer includes an image capture module arranged to capture an image from a video stream of a video conference. A face detection module is arranged to determine a subset of the image, the subset representing a face. An identity acquisition module is arranged to acquire an identity of a video conference participant coupled to the face represented by the subset of the image. A face extraction module is arranged to extract face data from the subset of the image and to determine whether to store the extracted face data for subsequent face recognition. A corresponding end user video conference device, server, method, computer program and computer program product are also provided.

Abstract: Multi-mode decoding and encoding of texture blocks are disclosed wherein in a default decoding and encoding mode all bits of a codeword sequence are available as payload bits for representing texel values of the texels in the texture block. In an auxiliary encoding and decoding mode one less bit of the codeword sequence is available as payload bits. The auxiliary mode is employed as a complement to the default mode and will be used to process those texture blocks, which the default mode handles poorly.

Abstract: A pixel block is compressed by providing a respective color component prediction for each pixel in the block. A difference between color components of two neighboring pixels is calculated and compared to a threshold. If the difference is smaller than the threshold, the prediction is calculated based on a first linear combination of the color components of these two neighboring pixels. However, if the difference exceeds the threshold, a second or third linear combination of the color components of the neighboring pixels is employed in the prediction. A guiding bit associated with the selected linear combination may be used. A prediction error is calculated based on the color component of the pixel and the provided prediction. The compressed block comprises an encoded representation of the prediction error and any guiding bit.

Abstract: A method of retrieving information comprised in a barcode is disclosed. The method comprises detecting that the barcode is present in a first image having a first image quality and capturing a first region, acquiring, when it is detected that the barcode is present, a second image having a second image quality and capturing a second region, wherein the second image quality is higher than the first image quality, and wherein the second region at least partly overlaps the first region, and decoding the barcode based on the second image to retrieve the information. A corresponding program product and a corresponding arrangement are also disclosed along with a communication device comprising the arrangement.

Abstract: A blurred barcode image is processed by providing an image representation thereof comprising grayscale values. The image representation is deconvoluted using a candidate motion kernel to get a deconvoluted representation. A barcode similarity measure is calculated for the deconvoluted representation to indicate how close the distribution of the grayscale values of the deconvoluted representation is to an optimal distribution for a barcode image. The kernel provision, deconvolution and measure calculation are repeated for different candidate kernels and the candidate kernel resulting in a deconvoluted representation that is closest to a barcode image as determined based on the barcode similarity measures is selected. The selected kernel is used for deconvoluting the blurred barcode image to get a deblurred barcode image that can be read and decoded.