2550results about How to "Improve compression efficiency" patented technology

A system and method for improving the coding efficiency of motion vector information in video coding. According to various embodiments, a list of motion vector predictor candidates is arranged according to predefined rules. Each motion vector also has a reference index associated with it. One of the motion vector candidates is then selected as a predictor based on predefined rules, or the selection is explicitly signaled in the bitstream. The reference index associated with the selected motion vector is used as a reference index for the current block. The reference index is predicted along with the motion vector. Such embodiments can improve the compression efficiency of modern video codecs.

A video frame arithmetical context adaptive encoding and decoding scheme is presented which is based on the finding, that, for sake of a better definition of neighborhood between blocks of picture samples, i.e. the neighboring block which the syntax element to be coded or decoded relates to and the current block based on the attribute of which the assignment of a context model is conducted, and when the neighboring block lies beyond the borders or circumference of the current macroblock containing the current block, it is important to make the determination of the macroblock containing the neighboring block dependent upon as to whether the current macroblock pair region containing the current block is of a first or a second distribution type, i.e., frame or field coded.

A lossless image encoding/decoding method and apparatus. The lossless color image encoding apparatus includes a motion prediction image generator estimating a motion between a previous image and a current image and outputting a corresponding prediction image, a residue generator generating a temporal residue corresponding to a difference between a prediction image generated by the motion prediction image generator and the corresponding block of the current image with respect to different components of the color image, a prediction residue generator generating prediction residues by defining a linear-transformed value of one residue among the different components of the color image output from the residue generator as a predictor and using differences between each of the residues of the other components and the predictor, and an entropy encoder receiving the residue forming the predictor from the residue generator and the prediction residues from the prediction residue generator and generating a bitstream. Encoding methods, decoding apparatuses, and decoding methods can be implemented similarly.

A “Remote Display Generator,” as described herein, provides various techniques for providing high-fidelity displays with highly responsive interactive application experiences to clients across a wide range of network bandwidths for remotely hosted applications. In general, the Remote Display Generator uses a compression-friendly remote display architecture as a core. With this compression architecture, actual screen data from a remote server is read out from the display buffer frame by frame, and then compressed with a unified screen codec. Other technologies, including timer-driven screen update models and adaptive transmission mechanisms, are then integrated with various embodiments of the Remote Display Generator to improve overall user experience by improving display quality and responsiveness to user interaction with remotely hosted applications.

A method and apparatus for coding an image capable of performing a prediction coding process by using a correlation degree between neighboring pixels of a current block and neighboring pixels of a reference block, and an image decoding method and apparatus. In the method, reference block candidates having neighboring pixels similar to the neighboring pixels of the current block are selected, matching errors between selected reference block candidates and the current block are calculated, and a reference block candidate having the least matching error is determined to be a predicted block of the current block.

A variable block transform system, medium, and a system, medium, and method for video encoding/decoding using the variable block transform. The system includes a transform block size determination unit that determines the transform block size for components of an input video based on a format, defining the components, of the input video or characteristics of the components, and a transform coding unit that performs transform coding on each of the color components of the input video according to the determined transform block sizes and outputs transform coefficients.

The invention relates to systems for a transmission of images via channels of communication with a limited capacity by means of application of compression of the images. The technical result consists in an increase of the compression degree upon encoding, and it allows to fulfill the transmission of such encoded images via the channel of communication with the limited capacity, therewith a high degree of the compression is provided without of increase of computational power of encoding device and without of distortions upon decoding. The result is obtained by the usage of more effective method of interpolation of restored subsamples, in this method there is used an adaptive and applicative set of samples, which restore a quantized signal, and this set of the samples allows to improve an accuracy of the interpolation with a number of the subsamples, which is necessary for the right interpolation that is simultaneously decreased one.

This invention provides a method and a system for coding/decoding frequency domain parameter stereos and multiple tracks, which converts signals of right and left tracks to a residual signal of a sum-difference tack and a residual signal of an estimated difference track, carries out time frequency conversion to residual signals of the estimated difference track, the original difference track and the original sum track to pick up the HF component and low frequency component of the residual signal of the original difference track, which is coded in quantization to utilize the HF component to get estimated residual RF component of the right and left tracks and gets the original residual RF component of the right and left tracks to be controlled in gain to get a gain coefficient of the difference of the two tracks and coded in quantization and finally multiplexes the coded data and edge information to get a frequency domain parameter stereo bit stream.

Systems and methods of storing previously transmitted data and using it to reduce bandwidth usage and accelerate future communications are described. By using algorithms to identify long compression history matches, a network device may improve compression efficiently and speed. A network device may also use application specific parsing to improve the length and number of compression history matches. Further, by sharing compression histories, compression history indexes and caches across multiple devices, devices can utilize data previously transmitted to other devices to compress network traffic. Any combination of the systems and methods may be used to efficiently find long matches to stored data, synchronize the storage of previously sent data, and share previously sent data among one or more other devices.

Method, systems and software are proposed for obtaining for blocks of a first image similar blocks of a second image (the “reference image”). The blocks of the first image are processed sequentially, for each block trying out a number of candidate locations in the second image and evaluating a cost function for each. Each candidate location in the second image is displaced by a respective motion vector from the block of the first image. In a first aspect of the invention the cost function is a function of a predicted motion vector for future blocks of the first image (i.e. blocks of the first image which have not yet been processed). In a second aspect of the invention the motion vectors are given by location values which are not all whole pixel spacings, halves of the pixel spacing, or quarters of the pixel spacing.

The present invention relates to an architecture for stack robust fine granularity scalability (SRFGS), more particularly, SRFGS providing simultaneously temporal scalability and SNR scalability. SRFGS first simplifies the RFGS temporal prediction architecture and then generalizes the prediction concept as the following: the quantization error of the previous layer can be inter-predicted by the reconstructed image in the previous time instance of the same layer. With this concept, the RFGS architecture can be extended to multiple layers that forming a stack to improve the temporal prediction efficiency. SRFGS can be optimized at several operating points to fit the requirements of various applications while the fine granularity and error robustness of RFGS are still remained. The experiment results show that SRFGS can improve the performance of RFGS by 0.4 to 3.0 dB in PSNR.

The invention relates to method for buffering encoded pictures. The method includes an encoding step for forming encoded pictures in an encoder. The method also includes a transmission step for transmitting said encoded pictures to a decoder as transmission units, a buffering step for buffering transmission units transmitted to the decoder in a buffer, and a decoding step for decoding the encoded pictures for forming decoded pictures. The buffer size is defined so that the total size of at least two transmission units is defined and the maximum buffer size is defined on the basis of the total size.

A method for selecting a motion vector predictor is provided. The method of selecting a motion vector predictor includes the steps of selecting motion vector predictor candidates for a current block and selecting a motion vector predictor of the current block out of the motion vector predictor candidates, wherein the motion vector predictor candidates for the current block include a motion vector of a first candidate block which is first searched for as an available block out of left neighboring blocks of the current block and a motion vector of a second candidate block which is first searched for as an available block out of upper neighboring blocks of the current block.

The invention discloses a self-adaption dividing method for code units in high-efficiency video coding, which mainly solves the problems that a largest code unit and a smallest code unit in the division of the code units in the prior art can not be regulated according to the characteristics of video content, and the dividing mode quantity of blocks on the boundary of a video frame is few. The method comprises the steps of: firstly, adopting the rate distortion rule or the relativity among video frames to self-adaptively determine the largest code unit and the smallest code unit in each video frame; secondly, expanding a rectangular block within the video frame in the largest code unit on the boundary of a video frame into a square block, and dividing the square block; then, marking the rectangular blocks after dividing, and carrying out frame prediction to the rectangular blocks after dividing; and finally, transforming, quantizing and entropy coding to prediction residuals. The invention has the advantage of high video compression efficiency, and can be applied to high-performance video coding standards.

In a picture coding apparatus and a picture coding method, when a picture data is hierarchically coded, compression efficiency can be improved, and the deterioration of picture quality can be reduced. When a picture data is hierarchically coded by utilizing a recursive hierarchical representation, adaptive division of block is performed corresponding to the characteristic of the picture data and then coding is performed, and thus obtained hierarchical coded data is transmitted, so that the block of the lower hierarchy can be adaptively divided, thereby the information quantity such as a plane portion of picture can be reduced.

Disclosed is an image encoding method. The method includes deriving a motion refinement candidate from among motion information of spatial neighboring blocks, motion information of a temporal neighboring blocks, predefined motion information, and motion information that most frequently occurs in a reference picture, performing a motion information refinement on the derived motion refinement candidate, and generating a prediction block of a current block by using the motion refinement candidate having undergone the motion information refinement.

Provided are a method of efficiently transmitting motion model parameters using temporal correlation between video frames and a video encoding and decoding method and apparatus, in which motion estimation and motion compensation are performed by generating a plurality of reference pictures that are motion-compensated using motion model parameters. Motion model parameters are encoded based on temporal correlation between motion vectors of representative points expressing the motion model parameters, global motion compensation is performed on a previous reference video frame using motion model parameters in order to generate a plurality of transformation reference pictures, and a current video frame is encoded using the plurality of transformation reference pictures.

A compressing unit 6 of a video encoding device selects whether or not to transform and quantize a prediction error signal 5 after a downsampling processing unit 36 performs a reduction transformation on the prediction error signal 5 by using a transforming process determining unit 31, and then creates quantization coefficient data 7a or 7b. When the compressing unit creates the quantization coefficient data 7b, a local decoding unit located behind the compressing unit inverse-quantizes and inverse-transforms the quantization coefficient data 7b, and, after that, an upsampling processing unit performs an enlargement transformation on the quantization coefficient data to create a decoded prediction error signal.

A method of encoding a motion vector includes: selecting one of a plurality of predicted candidate motion vector sets by using motion information of neighboring blocks of a current block; selecting one of predicted candidate motion vectors within a selected predicted candidate motion vector set, as a predicted motion vector; encoding a differential motion vector representing a difference between a current motion vector or motion vector of the current block and a selected predicted motion vector; and encoding a predicted motion vector index indicating the selected predicted motion vector. As a motion vector is encoded after selecting an efficient predicted candidate motion vector set, the size of a differential vector to be encoded can be reduced without necessarily encoding additional information to indicate which set of predicted candidate motion vectors has been selected, resulting in improved compression efficiency of motion vectors and in turn the improved video compression efficiency.

Trace circuitry, and a method of operating such trace circuitry, are provided for generating a trace stream indicative of activities of monitored circuitry of a data processing apparatus. The monitored circuitry produces data elements indicative of those activities, and the trace circuitry comprises trace element generation circuitry which is responsive to at least some of the data elements produced by the monitored circuitry to generate trace elements representative of those data-elements, with the trace elements generated being dependent on a selected trace mode of operation of the trace circuitry. Compression circuitry is then arranged to apply an encoding operation to a sequence of trace elements in order to produce a packet whose bit pattern represents the sequence of trace elements, and to cause that packet to be output in the trace stream, the encoding operation applied being dependent on a current compression scheme associated with the compression circuitry. Whilst in the selected trace mode of operation, the compression circuitry is responsive to a compression change stimulus to change the current compression scheme from a first compression scheme to a second compression scheme whose bit pattern encoding space overlaps the bit pattern encoding space of the first compression scheme, such that following the change of compression scheme any further packets produced whilst in the selected trace mode of operation are produced in accordance with the second compression scheme. Such an approach has been found to provide improved compression efficiency thereby reducing the volume of trace data produced.

Apparatus and methods are described for network content in dictionary-based (de)compression. Content for compression is parsed into discrete constructions, such as phrases, words, etc. The discrete constructions are passed to a searching engine to locate network information at one or more network locator identities, such as URI's (URL's, URNs) that correspond to the discrete constructions. Upon locating the network information, a dictionary of entries corresponding to the content is created. The content is encoded from the dictionary by indicating raw or relative offsets into the network information per each of the network locator identities. Decoding occurs anti-symmetrically to the encoding. In this manner, the vastness of network content, e.g., the world wide web, is leveraged to provide relevant dictionaries for de-/encoding. Searching for candidate dictionaries, scoring same and safeguarding against volatile dictionary content are other noteworthy features. Computer program products and computing network interaction are also defined.

Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VCL coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols s_i with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols s_i yields z, and, if n>1, for all i=1 . . . n−1, the value of s_i corresponds to a range of the i^th partition.