IP Library Granted Patent US 6,862,113
Granted Patent B1
US 6,862,113 · App. 09/574,268 · Granted Mar 1, 2005

Assist channel coding with character classifications

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 6,862,113
App. No.
09/574,268
Granted
Mar 1, 2005
Kind
B1
Abstract

A system encodes a separate assist channel that carries only a small amount of additional information in a hardcopy document to compensate for failure of an OCR system to accurately reconstruct a scanned electronic version of the hardcopy document. The assist channel is encoded by mapping data from a primary channel of the document into a plurality of groups. The plurality of groups is used to classify the symbols of the primary channel by the likelihood that a character will occur and the likelihood that the symbols of the primary channel will be confused during OCR processing.

Claims (40)

1. A method for generating image data for rendering on a hardcopy document, comprising:

identifying a primary set of symbol data; the primary set of symbol data providing a first channel of human readable information to be rendered on the hardcopy document; and

computing a secondary set of encoding data from the primary set of symbol data; the secondary set of encoding data providing an assist channel of machine readable information to be rendered on the hardcopy document; wherein said computing further comprises:

partitioning the primary set of symbol data into a plurality of groups; the plurality of groups classifying symbol data according to how likely the symbol data are to be confused during processing of a scanned representation of the primary set of symbol data, and

developing the secondary set of encoding data by associating the symbol data with ones of the plurality of groups.

2. The method according to claim 1 , further comprising assigning an identifier to each of the plurality of groups that partition the primary set of symbol data.

3. The method according to claim 1 , further comprising compressing the secondary set of encoding data.

4. The method according to claim 3 , wherein said compressing is performed with arithmetic encoding.

5. The method according to claim 3 , further comprising scrambling the compressed secondary set of encoding data, wherein said scrambling comprises:

computing a hash h i for each symbol in the primary set of symbol data with a state change function H(h i-1 , c i ), where h i-1 is a previous occurrence of the state change function H for the symbol c i-1 ; and

developing the secondary set of encoding data cd i for each corresponding symbol c i by scrambling each separation code d i with a guard value g i derived from the computed hash h i .

6. The method according to claim 1 , further comprising encoding the machine readable information with data glyphs.

7. The method according to claim 1 , wherein the primary set of symbol data and the secondary set of encoding data are rendered by a printer on the hardcopy document.

8. The method according to claim 1 , wherein said partitioning further comprises:

defining a graph with a node for each symbol in the primary set of symbol data;

assigning a value to each of the nodes that quantifies how likely the symbol data will occur in the hardcopy document;

interconnecting the nodes of the graph with arcs; and

assigning a value to each of the arcs that quantifies how likely symbol data in the primary set of symbol data are likely to be confused during processing of the scanned representation of the symbol data.

9. The method according to claim 8 , wherein said partitioning further comprises iteratively computing a partition of the graph that maximizes a ratio of the values of each of the arcs and the values of each of the nodes until achieving a desired benefit or entropy.

10. The method according to claim 1 , further comprising:

recording a scanned representation of the hardcopy document that includes the primary set of symbol data and a secondary set of encoding data; and

decoding the scanned representation of the hardcopy document by identifying a shortest path of a product graph of the scanned representation of the primary set of symbol data and the secondary set of encoding data.

11. The method according to claim 10 , wherein said decoding is performed using a shortest path computation.

12. The method according to claim 11 , wherein the shortest path computation comprises a two-pass dynamic programming computation.

13. The method according to claim 10 , wherein the product graph is defined by:

identifying templates from a template library that matches the primary set of symbol data;

defining nodes that correspond to both position in the primary set of symbol data and the secondary set of encoding data; and

defining arcs that identify template matches of the primary set of symbol data that are consistent with the secondary set of encoding data.

14. An apparatus for generating image data for rendering on a hardcopy document, comprising:

means for identifying a primary set of symbol data; the primary set of symbol data providing a first channel of human readable information to be rendered on the hardcopy document; and

means for computing a secondary set of encoding data from the primary set of symbol data; the secondary set of encoding data providing an assist channel of machine readable information to be rendered on the hardcopy document; wherein said computing means further comprises:

means for partitioning the primary set of symbol data into a plurality of groups; the plurality of groups classifying symbol data according to how likely the symbol data are to be confused during processing of scanned representation of the primary set of symbol data; and p 2 means for developing the secondary set of encoding data by associating the symbol data with ones of the plurality of groups.

15. The apparatus according to claim 14 , wherein said partitioning further comprises:

means for defining a graph with a node for each symbol in the primary set of symbol data;

means for assigning a value to each of the nodes that quantifies how likely the symbol data will occur in the hardcopy document;

means for interconnecting the nodes of the graph with arcs; and

means for assigning a value to each of the arcs that quantifies how likely symbol data in the primary set of symbol data are likely to be confused during processing of the scanned representation of the symbol data.

16. The apparatus according to claim 14 , further comprising:

means for recording a scanned representation of the hardcopy document that includes the primary set of symbol data and a secondary set of encoding data; and

means for decoding the scanned representation of the hardcopy document by identifying a shortest path of a product graph of the scanned representation of the primary set of symbol data and the secondary set of encoding data.

Assignments (3)
RELEASE OF SECURITY INTEREST Recorded Sep 7, 2022
From: JPMORGAN CHASE BANK, N.A. AS SUCCESSOR-IN-INTEREST ADMINISTRATIVE AGENT AND COLLATERAL AGENT TO BANK ONE, N.A.
To: XEROX CORPORATION
Reel/Frame 061388/0388 →
RELEASE OF SECURITY INTEREST Recorded Sep 7, 2022
From: JPMORGAN CHASE BANK, N.A. AS SUCCESSOR-IN-INTEREST ADMINISTRATIVE AGENT AND COLLATERAL AGENT TO JPMORGAN CHASE BANK
To: XEROX CORPORATION
Reel/Frame 066728/0193 →
RELEASE OF SECURITY INTEREST Recorded Aug 31, 2022
From: JPMORGAN CHASE BANK, N.A. AS SUCCESSOR-IN-INTEREST ADMINISTRATIVE AGENT AND COLLATERAL AGENT TO BANK ONE, N.A.
To: XEROX CORPORATION
Reel/Frame 061360/0628 →