# Patent

## Title
Symmetric tags

## Abstract

Coded data for disposal on or in a surface, the coded data being arranged in accordance with at least one layout having n-fold rotational symmetry about a center of rotation, where n is at least two, and having mirror symmetry, the layout including:

    
    
        (a) n identical first sub-layouts rotated 1/n revolutions apart about the center of rotation, and,
        (b) n identical second sub-layouts rotated 1/n revolutions apart about the center of rotation, each second sub-layout being a reflection of a corresponding one of the first sub-layouts, at least one sub-layout including:
        
            (i) rotation-indicating data that distinguishes that sub-layout from at least one other sub-layout; and,
            (ii) reflection-indicating data that distinguishes the reflection of that sub-layout from the reflection of a corresponding reflected sub-layout.

## Background
FIELD OF INVENTION
This invention relates to coded data for disposal on or in a surface and in particular to coded data formed from symmetric tags. In use the symmetric tags can be used for providing identity-coding and position-coding of surfaces.
CROSS-REFERENCES
Various methods, systems and apparatus relating to the present invention are disclosed in the following co-pending applications and granted patents filed by the applicant or assignee of the present invention. The disclosures of all of these co-pending applications are incorporated herein by cross-reference.

















7,156,289
7,178,718
7,225,979
09/575,197
7,079,712
6,825,945


7,330,974
6,813,039
7,190,474
6,987,506
6,824,044
6,980,318


6,816,274
7,102,772
7,350,236
6,681,045
6,678,499
6,679,420


6,963,845
6,976,220
6,728,000
7,110,126
7,173,722
6,976,035


6,813,558
6,766,942
6,965,454
6,995,859
7,088,459
6,720,985


7,286,113
6,922,779
6,978,019
6,847,883
7,131,058
7,295,839


09/607,843
09/693,690
6,959,298
6,973,450
7,150,404
6,965,882


7,233,924
09/575,181
09/722,174
7,175,079
7,162,259
6,718,061


10/291,523
10/291,471
7,012,710
6,825,956
10/291,481
7,222,098


10/291,825
7,263,508
7,031,010
6,972,864
6,862,105
7,009,738


6,989,911
6,982,807
10/291,576
6,829,387
6,714,678
6,644,545


6,609,653
6,651,879
10/291,555
7,293,240
10/291,592
10/291,542


7,044,363
7,004,390
6,867,880
7,034,953
6,987,581
7,216,224


10/291,821
7,162,269
7,162,222
7,290,210
7,293,233
7,293,234


6,850,931
6,865,570
6,847,961
10/685,523
10/685,583
7,162,442


10/685,584
7,159,784
7,068,382
7,007,851
6,957,921
6,457,883


10/743,671
7,094,910
7,091,344
7,122,685
7,038,066
7,099,019


7,062,651
6,789,194
6,789,191
6,644,642
6,502,614
6,622,999


6,669,385
6,827,116
6,549,935
6,987,573
6,727,996
6,591,884


6,439,706
6,760,119
7,295,332
7,064,851
6,826,547
6,290,349


6,428,155
6,785,016
6,831,682
6,741,871
6,927,871
6,980,306


6,965,439
6,840,606
7,036,918
6,977,746
6,970,264
7,068,389


7,093,991
7,190,491
6,982,798
6,870,966
6,822,639
6,474,888


6,627,870
6,724,374
6,788,982
7,263,270
6,788,293
6,946,672


6,737,591
7,091,960
09/693,514
6,792,165
7,105,753
6,795,593


6,980,704
6,768,821
7,132,612
7,041,916
6,797,895
7,015,901


7,289,882
7,148,644
10/778,056
10/778,058
10/778,060
10/778,059


10/778,063
10/778,062
10/778,061
10/778,057
7,055,739
7,233,320


6,830,196
6,832,717
7,182,247
7,082,562
6,843,420
10/291,718


6,789,731
7,057,608
6,766,944
6,766,945
7,289,103
10/291,559


7,299,969
10/409,864
7,108,192
7,111,791
10/683,040
10/778,090


6,957,768
09/575,172
7,170,499
7,106,888
7,123,239
6,982,701


6,982,703
7,227,527
6,786,397
6,947,027
6,975,299
7,139,431


7,048,178
7,118,025
6,839,053
7,015,900
7,010,147
7,133,557


6,914,593
10/291,546
6,454,482
6,808,330
6,527,365
6,474,773


6,550,997
7,093,923
6,957,923
7,131,724









BACKGROUND ART
The reference to any prior art in this specification is not, and should not be taken as, an acknowledgment or any form of suggestion that such prior art forms part of the common general knowledge.
It is known to provide one or more coded data structures on a surface that can be read and decoded by a suitable sensing device. Various embodiments of such a device incorporating an optical sensor are described in many of the documents incorporated into the present application by cross-reference.
The coded data structures disclosed in these documents include target features that enable the sensing device to identify the position of each structure. The relative positions of the features within each structure can also be interpreted to determine perspective distortion of the structure as sensed, enabling perspective correction to be performed on the sensed data. However, to enable the sensing device to decode the data in the structure, it is necessary that the position and orientation of the data relative to the structure and the position and orientation of the structure relative to the viewpoint be determined. Typically, this is achieved by providing at least one feature in the structure that is asymmetric in some way. For example, in one embodiment, a keyhole-shaped feature is provided that can be located with respect to the other features, and then recognized to ascertain the rotational orientation of the structure in relation to the sensing device. The actual data that is encoded in the data structure can then be decoded, since its position and orientation relative to the structure can be inferred.
Disadvantages with this arrangement include the need to dedicate space to one or more orientation features, and the difficulty of including redundancy in such features for the purposes of allowing orientation determination in the presence of damage to the features. It is desirable, therefore, to encode orientation information both more space-efficiently and in an error-detectable and/or error-correctable fashion.
SUMMARY OF THE INVENTION
In a first aspect the present invention provides coded data for disposal on or in a surface, the coded data being arranged in accordance with at least one layout having n-fold rotational symmetry about a center of rotation, where n is at least two, and having mirror symmetry, the layout including:

    
    
        (a) n identical first sub-layouts rotated 1/n revolutions apart about the center of rotation, and,
        (b) n identical second sub-layouts rotated 1/n revolutions apart about the center of rotation, each second sub-layout being a reflection of a corresponding one of the first sub-layouts, at least one sub-layout including:
        
            (i) rotation-indicating data that distinguishes that sub-layout from at least one other sub-layout; and,
            (ii) reflection-indicating data that distinguishes the reflection of that sub-layout from the reflection of a corresponding reflected sub-layout.
        
        
    
    


In another aspect the present invention provides a surface bearing machine-readable coded data, the coded data being arranged in accordance with at least one layout having n-fold rotational symmetry about a center of rotation, where n is at least two, and having mirror symmetry, the layout including:

    
    
        (c) n identical first sub-layouts rotated 1/n revolutions apart about the center of rotation, and,
        (d) n identical second sub-layouts rotated 1/n revolutions apart about the center of rotation, each second sub-layout being a reflection of a corresponding one of the first sub-layouts, at least one sub-layout including:
        
            (i) rotation-indicating data that distinguishes that sub-layout from at least one other sub-layout; and,
            (ii) reflection-indicating data that distinguishes the reflection of that sub-layout from the reflection of a corresponding reflected sub-layout.
        
        
    
    


In a further aspect the present invention provides a method of generating an interface surface, the method including the steps of:

    
    
        (e) receiving user data in a printer;
        (f) generating machine-readable coded data incorporating the user data, the coded data being arranged in accordance with at least one layout having n-fold rotational symmetry about a center of rotation, where n is at least two, and having mirror symmetry, the layout including:
        
            (i) n identical first sub-layouts rotated 1/n revolutions apart about the center of rotation, and,
            (ii) n identical second sub-layouts rotated 1/n revolutions apart about the center of rotation, each second sub-layout being a reflection of a corresponding one of the first sub-layouts, at least one sub-layout including:
            
                (1) rotation-indicating data that distinguishes that sub-layout from at least one other sub-layout; and,
                (2) reflection-indicating data that distinguishes the reflection of that sub-layout from the reflection of a corresponding reflected sub-layout.
            
            
        
        
        (g) printing the coded data onto a surface.
    
    


In another aspect the present invention provides a method of using a sensing device to read machine-readable coded data, the coded data being arranged in accordance with at least one layout having n-fold rotational symmetry about a center of rotation, where n is at least two, and having mirror symmetry, the layout including:

    
    
        (i) n identical first sub-layouts rotated 1/n revolutions apart about the center of rotation, and,
        (ii) n identical second sub-layouts rotated 1/n revolutions apart about the center of rotation, each second sub-layout being a reflection of a corresponding one of the first sub-layouts, at least one sub-layout including:
        
            (1) rotation-indicating data that distinguishes that sub-layout from at least one other sub-layout; and,
            (2) reflection-indicating data that distinguishes the reflection of that sub-layout from the reflection of a corresponding reflected sub-layout.
        
        
        (h) sensing at least one layout using the sensing device;
        (i) decoding the coded data of at least one of the sub-layouts of the sensed layout, thereby determining at least the rotation-indicating data of that sub-layout; and
        (j) using the rotation-indicating data to interpret the meaning of at least some of the coded data.
    
    





BRIEF DESCRIPTION OF THE DRAWINGS
Preferred and other embodiments of the invention will now be described, by way of non-limiting example only, with reference to the accompanying drawings, in which:
FIG. 1 shows a triangular macrodot packing with a four-bit symbol unit outlined, for use with an embodiment of the invention;
FIG. 2 shows a square macrodot packing with a four-bit symbol unit outlined, for use with an embodiment of the invention;
FIG. 3 shows a hexagonal macrodot packing with a four-bit symbol unit outlined, for use with an embodiment of the invention;
FIG. 4 shows a one-sixth segment of an hexagonal tag, with the segment containing a maximum of 11 four-bit symbols with the triangular macrodot packing shown in FIG. 1;
FIG. 5 shows a one-sixth segment of another hexagonal tag, with the segment containing a maximum of 17 four-bit symbols with the triangular macrodot packing shown in FIG. 1;
FIG. 6 shows a one-quarter segment of a square tag, with the segment containing a maximum of 15 four-bit symbols with the square macrodot packing shown in FIG. 2;
FIG. 7 shows a one-sixth segment of an hexagonal tag, with the segment containing a maximum of 14 four-bit symbols with the hexagonal macrodot packing shown in FIG. 3;
FIG. 8 shows a logical layout of a hexagonal tag using the tag segment of FIG. 4, with six interleaved 24-ary codewords;
FIG. 9 shows the macrodot layout of the hexagonal tag of FIG. 8;
FIG. 10 shows an arrangement of seven abutting tags of the design of FIG. 8 and FIG. 9, with shared targets;
FIG. 11 shows a logical layout of a square tag using the tag segment of FIG. 6, with four interleaved 24-ary (15, k) codewords;
FIG. 12 shows the macrodot layout of the square tag of FIG. 11;
FIG. 13 shows an arrangement of nine abutting tags of the design of FIG. 11 and FIG. 12, with shared targets;
FIG. 14 shows a logical layout of an alternative square tag, with four interleaved 23-ary (7,k) codewords;
FIG. 15 shows the macrodot layout of the square tag of FIG. 14;
FIG. 16 shows a logical layout of a triangular tag, with three interleaved 23-ary (7, k) codewords;
FIG. 17 shows the macrodot layout of the triangular tag of FIG. 16;
FIG. 18 shows a logical layout of a two-fold rotationally symmetric linear tag, with two interleaved 23-ary (7,k) codewords;
FIG. 19 shows the macrodot layout of the linear tag of FIG. 18;
FIG. 20 shows an alternative macrodot layout based on the layout of the linear tag of FIG. 18, with a purely one-dimensional structure analogous to the structure of a conventional barcode;
FIG. 21 shows a logical layout of an alternative hexagonal tag, with one local 24-ary (12, k) codeword, interleaved with eighteen 3-symbol fragments of eighteen distributed 24-ary (9, k) codewords;
FIG. 22 shows the logical layout of the hexagonal tag of FIG. 21, re-arranged to show the distributed 3-symbol fragments which contribute to the same codewords;
FIG. 23 shows a continuous tiling of three hexagonal tag types each with the structure of the tag of FIG. 21;
FIG. 24 shows a layout of an alternative square tag using the symbol of FIG. 2, with eight interleaved 24-ary (6, k) codewords;
FIG. 25 shows a layout of an alternative hexagonal tag using the symbol of FIG. 1, with twelve interleaved 24-ary (4,k) codewords; and
FIG. 26 shows a tag image processing and decoding process flow.



DESCRIPTION OF THE PREFERRRED AND OTHER EMBODIMENTS
In the preferred embodiment, the invention is configured to work with the netpage networked computer system, an overview of which follows. It will be appreciated that not every implementation will necessarily embody all or even most of the specific details and extensions discussed in relation to the basic netpage system.
In its preferred form, the netpage system relies on the production of, and human interaction with, netpages. These are pages of text, graphics and images printed on ordinary paper, but which work like interactive web pages. Information is encoded on each page using ink which is substantially invisible to the unaided human eye. The ink, however, and thereby the coded data, can be sensed by an optically imaging pen and transmitted to the netpage system.
In the preferred form, active buttons and hyperlinks on each page can be clicked with a sensing pen to request information from the network or to signal preferences to a network server. In one embodiment, text written by hand on a netpage is automatically recognized and converted to computer text in the netpage system, allowing forms to be filled in. In other embodiments, signatures recorded on a netpage are automatically verified, allowing e-commerce transactions to be securely authorized.
A detailed description of several forms of the netpage system, as well as a netpage printer and a netpage sensing device in the form of a stylus and pen is described in the present applicants' co-pending PCT application WO 00/72230 entitled “Sensing Device, filed 24 May 2000; and co-pending U.S. application U.S. Ser. No. 09/721,893 entitled “Sensing Device”, filed 25 Nov. 2000.
1.1 Netpages
Netpages are the foundation on which a netpage network is built. They provide a paper-based user interface to published information and interactive services.
A netpage consists of a printed page (or other surface region) invisibly tagged with references to an online description of the page. The online page description is maintained persistently by a netpage page server. The page description describes the visible layout and content of the page, including text, graphics and images. It also describes the input elements on the page, including buttons, hyperlinks, and input fields. A netpage allows markings made with a netpage pen on its surface to be simultaneously captured and processed by the netpage system.
Multiple netpages can share the same page description. However, to allow input through otherwise identical pages to be distinguished, each netpage is assigned a unique page identifier. This page ID has sufficient precision to distinguish between a very large number of netpages.
Each reference to the page description is encoded in a printed tag. The tag identifies the unique page on which it appears, through the page ID, and thereby indirectly identifies the page description. The tag also identifies its own position on the page. Characteristics of the tags are described in more detail below.
Tags are printed in infrared-absorptive ink on any substrate which is infrared-reflective, such as ordinary paper. Near-infrared wavelengths are invisible to the human eye but are easily sensed by a solid-state image sensor with an appropriate filter.
A tag is sensed by an area image sensor in the netpage pen, and the decoded tag data is transmitted to the netpage system via the nearest netpage relay, such as a suitably-enabled personal computer, PDA, mobile phone or netpage printer. The pen is wireless and communicates with the netpage relay via a short-range radio link. The pen may also incorporate the relay functionality. Tags are sufficiently small and densely arranged that the pen can reliably image at least one tag even on a single click on the page. It is important that the pen recognize the page ID and position on every interaction with the page, since the interaction is stateless.
As only single tags may be sensed with one interaction, tags are preferably error-correctably encoded to make them partially tolerant to surface damage.
The netpage page server maintains a unique page instance for each printed netpage, allowing it to maintain a distinct set of user-supplied values for input fields in the page description for each printed netpage.
1.2 Coded Data on Surfaces Using Netpage Tags
Various netpage coding schemes and patterns are described in the present applicants' co-pending PCT application WO 00/72249 entitled “Identity-Coded Surface with Reference Points”, filed 24 May 2000; co-pending PCT application WO 02/84473 entitled “Cyclic Position Codes”, filed 11 Oct. 2001; co-pending US application U.S. Ser. No. 10/309,358 entitled “Rotationally Symmetric Tags”, filed 4 Dec. 2002; and Australian Provisional Application 2002952259 entitled “Methods and Apparatus (NPT019)”, filed 25 Oct. 2002.
1.2.1 Tag Data Content
In a preferred form, each tag identifies the region in which it appears, and the location of that tag within the region. A tag may also contain flags which relate to the region as a whole or to the tag. One or more flag bits may, for example, signal a tag sensing device to provide feedback indicative of a function associated with the immediate area of the tag, without the sensing device having to refer to a description of the region. A netpage pen may, for example, illuminate an “active area” LED when in the zone of a hyperlink.
The tags preferably tile the entire page, and are sufficiently small and densely arranged that the pen can reliably image at least one tag even on a single click on the page. It is important that the pen recognize the page ID and position on every interaction with the page, since the interaction is stateless.
In a preferred embodiment, the region to which a tag refers coincides with an entire page, and the region ID encoded in the tag is therefore synonymous with the page ID of the page on which the tag appears. In other embodiments, the region to which a tag refers can be an arbitrary subregion of a page or other surface. For example, it can coincide with the zone of an interactive element, in which case the region ID can directly identify the interactive element.
Each tag typically contains 16 bits of tag ID, at least 90 bits of region ID, and a number of flag bits. Assuming a maximum tag density of 64 per square inch, a 16-bit tag ID supports a region size of up to 1024 square inches. Larger regions can be mapped continuously without increasing the tag ID precision simply by using abutting regions and maps. The distinction between a region ID and a tag ID is mostly one of convenience. For most purposes the concatenation of the two can be considered as a globally unique tag ID. Conversely, it may also be convenient to introduce structure into the tag ID, for example to define the x and y coordinates of the tag. A 90-bit region ID allows 290 ( ̃1027 or a thousand trillion trillion) different regions to be uniquely identified. Tags may also contain type information, and a region may be tagged with a mixture of tag types. For example, a region may be tagged with one set of tags encoding x coordinates and another set, interleaved with the first, encoding y coordinates. It will be appreciated the region tag ID and tag ID precision may be more or less than just described depending on the environment in which the system will be used.
1.2.2 Tag Data Encoding
FIG. 11 shows one embodiment of a netpage tag in the form of a square tag 726 with four perspective targets 17. It is similar in appearance to tags described by Bennett et al. in U.S. Pat. No. 5,051,746. The tag 726 represents sixty 4-bit Reed-Solomon symbols 747 (see the description of FIG. 1, FIG. 2 and FIG. 3 below for a discussion of symbols), for a total of 240 bits. The tag represents each “one” bit by the presence of a mark 748, referred to as a macrodot, and each “zero” bit by the absence of the corresponding macrodot. FIG. 13 shows a square tiling 728 of nine tags, containing all “one” bits for illustrative purposes. It will be noted that the perspective targets are designed to be shared between adjacent tags.
In general, each tag includes a codeword encoded four times within the tag using the 4-bit symbols. Using a (15, 7) Reed-Solomon code, 112 bits of tag data are redundantly encoded to produce 240 encoded bits, corresponding to 60-bits, or 15 4-bit symbols, per codeword.
In one example, each 4-bit symbol is represented in a spatially coherent way in the tag, with the symbols of the four codewords being interleaved spatially within the tag. This is shown by the example in FIG. 11, where each symbol is labeled with the number of its codeword (1-4) and the position of the symbol within the codeword(A-O).
This ensures that a burst error (an error affecting multiple spatially adjacent bits) damages a minimum number of symbols overall and a minimum number of symbols in any one codeword, thus maximizing the likelihood that the burst error can be fully corrected.
This arrangement of using a (15, 7) Reed-Solomon code, with 112 bits of tag data redundantly encoded to produce 240 encoded bits, and spatial interleaving of the codewords within the tag allows up to 4 symbol errors to be corrected per codeword, i.e. it is tolerant of a symbol error rate of up to 27% per codeword.
Any suitable error-correcting code can be used in place of a (15, 7) Reed-Solomon code, for example: a Reed-Solomon code with more or less redundancy, with the same or different symbol and codeword sizes; another block code; or a different kind of code, such as a convolutional code (see, for example, Stephen B. Wicker, Error Control Systems for Digital Communication and Storage, Prentice-Hall 1995, the contents of which a herein incorporated by reference thereto).
In order to support “single-click” interaction with a tagged region via a sensing device, the sensing device must be able to see at least one entire tag in its field of view no matter where in the region or at what orientation it is positioned. The required diameter of the field of view of the sensing device is therefore a function of the size and spacing of the tags.
The data-bearing macrodots 748 of the tag are designed to not overlap their neighbors, so that groups of tags cannot produce structures that resemble targets. This also saves ink. The perspective targets allow detection of the tag, so further targets are not required.
Although the tag may contain an orientation feature to allow disambiguation of the four possible orientations of the tag relative to the sensor, the present invention is concerned with embedding orientation and related transform data in the tag data. For example, the four codewords can be arranged so that each tag orientation (in a rotational sense) contains one codeword placed at that orientation, as shown in FIG. 11.
Tag decoding then consists of decoding one codeword at each rotational orientation. Each codeword can either contain a single bit indicating whether it is the first codeword, or two bits indicating which codeword it is. The latter approach has the advantage that if, say, the data content of only one codeword is required, then at most two codewords need to be decoded to obtain the desired data. This may be the case if the region ID is not expected to change within a stroke and is thus only decoded at the start of a stroke. Within a stroke only the codeword containing the tag ID is then desired. Furthermore, since the rotation of the sensing device changes slowly and predictably within a stroke, only one codeword typically needs to be decoded per frame.
It is possible to dispense with perspective targets altogether and instead rely on the data representation being self-registering. In this case each bit value (or multi-bit value) is typically represented by an explicit glyph, i.e. no bit value is represented by the absence of a glyph. This ensures that the data grid is well-populated, and thus allows the grid to be reliably identified and its perspective distortion detected and subsequently corrected during data sampling.
To allow tag boundaries to be detected, each tag data must contain a marker pattern, and these must be redundantly encoded to allow reliable detection. The overhead of such marker patterns is similar to the overhead of explicit perspective targets. Such scheme uses dots positioned at various points relative to grid vertices to represent different glyphs and hence different multi-bit values, as discussed in the present applicants' co-pending PCT application WO 02/084473 entitled “Cyclic Position Codes”, filed 11 Oct. 2001.
The arrangement 728 of FIG. 13 shows that the square tag 726 can be used to fully tile or tessellate, i.e. without gaps or overlap, a plane of arbitrary size.
Although in preferred embodiments the tagging schemes described herein encode a single data bit using the presence or absence of a single undifferentiated macrodot, they can also use sets of differentiated glyphs to represent single-bit or multi-bit values, such as the sets of glyphs illustrated in the present applicants' co-pending PCT application WO 02/084473 entitled “Cyclic Position Codes”, filed 11 Oct. 2001.
Macrodot Packing Schemes
FIG. 1 shows a triangular macrodot packing 700 with a four-bit symbol unit 702 outlined. The area of the symbol unit is given by AUNIT=2√{square root over ( )}3s2≅3.5s2, where s the spacing of adjacent macrodots. FIG. 2 shows a square macrodot packing 704 with a four-bit symbol unit 706 outlined. The area of the symbol unit is given by AUNIT=4s2. FIG. 3 shows a hexagonal macrodot packing 708 with a four-bit symbol unit 710 outlined. The area of the symbol unit is given by AUNIT=3√{square root over ( )}3s2≅5.2s2. Of these packing schemes, the triangular packing scheme gives the greatest macrodot density for a particular macrodot spacing s.
In preferred embodiments, s has a value between 100 μm and 200 μm.
Tag Designs
FIG. 4 shows a one-sixth segment 712 of a hexagonal tag, with the segment containing a maximum of 11 four-bit symbols with the triangular macrodot packing shown in FIG. 1. The target 17 is shared with adjacent segments. Each tag segment can, by way of example, support a codeword of an (11, k) Reed-Solomon code, i.e. a punctured (15, k) code, with the ability to detect u=11−k symbol errors, or correct t=└(11−k)/2┘ symbol errors. For example, if k=7 then u=4 and t=2.
(EQ 1) gives the area of the corresponding hexagonal tag. (EQ 2) gives the radius of the required field of view. (EQ 3) gives the area of the required field of view. (EQ 4) gives the recovered bit data density for the field of view.

ATAG=(10s)×(5√{square root over ( )}3s)×6=300√{square root over ( )}3s2≅520s2  (EQ 1)

RFOV=(10s×2)+2s=22s  (EQ 2)

AFOV=πR2FOV≅1521s2  (EQ 3)

DFOV=(6×11×4)/AFOV≅0.17/s2  (EQ 4)

FIG. 5 shows a one-sixth segment 716 of another hexagonal tag, with the segment containing a maximum of 17 four-bit symbols with the triangular macrodot packing shown in FIG. 1. Each tag segment can, by way of example, support a codeword of a (17, k) Reed-Solomon code, i.e. an augmented (15, k) code, with the ability to detect u=17−k symbol errors, or correct t=[(17−k)/2] symbol errors. For example, if k=7 then u=10 and t=5.
(EQ 5) gives the area of the corresponding hexagonal tag. (EQ 6) gives the radius of the required field of view. (EQ 7) gives the area of the required field of view. (EQ 8) gives the recovered bit data density for the field of view.

ATAG=(12s)×(6√{square root over ( )}3s)×6=432√{square root over ( )}3s2≅748s   (EQ 5)

RFOV=(12s×2)+2s=26s   (EQ 6)

πR2FOV≅2124s2   (EQ 7)

DFOV=(6×17×4)/AFOV≅0.19/s2   (EQ 8)

FIG. 6 shows a one-quarter segment 718 of a square tag, with the segment containing a maximum of 15 four-bit symbols with the square macrodot packing shown in FIG. 2. Each tag segment can, by way of example, support a codeword of a (15, k) Reed-Solomon code, with the ability to detect u=15−k symbol errors, or correct t=└(15−k)/2┘ symbol errors. For example, if k=7 then u=8 and t=4.
(EQ 9) gives the area of the corresponding square tag. (EQ 10) gives the radius of the required field of view. (EQ 11) gives the area of the required field of view. (EQ 12) gives the recovered bit data density for the field of view.

ATAG=(8s)×(8s)×4=256s2   (EQ 9)

RFOV=((8s×2)+2s)×√{square root over ( )}2≅25.5s   (EQ10)

πR2FOV≅2036s2   (EQ 11)

DFOV=(4×15×4)/AFOV≅0.12/s2   (EQ 12)

FIG. 7 shows a one-sixth segment 720 of an hexagonal tag, with the segment containing a maximum of 14 four-bit symbols with the hexagonal macrodot packing shown in FIG. 3. Each tag segment can, by way of example, support a codeword of a (14, k) Reed-Solomon code, i.e. a punctured (15, k) code, with the ability to detect u=14−k symbol errors, or correct t=└(14−k)/2┘ symbol errors. For example, if k=6 then and u=8 and t=4.
(EQ 13) gives the area of the hexagonal tag. (EQ 14) gives the radius of the required field of view. (EQ 15) gives the area of the required field of view. (EQ 16) gives the recovered bit data density for the field of view.

ATAG=(8√{square root over ( )}3s)×(12s)×6=576√{square root over ( )}3s2≅998s2   (EQ 13)

RFOV=(8√{square root over ( )}3s×2)+2s≅29.7s   (EQ 14)

πR2FOV≅2774s2   (EQ 15)

DFOV=(6×14×4)/AFOV≅0.12/s2   (EQ 16)

Of the tag designs considered, hexagonal tag designs using the tag segments shown in FIG. 4 and FIG. 5 yield fields of view with the highest recovered bit data densities. Square and hexagonal tag designs using the tag segments shown respectively in FIG. 6 and FIG. 7 yield fields of view with lower recovered bit data densities.
Hexagonal Tag Design
FIG. 8 shows a logical layout of a hexagonal tag 722 using the tag segment 712 of FIG. 4, with six interleaved 24-ary (11, k) codewords. FIG. 9 shows the macrodot layout of the hexagonal tag 722 of FIG. 8. FIG. 10 shows an arrangement 724 of seven abutting tags 722 of the design of FIG. 9, with shared targets 17. The arrangement 724 shows that the hexagonal tag 722 can be used to tessellate a plane of arbitrary size.
Alternative Square Tag Design
FIG. 14 shows a logical layout of another square tag 730, with four interleaved 23-ary (7, k) codewords. Each 3-bit symbol 732 is represented by an L-shaped arrangement of three macrodots. FIG. 15 shows the macrodot layout of the square tag 730 of FIG. 14.
Triangular Tag Design
FIG. 16 shows a logical layout of a triangular tag 734, with three interleaved 23-ary (7, k) codewords. Each 3-bit symbol 736 is represented by a triangular arrangement of three macrodots. FIG. 17 shows the macrodot layout of the triangular tag 734 of FIG. 16. As with the square and hexagonal tags described above, the triangular tag 734 can be used to tessellate a plane of arbitrary size.
Linear Tag Design
FIG. 18 shows a logical layout of a two-fold rotationally symmetric linear tag 738, with two interleaved 23-ary (7, k) codewords. Each 3-bit symbol 740 is represented by a linear arrangement of three macrodots. FIG. 19 shows the macrodot layout of the linear tag 738 of FIG. 18.
FIG. 20 shows an alternative macrodot layout based on the layout of the linear tag of FIG. 18, with a purely one-dimensional structure analogous to the structure of a conventional barcode. Although the layout is based on that of the linear tag of FIG. 18, the target structures 17 are linear rather than circular. This embodiment is particularly suitable for use with prior art barcode scanners (with suitable software changes) adapted for linear scanning rather than area scanning.
Distributed Hexagonal Tan Design
FIG. 21 shows a logical layout of a hexagonal tag 750 using the tag segment of FIG. 22, with one local 24-ary (12, k) codeword interleaved with eighteen 3-symbol fragments of eighteen distributed 24-ary (9, k) codewords. FIG. 9 shows, as before, the macrodot layout of the hexagonal tag 750 of FIG. 21, and FIG. 10 shows an arrangement of seven abutting tags of the design of FIG. 9, with shared targets.
In the layout of FIG. 21, the twelve 4-bit symbols of the local codeword are labeled G1 through G12, and are shown with a dashed outline. Each symbol of the eighteen fragments of the eighteen distributed codewords is labeled with an initial prefix of A through F, indicating which of six nominal codewords the symbol belongs to, a subsequent prefix of S through U, indicating which 3-symbol part of the codeword the symbol belongs to, and a suffix of 1 through 3, indicating which of the three possible symbols the symbol is.
FIG. 23 shows a continuous tiling 752 of three hexagonal tag types labeled P, Q and R, each with the structure of tag 750. There are six distributed codewords (A through F) associated with each tag type (P, Q and R). The distributed tagging scheme is predicated on the data content of each respective distributed codeword AP, AQ, AR, etc. through FP, FQ and FR being constant throughout the tiling. Only the G codewords can contain unique data.
FIG. 23 shows lattice vectors 754 associated with the physical tag layout, and corresponding (i.e. iso-directional rather than minimal) lattice vectors 755 associated with the PQR tag layout. The ratio of the length of the PQR lattice vectors 755 to the length of the corresponding physical lattice vectors 754 is three, consistent with there being three distinct tag types P, Q and R in the PQR tag layout.
FIG. 23 also shows the coverage 756 and 757 of a minimal imaging field of view in two arbitrary positions with respect to the tiling. The field of view is minimal with respect to the tiling in the sense that it the smallest field of view which is guaranteed to include at least one complete tag. Tag 750 is structured so that the minimal field of view allows the recovery of the local codeword G of at least one tag, and the entire set of distributed codewords AP through FR via fragments of tags of type P, Q and R included in the field of view. Furthermore, the continuous tiling of tag 750 ensures that there is a codeword available with a known layout for each possible rotational and translational combination (of which there are eighteen). Each distributed codeword includes data which identifies the rotation of the codeword in relation to the tiling, thus allowing the rotation of the tiling with respect to the field of view to be determined from decoded data rather than from other structures, and the local codeword to be decoded at the correct orientation.
Once the field of view is imaged, decoding proceeds as follows. A codeword is sampled at an arbitrary rotation (of the possible six rotations with respect to the six targets). This consists of sampling three S symbols from the current tag, and sampling, at the same rotation, T and U symbols from adjacent tags, modulo the size and alignment of the field of view with respect to the tiling. The result is a single distributed 24-ary (9, k) codeword. Decoding the codeword yields, among other data, the codeword orientation. Once the orientation is known, the local G codeword can be sampled and decoded at the correct orientation. Decoding the G codeword yields, among other data, the type of the corresponding tag (i.e. P, Q or R). This in turn allows the data content of the various distributed codewords to be correctly interpreted, once they are sampled and decoded. It also allows the distributed codewords to be selectively sampled and decoded. For example, codewords known to contain data which is assumed not to change during a stroke, such as the region ID, may be ignored.
FIG. 22 shows the logical layout of the hexagonal tag 750 of FIG. 21, re-arranged to show the distributed 3-symbol fragments which contribute to the same codewords. For example, if the central tag shown in FIG. 22 were a P-type tag, then the six distributed codewords shown in the figure would be the AP, BP, CP, DP, EP and FP codewords. FIG. 22 also shows the local G codeword of the tag. Clearly, given the distributed and repeating nature of the distributed codewords, different fragments from the ones shown in the figure can be used to build the corresponding codewords.
Although it is more space-efficient to record the tag type (P, Q or R) in the G codeword, the tag type corresponding to each (or to selected) distributed codewords can also be recorded in the distributed codewords themselves. In this case there is a fixed relationship between a codeword's alignment and the tag to which its tag type refers. For example, a codeword's tag type may always refer to the tag containing the S fragment of the codeword.
Note that with a larger field of view, a particular codeword need not be constant throughout the tiling, but may instead be allowed to be constant only in a certain direction. For example, a codeword used to encode a coordinate can be constant in the direction where the coordinate is constant, but can vary in (semi-)orthogonal directions (with respect to the rotational symmetry of the tiling). This has the advantage that semi-variable information can be encoded in distributed codewords rather than being restricted to local codewords.
Mirror-Symmetric Tap Designs
FIG. 24 shows a layout of a square tag 760 using the symbol of FIG. 2, with eight interleaved 24-ary (6, k) codewords. Like the square tag of FIG. 11 discussed earlier, the tag of FIG. 24 contains four codewords, each arranged according to the same layout but each rotated according to a different one of the four possible rotations of the tag with respect to its own four-fold rotational symmetry. As discussed earlier, this allows a codeword to be sampled and decoded independently of the actual rotation of the tag, which allows the rotation of the tag to be encoded in the codeword(s).
The tag of FIG. 24 contains four additional codewords, laid out in the mirror image of the original four codewords with respect to the tag's two axes of reflection 762 and 764. This allows a codeword to be sampled and decoded independently of the actual rotation and reflection of the tag, which allows the rotation and reflection of the tag to be encoded in the codeword(s). This is useful if the tag may be imaged in reflection, e.g. reflected in a mirror or through the back of a transparent substrate.
Each codeword may explicitly indicate its rotation and reflection via a three-bit value, or implicitly via a one-bit value indicating whether the codeword corresponds to a pre-determined rotation and reflection or not.
In FIG. 24, each original symbol has a prefix (1-4) indicating which codeword it belongs to, and a suffix (A-F) indicating its position in the codeword. Each reflected symbol is shown with a bar above its label, as well as with a dashed outline.
FIG. 25 shows a layout of hexagonal tag 770 using the symbol of FIG. 1, with twelve interleaved 24-ary (4, k) codewords. Like the hexagonal tag of FIG. 8 discussed earlier, the tag of FIG. 25 contains six codewords, each arranged according to the same layout but each rotated according to a different one of the six possible rotations of the tag with respect to its own six-fold rotational symmetry.
The tag of FIG. 25 contains six additional codewords, laid out in the mirror image of the original six codewords with respect to the tag's three axes of reflection 772, 774 and 776. As discussed above, this allows a codeword to be sampled and decoded independently of the actual rotation and reflection of the tag, which allows the rotation and reflection of the tag to be encoded in the codeword(s).
Each codeword may explicitly indicate its rotation and reflection via a four-bit value, or implicitly via a one-bit value indicating whether the codeword corresponds to a pre-determined rotation and reflection or not.
In FIG. 25, each original symbol has a prefix (1-6) indicating which codeword it belongs to, and a suffix (A-D) indicating its position in the codeword. Each reflected symbol is shown with a bar above its label, as well as with a dashed outline.
Note that the tags of FIG. 24 and FIG. 25 are not ideally sized for the number of symbols each codeword contains, since the data content of each codeword is low once allowance is made for useful redundancy. However, both serve to illustrate interleaved rotation-symmetric and mirror-symmetric tag designs, and the design principles obviously extend to tags of larger size and/or to tags incorporating different error-detecting and error-correcting schemes.
1.2.3 Tag Image Processing and Decoding
FIG. 26 shows a tag image processing and decoding process flow. A raw image 802 of the tag pattern is acquired (at 800), for example via an image sensor such as a CCD image sensor, CMOS image sensor, or a scanning laser and photodiode image sensor. The raw image is then typically enhanced (at 804) to produce an enhanced image 806 with improved contrast and more uniform pixel intensities. Image enhancement may include global or local range expansion, equalization, and the like.
The enhanced image 806 is then typically filtered (at 808) to produce a filtered image 810. Image filtering may consist of low-pass filtering, with the low-pass filter kernel size tuned to obscure macrodots but to preserve targets. The filtering step 808 may include additional filtering (such as edge detection) to enhance target features.
The filtered image 810 is then processed to locate target features (at 812), yielding a set of target points. This may consist of a search for target features whose spatial inter-relationship is consistent with the known geometry of a tag. Candidate targets may be identified directly from maxima in the filtered image 810, or may the subject of further characterization and matching, such as via their (binary or grayscale) shape moments (typically computed from pixels in the enhanced image 806 based on local maxima in the filtered image 810), as described in U.S. patent application Ser. No. 09/575,154.
The search typically starts from the center of the field of view. The target points 814 found by the search step 812 indirectly identify the location of the tag in the three-dimensional space occupied by the image sensor and its associated optics. Since the target points 814 are derived from the (binary or grayscale) centroids of the targets, they are typically defined to sub-pixel precision.
It may be useful to determine the actual 3D transform of the tag (at 816), and, by extension, the 3D transform (or pose) 818 of the sensing device relative to the tag. This may be done analytically, as described in U.S. patent application Ser. No. 09/575,154, or using a maximum likelihood estimator (such as least squares adjustment) to fit parameter values to the 3D transform given the observed perspective-distorted target points (as described in P. R. Wolf and B. A. Dewitt, Elements of Photogrammetry with Applications in GIS, 3rd Edition, McGraw Hill, February 2000, the contents of which are herein incorporated by reference thereto). The 3D transform includes the 3D translation of the tag, the 3D orientation (rotation) of the tag, and the focal length and viewport scale of the sensing device, thus giving eight parameters to be fitted, or six parameters if the focal length and viewport scale are known (e.g. by design or from a calibration step). Each target point yields a pair of observation equations, relating an observed coordinate to a known coordinate. If eight parameters are being fitted, then five or more target points are needed to provide sufficient redundancy to allow maximum likelihood estimation. If six parameters are being fitted, then four or more target points are needed. If the tag design contains more targets than are minimally required to allow maximum likelihood estimation, then the tag can be recognized and decoded even if up to that many of its targets are damaged beyond recognition.
To allow macrodot values to be sampled accurately, the perspective transform of the tag must be inferred.
Four of the target points are taken to be the perspective-distorted corners of a rectangle of known size in tag space, and the eight-degree-of-freedom perspective transform 822 is inferred (at 820), based on solving the well-understood equations relating the four tag-space and image-space point pairs (see Heckbert, P., Fundamentals of Texture Mapping and Image Warping, Masters Thesis, Dept. of EECS, U. of California at Berkeley, Technical Report No. UCB/CSD 89/516, June 1989, the contents of which are herein incorporated by reference thereto). The perspective transform may alternatively be derived from the 3D transform 818, if available.
The inferred tag-space to image-space perspective transform 822 is used to project (at 824) each known data bit position in tag space into image space where the real-valued position is used to bi-linearly (or higher-order) interpolate (at 824) the four (or more) relevant adjacent pixels in the enhanced input image 806. The resultant macrodot value is compared with a suitable threshold to determine whether it represents a zero bit or a one bit.
Once the bits of one or more complete codeword have been sampled, the codewords are decoded (at 828) to obtain the desired data 830 encoded in the tag. Redundancy in the codeword may be used to detect errors in the sampled data, or to correct errors in the sampled data.
As discussed in U.S. patent application Ser. No. 09/575,154, the obtained tag data 830 may directly or indirectly identify the surface region containing the tag and the position of the tag within the region. An accurate position of the sensing device relative to the surface region can therefore be derived from the tag data 830 and the 3D transform 818 of the sensing device relative to the tag.
1.2.4 Tag Map
Decoding a tag results in a region ID, a tag ID, and a tag-relative pen transform. Before the tag ID and the tag-relative pen location can be translated into an absolute location within the tagged region, the location of the tag within the region must be known. This is given by a tag map, a function which maps each tag ID in a tagged region to a corresponding location.
A tag map reflects the scheme used to tile the surface region with tags, and this can vary according to surface type. When multiple tagged regions share the same tiling scheme and the same tag numbering scheme, they can also share the same tag map.
The tag map for a region must be retrievable via the region ID. Thus, given a region ID, a tag ID and a pen transform, the tag map can be retrieved, the tag ID can be translated into an absolute tag location within the region, and the tag-relative pen location can be added to the tag location to yield an absolute pen location within the region.
The tag ID may have a structure which assists translation through the tag map. It may, for example, encode Cartesian coordinates or polar coordinates, depending on the surface type on which it appears. The tag ID structure is dictated by and known to the tag map, and tag IDs associated with different tag maps may therefore have different structures. For example, the tag ID may simply encode a pair of x and y coordinates of the tag, in which case the tag map may simply consist of record of the coordinate precision. If the coordinate precision is fixed, then the tag map can be implicit.
1.2.5 Tagging Schemes
Two distinct surface coding schemes are of interest, both of which use the tag structure described earlier in this section. The preferred coding scheme uses “location-indicating” tags as already discussed. An alternative coding scheme uses object-indicating tags.
A location-indicating tag contains a tag ID which, when translated through the tag map associated with the tagged region, yields a unique tag location within the region. The tag-relative location of the pen is added to this tag location to yield the location of the pen within the region. This in turn is used to determine the location of the pen relative to a user interface element in the page description associated with the region.
Not only is the user interface element itself identified, but a location relative to the user interface element is identified. Location-indicating tags therefore trivially support the capture of an absolute pen path in the zone of a particular user interface element.
An object-indicating tag contains a tag ID which directly identifies a user interface element in the page description associated with the region. All the tags in the zone of the user interface element identify the user interface element, making them all identical and therefore indistinguishable.
Object-indicating tags do not, therefore, support the capture of an absolute pen path. They do, however, support the capture of a relative pen path. So long as the position sampling frequency exceeds twice the encountered tag frequency, the displacement from one sampled pen position to the next within a stroke can be unambiguously determined.
With either tagging scheme, the tags function in cooperation with associated visual elements on the netpage as user interactive elements in that a user can interact with the printed page using an appropriate sensing device in order for tag data to be read by the sensing device and for an appropriate response to be generated in the netpage system.
The invention may also be said to broadly consist in the parts, elements and features referred to or indicated herein, individually or collectively, in any or all combinations of two or more of the parts, elements or features, and wherein specific integers are mentioned herein which have known equivalents in the art to which the invention relates, such known equivalents are deemed to be incorporated herein as if individually set forth.
Although the preferred embodiment has been described in detail, it should be understood that various changes, substitutions, and alterations can be made by one of ordinary skill in the art without departing from the scope of the present invention.

## Claims

1. A method of generating an interface surface, the method including the steps of:
(a) receiving user data in a printer;
(b) generating machine-readable coded data incorporating the user data, the coded data being arranged in accordance with at least one layout having n-fold rotational symmetry about a center of rotation, where n is at least two, and having mirror symmetry, the layout including:
(i) n identical first sub-layouts rotated 1/n revolutions apart about the center of rotation, and,
(ii) n identical second sub-layouts rotated 1/n revolutions apart about the center of rotation, each second sub-layout being a reflection of a corresponding one of the first sub-layouts, at least one sub-layout including:
(1) rotation-indicating data that distinguishes that sub-layout from at least one other sub-layout; and,
(2) reflection-indicating data that distinguishes the reflection of that sub-layout from the reflection of a corresponding reflected sub-layout; and


(c) printing the coded data onto a surface.

2. A method according to claim 1, the coded data being substantially invisible to the unaided human eye.

3. A method according to claim 1, the surface further including additional visible markings, the method including printing visible markings on the surface substantially simultaneously with the coded data.