Method for surface printing

• US 20040060991A1
• Filed: 09/22/2003
• Published: 04/01/2004
• Est. Priority Date: 06/30/2000
• Status: Active Grant

• Current Assignee: Memjet Technology Ltd. (Memjet Limited)
• Original Assignee: Silverbrook Research Pty Limited
• Inventors: Lapstun, Paul, Walmsley, Simon Robert
• Granted Patent: US 6,857,571 B2
• Time in Patent Office: Days
• US Class Current: 235/494
• CPC Class Codes: G06K 1/121 by printing code marks applying code marks to labels B65C9/46; marking or coding completed packages B65B61/26
• CPC Class Codes: G06K 19/06 characterised by the kind of the digital marking, e.g. shape, nature, code
• CPC Class Codes: G06K 19/06037 multi-dimensional coding
• CPC Class Codes: G06K 19/06168 the marking being a concentric barcode
• CPC Class Codes: G06K 2019/06262 with target- or other orientation-indicating feature
• CPC Class Codes: G06K 7/1417 2D bar codes
• CPC Class Codes: G06K 7/1421 Circular bar codes
• CPC Class Codes: G06K 7/1443 locating of the code in an image
• CPC Class Codes: G06K 7/1456 determining the orientation of the optical code with respect to the reader and correcting therefore

Abstract

A generic data package template is described that allows data to be encoded and printed in any arbitrary shape using an arbitrary encoding scheme. The template comprises an arbitrary shaped constant background pattern that is read to locate and orient a data area. The data are contains a plurality of dots that are decoded to extract the stored information.

Claims

1. A method for generating a surface printed with tags, the tags embedded with data, the method comprising the steps of:

printing, using an encoder having two or more rendering engines, a pattern of tags, each tag having a data area comprising data dots and a locator component comprising constant dots;

using the tag encoder to obtain tag data from a tag format structure, the tag format structure being a dot based data package template containing a plurality of entries, there being an entry associated with each dot'"'"'s position, an entry indicating whether a data dot or a constant dot, accordingly each entry having either fixed data bits or variable data bits, and further;

interpreting each entry independently without reliance on state information.

2. The method of claim 1, wherein:

a first rendering engine processes one part of the surface and a second engine processes a different part of the surface.

3. The method of claim 1, wherein:

a first rendering engine processes one part of a tag and a second engine processes a different part of the same tag.

4. The method of claim 1, wherein:

each entry of the tag format structure comprises bits including a selected bit and the entry is interpreted as indicating a data bit, or not, according to the selected bit.

5. The method of claim 4, further comprising the step of:

determining if the selected bit indicates that the entry is data, then interpreting a remainder of the entry as an address.

6. The method of claim 1, wherein the tag format structure is comprised of one or more lines and further comprising the steps of:

scaling the tag by a factor of N, by scaling the number of entries in the tag format structure; and

scaling the tag format structure by replication of each entry N times and by replication of each line N times.

7. The method of claim 1, further comprising the step of:

providing a tag format structure in which dot positions have a relationship and the relationship takes into account a redundancy encoding of the data.

8. The method of claim 1, further comprising the steps of:

using the tag encoder to redundantly encode the data bits to conserve bandwidth.

9. The method of claim 1, further comprising the step of:

redundantly encoding entries in the tag format structure.

10. The method of claim 1, further comprising the step of:

providing the encoder with an input which defines the structure of a tag.

11. The method of claim 1, further comprising the step of:

providing the encoder with an input which defines whether or not to redundantly encode the variable data bits or to treat the variable data bits as having been encoded.

12. The method of claim 1, further comprising the step of:

providing the encoder with an input which defines whether or not to redundantly encode the fixed data bits or to treat the fixed data bits as having been encoded.

13. The method of claim 1, further comprising the step of:

providing the encoder with an input comprising a number of variable data bit records, each record containing one or more variable data bits for the one or more tags on a given line of tags.

14. The method of claim 1, further comprising the step of:

printed the tags with an infrared absorptive ink that can be read with a tag sensing device.

15. The method of claim 1, further comprising the step of:

using the encoder to merge encoded tag data with a basic tag structure and place dots in at least one output FIFO in a correct order for subsequent printing.

16. The method of claim 1, further comprising the step of:

generating encoded tag data from original data bits on-the-fly to minimize buffer space.

17. The method of claim 1, further comprising the step of:

printing each tag so as to have a background pattern further comprising a locator component.

18. The method of claim 17, wherein:

the locator component is circular.

19. The method of claim 9, further comprising the step of:

performing the encoding using double indirection encoding.

20. The method of claim 1, further comprising the step of:

printing the dots as continuous tone dots.