Abstract: Digital video data streams that conform to standards such as the ITU-T H.263 and MPEG-4 ISO/IEC standards are compressed to reduce the amount of memory needed to store these streams. Information for groups of pixels are compressed into segments of encoded information. Each segment of encoded information includes luminance values that are rounded and truncated, the full-length values of chrominance information for the first pixel in the group, and codes that represent differences in chrominance values between adjacent pixels in the remainder of the group. A special “escape” code is used to represent the chrominance value for a pixel whenever the difference in chrominance values between that pixel and the preceding pixel exceeds a threshold.

Abstract: Digital video data streams that conform to standards such as the ITU-T H.263 and MPEG-4 ISO/IEC standards are compressed to reduce the amount of memory needed to store these streams. Information for a sequence of frames is compressed by rounding and truncating luminance values, and by encoding chrominance values using a radix tree and a palette. Each entry in the palette stores information representing a color that actually occurs at least once in the sequence of frames. The radix tree provides an efficient way to generate compressed representations for colors that are stored in the palette, and also provides a way to identify the color in the palette that is the closest match to other colors in the data stream that are not stored in the palette.

Abstract: Efficient techniques/algorithms for finding the maximum and/or minimum of a two-dimensional m×n sliding window, including a 3×3 sliding window, that take advantage of the redundant information between slides and eliminate unnecessary comparisons. The number of comparisons required are significantly reduced, making the algorithms computationally efficient.

Abstract: Digital video data streams that conform to standards such as the ITU-T H.263 and MPEG-4 ISO/IEC standards are compressed to reduce the amount of memory needed to store these streams. Information for groups of pixels are compressed into segments of encoded information. Each segment of encoded information includes luminance values that are rounded and truncated, the full-length values of chrominance information for the first pixel in the group, and codes that represent differences in chrominance values between adjacent pixels in the remainder of the group. A special “escape” code is used to represent the chrominance value for a pixel whenever the difference in chrominance values between that pixel and the preceding pixel exceeds a threshold.

Abstract: Digital video data streams that conform to standards such as the ITU-T H.263 and MPEG-4 ISO/IEC standards are compressed to reduce the amount of memory needed to store these streams. Information for a sequence of frames is compressed by rounding and truncating luminance values, and by encoding chrominance values using a radix tree and a palette. Each entry in the palette stores information representing a color that actually occurs at least once in the sequence of frames. The radix tree provides an efficient way to generate compressed representations for colors that are stored in the palette, and also provides a way to identify the color in the palette that is the closest match to other colors in the data stream that are not stored in the palette.

Abstract: A program for decoding variable-length codes like Huffman codes is generated by receiving information describing a particular coding scheme that defines an association between source symbols and the variable-length codes, generating a binary tree that represents the coding scheme, generating a lookup table from the binary tree that can be used to decode variable-length codes having a length less than or equal to a threshold length, and processing the binary tree and the lookup table to generate the decode program.