# US 2004/0079808 A1 · Tag and tag format structure

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0079808 A1
- Document ID: US20040079808A1
- Status: Published application
- Kind: A1
- Application number: 10/667,342
- Filed: 2003-09-23
- Published: 2004-04-29
- Earliest claimed: 2000-06-30
- Assignees: Silverbrook Research Pty Ltd
- Inventors: Simon Robert Walmsley; Paul Lapstun
- Web page: https://patentgrep.com/patent/US20040079808A1

## CPC

- G06K 19/06: characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K 1/121: {by printing code marks (applying code marks to labels B65C9/46; marking or coding completed packages B65B61/26)}
- G06K 7/1417: {2D bar codes}
- G06K 7/1421: {Circular bar codes}
- G06K 7/1443: {locating of the code in an image}
- G06K 7/1456: {determining the orientation of the optical code with respect to the reader and correcting therefore}
- G06K 19/06037: {multi-dimensional coding}
- G06K 19/06168: {the marking being a concentric barcode}
- G06K 2019/06262: {with target- or other orientation-indicating feature}
- G06K: GRAPHICAL DATA READING (image or video recognition or understanding G06V); PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS

## 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

### Claim 1

A tag embedded with data, the tag comprising dots, each dot having a position, the tag conforming to a tag format structure, wherein:
the tag format structure contains a plurality of entries, there being an entry associated with each dot's position;
each entry specifying whether the associated dot is data or not.

### Claim 2 (depends on 1)

The tag of claim 1, wherein:
each entry of the tag format structure comprises bits including a low order bit and the entry is interpreted according to the low order bit.

### Claim 3 (depends on 2)

The tag of claim 2, wherein:
the low order bit determines if the entry is interpreted as data or not.

### Claim 4 (depends on 3)

The tag of claim 3, wherein:
the low order bit indicates that the entry is data and a remainder of the bits of the entry is interpreted as an address.

### Claim 5 (depends on 1)

The tag of claim 1, wherein:
each entry is interpretable independently without reliance on state information.

### Claim 6 (depends on 1)

The tag of claim 1, wherein:
the tag format structure is comprised of one or more lines;
the tag is scaled by a factor of N by scaling the number of entries in the tag format structure;
the scaling of the tag format structure being a replication of each entry N times and a replication of each line N times.

### Claim 7 (depends on 1)

The tag of claim 1, wherein:
each dot is a macrodot generated from the tag format structure.

### Claim 8 (depends on 1)

The tag of claim 1, wherein:
dot positions have a relationship and the relationship takes into account a redundancy encoding of the data.

### Claim 9 (depends on 1)

The tag of claim 1, wherein:
the tag is produced using a tag encoder in which the tag format structure is implemented, the encoder encoding fixed data together with tag specific data into the tag.

### Claim 10 (depends on 9)

The tag of claim 9, wherein:
the tag is printed with an infrared absorptive ink that can be read with a tag sensing device.

### Claim 11 (depends on 9)

The tag of claim 9, wherein:
the tag encoder merges encoded tag data with a basic tag structure and places dots in an output FIFO in a correct order for subsequent printing.

### Claim 12 (depends on 11)

The tag of claim 11, wherein:
the encoded tag data is generated from the original data bits on-the-fly to minimize buffer space.

### Claim 13 (depends on 1)

The tag of claim 1, wherein:
dots may be located in a data area or located in an arbitrarily shaped constant background pattern.

### Claim 14 (depends on 13)

The tag of claim 13, wherein:
the background pattern further comprises a locator component.

### Claim 15 (depends on 14)

The tag of claim 14, wherein:
the locator component is circular.

### Claim 16 (depends on 9)

The tag of claim 9, wherein:
the encoding further comprises double indirection encoding.

### Claim 17 (depends on 1)

The tag of claim 1, wherein:
the dots are printed as continuous tone dots.

### Claim 18 (depends on 1)

The tag of claim 1, wherein:
each entry of the tag format structure comprises a selected and the entry is interpreted according to the selected bit.

### Claim 19 (depends on 18)

The tag of claim 18, wherein:
the selected bit determines if the entry is interpreted as data or not.

### Claim 20 (depends on 19)

The tag of claim 19, wherein:
the selected bit indicates that the entry is data and a remainder of the bits of the entry is interpreted as an address.
