Abstract:
A technique to compress multidimensional color look-up tables by computing an inexpensive fit to the contents of the tables is provided. At each node of the table, the difference between the result of evaluating the fit and the original value at that node are completed. In one form, the parameters of the fit and the differences are stored and compressed, possibly losslessly.
Abstract:
Systems and methods are described that facilitate calibrating a scanner by capturing a plurality of white calibration files and generating a mathematical function that models the scanner. For instance, a white calibration file can be captured before and after a page is scanned, and the function can be an average of offset and gain values for pixels in scanlines of the scanned page. Three or more white calibration files can be used to generate a linear function (e.g., using linear regression) or an exponential function describing the gain an offset values of the pixels.
Abstract:
A method and system is provided for splitting a print job into its preamble and at least one chunk. The splitter maintains a collection of RIP node addresses to which chunks of the job currently being split have already been sent. When a new chunk is about to be sent, the splitter checks whether each RIP node address has already received a chunk. If the RIP node has not already received a chunk, the splitter sends the preamble as well as the chunk to an available RIP associated with the RIP node. If, however, the RIP node address has already received a chunk, only the portion of the chunk after the preamble is sent to an available RIP associated with the RIP node and communicate the location of the preamble to the available RIP node. The preamble may contain common content for each job.
Abstract:
A method for converting a specified color value from a first color space to a second color space identifies the specified color value in the first color space. A converted color space value is received from a final lookup table. The converted color space value is previously determined as a function of the specified color value and a mid-point interpolation and represents the specified color in the second color space. The converted color space value is stored in a memory device.
Abstract:
The presently described embodiments provide for halftone-aligned averaging and noise reduction in a calibration method and associated system. Halftone-aligned averaging is implemented, in one form, as a method of averaging in which the window over which an average is computed is a multiple of the halftone period. Noise reduction, in one illustrative embodiment, comprises discarding windows having an average outside of the range from the 5th to the 95th percentiles of all windows for a patch.
Abstract:
A gradient-based trapping apparatus includes a processing device for receiving a current portion of a digital image. If the current portion includes an edge, a trapping device produces a trapped portion. The trapped portion represents the current portion with varying colors. The trapping device produces the trapped portion based on a plurality of patterns. Each of the patterns is chosen as a function of at least one of a) a distance of a current pixel within the current portion from the edge, b) at least one of a plurality of colors within the current portion, and c) a width of the trapped portion.
Abstract:
A method of color transformation is based on non-separable tiling of a color space. Non-separable tiling allows fine granularity where it is desired and coarse granularity where it is tolerable. Non-separable tiling of the color space provides improved transformation quality for a given lookup table size. Color space is recursively tiled and addressed. Transformation information from the tiles is stored in a database. Database searching techniques are used to speed information access. For example, a hashing function and hashing table are employed to store and retrieve transformation information. An image processor operative to perform the method includes a database index generator and a database of transformation information. For example, the database index generator generates a hashing key from pixel information and uses a hashing function to generate a database cell index. The image processor includes an output device. The output device is, for example, a xerographic printer.
Abstract:
A primary pixel of interest within an image is processed by receiving colors, defining a plurality of pixels in a primary sub-neighborhood of pixels included within a neighborhood of pixels, into a processor. The primary pixel of interest is included within the primary sub-neighborhood. A determination is made if a border exists between first and second regions within the primary pixel of interest. If the border exists within the primary pixel of interest, a plurality of secondary sub-neighborhoods of pixels, which are included within the neighborhood and that potentially include the border, are determined. A determination is made if the border exists between the first and the second regions within respective secondary pixels of interest in the secondary sub-neighborhoods. If the border exists within a predetermined number of the pixels of interest, respective amounts of coverage for first and second colors are identified within a plurality of scaled up pixels corresponding to the primary pixel of interest. The scaled up pixels are displayed.
Abstract:
This invention is a method and apparatus for processing compressed digital images. More particularly, this invention relates to methods and apparatus which accomplish rotation in conjunction with a variable-length decompression operation. A small amount of auxiliary information consisting of pointers to the starts of the scanlines is stored along with the DC coefficients in the decompressor, instead of the compressed image, to reduce the memory requirements for orthogonally rotating an image.
Abstract:
An improved technique for compressing a color or gray scale pixel map representing a document using an MRC format including a method of segmenting an original pixel map into two planes, and then compressing the data or each plane in an efficient manner. The image is segmented such that pixels that compress well under a lossy compression technique are placed on one plane and pixels that must be compressed losslessly are placed on another plane. Lossy compression is then applied to the lossy pixel plane while lossless compression is applied to the lossless pixel plane.