Abstract:
Rapid throughput of still image compressed data (e.g. JPEG) is achieved for presentation of images in rapid succession for browsing or browsing by panning within large images by using a hardware decoder adapted for presentation of moving images to reduce the processing load which must be performed in accordance with software although the still image data is incompatible with still image data in many respects; some of which necessarily lead to a loss of image fidelity. The still image data is partially decoded (e.g. entropy decoded) in software processing and re-encoded and reformatted to a form which can at least be accepted by the hardware decoder even though not compliant with any particular moving picture data standard (e.g. MPEG). Storage in the hardware decoder is reallocated to provide, in combination with a reduction of slower software processing, a throughput increase of four-fold or more. Software processing of the still image data is also allowed to proceed and the result substituted for the result of the hardware decoding if a given image is viewed for a time sufficient for the software image processing to be completed.
Abstract:
The present invention allows data objects to be tagged with secondary resources that specify rendering attributes, such as color profiles. A method, data structure and apparatus provides object level management using tagged secondary resources. Rendering control (color space selection, in this case) of the primary datastream (AFP, in this case) is provided to heterogeneous objects (PostScript Level 1 color images, in this case). The present invention provides a method for the primary datastream to include the source calibration parameters, i.e., the rendering control, without modifying the heterogeneous object. For example, if the threshold matrix for the halftoning is tagged as a resource to the image object, the rendering process can use this specific matrix when the image is halftoned and presented.
Abstract:
In summary, the present invention provides a method, apparatus and program product for calculating an estimate of the amount of toner coverage required for printing print data defined in a compressed data stream. The estimate is obtained with reduced processing by obtaining coverage data from a partially decompressed formed of the data stream and using this to obtain the coverage estimate, thus removing the need to do a full de-compression of the data stream. For example the coverage data is a count of toned pixels for at least one intensity level.
Abstract:
Systems and methods for implementing a fast, color printer architecture are disclosed. A print processor comprises a plurality of processing units operating in parallel to process data for different layers or color planes. A connection can be formed between any processing unit and any print head of one or more printers. Any one of a plurality of the parallel processing units may be assigned to process one, some, or all of the colors of data. Consequently, each one of a plurality of print heads can be assigned to receive data from any one of a plurality of processing units.
Abstract:
Method and system aspects for mapping tasks to iteratively improve task assignment in a heterogeneous computing (HC) system include identifying a current machine that defines a makespan in the HC system. Further included is the reassigning of at least one task from the current machine to at least one alternate machine in the HC system according to a predefined reassignment constraint. Reassigning also includes reassigning the at least one task when the at least one alternate machine can perform the at least one task in addition to previously assigned work while finishing in less time than the time of the makespan reduced by time required for the task being reassigned.
Abstract:
A method, system, and data structure for the scaling down of data is provided. At least two blocks of transformed data samples representing at least two blocks of original data samples are received. One of at least two tables of constants is selected wherein each table of constants is capable of reducing the number of transformed data samples by a different factor. The constants taken from the selected table are applied to the at least two blocks of transformed data samples to produce one block of transformed data samples representing one block of final data samples. The data is processed one dimension at a time by multiplying the data in one dimension with selected constants taken from previously developed tables corresponding to the desired scale down factor. Scaling down by different factors in each dimension as well as scaling down in one dimension and scaling up in the other dimension may be achieved. In addition, the de-quantization of the quantized transform coefficients may be accomplished by pre-multiplication of the selected constants when the quantization values are known. In a similar way the re-quantization may be accomplished by a pre-division of the selected constants. Both de-quantization and re-quantization may be combined when the input quantized transform coefficients and output quantized transform coefficients are desired.
Abstract:
A method and system for printing simple data utilizing a raster image processor in a computer system is disclosed. The raster image processor is configured for use with a complex data stream corresponding to at least one complex page description language. The method and system include embedding at least one control structure in the complex data stream. The control structure(s) are for informing the raster image processor of the simple data. The method and system also include converting the simple data into a printable format based on the at least one control structure and without using the complex page description language to convert a portion of the complex data stream corresponding to the simple data into the printable format. The method and system also include converting a remaining portion of the complex data stream into the printable format using the complex page description language.
Abstract:
The present invention is related to a method and system for transforming a datastream. The method includes parsing the datastream into a plurality of work units in a first format and processing each of the plurality of work units by at least one compute node to convert each work unit into a second format. In another aspect, the system includes a central component for receiving the datastream in a first format, a plurality of sources in the central component, where each of the plurality of sources is associated with at least one transform, and at least one compute node coupled to the central component. According to the system of the present invention, the central component instantiates at least one source of the plurality of sources that parses the datastream into a plurality of work units in the first format, and distributes each of the work units to the at least one compute node, which converts each work unit into a second format.
Abstract:
A method, system, and program for transmitting and decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.
Abstract:
Image rotations of 90°, 180° and 270° and horizontal and vertical mirroring image transformations are performed losslessly and with greatly enhanced speed by processing orthogonal transform coefficients in a zig-zag order with direct storage of S (size) values, reassociated R (run of zero valued coefficients) from an adjacent coded orthogonal transform value and a non-zero valued transformation coefficient in reverse zig-zag order. Cache misses are avoided by processing values which are not widely separated in the coded data and other features of the technique and memory accesses are reduced to accelerate processing while extremely little computation is required. These effects are substantially augmented when intermediate codes having certain attributes including coding of zero valued coefficients and flagging certain code features are employed.