Abstract:
A method for the differential coding and decoding and related circuits are disclosed here. The differential coding is a special type of coding which, instead of coding directly an input signal, carries out the difference between this signal and a predicted signal of it. This allows the reduction of the information to be transmitted. The invented method is capable of further reducing the signal redundancy and therefore the information to be transmitted.
Abstract:
Inputted image signals are coded, for example, by performing prediction encoding, DCT conversion, quantization in predetermined quantization step sizes, and variable-length coding so as to generate first coded data. From the amount of the first coded data per unit of time, for example, per frame or GOP and the total amount of data usable, the amount of codes assigned per frame or GOP is determined. On the basis of this amount of codes assigned, the inputted image signals are coded every given period of time to generate second coded data. Thus variable rate coding in which the coding rate changes every period of time is implemented to provide high-quality images which are uniform as a whole without increasing the quantization step sizes of images even though there are continuous frames whose patterns are complicated, unlike a conventional apparatus. The second coded data thus generated are variable rate ones. Therefore, by recording them on an image recording medium, it is possible to utilize a limited capacity of storage effectively, and prolong the recording time of the image recording medium. Then, from this image recording medium, it is possible to reproduce high-quality images which are uniform as a whole.
Abstract:
Video signals are coded (102) at a first relatively low frame rate. One or more portions of the image area, for example the mouth of a person speaker; recognised by feature extractor (106), are coded (110) at a higher frame rate. Preferably the second coding operates by resolving the pixel values of the image portion - considered as a vector - relative to a set of orthogonal reference vectors (stored in 112) to produce coefficients which are then transmitted. Preferably, the feature extractor (106) normalises the image portion as regards scaling, position and rotation and sends data on these parameters as side information.
Abstract:
A method for quantizing and entropy coding coefficients resulting from sub-band decomposition or transform, in order to dispense with the variable occupancy, feedback-controlled buffer memory which is usually necessary in such systems when coded bits must be transmitted at a constant fixed frequency. This method results in reduced complexity and an improved uniformity of quantization accuracy. The method comprises two steps. The first involves a joint retrieval of a random sample of the set of sub-band/transform coefficients and of a corresponding set of probability density functions representative of the known statistical characters of the coefficients. In the second step, the resulting joint random sample is subjected to an iterative procedure to determine the quantization increment which results in the desired overall bit rate. The margin of error for said quantization increment comprises both a statistical component (stemming from the limited sample size) and a deterministic component (reflecting the imperfection in the adequacy of the iterative procedure).
Abstract:
A method comprising an image decomposition step using multiresolution pyramidal Gabor transformation. The transformed image data arranged in a pyramid of sub-bands are then selected in three groups according to the spatial frequency level of the sub-band data, wherein the sub-band data of each group are coded by a respective one of three coding operations which are performed in parallel and each of which has a specific performance matching the properties of the data in each group. A reverse transformation operation is then performed to recreate the images. The method uses movement-compensation prediction to reduce the time correlation between the two images without movement vector transmission to the receiver being absolutely necessary. The method further uses filters providing decomposition into sub-bands which only comprise value coefficients that are powers of two or the sum of or difference between two powers of two. A previous step allows the data for processing to be converted from interlaced (CCIR 601 format) to progressive modes, based on a movement-compensated interpolation. A final progressive to interlaced mode conversion step may be provided in the decoder.
Abstract:
The video data of a frame sequence are coded and decoded by batches, whereas each nth main frame data field (F1, F4) (= key frame) is transmitted as completely as possible. From two adjacent main frame data fields (F1, F4), n-1 phantom image data fields (P1, P2) are calculated at the emitter and receiver sides by means of n-1 motion fields (M1, M2). In addition, n-1 differential frame data fields (D1, D2) are determined on the emitter side, then transmitted with the main frame data fields (F1, F4). On the receiver side, the original sequence of the data fields (F1, F2, F3, F4,...) is again reconstructed from the transmitted data fields (F1, D1, D2, F4, ...) is again reconstructed from the transmitted data fields (F1, D1, D2, F4, ...) by a renewed calculation of the motion fields (M1, M2).
Abstract:
The signals are processed in blocks. When signals are coded and decoded in blocks, the limits of the blocks may be visible or audible during reproduction of certain picture or audio signals, causing interference. By post-filtering (471, 472, 473) transformed, quantized and inversely transformed signal scanning values in the coder, or transformed and inversely transformed signal scanning values in the decoder, the visibility or audibility of signal jumps at the limits of blocks can be reduced.
Abstract:
Generalized range prediction code modulation system for groups of signals with range overlap top-down (Cauchy's convergence principle) and bottom-up for successive range-dependent, sharper, reduced-length coding of the (multidimensional) function-address space, using the ranges of signals, differences, vectors, predicates, unsharpness, relative offsets and code length prediction. One aim of the invention is PCM coding with substantially reduced data rate and simple operations in comparison with conventional processes.
Abstract:
A digital television transmitter has a buffer (28) that receives a low resolution low pass filtered signal (26). A high resolution high pass filtered signal (30) is applied to the buffer only when the buffer can accept it without overflowing. A digital television receiver receives a digital television picture signal (32') and preferably a transmitter buffer occupancy state signal (34'). A low resolution low pass filtered signal (22') is applied to an adder (68). A high resolution high pass filtered signal (24') is applied to the adder when the buffer state is low and also when it is intermediate and no substantial motion is present. The transmitter and receiver are useful in video teleconferencing.
Abstract:
The sample values of a digitized image (14) are encoded utilizing the amount of redundancy in the digital data to generate check bits which are attached to blocks of the data prior to transmission or recording (Fig. 2A). After transmission or recording, the recovered data is re-encoded using the original encoding rules, and any resultant errors which have changed the redundancy are reflected in the re-encoded check bits (Fig. 2B). The original check bits attached to the data are compared to the re-encoded check bits (26) to determine if the errors are correctable (27), and, if so, what steps must be taken to correct the errors (30) and to restore the original redundancy to the recovered data (31).