Abstract: An image processing apparatus includes an image partitioning unit that partitions an image represented by input image information into image partitions, each containing plural pixels; a run coding unit that run-length encodes image partitions for which all pixels contained in any of the image partitions match with a pixel value in a predetermined position in another image partition; and an independently coding unit that encodes image partitions other than image partitions encoded by the run coding unit, so that the resulting codes are decoded independently for each image partition.

Abstract: An integrated memory controller (IMC) preferably sits on the main CPU bus or a high speed system peripheral bus and couples to system memory. The IMC may use a lossless data compression and decompression scheme for improved performance. The IMC may also include microcode for specific decompression of particular data formats such as digital video and digital audio. Compressed data may be decompressed in the IMC and stored into system memory or saved in the system memory in compressed format. Internal memory mapping may allow for formal definition spaces which may define the format of the data and the data type to be read or written. Software overrides may be placed in applications software in systems that desire to control data decompression at the software application level.

Abstract: A system and method for updating a display unit remotely located from a computing system are described. The method includes copying display information from a video buffer of a computing device executing an application to generate a display update, calculating a size of the display update, and determining an amount of available bandwidth of a network connecting the computing device and the display unit. The method also includes calculating a time period required to communicate the display update from the computing device to the display unit, transmitting the display update to the display; and repeating the method after the time period has elapsed.

Abstract: An image processing method is provided. The image processing method includes obtaining a least significant bit (LSB) associated with a pixel block. Further, two bits are reduced from a bit number of each of the pixels of the pixel block. Thereafter whether to carry the pixel or not is determined according to the LSB. When the LSB is 01 or 11, the carry manners of each pixel of the pixel block in two consecutive frames are asymmetric one to another. Further, under the conditions of when the LSB is 01 and 11, respectively, the carry manners of the pixels of the pixel block mutually compensate. Therefore, the display performance of a display is improved.

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: An image compression apparatus performs quantization of DC component data, low-pass component data and high-pass component data which are generated by frequency conversion of still image data. An extracting part extracts additional data and coding object data which is to be entropy coded, from quantization data. An entropy coding part performs entropy coding of the coding object data stored in a coding object data memory. An additional data processing part generates a flex bit from the additional data. A pattern information generation part acquires the coding object data directly from the extracting part, to generate pattern information indicating whether the coding object data is zero or not. A bit stream generation part outputs the pattern information, the coding object data and the flex bit in a predetermined order, to output a bit stream.

Abstract: Lossless image compression is performed by receiving and opening an original image file representing an image. A pixel path is determined in the image by analyzing one or more complex structures in the image. The one or more complex structures are represented using a mathematical expression. Each of the pixels along the determined pixel path is replaced to minimize the complex structure, thus providing a compressed image file having a smaller file size than the original image file. A comment is inserted in the compressed image file specifying the determined pixel path. The compressed image file is stored on a computer-readable storage medium.

Abstract: A system and method of color data compression may perform variations of MRC compression including taking into consideration means and/or variances within k×k cells of an image, background texture, background smoothed color, and gradient components for determination of which parts of an image belong to the background and foreground MRC layers, for calculating thresholds values for such determinations, and determining correctness of determined thresholds and polarity, and may determine the background and foreground layer colors based on the variances, the gradient components, and neighboring pixels of non-color-assigned pixels of the background and foreground layers.

Abstract: A method and an arrangement for improving the digital-signal-generated grayscale resolution of a monochrome visual display unit (3) to which the digital signals from an image source (1) can be supplied over n-bit wide RGB channels (2). Measures are proposed that make it possible to display distinguishable grayscale gradations on the visual display unit (3) regardless of whether a grayscale signal (6; 10) or RGB color signals (12, 13, 14) are transmitted to the visual display unit (3).

Abstract: A method and apparatus for coding an image by using exponential Golomb binarization are provided. The method comprises: performing entropy coding on an input image by performing exponential Golomb binarization using a plurality of predetermined thresholds; measuring a bit rate of a bit stream which is generated by performing the entropy coding using each threshold; and determining an optimal threshold by comparing bit rates with regard to the thresholds.

Abstract: An image compression and decompression method compresses data based upon the data states, and decompresses the compressed data based upon the codes generated during the compression.

Abstract: An output device which outputs pixel data corresponding to a color material used by a printing unit to the printing unit includes an image buffer which stores image data, a generation unit which generates density data corresponding to the color material based on image data read out from the image buffer, a print buffer which stores density data generated by the generation unit, and a conversion unit which converts density data read out from the print buffer into pixel data corresponding to the resolution of the printing unit synchronously with the printing unit.

Abstract: Provided is a method and apparatus for compressing a text and an image. When compressing the text and image, it is possible to group valid lines with data into each line having a common element, and compress and encode the data of the valid lines. Accordingly, it is possible to reduce a data loss that may occur in a tactical communication environment with a poor channel state due to a bit sleep or a burst error. In the case of the text, it is possible to perform lossless compression on only a valid line with data and thereby improve compression efficiency. In the case of the image, it is possible to perform loss compression on valid lines, and then restore the partially damaged data using an ECC even when data is partially damaged. Accordingly, it is possible to improve compression efficiency and the entire data transmission success rate.

Abstract: An information retrieval apparatus includes an acquiring unit that acquires a numerical value defining a boundary of a numerical range; a detecting unit that detects a number of places in and a head numeral of the numerical value; an extracting unit that extracts from a bit string group, a bit string indicating whether a numerical value in a numerical value group having the number of places and the head numeral is present in files subject to retrieval; a specifying unit that specifies a file corresponding to a bit in the extracted bit string, the bit indicating the presence of a numerical value of the numerical value group; a determining unit that determines whether a numerical value in the specified file meets the boundary condition; and a designating unit that, based on a determination by the determining unit designates the specified file to have a numerical value within the numerical range.

Abstract: The invention provides a development processing apparatus that performs development processing on the basis of an image file that contains undeveloped image data created by a digital camera and accompanying image data that accompanies the undeveloped image data. The accompanying image data is image data that has been subjected to development. The development processing apparatus includes an actual development processing section that creates actually developed image data conforming to a predetermined format from the undeveloped image data. A first analysis-purpose image generating section is provided that creates a first analysis-purpose image data having a predetermined resolution by performing development processing on the undeveloped image data. A second analysis-purpose image generating section is provided that creates a second analysis-purpose image data having a predetermined resolution from the accompanying image data.

Abstract: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.

Abstract: Exemplary methods, computer systems, and computer program products for processing a previously compressed data stream in a computer environment are provided. In one embodiment, the computer environment is configured for separating a previously compressed data stream into an input data block including a header input block having a previously compressed header. Sequences of bits are included with the input data block. Compression scheme information is derived from the previously compressed header. The input data block is accessed and recompressed following the header input block in the previously compressed data stream one at a time using block-image synchronization information. Access to the block-image synchronization information is initialized by the compression scheme information to generate an output data block. The block-image synchronization information is used to provide decompression information to facilitate decompression of the results of the output data block.

Abstract: A method of compressing a sequence of strokes input at an input device of a processing system is provided in which each stroke input at the input device is represented as a series of digital words representing x and y co-ordinates, a reference co-ordinate of each stroke is expressed in absolute terms, and a co-ordinate other than the reference co-ordinate is expressed as an offset from a preceding co-ordinate by combining a residual error value and an estimate calculated from the previous m co-ordinates using the formula: a ~ n = ? i = 1 m ? ? c i ? a n - i where ci are coefficients selected to model characteristics of the input strokes, and ? represents either an x or a y co-ordinate.

Abstract: A technique for prioritizing portions of compressed multi-resolution medical image data to be processed. More relevant portions of medical image data are compressed at a higher resolution than less relevant portions of medical image data. A mask is created from the image data and used to assign data compression quality factors to corresponding image blocks in the image data. The image data in each region is compressed based on their assigned quality factor. During processing of the compressed image data, the compressed image data and the mask are accessed. The mask is used to direct the processing of the compressed image data. Depending upon the application, the mask can be used to direct that the image data for the regions of most relevance be processed before the image data for the regions of lesser relevance. However, the mask can be used to direct that the image data for the regions of lesser relevance be processed before the image data for the regions of most relevance.

Abstract: Disclosed are methods and devices for compressing and decompressing video data streams, according to which the statistical relationship between image symbols and the context assigned thereto is used for compression. Particularly disclosed is a context-sensitive encoding unit in which the image symbols filed in an image storage are assigned to different encoding branches via a context switch, where they are encoded and compressed by a Golomb encoder and a run length encoder.

Abstract: A method and apparatus of improving the compression efficiency of a motion vector by efficiently predicting a motion vector in an enhancement layer from a motion vector in a base layer in a video coding method using a multi-layer are provided.

Abstract: A method and an apparatus to encode a series of quantized coefficients of a transform of a block of image data. The transform is such that 0 is the most likely coefficient amplitude and 1 is the next most likely coefficient amplitude. The method includes forming symbols (called events) from the series of quantized transform coefficients. An event is a run of none or more zero-valued coefficients followed by a run of one of a predefined set of sequences, each sequence in the set being either a single coefficient of amplitude greater than one, or a sequence of 1's and 0's starting with a coefficient of amplitude 1. The method includes forming a codeword for each formed event. Relatively short codewords are formed to represent events that are relatively more likely to occur, and relatively long codewords are formed to represent events that are relatively less likely to occur.

Abstract: A display panel driver including a compression circuit configured to, when receiving image data of a set of pixels of a target block, generate compressed image data corresponding to the target block by compressing the image data, the number of the set of pixels being equal to or more than four, an image memory configured to store the compressed image data, a decompression circuit configured to generate decompressed image data by decompressing the compressed image data reading from the image memory, and a drive circuit configured to drive a display panel in response to the decompressed image data, wherein the compression circuit selects one of a plurality of compression methods based on a correlation between the image data of the set of pixels of the target block, and generates the compressed image data by using the selected compression method.

Abstract: An image processing apparatus and method capable of compressing a current image using one of a plurality of compression algorithms based upon similarity (or fluctuation level) between a previous image and the current image are discussed.

Abstract: An encoder encoding an Nth pixel data of 2×M pixel data and a decoder decoding an Nth encoded pixel data of 2×M encoded pixel data are provided. A first to an Mth pixel data are belonged to an (i?1)th data block. An (M+1)th to a (2×M)th pixel data are belonged to an ith data block. i>1. M<N?2×M. If the Nth pixel data is similar to one of the (N?1)th pixel data, the local minimum or maximum of the (i?1)th data block, the encoder encodes the difference between the Nth pixel data and the similar one into the Nth encoded pixel data. When decoding the Nth encoded pixel data, the decoder adds the Nth encoded pixel data to one of a (N?1)th decoded pixel data, local minimum and maximum of a (i?1)th decoded block data.

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 processing apparatus that creates a still image from a motion picture. A storage section has a storage region for correction required when a target image with a predetermined determination size is corrected by using a plurality of images. A size determining section determines whether or not the size of the target image designated as a still image is equal to or smaller than the determination size. An image extracting section extracts from the motion picture a plurality of images including a target image designated as a still image and a first image for correction used when performing correction using a plurality of images.

Abstract: A method is provided for decoding a data stream representing an object with at least three dimensions, associated with a basic mesh including of an assembly of facets defined by an assembly of vertices and ridges, and with wavelet coefficients corresponding to the local modifications of the basic mesh, indexed each by a vertex of the basic mesh. For at least some wavelet coefficients of the data stream, the method includes the following steps: determining an orientation of an edge bearing the vertex indexing the wavelet coefficients, called an orientation of the wavelet coefficient; and determining, based on the orientation, information for locating in the basic mesh at least one child of the wavelet coefficient, distinct locating rules being associated with each orientation, so as to extract a data stream of at least some of the wavelet coefficients, associated each with locating information.

Abstract: A computer-implemented method for image adaptation includes accepting a digitally-represented input image and a target size requirement. The input image is modified by optimally determining at least one of a resolution of the input image and a quality of the input image, the quality defining an amount of information allocated to represent each pixel value of the input image, so as to produce a compressed output image meeting the target size requirement.

Abstract: An image compression method with random access capability. The method includes intracoding of digital images. The image is partitioned into small blocks and each block is coded independently of other blocks in the image. The encoder generates a fixed and predetermined number of bits for each block. The decoding of each image block is able to be done independently of any other image block.

Abstract: Techniques and tools are described for compensating for rounding when estimating sample-domain distortion in the transform domain. For example, a video encoder estimates pixel-domain distortion in the transform domain for a block of transform coefficients after compensating for rounding in the DC coefficient of the block. In this way, the video encoder improves the accuracy of pixel-domain distortion estimation but retains the computational advantages of performing the estimation in the transform domain. Rounding compensation includes, for example, looking up an index (from a de-quantized transform coefficient) in a rounding offset table to determine a rounding offset, then adjusting the coefficient by the offset. Other techniques and tools described herein are directed to creating rounding offset tables and encoders that make encoding decisions after considering rounding effects that occur after an inverse frequency transform on de-quantized transform coefficient values.

Abstract: The invention relates to compression of a pixel block (300) of depth values. A reference codeword (410) is determined as a representation of a reference depth value. A row (420) and a column (430) slope codeword are determined as representations of a basic depth slope for the rows (310) and columns (320) in the block (300), respectively. Representations indicating pixel positions where a slope change occurs along at least a portion of a row (310) or column (320) is determined for at least a subset of the rows (310) or columns (320). A mode codeword (440) is determined as a representation of a set of multiple slope correction patterns. A respect pattern codeword (450) is then selected for rows (310) or columns (320) as identifier of one of the slope correction patterns.

Abstract: A method for encoding an image, the encoding being a mixed encoding with the possibility of using a first lossless compression type, and a second lossy compression type, the method including: dividing the image into a plurality of elementary blocks; determining which elementary blocks have a high level of detail; allocating the first type of compression to each elementary block that has a high level of detail; allocating the second compression type to each elementary block that does not have a high level of detail; applying the first type of compression to each elementary block to which the first compression type has been allocated; applying the first compression type to each elementary block directly surrounded by two elementary blocks to which the first compression type has been allocated.

Abstract: An image processing apparatus segments an image into a plurality of regions in accordance with attributes of a plurality of types, and acquires feature amount data from image information of a region of a first attribute (an image region) from among the plurality of regions. The apparatus then applies compression processing to the image and acquires compressed data. The apparatus outputs the acquired feature amount data and compressed data as output data of the image.

Abstract: Forced compression halftone processes and forced compression techniques may be used to forcibly compress page raster images passed between a Digital Front End (DFE) processor and a Continuous Feed (CF) printer within a CF printing system. If a DFE processor determines that a compressed image size exceeds a static or dynamically predetermined threshold, the DFE processor may re-render the image using a “forced compression” halftone process, such as 2-to-1 forced compression, 4-to-1 forced compression, reduced resolution, etc. Once the page raster image has been re-rendered, the DFE processor may use a forced compression technique, which is complimentary to the applied “forced compression” halftone process to re-compress the page raster image. The approach allows page raster images to be compressed to meet interface bandwidth constraints associated with the physical interface between the DFE processor and CF print engine, thereby allowing otherwise unprintable jobs to be printed with reasonable quality.

Abstract: A color image residue transform and/or inverse transform method and apparatus, and a color image encoding and/or decoding method and apparatus using the same are provided. The residue transform method includes: obtaining a residue corresponding to the difference of an original image and a predicted image; and transforming the residue by using a relation between residues of color image components. The residue inverse transform method includes: generating a residue for each component by performing residue inverse transform of the residue transformed original image; and restoring the original image by adding a predicted image to the residue of each component. Also, the color image lossless encoding method using the residue transform includes: obtaining a residue corresponding to the difference of an original image and a predicted image; and performing encoding by transforming the residue by using the relation between residues of predetermined components.

Abstract: An image signal processing apparatus, the method and a camera system are provided, by which highly efficient processing close to 1-path processing can be performed without deteriorating a picture quality or taking too much time for the processing, a capacity required for a compression rate, band and memory in the worst case can be assured and a random accessing property is not impaired when compressing image data: wherein the apparatus has at least a first signal processing unit, a second signal processing unit, and a storage unit accessed by the first signal processing unit and the second signal processing unit; wherein the first signal processing unit includes at its interface part with the storage unit a band compression expansion unit having functions of compressing input image data based on a predetermined band compression method, writing the same in the storage unit, and expands compressed data read from the storage unit.

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: Provided are a method, system, and article of manufacture for generating subimages of an image to use to represent the image. A determination is made of a pixel location on one axis of an image comprising a plurality of pixels. The image is divided into multiple subimages at the determined pixel location on the axis. A determination is made as to whether each subimage can be cropped to remove regions of white pixels from the subimage. Each subimage is cropped to remove a region of white pixels in response to determining that the subimage can be cropped. An image file is generated defining the image including the subimages.

Abstract: M×N attribute data for M×N pixels, where M and N are integer multiple of “L” are input. Data expressed by L bits are encoded, A first encoding control step supplies the M×N attribute data to be encoded in an input order, causing encoding to be executed. A second encoding control step converts the M×N attribute data input into bit planes of bit 0 to bit L?1, extracts L-bit data from one converted bit plane, and supplies the extracted L-bit data for each bit plane, causing encoding to be executed. An amount of encoded data generated by the encoding under the control of the first encoding control step is compared with an amount of encoded data generated in the encoding under the control of the second encoding control step, and encoded data with a smaller amount are selected. The selected encoded data and identification information representing the selected data are then output.

Abstract: An apparatus for recording image data has an encoding processor that compresses original image data (for example, RAW data), having a plurality of pixels, in accordance with a lossless compression coding; and a recording processor that records the compressed image data or the original image data into a memory. If the size of the compressed image data is larger than that of the original image data, the recording processor records the original image data into the memory without carrying out a compression process.

Abstract: A method, system, and computer program product for a multi-resolution storage scheme for historical data are provided. The method includes dividing the historical data into a plurality of time frames and determining an amount of compression for each of the time frames, where at least two of the time frames have a different amount of compression. The method further includes applying the amount of compression to each of the time frames, resulting in multi-resolution historical data, and storing the multi-resolution historical data.

Abstract: Disclosed is a system and method for determining, in parallel on a graphics processing unit, a block compression case which results in a least error to a block. Once determined, the block compression case may be used to compress the block.

Abstract: The invention is related to lossless compression of prefix-suffix-codes wherein a prefix comprises unary code, and to corresponding decompression. The method for lossless compressing prefix-suffix-codes comprises the steps of forming a first contiguous bit sequence from the prefixes, and lossless compressing the first contiguous bit sequence by removing redundancy related to the difference between the first value's frequency in the first contiguous bit sequence and the second value's frequency in the first contiguous bit sequence. Bit values are unevenly distributed in the prefixes while distribution of bit values in the suffixes is more even. Therefore, better compression is achievable if the prefixes are compressed separately.

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: Methods, circuits, and apparatus for reducing memory bandwidth used by a graphics processor. Uncompressed tiles are read from a display buffer portion of a graphics memory and received by an encoder. The uncompressed tiles are compressed and written back to the graphics memory. When a tile is needed again before it has been modified, the compressed version is read from memory, uncompressed, and displayed. To reduce the number of unnecessary writes of compressed tiles to memory, a tile is only written to memory if it has remained static for some number of refresh cycles. Also, to prevent a large number of compressed tiles being written to the display buffer in one refresh cycle, the encoder can be throttled after a number of tiles have been written. Validity information can be stored for use by a CRTC. If a tile is updated, the validity information is updated such that invalid compressed data is not read from memory and displayed.

Abstract: An apparatus and a method of lossless coding and decoding are provided. The apparatus to perform lossless coding may selectively perform an arithmetic coding scheme or a Huffman coding scheme with respect to a symbol. The apparatus to perform lossless coding may generate a bitstream including a first coding bit, generated according to the Huffman coding scheme. Such bitstream may include a reserved bit for the arithmetic coding scheme.

Abstract: M×N attribute data for M×N pixels, where M and N are integer multiple of “L” are input. Data expressed by L bits are encoded, A first encoding control step supplies the M×N attribute data to be encoded in an input order, causing encoding to be executed. A second encoding control step converts the M×N attribute data input into bit planes of bit 0 to bit L?1, extracts L-bit data from one converted bit plane, and supplies the extracted L-bit data for each bit plane, causing encoding to be executed. An amount of encoded data generated by the encoding under the control of the first encoding control step is compared with an amount of encoded data generated in the encoding under the control of the second encoding control step, and encoded data with a smaller amount are selected. The selected encoded data and identification information representing the selected data are then output.

Abstract: An image processing apparatus has a storage unit for storing uncompressed data, a compression processing unit for performing lossless compression and lossy compression on the uncompressed data, a memory controller for reading the uncompressed data from the storage unit and writing compressed data compressed by the compression processing unit and a control unit for controlling transfer of the uncompressed data stored in the storage unit to the compression processing unit, wherein the compression processing unit has one DMA and simultaneously executes the lossless compression and the lossy compression, and wherein the control unit uses the DMA to successively transfer a rectangular region, constituted by a predetermined number of pixels in a main scanning line direction and a predetermined number of pixels in a sub-scanning line direction, of the uncompressed data from the storage unit to the compression processing unit for each rectangular region, and after uncompressed data on a main scanning line is transfer

Abstract: The invention relates to a method as well as a system, a device, an encoder and a decoder, and a computer software product for image processing by the method. In the invention, the number of bits is limited in the bit string of a pixel to be processed, wherein the pixel is encoded with the limited number of bits. A prediction value corresponding to said pixel is searched for. If it is found, the difference between the pixel and the prediction value is determined, to select the method for encoding the bit string of said pixel. Also, a code word is encoded in the bit string, to indicate the selected encoding method. If the prediction value is missing, the number of bits in said pixel is limited by quantizing. By means of the invention, a fixed number of bits is obtained for all encoded pixels in an image.