Abstract: An image detection manager uses run length encoding to detect a target image in a candidate image. The image detection manager extracts run length encoding data from the candidate image. The image detection manager distinguishes between a foreground and background of the candidate image and target image, and takes into account an interval of scale factors for matching color runs in the foreground and length runs in the background. The image detection manager treats background pixels as wildcards, and utilizes fuzzy color matching in which color levels of adjacent pixels in the foreground are allowed a specified variation. Using such functionality, the image detection manager compares rows of the run length encoding data from the candidate image to rows of run length encoding data from the target image, and determines whether the target image is present in the candidate image.

Abstract: Provided are an image processing apparatus and image processing method capable of processing image data as packet data, and compressing the image data in real time to a data amount within the storage capacity of a memory. Image data in the form of packet data is divided into a plurality of blocks by a block forming circuit (102), and compressed at a first compression ratio by a DCT circuit (104), quantizing circuit (105), and Huffman encoding circuit (106) for each block. A counter (108) measures the data amount of the compressed image data. If the measured data amount is equal to or larger than a predetermined value, the image data stored in a memory (112) is recompressed at a second compression ratio as a higher compression ratio by a Huffman decoding circuit (113), bit shifting circuit (114), and Huffman encoding circuit (115).

Abstract: There is provided a method of producing compressed data including the steps of receiving input data to be compressed (step 10), transforming said input data into a sum of basis functions multiplied by a corresponding set of coefficients, which may be a transformation to the frequency domain (step 12), forming a function or row of data from said set of coefficients (step 17), estimating the function using a learning process (step 21) and recording the resulting estimate (step 28) as the compressed data. Also provided is a method of estimating a function which may be used in the method of producing compressed data including inverting the function about a predetermined value (step 18) prior to using a learning process to estimate the function. Apparatus (1) for implementing the method and a software product to cause a processing means to implement the method are also claimed.

Abstract: A system and method that enhance edges in images by detecting and correcting edges of the components of the image, such as the luma and the chroma components. The luma and the chroma edges may be corrected to align with one another. The luma edge detection may utilize a combination of the first and second derivatives of luma. The chroma edges may be sharpened by adjusting the saturation of the chroma components, without changing the hue. The luma edges may be corrected using a blend of peaking and enhancing the luma edges. The corrected chroma and luma components may be then debugged and the appropriate corrected components may be sent to display. Chroma/luma edge alignment may utilize a product of the luma first and second derivatives.

Abstract: A compression system and method for compressing a bitonal image. A system is disclosed that comprises: a scaling system for geometrically scaling the bitonal image such that transition and isolated attributes are preserved, wherein the scaling system reduces contiguous sets of original pixels down to fewer scaled pixels; and an encoding system that encodes the scaled bitonal image using an industry standard format.

Abstract: A method to remove ringing artifacts from locations near dominant edges of an image reconstructed after compression. The image is decomposed into blocks small enough so that each would contain only one significant edge. A significant edge is tested as to whether it is a dominant edge of the image. If there is no dominant edge, the block is not processed. In the remaining blocks, the exact pixels that include the dominant edges are output without filtering. The direction of the dominant edges is inferred, and then the remaining pixels are filtered with a directional de-ringing filter. The de-ringing filter has a main direction that is perpendicular with the direction of the edge, and thus also with an inherent direction of the ringing artifacts.

Abstract: An image passthrough extension structure and method facilitating the transfer of compressed data image files from a software application to a device via the computer system operating system. The application determines whether the device is capable of decoding the specific compressed data file by polling the device driver. If the driver returns a “no support” message, the application processes the compressed data file in a conventional manner. If the driver returns a “support” message, the application transfers the compressed data file, along with the additional processing information, to the device driver utilizing the conventional file transfer operating system data structures modified to incorporate the compressed data file passthrough function.

Abstract: An image transmission apparatus and method for use with at least two transmission paths having different transmission rates from one another. The image transmission apparatus comprises an image input for receiving an image signal, a coding processing unit for encoding the image signal, a protocol control unit for packetizing the data encoded by the coding processing unit to generate data packets for transmission, and a transmission unit for transmitting the data packets. The protocol control unit has at least one timer processing unit which controls a data packet transmission interval individually corresponding to the transmission rates of the respective transmission paths based on data packet discard ratio information from the transmission paths.

Abstract: An image noise reducing method that can properly reduce both block noise and mosquito noise without deterioration of the image quality is provided. The method includes creating a first luminance component image data with the boundaries of the blocks thereof smoothened, creating a second luminance component image data with its entirety smoothened from the first luminance component image data, creating edge image data by subtracting the second luminance component image data from the first luminance component image data, creating corrected edge image data by applying correction to the edge image data under given conditions, and creating third luminance component image data by adding the corrected edge image data to the second luminance component image data. For color-difference component image data, first color-difference component image data with its entirety smoothened is created from the color-difference component image data.

Abstract: There is disclosed in embodiments methods relating to the compression of printing hints. The method in embodiments generates a first set of image pixels having corresponding printing hints. The printing hints are then adjusted to produce a second set of image pixels processed in such a way that an end printed result is visually equivalent to a printed result using the first set of image pixels thereby reducing the entropy in the printing hints. The method improves the compression ratio of an image using printing hints by adjusting the printing hints of pixels that are zero or fully saturated. The printing hints are adjusted in such a way to reduce the complexity of the printing hints.

Abstract: Systems and methods for encoding and decoding document images are disclosed. Document images are segmented into multiple layers according to a mask. The multiple layers are non-binary. The respective layers can then be processed and compressed separately in order to achieve better compression of the document image overall. A mask is generated from a document image. The mask is generated so as to reduce an estimate of compression for the combined size of the mask and multiple layers of the document image. The mask is then employed to segment the document image into the multiple layers. The mask determines or allocates pixels of the document image into respective layers. The mask and the multiple layers are processed and encoded separately so as to improve compression of the document image overall and to improve the speed of so doing. The multiple layers are non-binary images and can, for example, comprise a foreground image and a background image.

Abstract: A moving image compression (or encoding) device including: a hardware processing section which compresses moving image data by hardware; a data storage section which stores the moving image data processed by the hardware processing section; and a software processing section which compresses the moving image data from the data storage section by software. The hardware processing section includes a plurality of processing sections which perform processing including a discrete cosine transform and quantization of the moving image data. The software processing section performs variable-length coding of the quantized moving image data.

Abstract: JPEG data is efficiently recompressed and transmitted to a remote color facsimile device. Before transmission of recompressed JPEG data, an anticipated transmission time is displayed for enabling the user to easily select the desired compression ratio. To generate recompressed JPEG, a Huffman decoder is provided for decoding encoded data and temporarily generates decoded data. Table generator multiplies the predefined quantization table values by the prescribed value to generate the modified quantization table. Intermediate data generator generates the intermediate data by dividing the encoded data by ratio n, which is derived by dividing predefined quantization table by the modified quantization table. Huffman encoder encodes the intermediate data to create new encoded data. Recompressed JPEG data includes the newly coded data and the modified quantization table.

Abstract: A moving image compression (or encoding) device including: a hardware processing section which compresses moving image data by hardware; a data storage section which stores the moving image data processed by the hardware processing section; and a software processing section which compresses the moving image data from the data storage section by software. The hardware processing section includes a plurality of processing sections which perform processing including a discrete cosine transform and quantization of the moving image data. The software processing section performs variable-length coding of the quantized moving image data.

Abstract: A circuit which uses a compressor to divide each separation image into 8-line strips, and to independently compress each strip, a single decompressor to decompress two or more color image separations, strip by strip, by interleaving them, and to apply them to two or more print heads, one for each color separation. DMA from a main memory is used to apply both separations to the decompressor, and the decompressor output is demultiplexed into two print heads, one for each separation. This is done to drive each color separation simultaneously in a single-pass color printer. Multiplexing logic controls the DMA into the decompressor and the output of the decompressor into separate buffers for each color separation. Additional logic uses the page and line sync from each print head to synchronize the accessing of the correct image raster from buffers at the output of the decompressor to the associated print head.

Abstract: The electronic device comprises electronic circuitry which functionally comprises a boundary detector, an analyzer and an includer. The boundary detector is operative to determine a boundary (47) between a relevant area (45) and an irrelevant area (43) of an image (41). The analyzer is operative to analyze blocks (55) of pixels intersected by the boundary (47). The includer is operative to include blocks (55) of pixels intersected by the boundary (47) in the relevant area (45) in dependence upon the analysis. The invention further relates to a method of determining a relevant area of an image for block-based image processing. The method comprises the steps of determining a boundary between a relevant and an irrelevant area of an image, analyzing blocks of pixels intersected by the boundary and including blocks of pixels intersected by the boundary in the relevant area in dependence upon the analysis.

Abstract: The image processor comprises a switch that divides image data into m×n pixels, having n lines with m pixels per one line; a group of line memories that store the divided image; a compression device which batch compresses the image data of m×n pixels. Further, a command control unit provides control so as to send the (n?1) lines of image data among m×n pixels of image data to the group of line memories, and the remaining one line of image data directly to the compression device 902, and to send the m×(n?1) pixels of image data stored in the line memories to the compression device.

Abstract: An image processing apparatus and an image processing method are disclosed for generating coded data having a desired data size at a high speed. The image processing apparatus includes a coding part, two memories, a setting part and a data size adjustment part. The coding part partitions a wavelet coefficient of image data into bit-planes and generates coded data of the image data through entropy coding on the wavelet coefficient for each of the bit-planes. The data size adjustment part adjusts a size of the coded data such that the size falls within an acceptable range including the target size set by the setting part by sequentially discarding a portion of the coded data in a least significant order based on the size of the coded data portion corresponding to each of the bit-planes.

Abstract: A technique for reducing information reception delays is provided. The technique reduces delays that may be caused by protocols that guarantee order and delivery, such as TCP/IP. The technique creates multiple connections between a sender and recipient computing devices and sends messages from the sender to the recipient on the multiple connections redundantly. The recipient can then use the first arriving message and ignore the subsequently arriving redundant messages. The recipient can also wait for a period of time before determining which of the arrived messages to use. The technique may dynamically add connections if messages are not consistently received in a timely manner on multiple connections. Conversely, the technique may remove connections if messages are consistently received in a timely manner on multiple connections. The technique can accordingly be used with applications that are intolerant of data reception delays such as Voice over IP, real-time streaming audio, or real-time streaming video.

Abstract: A sender device 1 stores, in header information about image information, information indicating that attribute information and image data rearranged in sequence, and produces image information by means of storing attribute information and image data in a predetermined sequence. The thus-produced image information is sent to a receiver device 2 by way of a network line 3. When receipt of image information is initiated, the receiver device 2 refers to the header information, thereby determining presence/absence, in the header information, of information indicating that attribute information and image data are stored in a predetermined sequence. When it has been determined that attribute information and image data are arranged in a predetermined sequence, image data included in the received image information are immediately decompressed, and the thus-decompressed image data are output in the form of a record or display.

Abstract: The invention relates to the data transfer method, the image processing method, the data transfer system and the image data processor for transferring digital data, especially for transferring image data. The invention has an object to provide the data transfer method, the image processing method, the data transfer system and the image data processor, wherein the compression ratio is changed corresponding to the transfer rate between connecting devices and the lack of image is avoided. The detecting means detects the data transfer capability of the transmission channel and the transfer end, and the control means changes the compression ratio of the digital data corresponding to the data transfer capability. Subsequently, the compressing means compresses the digital data based on the changed compression ratio and the transfer means transfers the compressed digital data to the transfer end.

Abstract: In a method of image compression in which vertical and horizontal white skipping are performed, data compression is performed in the regions containing black pixels other than the skipped regions. While vertical and horizontal white skipping being performed, in the other regions, regions are detected in which pixel values change in smooth fashion, such as the outlines of letters and encoding is performed using the pixel value of the leading column of the region, number of columns and amount of change of the pixel values. As a result, the compression factor of the image can be increased and a considerable contribution made to reduce the storage capacity for storage of data and reduce the time required for data transmission.

Abstract: This invention has as its object to efficiently encode an image. To this end, for example, an image undergoes a color reduction process using a dither matrix with a predetermined size. A print control command is output. A compression parameter designation command that designates an up copy vertical offset value (a value according to the matrix size), a near left copy horizontal offset value (a value according to the matrix size), and a far left copy horizontal offset value (a value according to the period of background patterns), which are used in encoding, is output. Image data is encoded according to an encoding sequence.

Abstract: A multi-stage or process operation, such as the printing of a document from a data file in the form of a word processing document may be performed either by passing the document directly along a relatively fast network link to a printer 300, or by passing the document along a relatively slow link to a printer 200, where the document is ripped, and then passing the ripped data along a further relatively fast link to printer 300. To determine the optimum course of action in view of a policy demanding speed of printing the probable speed of each course of action is determined, and the course of action most likely to yield a result in conformity with the policy is selected.

Abstract: The present invention provides a contents managing system, a contents managing methods, and a program are provided, by which a communication fee required to distribute such contents which will not be probably utilized is reduced when contents are distributed via a network. An image owner performs a user registration with respect to an image managing server 2 by employing an image owner terminal. After the user registration, an image purchaser makes an order of an image with reference to a trial image produced by the image owner terminal. The image owner as to this ordered image uploads actual image data to the image managing server, whereas the image purchaser downloads the actual image data which is uploaded.

Abstract: A method and apparatus for generating a compressed representation of a two-dimensional image where the image is described as a sequence of pixels in raster order. The method includes receiving the two-dimensional image as a sequence of pixels in raster order. For each pixel, the system determines whether the pixel is part of a first string of pixels that is identical to a second string of pixels found previously in the image at one of a plurality of preselected fixed distances from the first string of pixels. If so, the first string of pixels is encoded as a string token that is a reference to the second string of pixels. Otherwise, the pixel is encoded as a non-string token.

Abstract: An image processing apparatus has a compression rate predicting section for computing an improving rate of compression required for storing image data of the entire document in a image data storage section, and a compression rate correction table for storing a change table for changing the reference values for bi-level processing based on the improved rate computed by the compression rate predicting section in its image processing section. In a case where storage capacity is short while the document image data is stored in the image data storage section, image processing is applied to image data in image data processing section by the compression rate predicting section and the compression rate correction table so that the compression rate is improved. Thereby, compression rate of image data is improved and the image data of the entire document is reliably stored in the image data storage section.

Abstract: Systems and methods for encoding and decoding document images are disclosed. Document images are segmented into multiple layers according to a mask. The multiple layers are non-binary. The respective layers can then be processed and compressed separately in order to achieve better compression of the document image overall. A mask is generated from a document image. The mask is generated so as to reduce an estimate of compression for the combined size of the mask and multiple layers of the document image. The mask is then employed to segment the document image into the multiple layers. The mask determines or allocates pixels of the document image into respective layers. The mask and the multiple layers are processed and encoded separately so as to improve compression of the document image overall and to improve the speed of so doing. The multiple layers are non-binary images and can, for example, comprise a foreground image and a background image.

Abstract: A system and method facilitating document image compression utilizing a mask separating a foreground of a document image from a background is provided. The invention includes a pixel energy analyzer adapted to partition regions into a foreground and background. The invention further provides for a merge region component adapted to attempt to merge regions if the merged region would not exceed a threshold energy. Merged regions are partitioned into a new foreground and new background. Thereafter, a mask storage component stores the partitioning information in a binary mask.

Abstract: A system and method for reducing the volume of data necessary to represent an image by utilizing tiling and masking techniques is disclosed. Initially, an image described by raster content having an original number of bits per pixel is provided. The image is divided into tiles such that each of the tiles represents a portion of the image. Then, for each of the tiles, the following steps are performed: (a) the colors in the tile are identified; (b) the required number of masks are compared to a threshold number of masks to determine if data reduction by using masks is worthwhile; (c) if the required number of masks is less than the threshold number of masks, a representation of the tile is generated using fills and/or masks; and (d) if the required number of masks is greater than or equal to the maximum number of masks, a representation for the tile using the original format and number of bits per pixel or a smaller index is generated.

Abstract: A system and method for accepting raster data from a Postscript or equivalent image data generator, identifying portions of the raster image which contain continuous tone data and linework data, dividing those portions into separate tiles and compressing the data within each tile by a compression method optimized for the type of image data within the tile. The compression algorithms are based upon conventional JPEG or LZW techniques, but enhanced to more efficiently process image data sets with large amounts of blank data.

Abstract: A system, method, and processor-readable medium provide for compressing color data involves a number of pixels defining a region of a display area. The pixel data for each of the pixels includes color data and control data. The control data of particular pixels, having color data not used to contribute to a color of an object in a display area region, is set to a transparent setting. The color data of the particular pixels is set to a selected color code for the entire region and subject to compression. In another embodiment, the particular pixels may include color data not used to contribute to a color of a first object or a second object in the display area region. The color data of particular pixels defining the first object is set to a first color code. The color data of particular pixels defining the second object is set to a second color code. The color data is switched between the first and second color codes at a selected pixel position.

Abstract: The present invention efficiently compresses image data, and stores and manages the compressed data. Image data is compressed in tile unit having predetermined pixels and data packing is performed. The compressed data is compared with compressed data of a preceding packet. If these compressed data are different, the packet data is stored in a memory, and an entry address of the compressed data is stored in a packet table. Meanwhile, if the compressed data is equal to the compressed data of the preceding packet, the compressed data is not stored, but an entry address of the compressed data of the preceding packet is stored in a record of interest in the packet table, and a flag indicative of repetition of the preceding address is set in the packet of interest.

Abstract: Apparatus and method for selecting an appropriate parameter at decompression are disclosed. In particular, when adaptive block size discrete cosine transform compression is used to compress data, different combinations of sub-blocks can be generated. To decompress the different combinations of sub-blocks, the appropriate parameter is selected based on block size assignment information and the address of data in the data block.

Abstract: A programmable image processor capable of realizing a plurality of image formation operations is comprised of an SIMD type data operation processing section, RAMs, memory controllers, and memory switches. The memory controller and the memory switches selectively connect the plurality of RAMs to the data operation processing section thereby changing the memory capacity allotted to each image formation operation among a plurality of image formation operations.

Abstract: A technique for detection and bypass of unnecessary modulation/demodulation and compression/decompression of Group 3 fax, in a telecommunication network having more than one pair, or “tandem,” Group 3 fax relay gateways. Detection and the effective removal of a Group 3 fax tandem reduces end-to-end processing delays of the facsimile signal, and improves performance of the Group 3 fax communication. The invention uses frequencies normally used for voice information (such as V.21 channel 1 frequencies) to detect tandem fax relay gateways and effectively remove unnecessary relay gateways.

Abstract: An image processing system provided with a line sensor for reading image signals in line units. First, the line sensor scans a document in a normal direction. At this time the image data obtained by the scan are subjected to image processing such as compression and the like. Areas of image data that cannot be processed to the high moving speed of the scanner are subjected to image processing by later performing a scan in the reverse direction.

Abstract: The present invention provides an image processing apparatus and an image processing method that enable efficient use of code information storage areas and can rapidly process code information to render characters. A character data management unit stores reference information for referencing the shape data of a character indicated by inputted character data in an intermediate code buffer in association with an intermediate code. Thereby, a data amount of the intermediate code buffer is reduced. At the same time, reference information for referencing the intermediate code is stored in a font cache buffer in association with the character shape data. By dint of the mutual reference, when character shape data is to be saved from, e.g.

Abstract: An image processing method carries out a compression process which divides an image into a plurality of divided regions and compresses the divided regions in a state where each of the divided regions are independent of one another, and sets boundaries of the divided regions in order to approximately match boundaries of one or a plurality of image regions which are within the image and have aspect ratios and/or sizes different from those of the image.

Abstract: An image processing apparatus is disclosed that includes a size adjusting unit and an encoding unit. If the size of a region is fixed, and as a result, an image to be processed by the image processing apparatus is not divisible into the regions, the size adjusting unit adjusts the size of the image so that the image becomes divisible into the regions. The encoding unit encodes the image by the regions and generates a codestream. Accordingly, even if the region is fixed in size, the image can be encoded.

Abstract: A coding apparatus which can simplify a coding circuit and also simplify the processing of quantization. Image data that consists of R-, G-, and B-color components read from a scanner into buffers is subjected to transformation using a position correlation for each of RGB in position-correlation transformation sections. The DC component of each of the components is then color-converted in a color conversion section to be a DC lightness signal and DC color signals, and the signals are quantized in a quantization section and a coding section. Whereas, the AC components of each of the components are subjected to quantization in a first step in an AC component quantization section, and further to color conversion in a color conversion section to be an AC lightness signal and AC color signals. The signals are quantized in a second step in a quantization section and a coding section.

Abstract: A method of deriving a preview image from CCITT-compressed digital image data that represent an original image is disclosed. The method comprises receiving CCITT-compressed image data that represent an original image having Nr rows and Nc columns. Without decompressing the CCITT-compressed data, a preview image is derived that has Nr/M rows each having Nc/M pixel values. The reducing step includes processing each group of M rows of said original image represented in the CCITT-compressed data. Specifically, the CCITT-compressed data that represent the group of M rows of the original image is read. For each constituent row in the group of M rows, a location in the row is derived for each transition represented in the CCITT-compressed data. For each constituent row in the group of M rows, each transition in the row is mapped to a pixel value in a reduced row having Nc/M pixel values. Therefore, for each group of M rows in the original image, M reduced rows are defined.

Abstract: An image scanning and processing system includes a scanner for generating a stream of data encoding a scanned image; a controller for controlling and processing data received from the scanner; and a file storage unit. In use, the stream of data is written to a master file saved in the file storage unit. The controller is configured to create a preview image with a lower data size than the scanned image from at least part of the data encoding the scanned image. The controller is configured to extract data encoding the preview image directly from the stream of data, and to write the extracted data to a thumbnail file. A method of scanning and processing an image, includes scanning an original and thereby generating a stream of data, encoding a scanned image, saving the scanned image in a master file, and creating a preview image with a lower data size than the scanned image from at least part of the data encoding the scanned image.

Abstract: A method and apparatus for generating a compressed representation of a two-dimensional image where the image is described as a sequence of pixels in raster order. The method includes receiving the two-dimensional image as a sequence of pixels in raster order. For each pixel, the system determines whether the pixel is part of a first string of pixels that is identical to a second string of pixels found previously in the image at one of a plurality of preselected fixed distances from the first string of pixels. If so, the first string of pixels is encoded as a string token that is a reference to the second string of pixels. Otherwise, the pixel is encoded as a non-string token.

Abstract: For preventing the occurrence of disjunction among a plurality of images in the magnification index in the main scanning direction, image data delivered from an external device through an input image data connector are converted by a P/S converter into serial data from parallel data, and then stored into a memory by a write controller. When the image data are cached, a read controller starts reading the image data. At the same time, a computation means starts counting time based on information set at a setting means by an external central processing unit. As soon as it reaches the initial insert interval, the read controller suspends reading of image data out of the memory to insert virtual data pixel. In the same procedure, the read controller inserts virtual data pixel at each of the insert intervals counted by the computation means.

Abstract: The present invention provides a high speed MMR compression processing method by reducing the number of times of repeating a process of finding the positions of changing pixels a1, a2, b1, and b2. According to this method, first, a bit string corresponding to pixel data is obtained from an image. Then, data are sequentially fetched from the bit string byte by byte. Subsequently, a search is made of a table that describes the number of consecutive bits that are arranged to the right of and have the same color as each of bits of each byte of all bit patterns represented by bits included in the fetched 1 byte. Then, the number of consecutive bits, which are arranged to the right of and have the same color as each of bits of each of the fetched bytes, is detected according to the bit patterns represented by bits of the fetched byte. Subsequently, a pixel placed at the position corresponding to the number obtained by adding 1 to the detected number of consecutive bits is determined as a color changing pixel.

Abstract: A digital image processing method reduces noise and blocking artifacts in a digital image by first converting the RGB values of the digital image pixels to Y, Cb and Cr components, then detecting the block boundaries in the Y, Cb and Cr image components, and estimating the noise in the Y, Cb and Cr image components. One or more noise tables are constructed for the Y, Cb and Cr image components. An adaptive Huber-Markov-random-field-model-based filter (HMRF) is applied to the Y, Cb and Cr image components, wherein the adaptive feature of the HMRF employs the detected block boundaries and the noise tables to produce filtered Y, Cb and Cr image components. Finally, the filtered Y, Cb and Cr image components are converted to RGB components.

Abstract: A method is provided for transferring print data from a host computer to a printer connected to the host. According to the method, a transfer rate determiner of the host determines the data transfer rate of the interface between the host and the printer. Before the print data is transferred from the host to the printer, the data compress/decompress time by several compression methods is estimated. Also, the data transfer time for the compressed print data is estimated. These times are added to provide a total data process time. Meanwhile, data transfer time for non-compressed print data is estimated. The total data process time for the compressed data and the data transfer time for the non-compressed data are compared to determine the most efficient print data transfer scheme.

Abstract: A video image decoding and composing apparatus includes: a composing information memory for storing composition information; an arbitrary shape object decoding means for decoding a coded signal of an arbitrary shape object video image; a shape memory for storing a shape signal which is decoded by the arbitrary shape object decoding means; a texture memory for storing a texture signal which is decoded by the arbitrary shape object decoding means; a rectangular shape object decoding means for decoding a coded signal of a rectangular shape object video image; a video image memory for storing a video image signal which is decoded by the rectangular shape object decoding means; a composing means for composing the shape signal stored in the shape memory, the texture signal stored in the texture memory, and the video image signal stored in the video image memory, in accordance with the composition information stored in the composition information memory; a position indicating means for indicating a position in the c

Abstract: Compression apparatus is described that operates to select an optimum compression procedure to apply to received image data. The compression apparatus can be employed in a page printer having a print engine that must be provided with video data at a constant rate in order to avoid a print underrun. The page printer operates to receive print data and to convert the received print data into rasterized page strips. Some or all of these rasteized page strips can then be compressed by the compression apparatus for later conversion to video data. The compression apparatus operates to compress each received rasterized page strip by selecting a compression procedure that results in a compressed strip that will provide optimum print quality while not causing a print underrun and that is below a threshold data size.