Abstract: An apparatus and method for limiting bit rate of compressed data is disclosed. The apparatus and method allows the generation of parameters for encoding digital image data based on the data bit rate resulting from the use of different parameters. In one embodiment, a statistical analysis is performed to determine the different parameters. The use of parameters results in a bit rate that would prevent a decoder to stall during decompression while allowing the encoder compress without affecting the quality. Therefore, a more efficient encoding and decoding can be achieved.

Abstract: An apparatus and method for encoding quantized frequency represented data, the data comprising zero and non-zero represented data is claimed. For zero represented data, a zero run length is determined. A Golomb parameter is determined as a function of the zero run length. A quotient is encoded as a function of the zero run length and the Golomb parameter. A remainder is encoded as a function of the zero run length, the Golomb parameter and the quotient. The coded quotient and the coded remainder are concatenated. For non-zero represented data, the nonzero data is encoded as a function of the non-zero data value and the sign of the non-zero data value.

Abstract: An apparatus and method for limiting bit rate of compressed data is disclosed. The apparatus and method allows the generation of parameters for encoding digital image data based on the data bit rate resulting from the use of different parameters. In one embodiment, a statistical analysis is performed to determine the different parameters. The use of parameters results in a bit rate that would prevent a decoder to stall during decompression while allowing the encoder compress without affecting the quality. Therefore, a more efficient encoding and decoding can be achieved.

Abstract: An apparatus and method for encoding quantized frequency represented data, the data including zero and non-zero represented data. For zero represented data, a zero run length is determined. A Golomb parameter is determined as a logarithmic function of the zero run length. A quotient is encoded as a function of the zero run length and the Golomb parameter. A remainder is encoded as a function of the zero run length, the Golomb parameter and the quotient. The coded quotient and the coded remainder are concatenated.

Abstract: A method of losslessly decoding signals representing an image is claimed. A lossy compressed data file and a residual compressed data file are received. The lossy compressed data file is separated into DC coefficients and AC coefficients, and decoded, separately, to the determine DC values and the AC values. The DC values and the AC values are inverse quantized to produce lossy, decompressed data. The residual compressed data file is decoded to produce a residual decompressed data. The lossy decompressed frequency data is combined with the residual decompressed data to produce a lossless data file, wherein the lossless data file is substantially the same as the original image.

Abstract: A method of losslessly compressing and encoding signals representing image information is claimed. A lossy compressed data file and a residual compressed data file are generated. When the lossy compressed data file and the residual compressed data file are combined, a lossless data file that is substantially identical to the original data file is created.

Abstract: A system and method for quality-based image compression utilizing adaptively sized blocks and sub-blocks of discrete cosine transform coefficient data and a quality based quantization scale factor is claimed. A block size assignment element in an encoder element selects the block or sub-block of an input block of pixel data to be processed. Blocks with variances larger than a threshold are subdivided, while blocks with variances smaller than a threshold are not subdivided. A transform element transforms the pixel values of the selected blocks into the frequency domain. The frequency domain values are quantized either on a block by block basis or a frame by frame basis utilizing a scale factor that correlates with the quality of the image. The data is then serialized and coded in preparation for transmission.

Abstract: An apparatus for adding a watermark to a moving image as it is displayed comprises a watermark generator in which data representing a watermark is generated. The watermark contains at least one of location data and time data pertaining to the displaying of the moving image. The location and time data is protected by forward error encoding. The watermark also contains at least one of program data identifying the moving image and frame data unique in identifying each frame of the moving image. The program and time data is protected by scrambling. A watermark applicator applies the watermark data to image data representing substantially all of the moving image depending on a characteristic, such as amplitude, of the data.

Abstract: An apparatus and method for limiting bit rate of compressed data is disclosed. The apparatus and method allows the generation of parameters for encoding digital image data based on the data bit rate resulting from the use of different parameters. In one embodiment, a statistical analysis is performed to determine the different parameters. The use of parameters results in a bit rate that would prevent a decoder to stall during decompression while allowing the encoder compress without affecting the quality. Therefore, a more efficient encoding and decoding can be achieved.

Abstract: A system and method for quality-based image compression utilizing adaptively sized blocks and sub-blocks of discrete cosine transform coefficient data and a quality based quantization scale factor is claimed. A block size assignment element in an encoder element selects the block or sub-block of an input block of pixel data to be processed. Blocks with variances larger than a threshold are subdivided, while blocks with variances smaller than a threshold are not subdivided. A transform element transforms the pixel values of the selected blocks into the frequency domain. The frequency domain values are quantized either on a block by block basis or a frame by frame basis utilizing a scale factor that correlates with the quality of the image. The data is then serialized and coded in preparation for transmission.

Abstract: An apparatus and method for encoding quantized frequency represented data, the data comprising zero and non-zero represented data is claimed. For zero represented data, a zero run length is determined. A Golomb parameter is determined as a function of the zero run length. A quotient is encoded as a function of the zero run length and the Golomb parameter. A remainder is encoded as a function of the zero run length, the Golomb parameter and the quotient. The coded quotient and the coded remainder are concatenated. For non-zero represented data, the nonzero data is encoded as a function of the non-zero data value and the sign of the non-zero data value.

Abstract: An apparatus for adding a watermark to a moving image as it is displayed comprises a watermark generator in which data representing a watermark is generated. The watermark contains at least one of location data and time data pertaining to the displaying of the moving image. The location and time data is protected by forward error encoding. The watermark also contains at least one of program data identifying the moving image and frame data unique in identifying each frame of the moving image. The program and time data is protected by scrambling. A watermark applicator applies the watermark data to image data representing substantially all of the moving image depending on a characteristic, such as amplitude, of the data.

Abstract: An apparatus and method to encode the run-lengths and amplitude of the quantized DCT coefficients in a lossless manner is used to achieve compression. Specifically, Golomb-Rice coding is used to encode both zero runs and non-zero amplitudes of the DCT coefficients after quantization. It is found that the use of a scheme taking advantage of an exponential distribution of data, such as Golomb-Rice coding, allows for higher coding efficiencies than alternate schemes.

Abstract: An apparatus and method for determining a block size assignment for a block of pixels is claimed. A mean for a given block of pixels and a neighborhood mean for adjacent blocks of pixels is determined. A contrast ratio is then determined, as a function of the mean and the neighborhood mean. A variance threshold is determined as a function of the contrast ratio. Then, various sub-block sizes within the block of pixels is determined as a function of the variance threshold. As such, a pixel block is considered in the context of adjacent pixel blocks rather than in isolation, which narrows the spread of block variances and allows for a more robust subdivision of pixel blocks.

Abstract: An apparatus for adding a watermark to a moving image as it is displayed comprises a watermark generator in which data representing a watermark is generated. The watermark contains at least one of location data and time data pertaining to the displaying of the moving image. The location and time data is protected by forward error encoding. The watermark also contains at least one of program data identifying the moving image and frame data unique in identifying each frame of the moving image. The program and time data is protected by scrambling. A watermark applicator applies the watermark data to image data representing substantially all of the moving image depending on a characteristic, such as amplitude, of the data.

Abstract: An apparatus and method of serializing frequency based image data in a digital cinema system is described. At least one group of data that may be represented as a 16×16 block of data is compiled. Alternatively, a frame of data is compiled. The group of data is divided into four groups, each which may be represented as an 8×8 blocks. Each of the four 8×8 blocks of data are serialized using zig-zag scanning vertical scanning, and/or horizontal scanning.

Abstract: An apparatus and method for encoding quantized frequency represented data, the data comprising zero and non-zero represented data is claimed. For zero represented data, a zero run length is determined. A Golomb parameter is determined as a function of the zero run length. A quotient is encoded as a function of the zero run length and the Golomb parameter. A remainder is encoded as a function of the zero run length, the Golomb parameter and the quotient. The coded quotient and the coded remainder are concatenated. For non-zero represented data, the nonzero data is encoded as a function of the non-zero data value and the sign of the non-zero data value.

Abstract: An apparatus and method for limiting bit rate of compressed data is disclosed. The apparatus and method allows the generation of parameters for encoding digital image data based on the data bit rate resulting from the use of different parameters. In one embodiment, a statistical analysis is performed to determine the different parameters. The use of parameters results in a bit rate that would prevent a decoder to stall during decompression while allowing the encoder compress without affecting the quality. Therefore, a more efficient encoding and decoding can be achieved.

Abstract: An apparatus and method for determining a block size assignment for a block of pixels is claimed. A mean for a given block of pixels and a neighborhood mean for adjacent blocks of pixels is determined. A contrast ratio is then determined, as a function of the mean and the neighborhood mean. A variance threshold is determined as a function of the contrast ratio. Then, various sub-block sizes within the block of pixels is determined as a function of the variance threshold. As such, a pixel block is considered in the context of adjacent pixel blocks rather than in isolation, which narrows the spread of block variances and allows for a more robust subdivision of pixel blocks.

Abstract: An apparatus and method for encoding quantized frequency represented data wherein the data comprised zero and non-zero represented data. For zero represented data, a zero run length is determined. A Golomb parameter is determined as a function of the zero run length. A quotient is encoded as a function of the zero run length, and the Golomb parameter. A remainder is encoded as a function of the zero run length, the Golomb parameter and the quotient. The coded quotient and the coded remainder are concatenated. For non-zero represented data, the nonzero data is encoded as a function of the non-zero data value and the sign of the non-zero data value.