Patent application number | Description | Published |
20090060267 | SALIENCE ESTIMATION FOR OBJECT-BASED VISUAL ATTENTION MODEL - The present invention provides a salience estimation method for object-based visual attention model. The method comprises steps of segmenting the image into a plurality of objects to be estimated, extracting feature maps for each segmented object, calculating the saliences of each segmented object in a set of circles defined around a centre pixel of the object based on the extracted feature maps, and integrating the saliences of each segmented object in all circles in order to achieve an overall salience estimation for each segmented object. The present invention is much more human vision inosculated and of low computing complexity. | 03-05-2009 |
20090175330 | Method and apparatus for adapting a default encoding of a digital video signal during a scene change period - The frame following a scene cut is usually coded as an I picture. In CBR encoding, the encoder will try to keep the bit rate constant, which will often cause serious picture quality degradation at scene changes. In VBR encoding, more bits will be allocated to the first frame of the new scene and the bit rate will increase significantly for a short time. Therefore subsequent frames must be coded in ‘skipped’ mode, which will often cause jerk artifacts. According to the invention, in each frame belonging to a scene change period, areas are determined that have different human attention levels. In the frames (n−1, n−2, n−3) located prior to the first new scene frame, to the areas having a lower attention level less bits are assigned than in the default encoding, and in the frames (n, n+1, n+2) located at and after the scene cut the thus saved bits are additionally assigned to the areas having a higher attention level. | 07-09-2009 |
20090245386 | METHOD AND APPARATUS FOR ENCODING A FLASH PICTURE OCCURRING IN A VIDEO SEQUENCE, AND FOR DECODING CORRESPONDING DATA FOR A FLASH PICTURE - When video sequences are obtained from e.g. news, interviews, conferences and sports matches, flashlight often appears in the video due to photographing. When encoding the video sequence, the intensity changes a lot so that the motion estimation can not find a well-matching block in a previous picture. Accordingly, the video encoder will encode in intra mode and thereby generate much more bits than for the neighbouring non-flash pictures. According to the invention, not the real flash picture is encoded in the video sequence but an artificial non-flash or de-flashed picture, and some indications and parameters are inserted into the bit stream to model the flash effect. The decoder can regenerate the flash picture by reconstructing the non-flash picture and then adding the flash effect. The number of bits required for coding flash pictures is thereby significantly reduced. | 10-01-2009 |
20090267812 | Method for encoding a sequence of integers, storage device and signal carrying an encoded integer sequence and method for decoding a sequence of integers - The invention is related to a method for encoding a sequence of integers, to a storage device and to a signal carrying such encoded sequence and to a method for decoding such encoded sequence. | 10-29-2009 |
20090279603 | Method and Apparatus for Adaptively Determining a Bit Budget for Encoding Video Pictures - When for video coding Intra refresh is used, which inserts Intra coded blocks into previously Inter coded pictures, an efficiently adapted rate control method is required for error resilient video coding. A method for adaptively determining a bit budget for encoding video pictures comprises pre-analyzing each of the pictures of a group of pictures, wherein a relative complexity index is calculated for each picture, allocating bits to the pictures based on their relative complexity index and encoding each of the pictures with the allocated number of bits. The pre-analysis comprises selecting pictures for Intra refresh coding, extracting attention area information from the selected pictures, encoding at least the macroblocks of the attention area using Intra mode, calculating for each picture a complexity index, and calculating from the complexity indices of the pictures of the group a relative complexity index for each picture. Thus, a subjectively better video quality is achieved. | 11-12-2009 |
20100020865 | Data stream comprising RTP packets, and method and device for encoding/decoding such data stream - In the case of packet loss during transmission over an error-prone transmission channel, some decoders may perform error concealment. In real-time systems, application decoders must handle the data loss alone and find out which data are missing. A special syntax within a packet-based framework is provided which is based on identifying and indicating the relationship between RTP packets and the application layer data they carry, before the packets are fed to the multi-layer application decoder. This helps the decoder to employ proper error concealment techniques in time, and prevents unnecessary processing in the decoder. A data stream comprises RTP packets containing application data of a multi-layer application, wherein an RTP packet (p | 01-28-2010 |
20100034273 | Method for predicting a lost or damaged block of an enhanced spatial layer frame and SVC-decoder adapted therefore - The invention is related to prediction of a lost or damaged block of an enhanced spatial layer frame. | 02-11-2010 |
20100040298 | METHOD AND APPARATUS FOR SELECTING A SCAN PATH FOR THE ELEMENTS OF A BLOCK IN SPATIAL DOMAIN PICTURE ENCODING AND DECODING - International image or video coding standards uses hybrid coding, wherein a picture is separated into pixel blocks on which predictive coding, transform coding and entropy coding is employed. The transform coding is effective because the prediction error samples are correlated in the frequency domain. However, when the prediction quality is getting better and better, spatial domain coding becomes more effective than transform coding. According to the invention, it is first determined in which corner of a current block the first non-zero amplitude value is located. Based on the related zeros run length value in that block, a pre-defined scan path is selected, i.e. a context-based adaptive scan mode is used. | 02-18-2010 |
20100183069 | Method and Apparatus for Determining in Picture Signal Encoding the Bit Allocation for Groups of Pixel Blocks in a Picture - Optimised bit allocation is important in video compression to increase the coding efficiency, i.e. to make optimum use of the available data rate. In view of the human visual system, a human usually pays more attention to some part of a picture rather than to other parts of that picture. Therefore the bit allocation should be optimised for different-attention picture areas (GOB | 07-22-2010 |
20100194610 | Method and device for encoding a bit sequence - The invention is related to a method and a device for encoding of a bit sequence. | 08-05-2010 |
20100232519 | ENCODING METHOD AND DEVICE FOR CARTOONIZING NATURAL VIDEO, CORRESPONDING VIDEO SIGNAL COMPRISING CARTOONIZED NATURAL VIDEO DECODING METHOD AND DEVICE THEREFORE - The invention is related to an encoding method and device which allows for providing cartoonized video. The invention is further related to corresponding decoding methods and devices. The invention is also related to corresponding video signals. An encoding method, which allows for providing a cartoonization of the source video and for recombining the source video from the cartoonization of the source video and a residual video, comprises the following steps: Cartoonizing the source video, encoding a first video, reconstructing the first video, determining a first residual video between a second video and the reconstructed first video, encoding the first residual video and combining the encoded first video and the encoded first residual video wherein one of the first video and the second video is the source video and the other is the cartoonized source video. | 09-16-2010 |
20100310187 | METHOD AND DEVICE FOR COMPRESSING AN IMAGE AND STORAGE MEDIUM CARRYING AN IMAGE COMPRESSED BY SAID METHOD - The invention is related to a method for compressing images. The proposed method comprises associating perceptual importance parameters with pixels of the image, applying a transform on the image, partitioning the transformed image into code blocks and encoding coefficient bits of a given code block together from a most significant bit plane towards a least significant bit plane, wherein encoding of at least one coefficient is truncated at a truncation bit plane depending on the perceptual importance parameter associated with the pixel to which said code block coefficient corresponds. Truncating encoding of coefficients in dependency on the perceptual importance of the pixel associated with the coefficient allows for truncating coefficients corresponding to perceptually less important pixels at more significant bit planes. So, the overall perceptual quality of the compressed image is enhanced. | 12-09-2010 |
20110044386 | METHOD AND APPARATUS FOR ENCODING GROUPS OF PICTURES OF A VIDEO SEQUENCE, EACH OF SAID GROUPS INCLUDING AN INTRA ENCODED PICTURE AND MORE THAN TWO PREDICTED ENCODED PICTURES - In known video coding standards there are basically three types of pictures: I, P and B. Video sequences are usually coded in a group of picture structure wherein several P or B pictures are coded following one I picture. However, this GOP structure has some disadvantages with respect to error resilience and storage medium recording. If a P picture is lost e.g. due to transmission channel error, then the subsequent P pictures can not be reconstructed correctly, and the error will propagate temporally and cause unpleasing artifacts. This GOP structure is designed for forward play only and makes complicated a reverse play operation. According to the invention, a reversible GOP structure is used for the video encoding and decoding. The RGOP structure contains both, a forward encoding chain and a backward encoding chain. Each picture in the RGOP structure is assigned to only one of these chains and the video pictures of adjacent RGOP chains are interleaved. | 02-24-2011 |
20110134995 | VIDEO CODING WITH CODING OF THE LOCATIONS OF SIGNIFICANT COEFFICIENTS IN A BLOCK OF COEFFICIENTS - In known image compression, following quantisation, a very sparse distribution of significant (i.e. non-zero) amplitude coefficients of the transformed image signal may be obtained while most quantised coefficients are zeros. A costly task for a transform-based image compression in terms of resulting overall data rate is to record the locations of such significant coefficients within the coding blocks. In quartation processing, a ‘significant square’ (containing at least one non-zero amplitude coefficient in the coefficient block) is recursively divided into four smaller squares until single significant coefficients are reached, and the significance statuses of all generated squares are encoded. However, for some distribution patterns encoding the x-y-coordinates of the significant coefficients as binary numbers will lead to less coding cost. According to the invention, at least four different pattern determination or encoding modes are checked, and the encoding side selects the least costly one of these modes and transfers the corresponding mode information to the decoding side for corresponding decoding. | 06-09-2011 |
20110158323 | METHOD FOR LOSSLESS COMPRESSING PREFIX-SUFFIX-CODES, METHOD FOR DECOMPRESSING A BIT SEQUENCE REPRESENTING INTEGERS OR SYMBOLS ENCODED IN COMPRESSED PREFIX-SUFFIX-CODES AND STORAGE MEDIUM OR SIGNAL CARRYING COMPRESSED PREFIX-SUFFIX-CODES - The invention is related to lossless compression of prefix-suffix-codes wherein a prefix comprises unary code, and to corresponding decompression. The method for lossless compressing prefix-suffix-codes comprises the steps of forming a first contiguous bit sequence from the prefixes, and lossless compressing the first contiguous bit sequence by removing redundancy related to the difference between the first value's frequency in the first contiguous bit sequence and the second value's frequency in the first contiguous bit sequence. Bit values are unevenly distributed in the prefixes while distribution of bit values in the suffixes is more even. Therefore, better compression is achievable if the prefixes are compressed separately. | 06-30-2011 |
20110317768 | METHOD AND APPARATUS FOR DETERMINING BLUR IN AN IMAGE - Blur is one of the most important features related to video quality. Accurate estimating the blur level of a video is a great help to accurately evaluate the video quality. An improved method is provided for estimating the blur level of videos that are compressed by a block based codec, such as H.264/AVC, MPEG2, etc. According to the invention, local blur detection is based on macroblock (MB) edges, a content dependent weighting scheme is employed to decrease the influence from texture and when detecting local blur, the spreading of detection will stop at local minimum and maximum luminance positions. | 12-29-2011 |
20120013491 | METHOD AND DEVICE FOR ENCODING AN INPUT BIT SEQUENCE AND CORRESPONDING DECODING METHOD AND DEVICE - The invention is made in the technical field of encoding and decoding of bit sequences. The invention proposes a device for compression-encoding an input bit sequence in which Zeroes and Ones occur equally frequent, comprising an XOR gate adapted for receiving pairs of immediately succeeding bits of the input bit sequence as inputs and for outputting further bits of another bit sequence, means for adding a bit to said other bit sequence wherein the added bit is a primary bit which is equal to a primary bit of the input bit sequence or a last bit which is equal to a last bit of the input bit sequence, and means for encoding the other sequence. The XOR gate transforms the input bit sequence into the other bit sequence which comprises more uneven frequencies of occurrence of Zeroes and Ones than the input bit sequence. | 01-19-2012 |
20120019403 | METHOD AND DEVICE FOR ENCODING AND DECODING OF SYMBOL SEQUENCES WHEREIN EACH SYMBOL MAY HAVE ONE OUT OF THREE OR MORE POSSIBLE SYMBOL VALUES - A method for compressing a symbol sequence, wherein each symbol may have one out of three or more possible symbol values, said method comprises the steps of modifying the symbol sequence by replacing each run pair, which contains a first run of symbols of a most frequent symbol value and a second run of symbols of a second most frequent symbol value, by a further symbol value not comprised in the three or more possible symbol values, generating a binary sequence comprising all replaced run pairs and compression encoding the binary sequence and the modified symbol sequence. | 01-26-2012 |
20120106858 | COMPRESSION OF 3D MESHES WITH REPEATED PATTERNS - 3D models of the engineering class usually have a large number of connected components, with small numbers of large triangles, often with arbitrary connectivity. To enable compact storage and fast transmission of large 3D mesh models, an efficient compression strategy specially designed for 3D mesh models is provide. A method for encoding a 3D mesh model comprises determining and clustering repeating components, normalizing the components, wherein scaling factors are clustered and orientation axes are clustered, encoding the connected components using references to the clusters, and entropy encoding the connected components. | 05-03-2012 |
20120203514 | METHOD AND APPARATUS FOR ENCODING A MESH MODEL, ENCODED MESH MODEL, AND METHOD AND APPARATUS FOR DECODING A MESH MODEL - For most large 3D engineering models, the instance positions of repeating instances of connected components show significant multiple spatial aggregation. The invention uses several KD-trees, each for one cluster of points which are spatially aggregated. The multiple KD-trees generate a relatively short data stream, and thus improve the total compression ratio. A method for encoding points of a 3D mesh model comprises steps of determining that the mesh model comprises repeating instances of a connected component, and determining for each repeating instance at least one reference point, clustering the reference points of the repeating instances into one or more clusters, and encoding the clustered reference points using KD-tree coding, wherein for each cluster a separate KD-tree is generated. | 08-09-2012 |
20120242679 | RENDERING METHOD - As to enhance the rendering while minimizing needed computation time, the method comprises the steps of determining noise information, said noise information being representative of noise level estimated for at least a part of said image; the noise information being determined for the achromatic component of the image; sampling said part of the image according to said noise information; and rendering said at least a part of the image according to said sampling. | 09-27-2012 |
20120288210 | TEXTURE-PATTERN-ADAPTIVE PARTITIONED BLOCK TRANSFORM - The invention is related to encoding an image block of an image using a partitioned block transform. The inventors recognized that applying a texture-pattern associated invertible mapping to the pixels of a first partition, said first partition resulting from partitioning said image block according to a current texture pattern with which said texture-pattern associated invertible mapping is associated, allows for limiting the maximum number of required first 1-D transforms to not exceeding a number of columns in the image block as well as limiting the maximum number of required second 1-D transforms to not exceeding a number of rows in the image block, also. Achieving limitation of maximum required 1-D transforms enables more efficient implementation on hardware and improves encoding performance but also allows for further partitions according to texture patterns which comprise at least one of multiple strips, texture patterns with highly unsymmetrical pixel distribution and non-directional texture patterns. | 11-15-2012 |
20120306875 | METHOD FOR ENCODING NORMALS OF A 3D MESH MODEL, METHOD FOR DECODING NORMALS OF A 3D MESH MODEL, ENCODER AND DECODER - A method for encoding vertex orientations, also known as normal components, of a 3D mesh model comprises a first clustering of the normal components, determining for each of the first clusters a sphere sector to which most of its elements belong, mapping normal components to a predefined sector, re-clustering the normal components in the predefined sector into second clusters, determining predictors for the second clusters and encoding a normal component by its residual, a reference to its predictor and data indicating which of said mirror mapping operations were performed. A sphere sector is obtained by dividing a sphere into m equal spherical segments and dividing each of said spherical segments into n equal sectors. The first clustering for the sector mapping and the second clustering for predictive coding result in an improved compression ratio. | 12-06-2012 |
20120307897 | VIDEO ENCODER, VIDEO DECODER, METHOD FOR VIDEO ENCODING AND METHOD FOR VIDEO DECODING, SEPARATELY FOR EACH COLOUR PLANE - High-fidelity video coding nowadays tends to adopt the RGB coding for directly reducing RGB inter-color redundancy without color space conversion. A known method uses a blockbased inter-colour compensation algorithm for removing inter-colour redundancy on RGB colour planes by defining the correlation between colour planes within each coding block as a linear model of slope and offset parameters, codes the base plane block and then predicts the other two colour blocks from the base plane block. However, for most coding blocks the texture within a component block varies quite much. A new method for improved video coding uses adaptive segmentation of the base colour component block, corresponding segmentation of the other colour component blocks and individual slope and offset parameters for predicting each segment. | 12-06-2012 |
20130070106 | METHOD FOR DETERMINING A QUALITY MEASURE FOR A VIDEO IMAGE AND APPARATUS FOR DETERMINING A QUALITY MEASURE FOR A VIDEO IMAGE - Accurately estimating the image quality of video is still difficult, especially when there is no reference video available. A method for determining a quality measure for a video image comprises selecting a measuring point, such as a MB, determining a context area around the measuring point, calculating a variance of pixel values in the context area, calculating a variance of pixel values in the measuring point, calculating a relation between the two variances of pixel values, and averaging said relations for a plurality of measuring points, wherein a quality measure for a video image is obtained. | 03-21-2013 |
20130173225 | METHOD FOR SAMPLING MESH MODELS AND APPARATUS FOR SAMPLING MESH MODELS - Common 2D or 3D mesh models comprise redundancy in the form of symmetries, such as repetitive structures. For complexity reduction, the redundant structures must be detected. An improved method for sampling mesh models comprises sampling the model ( | 07-04-2013 |
20130211803 | METHOD AND DEVICE FOR AUTOMATIC PREDICTION OF A VALUE ASSOCIATED WITH A DATA TUPLE - The invention relates to a method and a device for automatic prediction of a current value using a weighted average of a number of current reference values, wherein the current value is associated with a current pair consisting of a first and a second current data tuple. The method comprises using a set of reference pairs, each reference pair consisting of a first and a second reference data tuple and being associated with a reference value, for selecting the current reference values wherein the first reference data tuples, the first current data tuple and a first metric is used for selecting, determining, for each current reference value, an associated weight using the second reference data tuples of the pair associated with the respective selected reference value, the second current data tuple and a second metric, and using the current reference values and the determined weights for determining the weighted average. | 08-15-2013 |
20130223208 | METHOD AND APPARATUS FOR QUALITY OF EXPERIENCE MANAGEMENT FOR NETWORK SERVICES - The present invention provides a QoE (Quality of Experience) management solution, wherein QoE feedback is used to optimize the usage of QoS provisioning techniques, thus improving the utilization efficiency of network resources. According to one aspect of the invention, a method for QoE management for a network service provided to a user device, the method comprising: displaying a user interface on the user device for a user to input an expected QoE value of the network service; receiving the expected QoE value of the network service from the user; evaluating an objective QoE value of the network service as a function of network QoS parameters; and adjusting the QoS parameters of the network service if the objective QoE value is less than the expected QoE value. | 08-29-2013 |
20130235214 | METHOD AND APPARATUS FOR MEASURING QUALITY OF VIDEO BASED ON FRAME LOSS PATTERN - A method and apparatus for measuring the quality of a video is provided. The method comprises: generating a frame loss pattern of the video by indicating whether each frame in the video is lost or successfully transmitted; and evaluating the quality of the video as a function of the generated t came loss pattern. | 09-12-2013 |
20140050417 | IMAGE FILTERING BASED ON STRUCTURAL INFORMATION - A method and an apparatus for image filtering are described. Structural information is employed during the calculation of filtering coefficients. The structural information is described by the regions defined through an edge map of the image. In one embodiment, the region correlation between the target pixel and a contributing pixel is selected as a structural filtering coefficient. The region correlation, which indicates the possibility of two pixels being in the same regions, is calculated by evaluating the strongest edge cut by a path between the target pixel and a contributing pixel. The structural filtering coefficient is further combined with spatial information and intensity information to form a spatial-intensity-region (SIR) filter. The structural information based filter is applicable to applications such as denoising, tone mapping, and exposure fusion. | 02-20-2014 |
20140140636 | Anisotropic Gradient Regularization for Image Denoising, Compression, and Interpolation - De-noising an image by Anisotropic Gradient Regulation commences by first choosing edge directions for the image. Thereafter, an anisotropic gradient norm is established for the image from anisotropic gradient norms along the selected edge directions. The image pixels undergo adjustment to minimize the anisotropic gradient norm for the image, thereby removing image noise. | 05-22-2014 |