Hewlett-packard Development Company, L.p.

Purdue Research Foundation

Dejan Depalov

Kenneth Kay Smith

Charles Addison Bouman

Peter Bauer

Jerry Wagner

Jan Philip Allebach

Eric L Andersen

Craig T Johnson

Baris Efe

Yandong Guo

Eric L Anderson

Jain Chirag

Goudar Chanaveeragouda

Jay Allebach

Yandong Guo Guo

A method of creating a hierarchical dictionary comprises, with a processor, extracting a number of symbols from a first image, constructing a number of refinement dictionary entries based on the symbols, the refinement dictionary entries forming a refinement dictionary, grouping a number of the refinement dictionary entries into clusters to form a number of refinement dictionary entry clusters, and constructing a number of direct dictionary entries for each of the refinement dictionary entry clusters, the direct dictionary entries forming a direct dictionary.

Creation of hierarchical dictionary

A scanner is disclosed. The scanner has three lights with three different colors. The scanner uses only two of the three lights when capturing each scan line. The scanner does this by alternating the use of two of the three colors every other scan line.

Capturing a scan line with two colors

A scanner is disclosed. The scanner captures three exposures for each color scan line. The scanner has a first, second and third light source that each produces a different color of light. The scanner uses the first and second light source for the first exposure. The scanner uses the first and third source for the second exposure. The scanner uses the second and third light source for the third exposure.

Scanner

A scanner is disclosed. The scanner detects when the to surface of the ADF scan glass is contaminated.

Scanner that detects debris

The present disclosure includes a system and method for symbol compression using conditional entropy estimation. One method for symbol compression using conditional entropy estimation includes approximating a quantity of symbol encoding bits for a number of symbols using a conditional entropy estimation. Dictionary entries are generated from the number of symbols so as to minimize a total bit-stream quantity. The total bit-stream quantity includes at least the approximated quantity of symbol encoding bits and a quantity of dictionary entries encoding bits. The symbols are encoded using the dictionary entries as a reference.

Symbol compression using conditional entropy estimation

Growing community of inventors

Boise, ID, United States of America

Dejan Depalov