Abstract: A codec includes an encoder having a quantization level generator that defines a quantization level specific to a block of values (e.g., transform coefficients), a quantizer that quantizes the block of transform coefficients according to the block-specific quantization level, a run-length encoder, and an entropy encoder. The quantization level is defined to result in at least a predetermined number (k) of quantized coefficients having a predetermined value. The amount of data compression by the encoder is proportional to (k). The codec also includes a decoder having entropy and run-length decoding sections whose throughputs are proportional to (k). The decoder takes advantage of this increased throughput by further decoding coefficients in parallel using a plurality of decoding channels. Methods for encoding and decoding data are also disclosed. The invention is well-suited to quantization, entropy, and/or run-length-based codecs, such as JPEG.

Abstract: An image decoding apparatus for decoding a bit stream includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. The image decoding apparatus also includes a dequantization unit that performs a dequantization on the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation. Further, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: A decoding method decodes a bit stream in an image decoding apparatus. The method includes receiving a weight parameter that is added to a luma quantization parameter as the bit stream. The method also includes decoding, in a decoding unit in the image decoding apparatus, the bit stream, and generating a luma component of quantized coefficients and a chroma component of quantized coefficients. Further, the method includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the luma component of quantized coefficients using the luma quantization parameter and the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of the luma quantization parameter weighted by an add operation of the weight parameter. In addition, the method includes performing, in a transform unit in the image decoding apparatus, an inverse orthogonal transform.

Abstract: A decoding method decodes a bit stream in an image decoding apparatus. The method includes decoding, in a decoding unit in the image decoding apparatus, the bit stream, and generating a luma component of quantized coefficients and a chroma component of quantized coefficients. The method also includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the luma component of quantized coefficients and the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by an addition operation.

Abstract: An embedder for embedding a watermark to be embedded into an input information representation comprises an information adder, which is implemented to provide the input information representation with the watermark and additional information to be added to obtain an input information representation provided with the watermark and the additional information. The additional information to be added comprises descriptive information describing the embedding of the at least one watermark into the input information representation.

Abstract: Some aspects of the disclosure relate to a compression technique that can permit determining dynamically a satisfactory quantization matrix based at least on properties intrinsic to a digital object being compressed and a predetermined compression quality criterion, wherein the quantization matrix is associated with a specific space-domain-to-frequency-domain transforms. In one aspect, the compression technique can permit creation of a compressed digital object that can satisfy a predetermined a compression quality criterion.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: A digital watermark embedding apparatus for embedding information, as digital watermark, into an input signal having dimensions equal to or greater than N (N is an integer equal to or greater than 2) and a digital watermark detection apparatus for detecting the digital watermark are disclosed. The digital watermark embedding apparatus generates an embedding sequence based on embedding information, generates a N?1-dimensional pattern based on the embedding sequence, generates N-dimensional embedding pattern by modulating a periodic signal according to a value on the N?1-dimensional pattern, and superimposing the embedding pattern in the input signal and outputs it.

Abstract: A method of providing CABAC compliant changes such as watermarks comprises accessing encoded data such as video which comprise at least two blocks; creating or accessing a list of changes to the encoded data that include a direct change to a block; determining motion character or motion vector differential of non-immediate block, non-immediate blocks being adjacent to an immediate block that are immediately adjacent to the block; determining change to the immediate block based on original motion character of the block and the non-immediate block and the motion character of the block that would result from the application of the change; storing the change to the list if the change does not cause a difference to the immediate block; and evaluating other potential changes if other potential changes are available, wherein the other potential changes are subjected to the same process steps as the direct change.

Abstract: Various implementations are provided for, for example, determining watermarking data, performing the watermarking, and processing watermarked data. At least one implementation watermarks AVC bitstream that uses CAVLC entropy coding. The watermarking data may be determined in a pre-processing stage and stored for later use in watermark a bitstream. One method accesses variable-length encoded data including an encoding of information identifying an actual reference used to predictively encode an image. The encoding of the information has a particular value. The method determines an alternative value that is different from the particular value, such that the alternative value is an encoding of alternative information that identifies a different reference from the actual reference. The alternative value is for use in watermarking the variable-length encoded data.

Abstract: Provided are an apparatus for multi-stage transforming a plurality of unit blocks in multi-dimension that can improve compression efficiency of video data by collecting Discrete Cosine Transforming (DCT) coefficients of neighboring blocks and performing an additional transformation based on the DCT coefficients of an original picture and a differential picture. The method includes the steps of: performing a Discrete Cosine Transform (DCT) on inputted picture data and selecting R blocks of a predetermined size from DCT picture data, where R is a natural number equal to or greater than 2; arranging DCT coefficients of each of the selected R blocks according to each frequency in one-dimension; and performing one-dimensional transformation again on the DCT coefficients arranged in one-dimension.

Abstract: An encoding apparatus encodes an image by tile in a smallest possible size while suppresses segmentation of a specific region in the image into tiles. Vertical lines at left and right ends of n-th face region are defined as boundary candidate vertical lines Lh(n) and Lm(n), and horizontal lines at upper and lower ends of the n-th region, as boundary candidate horizontal lines Lu(n) and Ls(n). A divider determines a horizontal line of another region existing within the range of the horizontal lines Lu(n) and Ls(n) of the n-th region as a line to be deleted. Further, the divider determines a vertical line of another region existing within the range of the vertical lines Lh(n) and Lm(n) as a line to be deleted. This processing is performed to the final region, then image data is divided using horizontal and vertical lines except the lines determined as lines to be deleted.

Abstract: An image processor includes an encoder and a decoder. The encoder includes a frequency transform unit, a pre-filter, and a color conversion unit that converts a pixel signal of a first color space inputted from outside into a pixel signal of a second color space including a luminance signal and chrominance signals. The decoder includes a frequency inverse transform unit, a post-filter, and a color inverse conversion unit that inversely converts a pixel signal of the second color space into a pixel signal of the first color space. The pre-filter performs prefiltering on one or plural specific signals among the luminance and chrominance signals. The post-filter does not perform postfiltering on the above specific signals.

Abstract: Techniques are described to approximate computation of an inverse discrete cosine transform using fixed-point calculations. According to these techniques, matrixes of scaled coefficients are generated by multiplying coefficients in matrixes of encoded coefficients by scale factors. Next, matrixes of biased coefficients are generated by adding a midpoint bias value to a DC coefficient of the matrix of scaled coefficients. Fixed-point arithmetic is then used to apply a transform to the matrixes of biased coefficients. Values in the resulting matrixes are then right-shifted in order to derive matrixes of pixel component values. Matrixes of pixel component values are then combined to create matrixes of pixels. The matrixes of pixels generated by these techniques closely resemble matrixes of pixels decompressed using the ideal inverse discrete cosine transform (“IDCT”).

Abstract: A content compression/compression system and method are disclosed in which a pre-processing step is performed before any compression and a post-processing step is performed once a compressed piece of content is decompressed.

Abstract: An image coding method includes: (i) determining, for each of one or more associated blocks, whether to add a motion vector of the associated block to a list, and (ii) adding the motion vector of the associated block to the list when determining that the motion vector of the associated block is to be added to the list; selecting, from the list, a motion vector which is to be merged to a current block; and (i) merging the selected motion vector to the current block, and (ii) coding the current block using the merged motion vector as a motion vector of the current block, and in the determining, it is determined that the motion vector of the associated block is not to be added to the list when an associated picture and an associated reference picture match temporally or when a current picture and a current reference picture match temporally.

Abstract: An image decoding apparatus for decoding a bit stream includes a receiving unit that receives the bit stream and a weight parameter that is added to a luma quantization parameter. The image decoding apparatus also includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. Further, the image decoding apparatus includes a dequantization unit that performs dequantization on the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of a luma quantization parameter weighted by the weight parameter. In addition, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: A predictive coding method for coding intra of frames is revealed. Firstly, an encoder divides an image frame into a plurality of macroblocks. Then the encoder sets predictive coding models corresponding to these macroblocks according to a ratio. The encoder performs predictive coding for coding each macroblock according to the corresponding predictive coding model so as to get and output a coded image. By the present invention, various predictive coding models are set and applied to code the different macroblocks so as to increase predictive coding efficiency. The intra prediction efficiency and image compression efficiency are improved simultaneously.

Abstract: Microsoft's recently proposed new image compression codec JPEG XR is currently undergoing ISO standardization as JPEG-XR. Even though performance measurements carried out by the JPEG committee indicated that the PSNR performance of JPEG XR is competitive, the visual performance of JPEG XR showed notable deficits, both in subjective and objective tests. This paper introduces various techniques that improve the visual performance of JPEG XR without leaving the current codestream definition. Objective measurements performed by the author indicate that the modified encoder, while staying backwards compatible to the current standard proposition, improves visual performance significantly, and the performance of the modified encoder is similar to JPEG.

Abstract: A decoding method decodes a bit stream in an image decoding apparatus. The method includes receiving a luma quantization parameter and a weight parameter that is added to the luma quantization parameter as the bit stream. The method also includes decoding, in a decoding unit in the image decoding apparatus, the bit stream, and generating a luma component of quantized coefficients and a chroma component of quantized coefficients. Further, the method includes performing, in a dequantization unit in the image decoding apparatus, dequantization on the luma component of quantized coefficients using the luma quantization parameter and the chroma component of quantized coefficients using a chroma quantization parameter calculated on the basis of the luma quantization parameter weighted by an add operation of the weight parameter.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: An image decoding apparatus for decoding a bit stream includes a receiving unit that receives the bit stream and a weight parameter that is added to a luma quantization parameter. Further, the image decoding apparatus includes a decoding unit that decodes the bit stream and generates a chroma component of quantized coefficients. The image decoding apparatus also includes a setting unit that sets a chroma quantization parameter calculated on the basis of the luma quantization parameter weighted by an addition operation that adds the weight parameter. Additionally, the image decoding apparatus includes a dequantization unit that performs dequantization on the chroma component of quantized coefficients using the chroma quantization parameter. In addition, the image decoding apparatus includes a transform unit that performs an inverse orthogonal transform.

Abstract: The present invention relates to an image compression and decompression method, in particular in the areas of computer image processing and data compression. The currently, the process speed for which JPEG (Joint Photographic Experts Group, a compression standard) is applied, it's not all too satisfactory. One aspect of the present invention is simplify compression process based on particular features of an image, thus achieve the aim of accelerate the processing speed. Apply the process described in the present invention, the processing speed for JPEG compression/decompression would rise, without suffers quality reduction compare to current JPEG compression/decompression method.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: This invention relates to the design and implementation of a large family of fast, efficient, hardware-friendly fixed-point multiplierless inverse discrete cosine transforms (IDCT) and the corresponding forward transform counterparts. All of the proposed structures comprises of butterflies and dyadic-rational lifting steps that can be implemented using only shift-and-add operations. The approach also allows the computational scalability with different accuracy-versus-complexity trade-offs. Furthermore, the lifting construction allows a simple construction of the corresponding multiplierless forward DCT, providing bit-exact reconstruction if properly pairing with our proposed IDCT. With appropriately-chosen parameters, all of the disclosed structures can easily pass IEEE-1180 test.

Abstract: Embodiments of the invention are directed toward methods for steganalysis that improve the detection of steganography in texture images. The methods combine features extracted from the image spatial representation and from a block discrete cosine transform (BDCT) representation with multiple different block sizes (i.e., N×N) to improve detection of data hidden in texture images. Image data that is to undergo steganalysis can be provided to embodiments of the invention in at least one of spatial (pixel) and JPEG format. When JPEG format is provided, the image is first decompressed to spatial representation, from which the features are extracted when the block size is at least one 2×2, 4×4, and 16×16. When the block size is 8×8, the JPEG coefficients (JPEG quantized 8×8 BDCT coefficients) derived directly from the JPEG image are used to extract features. In addition, the method is also effective as a universal steganalyzer for both texture and smooth/non-texture images.

Abstract: Provided are a hybrid prediction apparatus and method for entropy encoding that may enhance an existing image compression scheme and prediction scheme by including and selectively using a plurality of predictors configured to perform a per-pixel prediction of an image frame, and may also supplement a performance of a prediction scheme, excessively occurring in a particular pixel.

Abstract: A sequence of n coefficients is compressed by determining a cost-determined sequence of n coefficient indices represented by a cost-determined sequence of (run, index derivative) pairs under a given quantization table and run-index derivative coding distribution, wherein each sequence of (run, index derivative) pairs defines a corresponding sequence of coefficient indices such that (i) each index in the corresponding sequence of coefficient indices is a digital number, (ii) the corresponding sequence of coefficient indices includes a plurality of values including a special value, and (iii) each (run, index derivative) pair defines a run value representing a number of consecutive indices of the special value, and an index-based value derived from a value of the index following the number of consecutive indices of the special value.

Abstract: A method for referencing and interconnecting contents, applications and metadata to an audiovisual content is described, especially for iTV of for distribution on DVD, which comprises the step of inserting a digital watermark into the audiovisual content during an audiovisual content encoding step, the digital watermark being possibly used for allowing a user to reproduce or exploit additional contents supplementing those provided by the audiovisual content, wherein the digital watermark is inserted into the audiovisual content as data frame with header and body by subdividing it into a plurality of consecutive ‘I’ frames and forcing the parity of LSBs of mid-frequency providing an auxiliary watermark channel, e.g. in an MPEG2 transport stream.

Abstract: A method and system for embedding and recovering a spatial fingerprint in a sequence of video frames. The sequence includes marked frames that include marked groups having markable positions. The embedding method selects a frame offset and marking period for the marked frames, and determines a marking strength for modifying each marked group. A portion of the spatial fingerprint is embedded in each marked group of a first subgroup of the marked groups, and an ordering of the portion embedded in the first subgroup is embedded in each marked group of a second subgroup of the marked groups. The recovering method analyzes a quality ratio of the DCT transform energy and the residual for each markable position in the frame to determine whether the frame is a marked frame. The recovering method recovers the spatial fingerprint when the marked groups maintain the quality ratio in a number of successive marked frames.

Abstract: An encoding method encodes a first image signal of a first view and a second image signal of a second view. The method includes encoding the first image signal to generate a base stream. The method also includes encoding the second image signal to generate a dependent stream, and inserting a dependent delimiter indicating a picture boundary between pictures in the dependent stream at the beginning of a picture in the dependent stream.

Abstract: An image data decoding device includes a determination unit, a first pixel value generating unit, and a second pixel value generating unit. The determination unit receives compressed image data including information of one DC component, information of frequency components and a block end code for each block of an image as a result of frequency analysis and determines whether the block consists of the DC component and the block end code. The first pixel value generating unit performs inverse operation to the frequency analysis to generate pixel values of the block when the block is determined as not consisting of the DC component and the block end code. The second pixel value generating unit generates one and the same pixel value for all pixels of each block based on information of the DC component when the block is determined as consisting of the DC component and block end code.

Abstract: Methods, apparatuses and systems directed to frequency domain transforms, including fast integer transforms and directional integer transforms. Further disclosed is a video codec that utilizes a novel class of fast integer and directional transforms.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: A method, system and computer program product for optimal encoding for an image defined by image data. The quantization table, run-length coding and Huffman codebook are selected to minimize a Lagrangian cost function, wherein the minimization includes iteratively determining the optimal run-size pairs and in-category indices for minimizing a rate-distortion cost function, and wherein the rate-distortion cost function includes a perceptual weighting factor applied to a quantization error. The perceptual weighting factor adjusts the rate-distortion cost function to apply greater weight to lower frequency quantization error than to higher frequency quantization error.

Abstract: An imaging system may include an image sensor and an image encoder that encodes images from the image sensor with fixed output sizes and frame rates. The image encoder may encode images from the image sensor into an image format such as a Joint Photographic Experts Group (JPEG) format. The image encoder may insert padding data between image blocks in the encoded data to compensate in real time for variations in the encoded size of an image. The amount of padding data inserted by the encoder may be calculated to ensure the encoded image has a file size close to, but not greater than, the required fixed output size. If needed, the encoder may add additional padding data after the image blocks are encoded in a blanking period before a subsequent image is encoded so that the final size of the encoded image is equal to the required output size.

Abstract: A method for encoding video with a two-dimensional (2D) transform separable to two one-dimensional (1D) transforms. The method receives an array of values for a sub-section of an image, performs a first 1D-transform of the array, transposes the resulting array, and performs a second 1D-transform of the array resulting from the transpose. The method, without performing another transpose, generates a data stream using a transposed scan order based on the values of the array resulting from the second transform. A method for decoding video encoded by a 2D transform, which separable to two 1D transforms. The method receives a data stream containing encoded values for an image, parses out the values into an array using a transposed scan order, performs a first 1D-inverse transform on the array, transposes the resulting array, and performs a second 1D-inverse transform of the array resulting from the transpose to produce a decoded output.

Abstract: Detecting a change between images is performed more effectively when a measure of change is used for the detection that depends on a length of the code blocks to which the images are individually entropy-encoded, and which are allocated to different sections of the respective image, since the length of these code blocks is also available without decoding. This uses the fact that the length or amount of data of a code block directly depends, in large parts, on the entropy and hence on the complexity of the allocated image section, and that changes between images are, with high probability, also reflected in a change of complexity.

Abstract: A method, system and computer software product for improving rate-distortion performance while remaining faithful to JPEG/MPEG syntax, involving joint optimization of Huffman tables, quantization step sizes and quantized coefficients of a JPEG/MPEG encoder. This involves finding the optimal coefficient indices in the form of (run, size) pairs. By employing an interative process including this search for optimal coefficient indices, joint improvement of run-length coding, Huffman coding and quantization table selection may be achieved. Additionally, the compression of quantized DC coefficients may also be improved using a trellis-structure.

Abstract: A decoding method decodes a base stream generated by encoding a first image signal of a first view and a dependent stream generated by encoding a second image signal of a second view. The method includes detecting, on the basis of a dependent delimiter indicating a picture boundary between pictures in the dependent stream, the picture boundary in the dependent stream configured by inserting the dependent delimiter at the beginning of a picture in the dependent stream. Further, the method includes decoding the base stream and the dependent stream on the basis of the detected picture boundary in the dependent stream.

Abstract: An image processing system that can reduce the amount of operations for compression processing includes a characteristic region detecting section that detects a characteristic region from an image and a compressing section that compresses the image by compressing each prescribed partial region. The compressing section compresses an image of a partial region included in a characteristic region by using pixel values of pixels, the number of which is larger than the number of pixels used for compressing an image of a partial region included in a region other than the characteristic region.

Abstract: Disclosed are a method and apparatus for encoding and decoding an image. The image encoding method includes: generating a first frequency coefficient matrix by performing spatial transform (e.g. discrete cosine transform (DCT) on a current block; determining an angle parameter based on whether the current block is intra or inter predicted; generating a second frequency coefficient matrix by performing a partial switch between at least one of rows and columns of the first frequency coefficient matrix based on the determined angle parameter; and encoding the second frequency coefficient matrix and information about the angle parameter.

Abstract: A Method and apparatus for encoding and decoding a multi-view image are provided. The method of encoding a multi-view image includes determining whether each of pictures included in multi-view image sequences is a reference picture referred to by other pictures included in the multi-view image sequences for inter-view prediction, and encoding the pictures using at least one of inter-view prediction and temporal prediction based on the determination result, thereby efficiently encoding and decoding the multi-view image at high speed.

Abstract: Provided are methods and apparatuses for transforming and inverse-transforming an image. The method of transforming an image includes: generating a substituted N×N transformation matrix by substituting elements of an N×N transformation matrix used for a 1-dimensional (1D) discrete cosine transform (DCT) of a N×N block of the image with values based on N variables, where N is an integer; obtaining a multiplication matrix of the substituted N×N transformation matrix and a transposed matrix of the substituted N×N transformation matrix; obtaining the N variables that enable a sum of squares of elements excluding diagonal components of the obtained multiplication matrix to be a minimum; and transforming the N×N block by using the substituted N×N transformation matrix, which is substituted with the values based on the obtained N variables.

Abstract: There is provided a system, a computer program product, program storage device readable by machine, and a method of downsizing an input disjoint block level encoded image. According to examples of the presently disclosed subject matter, the method can include calculating a DCT downsize ratio for downsizing the input image in a DCT domain according to a target downsize ratio and according to a size of a DCT transform length associated with the input image; adapting an I-DCT according to the DCT domain downsize ratios; performing the adapted I-DCT; providing an intermediate image as output of a DCT domain process; and applying a pixel domain interpolation to the intermediate image according to dimensions of the intermediate image and according to dimensions of the target image.

Abstract: An apparatus and method for reducing noise in a high definition image are provided. When performing wavelet shrinkage for reducing noise, a signal level of an image may be estimated by adjusting a kernel size, and a noise level of the image may be estimated using a noise level function. After the signal level and the noise level are estimated, the noise may be removed or reduced, based on the signal level and the noise level, and the detail of the image may be maintained.

Abstract: The invention is related to a method for compressing images. The proposed method comprises associating perceptual importance parameters with pixels of the image, applying a transform on the image, partitioning the transformed image into code blocks and encoding coefficient bits of a given code block together from a most significant bit plane towards a least significant bit plane, wherein encoding of at least one coefficient is truncated at a truncation bit plane depending on the perceptual importance parameter associated with the pixel to which said code block coefficient corresponds. Truncating encoding of coefficients in dependency on the perceptual importance of the pixel associated with the coefficient allows for truncating coefficients corresponding to perceptually less important pixels at more significant bit planes. So, the overall perceptual quality of the compressed image is enhanced.

Abstract: A decoding method decodes a bit stream including a base stream and a dependent stream. The method includes decoding, by identifying a start position of a picture in the base stream based on an access unit delimiter indicating a boundary between access units in the base stream at the beginning of a picture in the base stream, the base stream configured by inserting the access unit delimiter as a NAL unit including nal_unit_type. The method also includes decoding, by identifying a start position of a picture in the dependent stream based on a dependent delimiter indicating a picture boundary between pictures in the dependent stream at the beginning of a picture in the dependent stream, the dependent stream configured by inserting the dependent delimiter as a NAL unit including nal_unit_type with a value which is different from the nal_unit_type of the access unit delimiter.

Abstract: An exemplary embodiment of the invention relates to a method of using pattern vectors for image coding and decoding. The method comprises converting a block of image data into a set of transform coefficients, quantizing the transform coefficients such that a number of the coefficients become zero, constructing a single entity or bit vector indicating which coefficients are non-zero, coding the single entity or bit vector as an integer using an adaptive, semi-adaptive or non-adaptive arithmetic coder, coding the values of the coefficients in any fixed order, using an adaptive, semi-adaptive or non-adaptive arithmetic coder, or some other coder, and coding all coefficients except the zero coefficients. The system and method of decoding data relate to the corresponding hardware and process steps performed by the decoder when decoding a bitstream coded as described herein.

Abstract: A decompression system for DCT-base compressed graphic data with transparent attribute includes a memory to store a compressed graphic data and a compressed mask data; a controller to read the compressed graphic data and the compressed mask data out of the memory; a first decompressor to decompress the compressed graphic data and generate a first color space image signal; a color space transformation device to transform the first color space image signal into a second color space image signal; a special color signal storage to store a plurality of special color signals; a second decompressor to decompress the compressed mask data and generate a select signal; and a first multiplexer to select the second color space image signal or a special color signal to output based on the select signal, wherein each special color signal indicates a different level of transparent attribute.