Abstract: The present invention provides a system that compresses and decompresses an image. The system includes a first codec a first stage codec for identifying runs of pixels of a defined value in a data stream of the image data beginning from the left and right margins of a line, such that information regarding the runs is assigned as a header and appended to the data stream. The compression device includes a second stage codec for scanning over remaining data in the data stream and compressing all but the header by utilizing a Huffman encoding scheme to reduce amount of data stored in the data stream, wherein the Huffman encoding scheme interleaves Huffman code values with unencrypted data while maintaining long word boundaries for the unencrypted data. The second codec also performs the operation of decompressing a compressed image.

Abstract: Techniques for representing nodes of tries. Associated with the nodes are keys and rules. A node of a trie having a stride n>1 is represented by a trie having a stride of 1 and the stride 1 trie is represented by a bit string termed a structural enumeration. The structural enumeration has a bit for each node of the trie of stride 1. If the node has a key and rule associated with it, the bit is set; otherwise it is not. The representation of a node of stride n>1 includes the node's structural enumeration and an array of rule pointers. The array has an entry for each rule associated with the node and the entries have the same order in the array as the set bits for their keys in the structural enumeration. Nodes having large strides may be represented by subdividing them into subtries.

Abstract: A representation used in a computer system to represent a set of data items that correspond to and are accessible by means of a set of keys. The representation includes an array of the data items and a bit string associated with the array. Each key is mapped onto a bit of the bit string by means of a hash function that is perfect for the set of keys. The mapped bit is set. The data item corresponding to the key has a position in the array that corresponds to the position of the bit for the key in the bit string. Methods for reading and writing the representation are disclosed as well as a technique based on the mod operation and a set of co-prime numbers for finding a perfect hash function for a given set of keys.

Abstract: A method and device for sharpening detected edges in an image to compensate for a corruption that occurs during the scanning and printing processes. Edges are enhanced by increasing the contrast between two sides of an edge region according to the amount of distortion in the image signal at that location. Each pixel in the image is analyzed in the context of neighboring pixels in the image to determine the presence of an edge and the degree of sharpening required. A filter is applied to adjust the intensity value of pixels in an edge region to correct for distortion and to emphasize the edge. The resulting final image contains sharpened edges with little effect on the smooth transition regions of the image.

Abstract: The present invention provides a system that compresses and decompresses an image. The system includes a first codec a first stage codec for identifying runs of pixels of a defined value in a data stream of the image data beginning from the left and right margins of a line, such that information regarding the runs is assigned as a header and appended to the data stream. The compression device includes a second stage codec for scanning over remaining data in the data stream and compressing all but the header by utilizing a Huffman encoding scheme to reduce amount of data stored in the data stream, wherein the Huffman encoding scheme interleaves Huffman code values with unencrypted data while maintaining long word boundaries for the unencrypted data. The second codec also performs the operation of decompressing a compressed image.

Abstract: A method and device for sharpening detected edges in an image to compensate for a corruption that occurs during the scanning and printing processes. Edges are enhanced by increasing the contrast between two sides of an edge region according to the amount of distortion in the image signal at that location. Each pixel in the image is analyzed in the context of neighboring pixels in the image to determine the presence of an edge and the degree of sharpening required. A filter is applied to adjust the intensity value of pixels in an edge region to correct for distortion and to emphasize the edge. The resulting final image contains sharpened edges with little effect on the smooth transition regions of the image.