Abstract: A system and method are provided for compressing video frames having a plurality of pixels. The video frames are viewable by an end user on a display. The method can include the operation of receiving a color palette from a key frame of video. Then a color value can be identified from the color palette. The pixels within a current frame that use the same color value that has been identified can then be selected. A further operation is grouping a color value together with frame coordinates of each pixel that uses the color value following the color value.

Abstract: A method and system are provided for code normalization and byte construction. A plurality of subsets of bits is extracted from a first input. Each of the subsets of bits has a bit width equaling a number of leading zeros from a second input variable. Further, a consecutive sequence of the plurality of subsets is stored in a memory. In addition, the consecutive sequence of the plurality of subsets is read from the memory if a third input release flag is established.

Abstract: A digital decoding apparatus and method receives a compression-coded digital signal in predetermined units and decodes the received compression-coded digital signal in the predetermined units. The compressed received digital signal is coded in the predetermined units with updating a table of probability of occurrence which is assigned for each coding symbol. An arithmetic decoding unit initializes a decoding process when decoding of signal in the predetermined units is started, based on information of initializing the table of probability of occurrence which is multiplexed on a header of data for the predetermined units.

Abstract: A Joint Bi-level Image Group (JBIG) coding and decoding system, which provides a series of fully serial and parallel computational combinations in arithmetic coding and decoding to thereby reduce the complexity of JBIG arithmetic encoder and decoder and increase the processing speed. The JBIG coding system receives pixels and contexts of an image datastream and performs an adaptive arithmetic coding on the pixels in accordance with a pre-stored table and a probability prediction table for further performing a non-distortion compression on the image datastream. The JBIG decoding system receives data and contexts of a compressed datastream and performs an adaptive arithmetic decoding on the data of the compressed datastream in accordance with the pre-stored table and the probability prediction table to thereby obtain an image datastream.

Abstract: A method for encoding a video frame or picture comprises dividing up the video frame or the picture in portions of a first type associated with a first scanning pattern, and portions of a second type associated with a second scanning pattern. Data corresponding to a predetermined of the portions of the video frame or picture is transformed into a two-dimensional transform coefficient array. Fhe transform coefficients are precoded in order to obtain transform data units. One of a first and a second set of context models is chosen depending on as to whether the predetermined portion is a portion of a type being associated with the first or the second scanning pattern. One context model of the chosen one of the first and the second set of context models is assigned to the transform data unit based on the scanning position assigned to the predetermined transform coefficient.

Abstract: This invention is a JPEG2000 arithmetic encoder with improvements to conventional JPEG2000 encoder implementations. This invention decouples co-efficient bit modeling from arithmetic encoding, eliminates the RENORME while loop through least most bit detection, decouples encoding from BYTEOUT, exploits parallelism across conditional execution paths, uses look-up table storage and packing of context state data and eliminates memory dependencies through direct register forwarding.

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: A circuit generally including a first module, a second module and a third module is disclosed. The first module may be configured to (i) generate a plurality of parsed residual blocks by parsing a plurality of 4×4 CAVLC (context-based adaptive variable length coding) residual blocks received in an input signal and (ii) generate a plurality of metric signals resulting from the parsing of the 4×4 CAVLC residual blocks. The second module configured to generate a plurality of scanning position signals based on the metric signals. The third module configured to generating an 8×8 CABAC (context-based adaptive binary arithmetic coding) residual block in an output signal by up-sampling the parsed residual blocks based on the scanning position signals.

Abstract: A method of context adaptive binary arithmetic coding (CABAC) of a sequence of data slices permits for quick initialization of context models. The data slices include a plurality of binarized symbols with context individual values having one or more bins of the binarized symbol. The method includes resetting an addressable status register for each new data slice where the status register includes status flag for one of a plurality of available context variable values. Context models are selected for each of a plurality of context individual values and are coded according to a selected context model. A selected context model is updated for an actual context index value based on the previous context index value.

Abstract: Described is an image compression technology by which a coefficient representative of a chrominance component corresponding to an (x, y) coordinate pair is coded into a symbol, along with plurality of context events associated with that symbol, to facilitate more efficient context-based arithmetic coding. For example, four context events may be generated, including one context event based on the corresponding (x, y) coefficient value in the luminance component, and three context events based on other luminance coefficients that have adjacent horizontal, vertical and diagonal relationships with the corresponding luminance component's coefficient, respectively. In one example implementation, coding the chrominance coefficient and computing the plurality of context events occurs in a zero coding pass of an entropy coder. A sign coding pass and a magnitude refinement pass may be performed to obtain further symbols for the context-based arithmetic coding.

Abstract: In a pipeline machine where, in an iterative process, one or more subsequent functions employ one or more parameters determined by one or more antecedent functions and the one or more subsequent functions generate one or more parameters for the one or more antecedent functions, pipeline dependency is reduced by advancing or rotating the iterative process by preliminarily providing to the subsequent function the next one or more parameters on which it is dependent and thereafter: generating by the subsequent function, in response to the one or more parameters on which is it dependent, the next one or more parameters required by the one or more antecedent functions and then, generating by the one or more antecedent functions, in response to the one or more parameters required by the one or more antecedent functions, the next one or more parameters for input to the subsequent function for the next iteration.

Abstract: When performing arithmetic processing on unprocessed image data with use of a target pixel and reference pixels in its proximity, buffers of a number corresponding to the number of lines required for the arithmetic processing, which are a first buffer and a second buffer, are used as intermediate storage units. Each buffer has a capacity that is smaller than a size of a line of the unprocessed image data and equal to or larger than a size required for the arithmetic processing in a main scanning direction. In each arithmetic processing, a pixel from each line in the unprocessed image data is input one by one to a storage region at the right end of a corresponding buffer, and a pixel is read and output from each position of each buffer that is determined according to a positional relationship between a target pixel and its reference pixel. Each time arithmetic processing is performed in each line, data is shifted one pixel from the right end to the left end in the first buffer and the second buffer.

Abstract: A device for video decoding is disclosed. It includes at least a pipeline scheduler, a decoding core, a segmented context memory and a context cache. The pipeline scheduler and the decoding core could decrease the time taken in a code-decoding period. The segmented context memory and the context cache could reduce accessing time of reading and writing context values.

Abstract: A method of image compression with wavelet transforms applied locally rather than globally by image component partitioning into independently transformed macroblocks plus overlapping data for filter length compensation.

Abstract: The data conversion device of the present invention includes: a coding section for replacing (i) one or more components constituting the display data of each pixel and other one or more components constituting display data of a pixel existing around that pixel on a screen with (ii) one or more average values of both the components so as to reduce an amount of data; and a decoding section for reading out compressed data from a frame memory and then allotting the average value as display data for each corresponding pixel. Therefore, unlike a case of adopting a conventional general data compression method, the data conversion device of the present invention can prevent deviation between original display data and display data obtained by a compression/restoration process from becoming large.

Abstract: An image forming apparatus having a reading unit which reads image information on an original, a first compression unit which compresses the image information into compressed image information, a first encoding unit which encodes the compressed image information, an interface unit which acquires printing information in a page description language from exterior, a generating unit which generates printing image information on the basis of the printing information, a second compression unit which compresses the printing image information into compressed printing image information, a second encoding unit which encodes the compressed printing image information, a decoding expansion unit which decodes and expands the encoded compressed image information and the encoded compressed printing image information, and a forming unit which forms an image onto a recording medium on the basis of the image information and the printing image information which have been decoded and expanded.

Abstract: In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset.

Abstract: An image encoding apparatus encodes an image signal according to a JPEG2000 standard. A wavelet converter in the image encoding apparatus acquires a plurality of conversion coefficients by performing wavelet conversion on the image signal. A modeling unit in the image encoding apparatus generates a plurality of symbols representing the plurality of conversion coefficients and a plurality of contexts by performing a modeling process on the plurality of conversion coefficients obtained by the wavelet converter. An arithmetic encoder in the image encoding apparatus discriminates whether each of the symbols is an MPS (More Probable Symbol) or LPS (Less Probable Symbol). In a case where it is discriminated that the symbol is an MPS, the arithmetic encoder executes CODEMPS. In a case where it is discriminated that the symbol is an LPS, the arithmetic encoder executes CODEMPS executes either CODEMPS or CODELPS according to a predetermined condition.

Abstract: An arithmetic decoding method and apparatus are provided. The apparatus includes an arithmetic decoding apparatus comprising an arithmetic decoding unit determining a range of a most probable symbol and a range of a least probable symbol required to decode a current symbol, comparing a current offset and the range of the most probable symbol required to decode the current symbol, and determining and outputting the value of the current symbol. The apparatus also includes a predicted arithmetic decoding unit determining a range of a most probable symbol and a range of a least probable symbol which are required to decode a next symbol using a prediction that the current symbol is the most probable symbol, comparing a next offset and the range of the most probable symbol required to decode the next symbol, and determining and outputting a range of the next symbol.

Abstract: In the decoder of binary arithmetic code of the present invention, the decoding and reverse binarization of arithmetic code are separated and a large intermediate buffer is interposed. The decoding of arithmetic code is first carried out at the time of input of a stream, whereby the arithmetic code can be decoded at the maximum input bit rate of the decoder. The obtained binary symbol string is first held in the intermediate buffer, following which the reverse binarization from the binary symbol string to multivalued symbols is carried out matched to the processing of the block decoder of the next stage.

Abstract: A signal encoding method according to the present invention is a signal encoding method of dividing a coding target signal as an object of coding into partition units and performing arithmetic coding based on probability-related information in the partition units, which comprises (1) a configuration information deriving step of analyzing the coding target signal in each of the partition units to derive as configuration information, information about an initial value of the probability-related information used for the arithmetic coding of the coding target signal in the partition unit in question; (2) a coding step of performing the arithmetic coding of the coding target signal in each of the partition units, based on the configuration information derived in the configuration information deriving step; and (3) a configuration information adding step of adding a header containing the configuration information to the arithmetic-coded signal in each of the partition units.

Abstract: A method for encoding a syntax element contained in a precoded video signal into a coded bit stream, the precoded video signal representing at least one video frame, the syntax element being associated with a predetermined portion of the video frame and being indicative of as to whether the predetermined portion of the video frame is precoded in a first or a second way into the precoded video signal is described. The method comprises investigating as to whether a neighboring portion of the video frame neighboring the predetermined portion is precoded in the first way or the second way, in order to obtain a binary value; assigning one of at least two context models to the predetermined portion of the video frame based on the binary value, wherein each context model is associated with a different probability estimation; and arithmetically encoding the syntax element into the coded bit stream based on the probability estimation with which the assigned context model is associated.

Abstract: A system for speeding up the arithmetic coding processing and method thereof is used in a calculating method in which when the input data are two successive same pixel values and the context values (CX) thereof. The output interval size A and base C are determined by adding a set of operation circuits and a set of speed-up tables, such that the A, C values which needed two clock cycles previously may be calculated within a clock cycle, thereby achieving the object of speeding up the arithmetic coding processing.

Abstract: A display device having a liquid crystal display element (30) transmitting light projected from a light source to an watching point side, and including pixels (31) forming a first image region and a second image region, and an image separation filter (32) disposed from the pixels (31) through glasses (33, 34) each with a specified thickness and forming a first image separation mechanism and a second image separation mechanism, in which a calculation for obtaining the disposing interval (P1, P3) of each of the above-described image separation mechanisms of the image separation filter (32) is carried out on the basis of angles of elevation ?k+1, ?k, angles ?k+1, ?k, thicknesses W1, W2 and refractive index n of the glasses (33, 34), a distance D from the watching point to the display device, and an interval (P2) between the image regions of the above-described pixels (31) to dispose the image separation mechanisms of the above-described filter (32) with the obtained P1, P3.

Abstract: According to one embodiment, a method for compensating for inadequate bit resolution in a light processing system includes receiving a plurality of values each indicative of an intensity level for a pixel to be displayed. Each of the values is represented by a plurality of bits of data. The method also includes determining a quantization step size for the plurality of bits of data. For at least one particular pixel of the pixels, a set of consecutive pixels including the particular pixel is selected. The method also includes determining a difference between the value associated with the particular pixel in the set and each value associated with the other pixels in the set, and also determining that all of the determined differences are less than or equal to the quantization step size. In response, a filtered value for the particular pixel in the set is generated based at least on some of the pixels in the set in addition to the particular pixel.

Abstract: Methods, structures and systems for encoding and decoding isosurface data. An encoder process takes volume data and an isolevel as input and produces compressed isosurface data as output. The compressed isosurface data produced by an encoder process is composed of an occupancy image record, an optional intersection points record, and an optional normal vectors record. An occupancy image is compressed with a context-based arithmetic encoder. Compressed isosurface data can be stored in a data storage device or transmitted through a communication medium to a remote computer system, where the decoder process is executed. The decoder processes take compressed surface data as input and produce surface data as output. The decoder processes first reconstructs the occupancy image by decoding the occupancy image record. An in-core isosurface decoder process produces a polygon mesh as a surface representation. An out-of-core isosurface decoder process produces a set of oriented points as a surface representation.

Abstract: Orthogonal transform coefficients D6, which are image data of a coded object, are generated by performing predetermined data transform operations on frame image D1 (Step S100), and coded data D7 is generated (S103) by subjecting the orthogonal transform coefficients D6 to arithmetic coding using a predetermined probability table. Then, in variable-length coding for generating the coded data D7, it is set whether or not a probability table is initialized at the slice layer, and a flag indicating the presence of the initialization is added to a header of a predetermined layer. Thus, the image coding method, image decoding method, image coding apparatus, image decoding apparatus, program, computer data signal, and image transmission system, which are capable of enhancing data compression efficiency by coded data in a manner that a probability table is suitably set over the entire coded data, are realized.

Abstract: An bit-plane coding pass generator is provided in which for SP-pass processing quantization coefficient of each code block divided into bit planes, “significant (S)” or “non-significant (N)” data in a predetermined area and those around the area and compared with an S/N matching pattern. The S/N matching pattern has been set when a jump can be made from an arbitrary sample point to a next sample point to be processed by SP pass. The jump is made to the next sample point to be processed by SP pass according to a jump address value obtained from a pattern coincident with a current S/N matching pattern. Thus, by reducing the time for the significant propagation (SP) pass defined in JPEG-2000, a code block can be coded at a higher speed by three coding passes.

Abstract: A method of compressing and decompressing images is disclosed for applications in compression and decompression chips with the JBIG standard. The pipeline of computing a pixel is divided into three parts: memory access, numerical operations, renormalization and byteout/bytein. Each steps takes a work cycle; therefore, three pixels are processed in parallel at the same time. In comparison, the work cycle of the prior art without pipeline improvement is longer. This method can effectively shorten the work cycle of each image data process, increasing the speed of compressing and decompressing image data.

Abstract: The present invention aims to increase an encoding efficiency when the occurrence probability of LPS (less probable symbol) is low. An encoding apparatus has a interval size (A), a interval limit value (C), divides a set interval which is set on a number line, selects a sub-interval corresponding to an occurring symbol, updates the interval size (A) and the interval limit value (C) with a limited precision based on the selected sub-interval size, and encodes a coordinate within the interval. Based on the probability (the occurrence probability of symbol) output from a learning memory, the sub-interval size (LSZ, dLSZ) and the sub-interval limit value are obtained.

Abstract: The invention concerns a digital data compression encoder, characterized in that it comprises: an input for a first data flow (SH), and a second data flow (SL), an encoding module, matching symbols of the first data flow, and code words, wherein, for certain symbols, there exist several words, called redundant, corresponding to the same symbol, and a processing module for encoding the symbols of the first data flow based on the correspondence, by selecting among the redundant words, on the basis of at least part of the second data flow.

Abstract: A signal encoding method according to the present invention is a signal encoding method of dividing a coding target signal as an object of coding into partition units and performing arithmetic coding based on probability-related information in the partition units, which comprises (1) a configuration information deriving step of analyzing the coding target signal in each of the partition units to derive as configuration information, information about an initial value of the probability-related information used for the arithmetic coding of the coding target signal in the partition unit in question; (2) a coding step of performing the arithmetic coding of the coding target signal in each of the partition units, based on the configuration information derived in the configuration information deriving step; and (3) a configuration information adding step of adding a header containing the configuration information to the arithmetic-coded signal in each of the partition units.

Abstract: Context-based adapative binary arithmetic coding (CABAC), as used in video standards such as H.264/AVC, with a renormalization of the interval low value plus range that includes partitioning of the bits of the low value to provide output bits plus low value update without bit-level iterations or aggregation of output bits until a full byte can be output.

Abstract: An image coding device for reducing flicker noise in moving image coding based on Motion JPEG-2000, which applies wavelet transform to an input image, quantizes the wavelet transform coefficients, and replaces quantization coefficients of adjacent frames in accordance with a predetermined judgment condition. The device spreads the finally output quantization coefficients into bit-planes from the MSB to LSB, generates coding passes in each bit-plane, performs arithmetic coding in the coding passes, controls the code quantity to a target code quantity from the generated arithmetic codes, and generates a packet of the image data by attaching a header to the arithmetic codes. The quantization coefficients are replaced based on a difference of absolute values of the quantization coefficients at the same sub-band in the adjacent frames. By further adding the wavelet transform coefficients, erroneous detection in the substitution processing can be decreased and the flicker noise can be suppressed effectively.

Abstract: A system, method and algorithm for performing statistical analysis on an input data source to determine an optimal token size resulting in an increased ratio value is described. Changes to the values of the tokens prior to compression may result in an overall compression increase even if the data source has been previously compressed. Specific techniques for modifying the tokens include varying the base size, rearrangement of the tokens, and modifications by matrix multiplication. After modification of the tokens, compression of the data using one or more lossless compression methods may be performed. The technique may be repeated by using the output of previous compression processes as input to additional entropy and compression optimization.

Abstract: A method for serving an image from a server to a client, e.g., a computer having a browser or other graphics viewing engine. The user of the client first specifies a set of one or more bitmap characteristics for an image transfer, with at least one of the bitmap characteristics including a number of bits per pixel. Preferably, this specification is accomplished using an applet or other piece of code that is downloaded to the client from the server. Later, when the server receives a client request that includes data identifying a specified bitmap characteristic, a server processing routine (e.g., a servlet) generates a version of the image that conforms to the specified bitmap characteristic. This version is then delivered back to the client in response to the original request. In this way, the user of the client machine can control the particular characteristics of the image files that are delivered to his or her machine.

Abstract: Transform coefficients of sample blocks of a macroblock of a video picture are encoded by adaptively encoding in 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 non-zero coefficients, the total number of zero coefficients interposed in the non-zero coefficients, and the respective run lengths of the 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 measures 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: A plurality of signal processing functions are achieved with the same arithmetic processing circuit by controlling wiring arrangements or signal modulation in accordance with a predetermined arrangement control signal that is output based on circuit arrangement information read from a circuit arrangement information storage unit. Hierarchical parallel processing is realized with small-scale circuit configuration. Further, detection of a predetermined feature and integration of the detection results can be efficiently performed.

Abstract: A plurality of compression schemes are provided that achieve improved compression ratios. A first embodiment provides for compression of each pixel by one of a plurality of different entropy-based compression schemes based upon a probability cost analysis. A second embodiment provides for compression of each pixel based on a hybrid context formed using a plurality of compression schemes for improved probability determination, and thus improved entropy encoding. In embodiments of the invention, a context compression scheme similar to JBIG is applied, as well as an inverse scheme. The context scheme forms a statistical context from a concatenated sequence of previous pixel values. The inverse scheme provides a gray value estimation method based upon previous pixel values and respective threshold values. Statistics are maintained with respect to the actual current pixel value and the difference between an estimated gray value and the current pixel threshold value.

Abstract: The present invention includes methods and apparatus for attaining high speed coding and decoding. A first method decreases the number of memory access times by performing signal format conversion, orthogonal transform and continuous variable-length coding with predetermined small areas in a frame used as units. A second method omits orthogonal transform computation by using orthogonal transform coefficients to shorten the processing time. A third method uses additions and subtractions for orthogonal transform thereby decreasing the number of registers used and reducing the number of memory access times. The present invention further includes a decoding method for variable-length decoding wherein table size is not made larger because the number of table access times per code word is set to a maximum of 2, and plural code words are decoded by one table access operation to attain high-speed decoding.

Abstract: Archival storage and retrieval of audio/video information is described. Audio and/or video information is digitized, compressed and stored in an intermediate archive format (IAF), which preserves the content at a high-enough quality for subsequent retrieval and conversion into various formats required at the time of use or distribution. A single capture operation is performed with ancillary metadata being added to facilitate subsequent searching, indexing and format conversion. Captured data content is catalogued and indexed at or subsequent to the creation of an IAF file that includes the archived information. The IAF includes a family of audio-video digital encoding formats based on public standards. The encoding format used in any particular application is determined at encoding time from information provided by the archive system user. At encoding, the particular encoding scheme is selected to optimize a tradeoff between storage constraints and end use quality requirements.

Abstract: An image coding apparatus corresponding to a standard scheme of binary image compression and having the compression efficiency of a gray scale image improved includes: a bit plane generator (303) dividing unitary image data into a plurality of bit planes determined according to the number of bits forming each pixel, an image preprocessor (305) connected to the bit plane generator (303) to arrange bit data of the same position forming a plurality of bit planes in close proximity to combine into a single bit plane, and a data compressor (306) connected to the image preprocessor (305) to compress an image of the single bit plane.

Abstract: The image coding device comprises data adding means for adding specific data to input image data at the end of image data, and arithmetic coding unit not issuing remaining output code of code register after coding of final input data. In this constitution, increase of circuit scale can be suppressed and decline of operation clock can be prevented.

Abstract: An imaging apparatus includes an input that receives a stream of image pixels such as high addressable bits, multiple bits per pixel or binary image bits representing an input image and a processor that processes and directs signals to an LED bar that selectively exposes areas of a photoreceptor. The exposed areas of the photoreceptor form a latent image, controlled by the processor, of areas of varied exposure based on surrounding pixels. The processor examines the pixels to determine an image structure beneficially adaptable to varied exposure and selects a pixel for varied exposure, such as increased or decreased exposure or altered timing to apply the pixel.

Abstract: A method and apparatus for performing block sequential processing is described. In one embodiment, the apparatus comprises a determine pass logic, selection logic, next coefficient logic and control. The determine pass logic has inputs coupled to receive significance state information for a region, a pass bit for each coefficient in a subset of the region, and a current pass indication. In response to these inputs, the determine pass logic generates pass indications to indicate a pass for each coefficient in the subset of the region. The selection logic has inputs coupled to signals output from the determine pass logic and the current pass indication and, in response to these inputs, generates output indications associated with one pass of either the significance propagation, refinement, and cleanup passes. The next coefficient logic is coupled to the selection logic and indicates the next coefficient in the current pass in response to the output indications from selection logic.

Abstract: A method, an apparatus (100) and a computer program product for entropy coding of discrete wavelet transform (DWT) coefficient bits that are arranged into code blocks and coded in bitplane order using three coding passes for each bitplane are disclosed. In the method, transform coefficients of a code block (200) in sign-magnitude form are pre-analyzed. Statistical data about the coefficients is stored, preferably with the coefficients. Significance state data (330), coded data (340), magnitude refinement data (350), bit data (310), and sign data (320) for the code block are buffered. More preferably, the buffering is implemented using a FIFO (120, 1130), located between a context generation module (110, 1120) and an arithmetic coder (130, 1150). Based upon the statistical data, at least one command for at least one sequence of bit and context pairs is generated for arithmetic encoding.

Abstract: Archival storage and retrieval of audio/video information is described. Audio and/or video information is digitized, compressed and stored in an intermediate archive format (IAF), which preserves the content at a high-enough quality for subsequent retrieval and conversion into various formats required at the time of use or distribution. A single capture operation is performed with ancillary metadata being added to facilitate subsequent searching, indexing and format conversion. Captured data content is catalogued and indexed at or subsequent to the creation of an IAF file that includes the archived information. The IAF includes a family of audio-video digital encoding formats based on public standards. The encoding format used in any particular application is determined at encoding time from information provided by the archive system user. At encoding, the particular encoding scheme is selected to optimize a tradeoff between storage constraints and end use quality requirements.

Abstract: The present invention relates to the image compression and restoring method for binary images that can be used in binary image equipment including printers. In the present invention, an image is not compressed by each pixel but by cell that combines four pixels. And each cell is compressed in two steps. In the first step, the number of black pixels contained in the cell is compressed. And in the second step, using the number of pixels the information compressed in the previous step, the exact location of pixels that constitute the cell is compressed. By doing this, the compression rate can be increased. And even when the compressed bit rows are restored in the first step, image restoration is available with just a small degradation.

Abstract: A data processing apparatus improves speed and efficiency of transfer of bit data, especially, multivalue data bit plane. For this purpose, a memory 50 holds four 8-bit multivalue data per 1 word, and bit plane coding processing is made by 4×4 (=16) multivalue data (processing block). In a memory area 51, the most significant bit (bit 7) of respective multivalue data (data 0 to 15 in FIG. 5) is collected in the order of multivalue data, and stored in one position (hatched portions in FIG. 5). Similarly, bit 6 is collected from the respective multivalue data and stored in one position.

Abstract: An arithmetic decoding method and apparatus process both binary image data and multi-level image data. When 4-bit image data is decoded, four complete sets of pairs of a more probable symbol and a state value or a probability estimate corresponding to pixels of four bitplanes are stored in corresponding ones of four predicted state memories. When less than 4-bit image data is to be decoded, a complete set of pairs of the more probable symbol and state value or the probability estimate corresponding to pixels of each bitplane are allocated to and stored in at least part of the four state memories. Ones of the pairs of the more probable symbol and the state value or the probability estimate are sequentially read from the four state memories and are used to sequentially decode the pixels.