Abstract: In encoding a sequence of frames, a linear transform, such as, for example a wavelet transform, is applied to the sequences of frames on a frame-by-frame basis. At least one portion of a linearly transformed frame thus obtained is encoded in the inter mode on the basis of a differential representation of the linearly transformed frame. The differential representation corresponds with a difference between, on the one hand, the portion of the linearly transformed frame and, on the other hand, a representation of a corresponding portion of at least one other linearly transformed frame. Data compression is then applied to the differential representation of the portion of the linearly transformed frame.

Abstract: The disclosure relates to a method for compressing in a packed data set a color image comprising color image samples arranged in a reference grid according to a sampling pattern, and comprising the steps of (a) performing a decorrelative transform providing component images, (b) performing a number of discrete wavelet decompositions on said component images and (c) forming packets in the packed data set by processing each consecutive line in the reference grid and each component and grouping all samples of said component in said line in one or more packets, and appending said one or more packets to the packed data set. The disclosure also relates to a device for compressing, a computer program for compressing, a method for decompressing, a device for decompressing, and a computer program for decompressing. The disclosure also relates to the packed data set produced by said method for compressing.

Abstract: The disclosure relates to a method for compressing in a packed data set a color image comprising color image samples arranged in a reference grid according to a sampling pattern, and comprising the steps of (a) performing a decorrelative transform providing component images, (b) performing a number of discrete wavelet decompositions on said component images and (c) forming packets in the packed data set by processing each consecutive line in the reference grid and each component and grouping all samples of said component in said line in one or more packets, and appending said one or more packets to the packed data set. The disclosure also relates to a device for compressing, a computer program for compressing, a method for decompressing, a device for decompressing, and a computer program for decompressing. The disclosure also relates to the packed data set produced by said method for compressing.

Abstract: An image processor processes an image having color pixels (R, G, B) arranged in a Bayer pattern. The image processor provides a de-correlated image composed of three types of components (Y, Cr, Cb). The image processor provides a component of the first type (Y) as a substitute for a pixel of the first type (G), whereby the component of the first type (Y) is a weighted combination of a cluster of pixels that includes the pixel of the first type (G) and neighboring pixels, wherein neighboring pixels of the second and third type (R, B) have an overall positive weighting factor corresponding to an overall addition of neighboring pixels of the second and third type (R, B) to the pixel of the first type (G). The image processor also provides a component of the second type (Cr) and a component of the third type (Cb) in similar fashion.

Abstract: The invention relates to a method for compressing an input data set, wherein the coefficients in the input data set are grouped in groups of coefficients, a number of bit planes, GCLI, needed for representing each group is determined, a quantization is applied, keeping a limited number of bit planes, a prediction mechanism is applied to the GCLIs for obtaining residues, and an entropy encoding of the residues is performed. The entropy-encoded residues, and the bit planes kept allow the decoder to reconstruct the quantized data, at a minimal cost in meta-data.

Abstract: In encoding a sequence of frames, a linear transform, such as, for example a wavelet transform, is applied to the sequences of frames on a frame-by-frame basis. At least one portion of a linearly transformed frame thus obtained is encoded in the inter mode on the basis of a differential representation of the linearly transformed frame. The differential representation corresponds with a difference between, on the one hand, the portion of the linearly transformed frame and, on the other hand, a representation of a corresponding portion of at least one other linearly transformed frame. Data compression is then applied to the differential representation of the portion of the linearly transformed frame.

Abstract: In a video encoder (100), a motion estimation module (102) identifies for a portion of a frame to be encoded, a similar portion in a reference frame. The reference frame is a decoded version of an already encoded frame. A reference frame compression module (104) independently encodes respective portions of the reference frame so as to obtain respective encoded portions of the reference frame. The respective portions of the reference frame that are independently encoded are at least as large as the portion of the frame to be encoded. A reference frame memory (108) temporarily stores the respective encoded portions of the reference frame as an encoded representation of the reference frame. A reference frame decompression module (105) decodes an encoded portion of the reference frame stored in the reference frame memory (108), so as to obtain a decoded version of the encoded portion of the reference frame.

Abstract: The invention relates to a method for compressing an input data set, wherein the coefficients in the input data set are grouped in groups of coefficients, a number of bit planes,GCLI, needed for representing each group is determined, a quantization is applied,keeping a limited number of bit planes,a prediction mechanism is applied to the GCLIs for obtaining residues, and an entropy encoding of the residues is performed. The entropy-encoded residues, and the bit planes kept allow the decoder to reconstruct the quantized data, at a minimal cost in meta-data.

Abstract: The invention relates to a method for compressing a set of input binary data values x, all coded in a same number B of bits, into a corresponding set of output data values x?, all coded in a smaller number b of bits, obtainable by (i) computing a quantization step size dq dq = 2 B + 1 2 b + 1 - 1 (ii) dividing the range of values [0, 2B?1[, into 2b subranges, the first subrange being [0, INT(dq/2)[ the ith subrange being [INT((i?3/2)*dq)+1, INT((i?1/2)*dq)[, for i going from 2 to 2b The invention also relates to a method for decompressing data and to applications of said method for compressing/decompressing video data, and to devices for performing these operations.

Abstract: The invention provides a method and device for compressing a sequence of signed coefficients wherein coefficients are grouped, for each group, the greatest coded line index (GCLI) is determined, a quantization level t is applied and only the GCLI-t lowest weight bits of the coefficients are copied into the output stream together with the value of the GCLI. According to the invention, sign bits are not coded for coefficient having a zero quantized value. The invention also provides a method for determining a data budget required for compressing a sequence of signed coefficients, in dependence of a quantization level, and a method for compressing an image within the limits of a given data budget constraint. The invention provides a compressed data set coding an image in an efficient way.

Abstract: The invention provides a method for mapping a data stream onto an SDI channel, said data stream comprising a sequence of m-bit words, a range of values from 0 to 2**n?1 and from 2**m?2**n to 2**m?1 being excluded values on said SDI channel. The method comprises the steps of grouping the words to be transmitted, detecting if at least one of the words of the group contains a number of MSB's equal to one, and then recoding these MSBs and adding a constant, in order that no excluded values are obtained. Supplementary bits signal groups that have been recoded.

Abstract: The invention provides a method and device for compressing a sequence of signed coefficients wherein coefficients are grouped, for each group, the greatest coded line index (GCLI) is determined, a quantization level t is applied and only the GCLI-t lowest weight bits of the coefficients are copied into the output stream together with the value of the GCLI. According to the invention, sign bits are not coded for coefficient having a zero quantized value. The invention also provides a method for determining a data budget required for compressing a sequence of signed coefficients, in dependence of a quantization level, and a method for compressing an image within the limits of a given data budget constraint. The invention provides a compressed data set coding an image in an efficient way.

Abstract: The invention relates to a method for compressing a set of input binary data values x, all coded in a same number B of bits, into a corresponding set of output data values x?, all coded in a smaller number b of bits, obtainable by (i) computing a quantization step size dq dq = 2 B + 1 2 b + 1 - 1 (ii) dividing the range of values [0, 2B?1[, into 2b subranges, the first subrange being [0, INT(dq/2)[ the ith subrange being [INT((i?3/2)*dq)+1, INT((i?1/2)*dq)[, for i going from 2 to 2b The invention also relates to a method for decompressing data and to applications of said method for compressing/decompressing video data, and to devices for performing these operations.

Abstract: The invention provides a method for mapping a data stream onto an SDI channel, said data stream comprising a sequence of m-bit words, a range of values from 0 to 2**n?1 and from 2**m?2**n to 2**m?1 being excluded values on said SDI channel. The method comprises the steps of grouping the words to be transmitted, detecting if at least one of the words of the group contains a number of MSB's equal to one, and then recoding these MSBs and adding a constant, in order that no excluded values are obtained. Supplementary bits signal groups that have been recoded.

Abstract: A method and a device compress a display stream wherein coefficients are grouped, for each group, the greatest coded line index (GCLI) is determined and only the GCLI lowest weight bits of the coefficients are copied into the output stream together with the value of the GCLI. The method and device provide a good compression efficiency together with a simple hardware.

Abstract: A method and a device compress a display stream wherein coefficients are grouped, for each group, the greatest coded line index (GCLI) is determined and only the GCLI lowest weight bits of the coefficients are copied into the output stream together with the value of the GCLI. The method and device provide a good compression efficiency together with a simple hardware.