System for embedded digital data that allows embedding of data around known obstructions
AssigneeXerox Corporation
InventorsDaniel H. Illowsky, Dan S. Bloomberg, Robert E. Weltman
Life of this patent
Estimating the term…
Abstract
A system for printing glyph frames around known obstructions. All frames in an area are determined to be obstructed or unobstructed, based on their location with respect to other printed areas. The unobstructed locations can be numbered and glyph data printed within. In the alternative, the good locations can be numbered modulo some number much smaller that the number of available locations to provide redundancy. The unobstructed locations can be stored in either the sync lines or in the data area of other locations known to be unobstructed. Also, the frame itself can be identified as obstructed or unobstructed to provide more redundancy.
Claims9
A process of printing glyph frames on media around an obstruction, where a frame is defined as an m by n area of data bits and one or more bordering sync lines, comprising:
- deciding which frame locations are unobstructed when printed,
- printing in one unobstructed frame meta-data information about which locations are unobstructed, and
- printing the frames within the unobstructed locations,
- wherein a sync lattice comprising the sync lines of a number of frames in an area contains meta-data describing whether a frame is obstructed or unobstructed,
- wherein the unobstructed frames are numbered in the sync lattice,
- wherein the numbering is modulo a number that is smaller than the number of available frames.
A process for printing embedded digital data in frames on media around an obstruction, where a frame is identified by at least one bordering sync line, comprising:
- determining which frames in a set of frames are unobstructed when printed;
- printing in a subset of unobstructed frames meta-data information about which frames in the set are unobstructed;
- and
- printing digital data bits in the remaining unobstructed frames;
- wherein the meta-data information comprises a codeword of N bytes and wherein the codeword is dispersed according to the method:
- defining a pseudo-random sequence of frame locations for the data bits;
- dividing the pseudo-random sequence into N consecutive segments;
- and
- using each segment to determine a location to print a corresponding byte of the codeword.
Dependencies are inferred from the claim text.