Abstract: Coding quantized transform coefficients as occur in image compression combines a position identifying method to identify the relative position of clusters of consecutive non-zero-valued coefficients, an amplitude event identifying method to identify amplitude events in the clusters of non-zero-valued coefficients, and a coding method to code the position events, amplitude events, and signs of the amplitudes in the clusters. The method is particularly applicable to a series of quantized transform coefficients where clusters are likely-to-occur.

Abstract: A method, and apparatus, and logic encoded in one or more computer-readable tangible medium to carry out a method of determining a breakpoint position in an ordered sequence of quantized transform coefficients of a block of image data for a hybrid variable length coding the ordered sequence. The breakpoint location in the sequence is between a low-frequency region and a high-frequency region. The hybrid variable length coding method includes coding the low-frequency region using a selected low-frequency variable length coding method; coding the high-frequency region using a selected high-frequency variable length coding method; and coding the position in the sequence of the breakpoint. The breakpoint location is determining uses a relatively simple and fast method based on pre-defined cost criteria. A method is included that instead of coding the breakpoint separately, codes the breakpoint jointly with coefficient events.

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 method and apparatus for variable accuracy inter-picture timing specification for digital video encoding is disclosed. Specifically, the present invention discloses a system that allows the relative timing of nearby video pictures to be encoded in a very efficient manner. In one embodiment, the display time difference between a current video picture and a nearby video picture is determined. The display time difference is then encoded into a digital representation of the video picture. In a preferred embodiment, the nearby video picture is the most recently transmitted stored picture. For coding efficiency, the display time difference may be encoded using a variable length coding system or arithmetic coding. In an alternate embodiment, the display time difference is encoded as a power of two to reduce the number of bits transmitted.

Abstract: Methods, medium, and machines which compress, enhance, encode, transmit, decode, decompress and display digital video images. Real time compression is achieved by sub-sampling each frame of a video signal, filtering the pixel values, and encoding. Real time transmission is achieved due to high levels of effective compression. Real time decompression is achieved by decoding and decompressing the encoded data to display high quality images. A receiver can alter various setting including, but not limited to, the format for the compression, image size, frame rate, brightness and contrast. In a Doppler improvement aspect of the invention, Doppler velocity scales are incorporated into grayscale compression methods using two bits. Variable formats may be selected and Doppler encoding can be turned on and off based on the image content. Frames or sets of pixels may be distinguished by automated analysis of the characteristics of an image, such as the presence of Doppler enhanced pixels.

Abstract: A coding method, apparatus, and medium with software encoded thereon to implement a coding method. The coding method includes encoding cluster of consecutive non-zero-valued coefficients, the encoding of a cluster including jointly encoding joint events that each are defined by at least two parameters: the number of zero-valued coefficients preceding the cluster, and the number of non-zero-valued coefficients in the cluster. The encoding of the cluster also includes encoding a parameter indicative of the number of amplitude-1 trailing non-zero-valued coefficients in the cluster, in one version with the parameter indicative of the number of trailing amplitude-1 coefficients part of the joint events such that the coding is according to a 3-dimensional joint variable length coding table. The method further includes encoding the amplitudes of the non-zero-valued coefficients that are not encoded by the joint encoding, e.g., encoding the amplitudes of the other than the trailing amplitude-1 coefficients.

Abstract: A coding method, apparatus, and medium with software encoded thereon to implement a coding method. The coding method includes jointly encoding joint events that each are defined by a cluster of consecutive non-zero-valued coefficients, each joint event defined by three parameters: the number of zero-valued coefficients preceding the cluster, the number of non-zero-valued coefficients in the cluster, and an indication of which trailing coefficients up to a maximum number of M trailing coefficients have amplitude greater than 1, with the coding using a 3-dimensional joint VLC table. The method further includes encoding the amplitude of the non-zero-valued trailing coefficients that have amplitude greater than 1 encoding the amplitude of any remaining non-zero-valued coefficients in the clusters that have more than M non-zero-valued coefficients.

Abstract: Systems and methods generate video fingerprints for video data streams. A collection of sub-fingerprints constitute a fingerprint block. The size and temporal position of the block is chosen to represent the video that is being served. The video server has prior information about the video semantics. Based on this information, the server generates control codes that identify which blocks, based on time/byte offsets, in the sequence best represent the video object. The video receiver is equipped with facilities to generate these fingerprint blocks. The block(s) are sent back to the server. The server is equipped with facilities to verify and record the mismatches with respect to references. The mismatch statistics may be archived for use in a number of applications.

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: An image capturing apparatus for capturing an image with solid state imaging devices may include a compressing section, a memory, a decompressing section, and a signal processing section. The compressing section may compress digitalized data of an image captured with the solid state imaging devices. The memory may temporarily store the compressed image data that is compressed by the compressing section. The decompressing section may decompress the compressed image data that is read out from the memory. The signal processing section may perform an image quality correction operation on the image data decompressed by the decompressing section. The compressed image data may contain a maximum value and a minimum value of pixel data in a block, information regarding positions of the maximum value and the minimum value in the block, and quantized data.

Abstract: The invention is related to a method and a device for encoding of a bit sequence. Said method comprises generating, for each run of Ones comprised in the bit sequence, a unary representation of length of the respective run of Ones, generating a first sequence by concatenating the generated unary representations of lengths of runs of Ones, generating, for each run of Zeroes comprised in the bit sequence, a unary representation of the length of the respective run of Zeroes, generating a second sequence by concatenating the generated unary representations of lengths of runs of Zeroes, and bit plane encoding the generated first and second sequence of unary representations. In most cases, overall entropy of bit planes of unary representations of run lengths is smaller than entropy of the bit sequence. Thus, more compact encoding can be achieved.

Abstract: A graphic data encoding method and apparatus generating a bitstream by encoding a header having at least one piece of first information determined in consideration of a predetermined graphic profile from among multiple pieces of encodable first information; and encoding a payload having at least one piece of second information determined in consideration of the predetermined graphic profile from among multiple pieces of encodable second information. A graphic data decoding method and apparatus decode the generated bitstream. Irrespective of the functions that can be performed by the graphic data encoding apparatus and the functions that can be performed by the graphic data decoding apparatus, the graphic data decoding apparatus, which is in accordance with a graphic profile, can completely restore a 3D mesh model described in the bitstream generated by the graphic data encoding apparatus that is satisfactory to the graphic profile.

Abstract: Methods, medium, and machines which compress, enhance, encode, transmit, decode, decompress and display digital video images in real time. Real time compression is achieved by sub-sampling each frame of a video signal, filtering the pixel values, and encoding. Real time transmission is achieved due to high levels of effective compression. Real time decompression is achieved by decoding and decompressing the encoded data to display high quality images. A receiver can alter various setting including, but not limited to, the format for the compression, image size, frame rate, brightness and contrast.

Abstract: An encoding method of losslessly encoding picture data is disclosed. The picture data are composed of pixel data. The pixel data whose number of quantizer bits is larger than eight bits are separated into a first portion and a second portion. The first portion is composed of eight bits on an LSB side. The second portion is composed of remaining bits on an MSB side excluding the first portion. A first encoding process is losslessly performed for the first portion. A second encoding process is losslessly performed for the second portion. The second encoding process is different from the first encoding process.

Abstract: In one of many possible embodiments, a system for optimizing bit utilization in data encoding is provided. The exemplary system includes a data processing subsystem configured to identify a total number of unique characters within a set of data, which number represents an original base of representation of the set of data. The data processing subsystem is further configured to convert the set of data to a base of representation that is higher than the original base of representation and then encode the base-converted data with a fixed-length encoding scheme.

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: An image representation format for representing a digital image comprises: image information stored as a bitstream representing sequential image blocks, each block comprising one or more components, each component comprising one or more data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions, wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component, and a block information table, which comprises: indicators to the first coefficient of a specified order of each image block in said bitstream, information indicating the number of bits in the bitstream between adjacent coefficients of said specified order of the image block, and the zeroth order coefficient of at least the first data unit of each component, said zeroth order coefficient being represented in a non-differential form.

Abstract: An image processing system includes a coding device configured to code input image data, and a decoding device configured to decode the coded input image data, wherein, if coding and decoding are repeated on the input image data, the image quality of an image corresponding to the input image data is deteriorated. The decoding device includes an input section inputting quantized data in which the input image data is quantized; and a decoding section dequantizing the quantized data that is input by the input section and converting a dequantized value obtained as a result of the quantization into a value in the vicinity of the boundary of a quantization threshold value within a range corresponding to the dequantized value when the quantization is performed.

Abstract: A method, and apparatus, and logic encoded in one or more computer-readable tangible medium to carry out a method. The method is to code an ordered sequence of quantized transform coefficients of a block of image data using a hybrid coding method that includes determining a breakpoint location in the sequence between a low frequency region and a high frequency region; coding the low-frequency region using a selected low-frequency variable length coding method; coding the high-frequency region using a selected high-frequency variable length coding method; and coding the location of the breakpoint. The breakpoint location is determined as a function of the sequence such that different sequences can have different breakpoints.

Abstract: An encoding method includes selecting a run detection method in accordance with characteristics of image data, generating a run value by detecting a run that is repeated in the image data in accordance with the selected run detection method, generating run count bits by counting the number of repetitions of the detected run, and performing a run-length encoding using the detected run values and the run count bits. The run detection method includes a coefficient run detection method that detects a run based on pixel values, a pattern run detection method that detects the run based on whether the pixel blocks have a specified pattern, a difference run detection method that detects the run based on a difference value between two successive pixel values, and a residual run detection method that detects the run based on an error value that is a difference value between an actual pixel value and a predicted value.

Abstract: Prediction-based compression engines are spoon-fed with sequentially efficiently compressible (SEC) streams of input data that make it possible for the compression engines to more efficiently compress or otherwise compact the incoming data than would be possible with streams of input data accepted on a TV-raster scan basis. Various techniques are disclosed for intentionally forming SEC input data streams. Among these are the tight packing of alike files or fragments into concatenation suitcases and the decomposition of files into substantially predictably consistent (SPC) fragments or segments that are routed to different suitcases according to their type. In a graphics-directed embodiment, image frames are partitioned into segment areas that are internally SPC and multidirectional walks (i.e., U-turning walks) are defined in the segment areas where these defined walks are traced during compression and also during decompression.

Abstract: Subtitling aims at the presentation of text information and graphical data, encoded as pixel bitmaps. The size of subtitle bitmaps may exceed video frame dimensions, so that only portions are displayed at a time. The bitmaps are a separate layer lying above the video, e.g. for synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. An advanced adaptation for bitmap encoding for HDTV, e.g. 1920.times.1280 pixels per frame as defined for the Blu-ray Disc Prerecorded format, providing optimized compression results for such subtitling bitmaps, is achieved by a four-stage run length encoding. Shorter or longer sequences of pixels of a preferred color, e.g. transparent, are encoded using the second or third shortest code words, while single pixels of different color are encoded using the shortest code words, and sequences of pixels of equal color use the third or fourth shortest code words.

Abstract: Subtitling aims at the presentation of text information and graphical data, encoded as pixel bitmaps. The size of subtitle bitmaps may exceed video frame dimensions, so that only portions are displayed at a time. The bitmaps are a separate layer lying above the video, e.g. for synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. An advanced adaptation for bitmap encoding for HDTV, e.g. 1920.times.1280 pixels per frame as defined for the Blu-ray Disc Prerecorded format, providing optimized compression results for such subtitling bitmaps, is achieved by a four-stage run length encoding. Shorter or longer sequences of pixels of a preferred color, e.g. transparent, are encoded using the second or third shortest code words, while single pixels of different color are encoded using the shortest code words, and sequences of pixels of equal color use the third or fourth shortest code words.

Abstract: Subtitling aims at the presentation of text information and graphical data, encoded as pixel bitmaps. The size of subtitle bitmaps may exceed video frame dimensions, so that only portions are displayed at a time. The bitmaps are a separate layer lying above the video, e.g. for synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. An advanced adaptation for bitmap encoding for HDTV, e.g. 1920.times.1280 pixels per frame as defined for the Blu-ray Disc Prerecorded format, providing optimized compression results for such subtitling bitmaps, is achieved by a four-stage run length encoding. Shorter or longer sequences of pixels of a preferred color, e.g. transparent, are encoded using the second or third shortest code words, while single pixels of different color are encoded using the shortest code words, and sequences of pixels of equal color use the third or fourth shortest code words.

Abstract: Transform coefficients of sample blocks of a macroblock of a video picture are encoded by adaptively encoding a combination, the number of non-zero coefficients before the trailing one coefficients and the number of trailing one coefficients. The transform coefficients may be further encoded by adaptively encoding one or more of the signs of the trailing one coefficients, the level measures of the interposed in the non-zero coefficients. Adaptive encoding of the number and trailing one coefficients may be performed in view of one or more neighboring sample blocks, whereas adaptive encoding of level measure may be performed in view of quantization parameters of a macroblock and previously encoded level measures. Decoding may be performed in an inverse manner.

Abstract: Coding quantized transform coefficients as occur in image compression combines a position identifying method to identify the relative position of clusters of consecutive non-zero-valued coefficients, an amplitude event identifying method to identify amplitude events in the clusters of non-zero-valued coefficients, and a coding method to code the position events, amplitude events, and signs of the amplitudes in the clusters. The method is particularly applicable to a series of quantized transform coefficients where clusters are likely to occur.

Abstract: Subtitling aims at the presentation of text information and graphical data, encoded as pixel bitmaps. The size of subtitle bitmaps may exceed video frame dimensions, so that only portions are displayed at a time. The bitmaps are a separate layer lying above the video, e.g. for synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. An advanced adaptation for bitmap encoding for HDTV, e.g. 1920.times.1280 pixels per frame as defined for the Blu-ray Disc Prerecorded format, providing optimized compression results for such subtitling bitmaps, is achieved by a four-stage run length encoding. Shorter or longer sequences of pixels of a preferred color, e.g. transparent, are encoded using the second or third shortest code words, while single pixels of different color are encoded using the shortest code words, and sequences of pixels of equal color use the third or fourth shortest code words.

Abstract: Disclosed is an apparatus in which there are provided a first storage unit for storing signals to which indexes are given in order to distinguish each of a plurality of signals that are to be coded; a first index computing unit for computing first indexes of non-zero signals among the signals stored in the first storage unit; a second index computing unit for computing second indexes from a base index and the first indexes; a second index storage position search unit for searching for a storage position in a second storage unit in which the second indexes are to be stored based on values of the indexes stored in the second storage unit; a second index preserving unit for preserving the second index in the second storage unit based on a storage position searched for by the second index storage position search unit; and a control unit for giving the base index to the second index computing unit and for controlling operation of the first index computing unit, the second index computing unit the second index stor

Abstract: A method of compressing a digital image defined by a plurality of pixel values in each of one or more channels includes adjusting each pixel value in each of the one or more channels by an average pixel value for that channel. The method further includes splitting each adjusted channel into one or more image blocks, and converting each image block into a frequency block that is a frequency-domain representation of that image block.

Abstract: An apparatus for compressing an image data with an array of pixels comprising a data length is disclosed. The apparatus comprises a rearranging unit, a transformation operator, a quantizer and a coding operator. The rearranging unit is configured to transform the array to form a rearranged block with a mark value. The transformation operator is configured to obtain transform coefficients of the rearranged block according to a predetermined transformation. The quantizer is configured to quantize the transform coefficients. The coding operator is configured to generate a result data by coding the transform coefficients which is quantized and the mark value according to a predetermined coding method.

Abstract: An image compression apparatus includes: a line memory unit for holding pixel values for at least one immediately previous line in the lines to be processed of an image to be compressed; a division unit for dividing pixels of the line to be processed into 2n-pixel blocks; a first estimation value calculation unit for extrapolation-estimating the 2n-1-th pixel and the 2n-th pixel in the blocks divided, and obtaining an estimated value in processing for the first hierarchical level; a second estimation value calculation unit for interpolation-estimating certain pixels and obtaining an estimated value in the processing for the second hierarchical level through the processing for the n-th hierarchical level; and an estimation coding unit for obtaining an estimation error from the estimated value, converting the estimation error into a quantization number, converting the quantization number into a variable length code, and obtaining a compression code.

Abstract: Embodiments of the present invention provide a coding system that codes data according to a pair of coding chains. A first coding chain generates coded video data that can be decoded by itself to represent a source video sequence of a small size, such as a size sufficient to support the real time playback and display features of a video editing application. The second coding chain generates coded video data representing supplementary data, which when decoded in conjunction with the coded video data of the first coding chain, yields the source video sequence for full-size display. The output of the first coding chain may be stored in memory in a file structure that can be accessed independently of the second chain's output and, therefore, it facilitates real time decoding and playback.

Abstract: An image representation format for representing a digital image including image information stored as a bitstream representing sequential image blocks, each block comprising one or more components, each component comprising one or more data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions, wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component, and a block information table, which comprises: indicators to the first coefficient of a specified order of each image block in the bitstream, information indicating the number of bits in the bitstream between adjacent coefficients of the specified order of the image block, and the zeroth order coefficient of at least the first data unit of each component, the zeroth order coefficient being represented in a non-differential form.

Abstract: Subtitling aims at the presentation of text information and graphical data, encoded as pixel bitmaps. The size of subtitle bitmaps may exceed video frame dimensions, so that only portions are displayed at a time. The bitmaps are a separate layer lying above the video, e.g. for synchronized video subtitles, animations and navigation menus, and therefore contain many transparent pixels. An advanced adaptation for bitmap encoding for HDTV, e.g. 1920.times.1280 pixels per frame as defined for the Blu-ray Disc Prerecorded format, providing optimized compression results for such subtitling bitmaps, is achieved by a four-stage run length encoding. Shorter or longer sequences of pixels of a preferred color, e.g. transparent, are encoded using the second or third shortest code words, while single pixels of different color are encoded using the shortest code words, and sequences of pixels of equal color use the third or fourth shortest code words.

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: Embodiments of the invention provide an instruction that computes the horizontal and vertical values (H,V) based upon the predefined equations. Based upon the horizontal and vertical values (H,V) and the current sign bit being processed at [m,n], the output context and decision pair (CX,D) is determined placed into a destination register.

Abstract: An imaging system incorporating adaptive compression which includes determining linear predictive differential residuals from an imager array pixel row. The differential residuals are classified into categories, each category having a range of differential residuals associated with it. The categories are analyzed to produce an ordered list having categories with most to least frequent residuals falling within a respective residual range associated with a respective category. The ordered list is then used to select a variable length encoding table with a matching ordered list. Variable length encoded category and range position offset data is output to a serializer unit, where the range position offset refers to a position in a range associated with a particular category.

Abstract: The present invention relates to a method and apparatus for synthesizing a plurality of data that is in compressed format. According to one aspect of the present invention, there is provided a method of creating a synthesized data by synthesizing a plurality of source data that is in compressed format, the method including the steps of: extracting a portion of one of the plurality of source data; decompressing the extracted portion to create a decompressed data portion; and synthesizing two or more of the decompressed data portions derived from different ones of the source data to create a part of the synthesized data. The extracting, decompressing and synthesizing step will be repeated until the creation of the synthesized data is completed.

Abstract: A method of decoding CAVLC transform coefficients encoded from an image uses a plurality of registers for storing coefficients and flags and a plurality of MUX devices for selecting data input for corresponding registers. The method includes receiving transform coefficients including first and second encoded data corresponding to an image, generating a trailing-one coefficient with a sign indicated by the first encoded data together with a flag value corresponding to a status of the trailing-one coefficient, and generating a non-trailing zero coefficient according to the second encoded data together with a flag value corresponding to a status of the non-trailing zero coefficient.

Abstract: Methods and systems for compressing an image are described. A plurality of transformed and quantized values associated with a block of image data is accessed. The block corresponds to a position within the image. A count of the number of bits encoded during run-length encoding of the block is made. Run-length encoding of the block is concluded should the count reach a limit.

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: In one of many possible embodiments, a system for optimizing bit utilization in data encoding is provided. The exemplary system includes a data processing subsystem configured to identify a total number of unique characters within a set of data, which number represents an original base of representation of the set of data. The data processing subsystem is further configured to convert the set of data to a base of representation that is higher than the original base of representation and then encode the base-converted data with a fixed-length encoding scheme.

Abstract: The present invention relates to a data compression and decompression system and method for lossless compressing digital data. In one preferred embodiment, the method for handling a data stream having a number of data objects comprising a step of performing a compressing process on a data object based on a compression based value to obtain at least one compressed data result, wherein the data object is considered as one numerical value. The device for handling the data stream comprising a compression means for compressing the data objects according to a compression base value. In another preferred embodiment, the method for handling data having a number of data objects comprising a step of performing a compressing process on a data object by obtaining a compression code for the data object according to a compression coding table, wherein the data object is considered as one numerical value.

Abstract: Entropy coding and decoding techniques are described, which may be implemented separately or in combination. For example, a video encoder uses two-layer run level coding to reduce bitrate for frequency transform coefficients in a quick and efficient manner, and a video decoder uses corresponding two-layer run level decoding. This two-layer coding/decoding can be generalized to more than two layers of run level coding/decoding. The video encoder and decoder exploit common patterns in run level information to reduce code table size and create opportunities for early termination of decoding. Using zoned Huffman code tables helps limit overall table size while still providing a level of adaptivity in encoding and decoding. Using embedded Huffman code tables allows the encoder and decoder to reuse codes for 8×8, 8×4, 4×8, and 4×4 blocks.

Abstract: An image representation format for representing a digital image comprises: image information stored as a bitstream representing sequential image blocks, each block comprising one or more components, each component comprising one or more data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions, wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component, and a block information table, which comprises: indicators to the first coefficient of a specified order of each image block in said bitstream, information indicating the number of bits in the bitstream between adjacent coefficients of said specified order of the image block, and the zeroth order coefficient of at least the first data unit of each component, said zeroth order coefficient being represented in a non-differential form.

Abstract: This data encoding apparatus includes: a prediction unit for calculating a prediction value of target data using read data; a subtractor for calculating a prediction error value, which is the error between the target data and the prediction value; a filtering unit and a subtractor for performing filtering on the prediction error value relating to the target data and a determined prediction error value, to calculate a corrected prediction error value relating to the target data; an absolute value calculation unit for calculating the absolute value of the corrected prediction error value; a k parameter determination unit for determining the code length of a fixed length code part using the flatness and dynamic range of the absolute corrected prediction error value; and a Golomb-Rice encoding unit for encoding the absolute corrected prediction error value by dividing it into a variable length code part and the fixed length code part.

Abstract: An image representation format for representing a digital image comprises: image information stored as a bitstream representing sequential image blocks, each block comprising one or more components, each component comprising one or more data units and each data unit being represented as a Huffman-coded stream of coefficients of basis functions, wherein a zeroth order coefficient is represented as a difference to the previous zeroth order coefficient of the corresponding component, and a block information table, which comprises: indicators to the first coefficient of a specified order of each image block in said bitstream, information indicating the number of bits in the bitstream between adjacent coefficients of said specified order of the image block, and the zeroth order coefficient of at least the first data unit of each component, said zeroth order coefficient being represented in a non-differential form.

Abstract: An apparatus and a method generate a coded block pattern (CBP) of an alpha channel image. An apparatus and a method encode or decode the alpha channel image using the method. The alpha channel image encoding apparatus includes a CBP generator generating a CBP of a first block corresponding to an encoding unit in the alpha channel image by allocating CBPs to a plurality of second blocks that includes the first block; and a bitstream generator generating a bitstream by encoding the CBP or the CBP and pixel values of the second blocks based on the CBP of each of second blocks.

Abstract: When image data to which attribute bits indicating attribute information of each pixel of an image has been attached is compressed, replacement bits for replacing the attribute bits are determined in accordance with the attribute bits. If total size of the attribute bits and image data exceeds a predetermined value, the attribute bits are replaced with the replacement bits and the replacement bits and image data are compressed. A bit string having a compression rate higher than that of the attribute bits before the replacement thereof is used as the replacement bits.

Abstract: Predictive lossless coding provides effective lossless image compression of both photographic and graphics content in image and video media. Predictive lossless coding can operate on a macroblock basis for compatibility with existing image and video codecs. Predictive lossless coding chooses and applies one of multiple available differential pulse-code modulation (DPCM) modes to individual macro-blocks to produce DPCM residuals having a closer to optimal distribution for run-length, Golomb Rice RLGR entropy encoding. This permits effective lossless entropy encoding despite the differing characteristics of photographic and graphics image content.