TERRENCE MICHAEL SHANNON
Pilots at Ambrosia Ln, Mora, ID

6452516, Sep 17, 2002

Mar 28, 2001

09/820493

Terrence M. Shannon - Kuna ID

Hewlett-Packard Company - Palo Alto CA

H03M 740

341 65

A computer operable to encode a string of tokens is described. The computer operates to identify a group of tokens in the string. The identified group of tokens are those tokens that follow a token having a first value. The computer further operates to assign a Huffman codeword to each token value present in the group. The Huffman codewords are assigned based upon the local frequencies of the group. The computer then operates to replace each token in the group with the codeword assigned to its value. The computer further operates to replace each token that is not a member of group with a codeword so as to generate a string of Huffman codewords that is representative of the string of tokens.

6362756, Mar 26, 2002

Mar 28, 2001

09/820494

Terrence M. Shannon - Kuna ID

Hewlett-Packard Company - Palo Alto CA

H03M 700

341 87

A computer operable to encode a string of tokens is described. The string of tokens includes a group of tokens that immediately follow a token having a first value. The Computer operates to select a token value that occurs most often in the group. The computer can then operate to convert the first string of tokens into a second string of tokens by substituting each occurrence of a token-pair unit in the first string with a single token. The token-pair unit includes a first token having the first value and a second token having the selected value. The computer then operates to identify a group of tokens in the second string. The identified group of tokens are those tokens that follow a token having the first value. The computer then operates to Huffman encode the second string. In part, this is accomplished by Huffman encoding the identified group based upon the identified groups local frequencies.

6356660, Mar 12, 2002

Sep 17, 1999

09/397420

Terrence M. Shannon - Kuna ID

Hewlett-Packard Co. - Palo Alto CA

G06K 946

382232, 382237, 382244, 382246, 358426, 358427

Raster images are highly compressed by first reordering the data. Next the reordered data is indexed to encode any and all predicted runs and literal runs. Each piece of the present line of the raster image is compared to a previous line. If there is a match, then the present piece is a predicted run and indexed accordingly. If there is no match, then the present piece is a literal run and indexed accordingly. A predicted run can have a minimum run length of one piece, and a maximum run length of the image width in pieces divided by the number of strings. The same is true for literal runs. The index strings are then compressed using a lossless compression method such as Huffman encoding. If Huffman encoding is used, the Huffman tables are predefined and known to both the compressor and decompressor. As the compressor compressed the index strings, the Huffman tables are adapted. The decompressor is notified by the compressor when the adapted tables are to be used.

5619342, Apr 8, 1997

Nov 30, 1995

8/565568

Terrence M. Shannon - Kuna ID

Hewlett-Packard Company - Palo Alto CA

H04N 100, G06K 942

358405

A source image is scaled to a destination image using a method which determines a first destination pixel position corresponding to a given source image pixel. The method comprises the steps of: compiling a scale table having one entry per source pixel in a "pixel group", the end destination pixel of a pixel group positioned where a first accumulation (i. e. , "Scale Source Sum") of sets of m pixels, equals a second accumulation (i. e. , "Scale Destination Sum") of sets n pixels, the Scale Source Sum derived by successively adding an m pixel set value for each successively read source pixel, and the Scale Destination Sum derived by successively adding an n pixel set value for each written destination pixel; factoring both an n source pixel set value and an m destination pixel set value by y, where y is a largest common denominator of both n and m, to derive "n (factored source)" and "m (factored destination)"; using the n(factored source) to determine an integer number of pixel groups between the first source image pixel and the initial source pixel, and determining a total number of destination pixels encompassed by the integer number of pixel groups; determining a position of the given source image pixel within a pixel group on the source raster image scan line; using the scale table to determine a corresponding destination pixel within the pixel group; finding the first destination pixel and positioning the scaled version of the source image thereat.

2004007, Apr 15, 2004

Oct 11, 2002

10/269493

Terrence Shannon - Kuna ID, US

G06F003/12, G06F013/00

358/001150, 358/001160

Methods and systems for processing compressed data that is intended for printing are described. In accordance with one embodiment, a method ascertains one or more attributes associated with raster data that is intended for printing on a printer. The raster data is compressed to provide a compressed raster data block. A tag is associated with the compressed raster data block. The tag embodies one or more attributes, where at least one of the attributes is of a type such that without the tag, the printer would have to decompress the compressed raster data block in order to ascertain the attribute(s).

2004008, May 6, 2004

Oct 31, 2002

10/285126

Terrence Shannon - Kuna ID, US
Nolan Letellier - Boise ID, US

G06F015/16

709/247000

A method of an embodiment of the invention is disclosed that includes sending data from a computing device to an image-forming device server for output by the image-forming device. The image-forming device server compresses the data, and sends the data as compressed data to the image-forming device for output thereby.

6856317, Feb 15, 2005

Apr 16, 2003

10/417876

Shane R. Konsella - Star ID, US
Terrence M. Shannon - Kuna ID, US

Hewlett-Packard Development Company, L.P. - Houston TX

G06T011/00

345471, 707 9

A system and method is provided for storing public and secure font data in a font file. The system and method include public glyph data stored in the font file. Secure glyph data is also provided that corresponds to the public glyph data and the secure glyph data is stored in the font file in an encrypted form. A security logic module is included and configured to allow the secure glyph data to be used when a decryption key is provided by a user to decrypt the secure glyph data.

6026196, Feb 15, 2000

Oct 15, 1997

8/953848

Terrence M. Shannon - Kuna ID
Michael G. Fuchs - Boise ID

Hewlett-Packard Co. - Palo Alto CA

G06K 936, G06K 946

382237

The present invention reduces the amount of data sent to a printer from a printer driver. Data reduction is achieved by using a dither matrix that is designed to produce compressible images, then using a lossless compression scheme that matches the dither matrix.

6942402, Sep 13, 2005

Oct 19, 2000

09/692844

James P. Slupe - Caldwell ID, US
Terrence M. Shannon - Kuna ID, US

Hewlett-Packard Development Company, L.P. - Houston TX

B41J003/36

400 88, 400 61, 400 70, 347109

An embodiment of a manual printer is particularly well suited for forming images on the surface of uneven objects. The embodiment of the manual printer includes a microprocessor for controlling its operation. Image data is stored in RAM and the firmware for controlling the operation of the microprocessor is stored in ROM. A print head interface generates drive signals for a print head using data received from the microprocessor. A signal is generated by an emitter. A receiver in the manual printer receives the signal. The signal includes an x-component, a y-component, and a z-component. The microprocessor determines the position of the manual printer with respect to a reference location using the components of the signal. A distance sensor in the manual printer measures the distance of the print head from the surface of the object. A tilt sensor in the manual printer measures an angle between a longitudinal axis in the manual printer and the surface of the object.

2003016, Aug 28, 2003

Feb 25, 2002

10/085559

Terrence Shannon - Kuna ID, US

G06F015/00, B41J001/00

358/001900

A data recognition module recognizes the type of content (e.g. textual or photographic data) contained within a rasterized image formed of dithered device ready bits. In operation, the data recognition module associates data patterns found within the data to determine the content type of the rasterized image. Knowledge of the content type provides insight to selection of a preferred compression algorithm or other process. In one implementation, where a print driver on a workstation outputs device ready bits corresponding to a rasterized image of text, photograph or other content, the data recognition module may reside on the workstation, where it recognizes the type of content contained within the device ready bits. This information is then used to determine a preferred type of compression.