CA2108456A1 - Data tag and detecting method - Google Patents
Data tag and detecting methodInfo
- Publication number
- CA2108456A1 CA2108456A1 CA002108456A CA2108456A CA2108456A1 CA 2108456 A1 CA2108456 A1 CA 2108456A1 CA 002108456 A CA002108456 A CA 002108456A CA 2108456 A CA2108456 A CA 2108456A CA 2108456 A1 CA2108456 A1 CA 2108456A1
- Authority
- CA
- Canada
- Prior art keywords
- cells
- data
- tag
- perimeter
- border
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
- 238000000034 method Methods 0.000 title claims description 12
- 239000003086 colorant Substances 0.000 description 2
- XMTQQYYKAHVGBJ-UHFFFAOYSA-N 3-(3,4-DICHLOROPHENYL)-1,1-DIMETHYLUREA Chemical compound CN(C)C(=O)NC1=CC=C(Cl)C(Cl)=C1 XMTQQYYKAHVGBJ-UHFFFAOYSA-N 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000003708 edge detection Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/06009—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking
- G06K19/06037—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code with optically detectable marking multi-dimensional coding
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K2019/06215—Aspects not covered by other subgroups
- G06K2019/06243—Aspects not covered by other subgroups concentric-code
Abstract
2108456 9218947 PCTABScor01 An identification or data tag composed of a central set of data cells surrounded by border cells which cooperate with their adjacent data cells by constrasting therewith to form a reference perimeter defined by the inter-sections of the boundaries of the border cells with their respective adjoining data cells.
Description
~Y'~ 92/18947 ~ A92/ool38 ¦:
1, . . .
DATA TAG AND D~TECTING METHOD
Field of the In~ention The present invention relates to an array tag. More particularly the present invention relates to a tag having a reference perimeter defined t by contrasting data and border cells.
s Background of the In~ention The use of printed identification tags to code information that can be sensed by optic sensors is well known. Numerous tags have been designed for a nurnber of dif~erent applications. Probably the most common of which is the bar code as used, for example, in grocery stores to identify packaged iterns.
It is also known to apply tags with specific coded informatior thereon and to use this coded information to control the movements of the coded article in accordance with the information coded on the tags, for example, this process is used to identifi~r railway cars and sort them and is also used at some airports, for example, to direct luggage to its correct destination.
The tags may take any suitable form but it is essential that the tag reader be able to a) locate the tag in the image b) orient the tag in the image (assurning that it is randornly applied) and c) decode the tag which obviously requires a) and b) be performed. This process is made considerably more reliable when the perimeter or a reference perimeter of the tag is easily identified.
It is also important to permit as much information as possible to be coded into the space available on the tag.
One of the more common forrns of the tag utili~es an array of cells set up in mutually perpendicular rows and colurnns and wherein the information is coded in each cell by one of a selected pair of contrasting colours, for example, black and white, so that the tag rea~er can then easily discrimi~ate one type of cell from another and by using the binary system clearly idenfffy what is coded therein.
U.S. patent 4,924,079 issued May 8, 1990 to Anselmo et al 7,:~84~ ~
discloses a matrix type arrangement having internal data field surrounded by a border and an external data field around the border (the external data field may be eliminated if desired), while U.S. patent 4,939,354 issued July 3, 1990 to Priddy discloses another machine readable binary coded tag format.
U.S. patent 4,924,078 issued May 8, 1~90 to Anselmo et al.
discloses a tag the perimeter of which must be determined to permit orientation and decoding of the tag. Identification of the perimeter requ~es the provision in the tag of a quiet zone to identify the perimeter of the tag.
Brief Description of the Present Invention It is an object of the present invention to provide a tag - cont ining coded data and complimentary border cells that define a reference perimeter.
The reference perimeter is an outstanding feature (i.e. easily identified) that facilitates locating a tag image.
Moreover, the ta~ of the present invention makes effective use of the tag area enabling more information to be encoded on a tag of given area or allows lower resolution (less expensive) ta8 readers for a given area ~ag or alternatively allows a given resolution reader to decode smaller tags with the same amoullt of information.
Broadly the present invention relates to a tag comprising a cen~al set of data cells surrounded by a plurality of border cells which cooperate with adjoining of said data cells to define a reference per~meter for said tag, each of said data cells being one of a first set of cells each of which has a first identi~ring feature or one of a secorld set of cells each having a t second identifying feature clear~y distinguishable from the first identifying feature, each of said border cells being selected from the opposite set of said first and second sets of cells to that from which its respective said adjoining data cell wa~ selected thereby to define a reference perimeter by the junction of said border c lls a~d their respective adjoining data cells.
If desired, additional data may be encoded in cells on the side of said border cells remote from said central set of data cells.
S~ 5g~ t~
1, . . .
DATA TAG AND D~TECTING METHOD
Field of the In~ention The present invention relates to an array tag. More particularly the present invention relates to a tag having a reference perimeter defined t by contrasting data and border cells.
s Background of the In~ention The use of printed identification tags to code information that can be sensed by optic sensors is well known. Numerous tags have been designed for a nurnber of dif~erent applications. Probably the most common of which is the bar code as used, for example, in grocery stores to identify packaged iterns.
It is also known to apply tags with specific coded informatior thereon and to use this coded information to control the movements of the coded article in accordance with the information coded on the tags, for example, this process is used to identifi~r railway cars and sort them and is also used at some airports, for example, to direct luggage to its correct destination.
The tags may take any suitable form but it is essential that the tag reader be able to a) locate the tag in the image b) orient the tag in the image (assurning that it is randornly applied) and c) decode the tag which obviously requires a) and b) be performed. This process is made considerably more reliable when the perimeter or a reference perimeter of the tag is easily identified.
It is also important to permit as much information as possible to be coded into the space available on the tag.
One of the more common forrns of the tag utili~es an array of cells set up in mutually perpendicular rows and colurnns and wherein the information is coded in each cell by one of a selected pair of contrasting colours, for example, black and white, so that the tag rea~er can then easily discrimi~ate one type of cell from another and by using the binary system clearly idenfffy what is coded therein.
U.S. patent 4,924,079 issued May 8, 1990 to Anselmo et al 7,:~84~ ~
discloses a matrix type arrangement having internal data field surrounded by a border and an external data field around the border (the external data field may be eliminated if desired), while U.S. patent 4,939,354 issued July 3, 1990 to Priddy discloses another machine readable binary coded tag format.
U.S. patent 4,924,078 issued May 8, 1~90 to Anselmo et al.
discloses a tag the perimeter of which must be determined to permit orientation and decoding of the tag. Identification of the perimeter requ~es the provision in the tag of a quiet zone to identify the perimeter of the tag.
Brief Description of the Present Invention It is an object of the present invention to provide a tag - cont ining coded data and complimentary border cells that define a reference perimeter.
The reference perimeter is an outstanding feature (i.e. easily identified) that facilitates locating a tag image.
Moreover, the ta~ of the present invention makes effective use of the tag area enabling more information to be encoded on a tag of given area or allows lower resolution (less expensive) ta8 readers for a given area ~ag or alternatively allows a given resolution reader to decode smaller tags with the same amoullt of information.
Broadly the present invention relates to a tag comprising a cen~al set of data cells surrounded by a plurality of border cells which cooperate with adjoining of said data cells to define a reference per~meter for said tag, each of said data cells being one of a first set of cells each of which has a first identi~ring feature or one of a secorld set of cells each having a t second identifying feature clear~y distinguishable from the first identifying feature, each of said border cells being selected from the opposite set of said first and second sets of cells to that from which its respective said adjoining data cell wa~ selected thereby to define a reference perimeter by the junction of said border c lls a~d their respective adjoining data cells.
If desired, additional data may be encoded in cells on the side of said border cells remote from said central set of data cells.
S~ 5g~ t~
2 3. 04. g~ ' 2a 2 1~ 1 S ~ ~
The present invention also relates to a method of detect~g the "periIneter" of a tag having cells containing a selected one of at least two different discrirninating feanlres to identify one cell from another comprising S providing a video image of said tag formed by scan lines of pixels, processing .
~9t~l8947 pcr/cA92/ool38 3 2 1 ~
pixels along said scan lines in said image to determ~ne a gradient at the pixelsdelimiting one feature from another and defining a boarder between adjacent cells, determining if a line defined by adjacent boarders conforms with a preselected criteria and if so continue to process along said scan lines to findS other sections of said preselected criteria and discover said perimeter of said tag, when an acceptable match is found between lines defined by said boarders of adjacent of said cells and said criteria said perimeter is established and said tag position and orientation is de~ned permitting decoding of a message coded on said tag. ' Preferably said criteria will comprise a plurality of straight lines and preferably said straight lines will intersect to define corners of said perimeter.
Brief Description of the Drawings Further features, objects and advantages will be evident from the following detailed descAption of the preferred embodiments of the present invention take~ in conjunction with the accompanying drawings in - which. s Figure 1 is a plan view of a tag constructed in accordance with the present invention and containing border cells a~d central data cells.
Figure 2 is a view similar to Figure 1 showing a tag with further data cells o31tside of the border cells.
Figure 3 illustrates a hexagon shaped tag incorporating the present invention.
Figure 4 is a schematic illustration of a reader for use with the tag of the present inventiolL
Figure S is a flow diagram illustrating the operation of the computer of the tag reader reading a tag as illustrated in Figure 1.
Deseription ofthe Prefe~Ted Embodiments The tag 10 of Figure 1 is composed of mutually perpendicular rows 1, 2, 3~ 4, 5, 6 and 7 a~d colum~s A, B, C, D, E, F, and G which define WO 92/18947 Pcr/cA92/ool3~ ~
2 ~ 4 individual cells lA, lB, 1C, 2A, 2B, 2C, etc., that may be coded with one of at least two different distlnguishable features. In the illustrated arrangement the disting~ishing features are the colours white or black. The rows 1 and 7 contain only border cells as do the columns A and G so that a central set 11 of coded data cells is defined by the cells contained within the corners 2B, 2F, `
6B, and 6F.
A reference 'perimetei 12 is indicated by hash lines e~ending therefrom on the white cells defining one side of the reference perimeter.
The reference perimeter in the example is square and completely encircles the set of data cells 11. However the reference perimeter need only extend for a distance around the data cells sui~lcient to identify and orient the tag 10. For example, the reference perimeter may extend along two or more sides of the set of data cells 11 and need not extend the full length of these sides. In all cases there must be a sufficient length of the perimeter to identi~ and oAent the tag. In most cases it is likely to include the set of datacells 11.
To define the reference perimeter 12 border cells in rows 1 and 7 and columns A and G are made to contrast with their respective adjoining data cell, for example, cell 2A is white since cell 2B is black and similarly cell lB is white because cell 2B is black so that all the border cells around the reference perimeter 12 having a different designating feature to that of its respective adjoining data cell contained within the central set 11.
A tag reader 100 schematically illustrated in Figure S can reliably distinguish the reference perimeter 12 by analyzing a video image of the tag 10 using well known edge detection techniques adapted to detect the lines of the reference perimeter 12. Once the reference perimeter has been determined, it is relatively straight forward to locate and to decode the data cells and/or border cells.
The array tag reader 100 generally consists of a 2D video camera 110 with a lens 120 interfaced through interface 130 with an irnage processing micro computer 140 as shown in Figure 4. The image ~rocessing algorithm executed by the micro computer would generally follow ~he WO92/18947 PCI/C~92/00138 sequence of operation shown in Figure 5.
As illustrated in Figure 5 an image is provided as indicated at 50 by a video camera or the like. ~e computer analyzes the video image and processes all pLxels in a sequence of pLxels along selected scan lines S coveAng the image as indicated at 52. If all pixels have been processed and no tag has been found this fact is returned as indicated at 54 to the main program. If more pixels remain to be processed the gradient is calculated at the current pixel as indicated at 56 and if the gradient in any direction exceeds a certain threshold as indicated at S8 then a straight line fit to the 10 contrast edge defined by the gradient is determined as indicated at 60. The straight line is then compared to see if it meets the constraints ?reviously programmed into the system as indicated at 62 and the straight line fit to the next contrast edge is then determined as indicated at 64 if constraints as viewed at 62 are met. Once a complete set of straight lines is obtained as 15 indicated at 66, the corners of the set of straight lines determined at 66 are determined as indicated at 68 and compared with the preprogrammed constraints for the tag. If the corners are properly identified they define the perimeter of the tag and the tag cells are probed to determine the coded message as indicated at 72 and assurning an error detection method is 20 programmed, it is applied to the detected message as indicated at 74. If no error is detected the information on the tag is delivered the mainline program as indicated at 76.
The algorithm searches along scan lines until a sufficiently large gradient (in any direction) defines an edge in the image. The algorithm then 25 steps along the edge to find the longest straight line that fits the edge to within a specified tolerance. The algorithm continues to step around the edge to determine a set of straight lines that approximate a ~t to the edge.
If the set of straight lines meet the constraints of the tag perimeter the intersections of the straight lines are determined and used to define the 30 corners of the perimeter and thereby the location and orierltation of the tag so the tag may then be analyzed and decoded.
The term gradient means a mathematical vector that gives the wo 92/18947 PCr/CA92/oo l 3s 2 ~ ci ~ s~3 '"~^`
magnitude and direction of a surface as is normally used to determine edges in an image and the contrast ring referred to in the above program is the reference perimeter 12.
It is alss possible, if des*ed, to provide further data cells on the S outside of the border cells as shown for example in Figure 2 where rows 0 and 8 and colurnns X and Y are outside of the-border cells and may be used to contain further data. In this case it is importallt that there not be confusion between the reference perimeter 12 and the periphery formed by the border cells and their adjacent outside data cells, i.e. the cells contained10 in rows 0 and 8 and columns X and Y should not be arranged in the same manner, i.e. to contrast with the border cells around the penphery and define a second reference periphery which would impede identification of the proper reference per~meter.
The reference perimeter 12 in Figure 2 also only extends 15 around three sides of the set of data cells 11. Ihe cell 7D in the illustration does not contrast with the adjoining data cell 6D to de~ne the perimeter but instead is used to code data, i.e. the whole row 7 may be used solely to code data if desired with the perimeter 12 being defined by an inverted U-shape.
Various consta~ts such as length and shape of the image 20 reference perimeter 12 a~d the use of special codes such as cyclic redundancycheck codes (CRC) may be used to differentiate the reference perimeter or coded data from false information.
Or~ly one row and column of data cells has been shown surrounding the border cells i~ ~igure 2, however further rows and columns 25 may also be provided if desired but it is generally preferred to ma~ntain the reference perimeter 12 close to the actual outer periphery of the data corltained within the tag.
In the illustrated arrangement the cells are all rectangular (square) and are either completely white or complçtely black so that the 30 edges of adjoining border and data cells define straight edges with a large contrast on opposite sides of the edges. Other shapes such as octagonal tag 10A with the reference perimeter 12A defined in the same marmer as the W092/l8s47 PCr/c~s2/00l38 2 ~ ~ 8 perimeter 12 (i.e. junction of contrasting boarder edges) are practical, - similarly the tag itself or the reference perimeter 12 may be a shape other than rectangle. The use of a tag with an octagonal perimeter has an advantage where the tag is to be applied to the end of a cylindrical object S such as a log as it increases the size or area of the tag tha~ may be used for a give diameter object.
Havi~g described the invention, modifications will be evident to those slcilled in the art without departing from the spirit of the invention as defined in the appended clairns.
.
:
.
~:
, .~ .
~, .
.
.
The present invention also relates to a method of detect~g the "periIneter" of a tag having cells containing a selected one of at least two different discrirninating feanlres to identify one cell from another comprising S providing a video image of said tag formed by scan lines of pixels, processing .
~9t~l8947 pcr/cA92/ool38 3 2 1 ~
pixels along said scan lines in said image to determ~ne a gradient at the pixelsdelimiting one feature from another and defining a boarder between adjacent cells, determining if a line defined by adjacent boarders conforms with a preselected criteria and if so continue to process along said scan lines to findS other sections of said preselected criteria and discover said perimeter of said tag, when an acceptable match is found between lines defined by said boarders of adjacent of said cells and said criteria said perimeter is established and said tag position and orientation is de~ned permitting decoding of a message coded on said tag. ' Preferably said criteria will comprise a plurality of straight lines and preferably said straight lines will intersect to define corners of said perimeter.
Brief Description of the Drawings Further features, objects and advantages will be evident from the following detailed descAption of the preferred embodiments of the present invention take~ in conjunction with the accompanying drawings in - which. s Figure 1 is a plan view of a tag constructed in accordance with the present invention and containing border cells a~d central data cells.
Figure 2 is a view similar to Figure 1 showing a tag with further data cells o31tside of the border cells.
Figure 3 illustrates a hexagon shaped tag incorporating the present invention.
Figure 4 is a schematic illustration of a reader for use with the tag of the present inventiolL
Figure S is a flow diagram illustrating the operation of the computer of the tag reader reading a tag as illustrated in Figure 1.
Deseription ofthe Prefe~Ted Embodiments The tag 10 of Figure 1 is composed of mutually perpendicular rows 1, 2, 3~ 4, 5, 6 and 7 a~d colum~s A, B, C, D, E, F, and G which define WO 92/18947 Pcr/cA92/ool3~ ~
2 ~ 4 individual cells lA, lB, 1C, 2A, 2B, 2C, etc., that may be coded with one of at least two different distlnguishable features. In the illustrated arrangement the disting~ishing features are the colours white or black. The rows 1 and 7 contain only border cells as do the columns A and G so that a central set 11 of coded data cells is defined by the cells contained within the corners 2B, 2F, `
6B, and 6F.
A reference 'perimetei 12 is indicated by hash lines e~ending therefrom on the white cells defining one side of the reference perimeter.
The reference perimeter in the example is square and completely encircles the set of data cells 11. However the reference perimeter need only extend for a distance around the data cells sui~lcient to identify and orient the tag 10. For example, the reference perimeter may extend along two or more sides of the set of data cells 11 and need not extend the full length of these sides. In all cases there must be a sufficient length of the perimeter to identi~ and oAent the tag. In most cases it is likely to include the set of datacells 11.
To define the reference perimeter 12 border cells in rows 1 and 7 and columns A and G are made to contrast with their respective adjoining data cell, for example, cell 2A is white since cell 2B is black and similarly cell lB is white because cell 2B is black so that all the border cells around the reference perimeter 12 having a different designating feature to that of its respective adjoining data cell contained within the central set 11.
A tag reader 100 schematically illustrated in Figure S can reliably distinguish the reference perimeter 12 by analyzing a video image of the tag 10 using well known edge detection techniques adapted to detect the lines of the reference perimeter 12. Once the reference perimeter has been determined, it is relatively straight forward to locate and to decode the data cells and/or border cells.
The array tag reader 100 generally consists of a 2D video camera 110 with a lens 120 interfaced through interface 130 with an irnage processing micro computer 140 as shown in Figure 4. The image ~rocessing algorithm executed by the micro computer would generally follow ~he WO92/18947 PCI/C~92/00138 sequence of operation shown in Figure 5.
As illustrated in Figure 5 an image is provided as indicated at 50 by a video camera or the like. ~e computer analyzes the video image and processes all pLxels in a sequence of pLxels along selected scan lines S coveAng the image as indicated at 52. If all pixels have been processed and no tag has been found this fact is returned as indicated at 54 to the main program. If more pixels remain to be processed the gradient is calculated at the current pixel as indicated at 56 and if the gradient in any direction exceeds a certain threshold as indicated at S8 then a straight line fit to the 10 contrast edge defined by the gradient is determined as indicated at 60. The straight line is then compared to see if it meets the constraints ?reviously programmed into the system as indicated at 62 and the straight line fit to the next contrast edge is then determined as indicated at 64 if constraints as viewed at 62 are met. Once a complete set of straight lines is obtained as 15 indicated at 66, the corners of the set of straight lines determined at 66 are determined as indicated at 68 and compared with the preprogrammed constraints for the tag. If the corners are properly identified they define the perimeter of the tag and the tag cells are probed to determine the coded message as indicated at 72 and assurning an error detection method is 20 programmed, it is applied to the detected message as indicated at 74. If no error is detected the information on the tag is delivered the mainline program as indicated at 76.
The algorithm searches along scan lines until a sufficiently large gradient (in any direction) defines an edge in the image. The algorithm then 25 steps along the edge to find the longest straight line that fits the edge to within a specified tolerance. The algorithm continues to step around the edge to determine a set of straight lines that approximate a ~t to the edge.
If the set of straight lines meet the constraints of the tag perimeter the intersections of the straight lines are determined and used to define the 30 corners of the perimeter and thereby the location and orierltation of the tag so the tag may then be analyzed and decoded.
The term gradient means a mathematical vector that gives the wo 92/18947 PCr/CA92/oo l 3s 2 ~ ci ~ s~3 '"~^`
magnitude and direction of a surface as is normally used to determine edges in an image and the contrast ring referred to in the above program is the reference perimeter 12.
It is alss possible, if des*ed, to provide further data cells on the S outside of the border cells as shown for example in Figure 2 where rows 0 and 8 and colurnns X and Y are outside of the-border cells and may be used to contain further data. In this case it is importallt that there not be confusion between the reference perimeter 12 and the periphery formed by the border cells and their adjacent outside data cells, i.e. the cells contained10 in rows 0 and 8 and columns X and Y should not be arranged in the same manner, i.e. to contrast with the border cells around the penphery and define a second reference periphery which would impede identification of the proper reference per~meter.
The reference perimeter 12 in Figure 2 also only extends 15 around three sides of the set of data cells 11. Ihe cell 7D in the illustration does not contrast with the adjoining data cell 6D to de~ne the perimeter but instead is used to code data, i.e. the whole row 7 may be used solely to code data if desired with the perimeter 12 being defined by an inverted U-shape.
Various consta~ts such as length and shape of the image 20 reference perimeter 12 a~d the use of special codes such as cyclic redundancycheck codes (CRC) may be used to differentiate the reference perimeter or coded data from false information.
Or~ly one row and column of data cells has been shown surrounding the border cells i~ ~igure 2, however further rows and columns 25 may also be provided if desired but it is generally preferred to ma~ntain the reference perimeter 12 close to the actual outer periphery of the data corltained within the tag.
In the illustrated arrangement the cells are all rectangular (square) and are either completely white or complçtely black so that the 30 edges of adjoining border and data cells define straight edges with a large contrast on opposite sides of the edges. Other shapes such as octagonal tag 10A with the reference perimeter 12A defined in the same marmer as the W092/l8s47 PCr/c~s2/00l38 2 ~ ~ 8 perimeter 12 (i.e. junction of contrasting boarder edges) are practical, - similarly the tag itself or the reference perimeter 12 may be a shape other than rectangle. The use of a tag with an octagonal perimeter has an advantage where the tag is to be applied to the end of a cylindrical object S such as a log as it increases the size or area of the tag tha~ may be used for a give diameter object.
Havi~g described the invention, modifications will be evident to those slcilled in the art without departing from the spirit of the invention as defined in the appended clairns.
.
:
.
~:
, .~ .
~, .
.
.
Claims (14)
1. A data tag (10) comprising a set of data cells (11) and a set of border cells which cooperate with adjoining ones of said data cells to define a reference perimeter (12, 12A) for said tag (10) extending along at least two sides of said set of data cells (11), each of said border cells and said data cells being one of a first set of cells each of which has a first identifying feature (black) or one of a second set of cells each having a second identifying feature (white) clearly distinguishable from the first identifying feature, each of said border cells being selected from the opposite set of said first and second sets of cells to that from which its respective said adjoining data cell was selected thereby to define a reference perimeter (12, 12A) by the junction of said border cells and their respective adjoining data cells.
2. A data tag as defined in claim 1 wherein said perimeter (12, 12A) encircles said set of data cells (11).
3. A data tag as defined in claim 1 comprising additional data cells on the side of said border cells remote from said set of data cells 11.
4. A data tag as defined in claim 2 comprising additional data cells on the side of said border cells remote from said set of data cells 11.
5. A data tag as defined in claim 1 wherein said data (11) and border cells are substantially rectangular.
6. A data tag as defined in claim 2 wherein said data (11) and border cells are substantially rectangular.
7. A data tag as defined in claim 1 wherein said first distinguishing feature (black) and said second distinguishing feature (white) covers substantially the complete area of each cell bearing that respective distinguishing feature.
8. A data tag as defined in anyone of claims 2 to 6 inclusive wherein said first distinguishing feature (black) and said second distinguishingfeature (white) covers substantially the complete area of each cell bearing that respective distinguishing feature.
9. A data tag as defined in anyone of claim 1 to 7 wherein said perimeter (12) is substantially polygonal.
10. A data tag as defined in anyone of claims 1 to 7 wherein said perimeter (12) is substantially rectangular.
11. A data tag as defined in anyone of claims 1 to 7 wherein said perimeter (12) is substantially octagonal.
12. A method of detecting the perimeter of a tag having cells containing a selected one of at least two different discriminating features (black or white) to identify one cell from another, said perimeter including a plurality of perimeter sections defining corners of said perimeter, each of said sections defined by the borders of adjacent cells extending along said section comprising providing a video image (50) of said tag (10) formed by scan lines of pixels, processing pixels along said scan lines (52) in said imageto determine a gradient (56) at the pixels delimiting (58) one feature (black) from another (white) and characterized by defining borders between adjacent of said cells regardless which side of said borders between said adjacent cells containing said one feature (black) or said other feature (white) are positioned, determining if a line defined by said borders between said adjacent cells conforms with a preselected criteria (60, 62) for a section of said perimeter (12) and if so continuing to process along said scan lines to find other sections of said preselected criteria (68) to determine said perimeter (12) of said tag (10), establishing said perimeter (12) when an acceptable match is found between lines defined by said borders between adjacent of said cells and said criteria, defining the position and orientation of said tag and decoding (72) of a message coded on said tag (10).
13. A method as defined in claim 12 wherein said criteria (60) for each of said perimeter sections comprises a straight line (60).
14. A method as defined in claim 13 wherein said straight lines defining adjacent of said perimeter sections intersect to define corners (7a) of said perimeter (12).
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US07/688,400 US5202552A (en) | 1991-04-22 | 1991-04-22 | Data with perimeter identification tag |
| US07/688,400 | 1991-04-22 | ||
| PCT/CA1992/000138 WO1992018947A1 (en) | 1991-04-22 | 1992-04-07 | Data tag and detecting method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2108456A1 true CA2108456A1 (en) | 1992-10-23 |
Family
ID=24764273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002108456A Abandoned CA2108456A1 (en) | 1991-04-22 | 1992-04-07 | Data tag and detecting method |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US5202552A (en) |
| EP (1) | EP0585244A1 (en) |
| JP (1) | JPH06506550A (en) |
| AU (1) | AU1452392A (en) |
| CA (1) | CA2108456A1 (en) |
| WO (1) | WO1992018947A1 (en) |
Families Citing this family (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5607187A (en) * | 1991-10-09 | 1997-03-04 | Kiwisoft Programs Limited | Method of identifying a plurality of labels having data fields within a machine readable border |
| JPH05290197A (en) * | 1992-04-06 | 1993-11-05 | Teiriyou Sangyo Kk | Method for deciphering two-dimensional code symbol mark |
| US5451764A (en) * | 1993-01-04 | 1995-09-19 | Texas Instruments Incorporated | Apparatus and method for storing and reading data |
| JPH06309485A (en) * | 1993-02-25 | 1994-11-04 | Nippondenso Co Ltd | Optical information reader |
| US5726435A (en) * | 1994-03-14 | 1998-03-10 | Nippondenso Co., Ltd. | Optically readable two-dimensional code and method and apparatus using the same |
| JP2938338B2 (en) * | 1994-03-14 | 1999-08-23 | 株式会社デンソー | Two-dimensional code |
| GB9408626D0 (en) * | 1994-04-29 | 1994-06-22 | Electronic Automation Ltd | Machine readable binary code |
| JP2867904B2 (en) * | 1994-12-26 | 1999-03-10 | 株式会社デンソー | 2D code reader |
| JP3448120B2 (en) * | 1994-12-27 | 2003-09-16 | シャープ株式会社 | Digital information record carrier |
| US5661818A (en) * | 1995-01-27 | 1997-08-26 | Eastman Kodak Company | Method and system for detecting grids in a digital image |
| GB9507098D0 (en) * | 1995-04-06 | 1995-05-31 | Rolls Royce Plc | Process and apparatus for reading a dot matrix code marking of an article |
| US6098882A (en) * | 1996-03-01 | 2000-08-08 | Cobblestone Software, Inc. | Variable formatting of digital data into a pattern |
| US5818032A (en) * | 1997-01-03 | 1998-10-06 | Sun; Tsu-Hung Tom | Encoded color halftone micro-dots for high density digital information storage |
| JP3560009B2 (en) * | 1997-02-14 | 2004-09-02 | 高司 澤口 | 3D code for information processing |
| US6533168B1 (en) | 1999-05-27 | 2003-03-18 | Peter N. Ching | Method and apparatus for computer-readable purchase receipts using multi-dimensional bar codes |
| AU2003900983A0 (en) * | 2003-03-04 | 2003-03-20 | Silverbrook Research Pty Ltd | Methods, systems and apparatus (NPT023) |
| US6601772B1 (en) * | 2000-07-14 | 2003-08-05 | Intellidot Corporation | Compact matrix code and one-touch device and method for code reading |
| US6533181B1 (en) * | 2000-07-22 | 2003-03-18 | Roboric Vision Systems, Inc. | Direct marking of parts with encoded symbology method, apparatus and symbolody |
| US10453151B2 (en) | 2001-02-01 | 2019-10-22 | Kris Engineering, Inc. | Receipts scanner and financial organizer |
| US7746510B2 (en) | 2001-02-01 | 2010-06-29 | Pandipati Radha K C | Receipts scanner and financial organizer |
| DE60236111D1 (en) | 2002-12-03 | 2010-06-02 | Silverbrook Res Pty Ltd | ROTATION SYMMETRIC MARKINGS |
| US7648678B2 (en) | 2002-12-20 | 2010-01-19 | Dako Denmark A/S | Method and system for pretreatment of tissue slides |
| US7427024B1 (en) | 2003-12-17 | 2008-09-23 | Gazdzinski Mark J | Chattel management apparatus and methods |
| US11017097B2 (en) | 2004-05-14 | 2021-05-25 | Peter N. Ching | Systems and methods for prevention of unauthorized access to resources of an information system |
| US7814024B2 (en) * | 2004-05-14 | 2010-10-12 | Ching Peter N | Multi-way transactions related data exchange apparatus and methods |
| US7270277B1 (en) * | 2004-05-21 | 2007-09-18 | Koziol Jeffrey E | Data encoding mark for placement in a compact area and an object carrying the data encoding mark |
| US7464425B2 (en) | 2004-08-04 | 2008-12-16 | Hill-Rom Services, Inc. | Hospital bed |
| US20070174916A1 (en) * | 2005-10-28 | 2007-07-26 | Ching Peter N | Method and apparatus for secure data transfer |
| US8416188B2 (en) * | 2007-02-08 | 2013-04-09 | Silverbrook Research Pty Ltd | System for controlling movement of a cursor on a display device |
| US7874496B2 (en) * | 2008-01-04 | 2011-01-25 | Microsoft Corporation | Optically readable tag |
| TWI471765B (en) * | 2011-12-30 | 2015-02-01 | Au Optronics Corp | Three-dimensional interaction display and operation method thereof |
| DE112018005306T5 (en) * | 2017-11-07 | 2020-06-18 | Sumitomo Electric Sintered Alloy, Ltd. | Sintered body based on iron, method for laser marking the same and method for producing the same |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3418456A (en) * | 1966-12-14 | 1968-12-24 | Monarch Marking Systems Inc | Encoded tag reader |
| US3808405A (en) * | 1972-07-19 | 1974-04-30 | Bendix Corp | Symmetrically encoded label for automatic label reading systems |
| US4004131A (en) * | 1973-03-27 | 1977-01-18 | Rca Corporation | Article carrying coded indicia |
| JPS6011973A (en) * | 1983-07-01 | 1985-01-22 | Nec Corp | Bar code reader |
| JPS63240688A (en) * | 1987-03-27 | 1988-10-06 | Kajima Corp | Circular code |
| US4924078A (en) * | 1987-11-25 | 1990-05-08 | Sant Anselmo Carl | Identification symbol, system and method |
| JPH01195589A (en) * | 1988-01-30 | 1989-08-07 | Hoya Corp | Character display body |
| US4939354A (en) * | 1988-05-05 | 1990-07-03 | Datacode International, Inc. | Dynamically variable machine readable binary code and method for reading and producing thereof |
| US5053609A (en) * | 1988-05-05 | 1991-10-01 | International Data Matrix, Inc. | Dynamically variable machine readable binary code and method for reading and producing thereof |
| JPH0275091A (en) * | 1988-09-09 | 1990-03-14 | Takayuki Murata | Information displaying body |
| JPH02105333A (en) * | 1988-10-14 | 1990-04-17 | Hitachi Ltd | Optical recording sheet, method and device for reproducing such recording sheet |
| AU630408B2 (en) * | 1988-12-20 | 1992-10-29 | Australian Meat & Livestock Research & Development Corporation | An optically readable coded target |
| JPH02188894A (en) * | 1989-01-17 | 1990-07-24 | Nec Eng Ltd | Optical read system |
| DE3921099A1 (en) * | 1989-06-28 | 1991-01-03 | Harald Oehlmann | MACHINE READABLE DATA CARRIER |
-
1991
- 1991-04-22 US US07/688,400 patent/US5202552A/en not_active Expired - Fee Related
-
1992
- 1992-04-07 JP JP4506800A patent/JPH06506550A/en active Pending
- 1992-04-07 WO PCT/CA1992/000138 patent/WO1992018947A1/en not_active Application Discontinuation
- 1992-04-07 EP EP92907563A patent/EP0585244A1/en not_active Withdrawn
- 1992-04-07 AU AU14523/92A patent/AU1452392A/en not_active Abandoned
- 1992-04-07 CA CA002108456A patent/CA2108456A1/en not_active Abandoned
Also Published As
| Publication number | Publication date |
|---|---|
| WO1992018947A1 (en) | 1992-10-29 |
| EP0585244A1 (en) | 1994-03-09 |
| AU1452392A (en) | 1992-11-17 |
| JPH06506550A (en) | 1994-07-21 |
| US5202552A (en) | 1993-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2108456A1 (en) | Data tag and detecting method | |
| US5825015A (en) | Machine readable binary codes | |
| US5917945A (en) | Recognizing dataforms in image areas | |
| ES2231309T3 (en) | LOCALIZER OF LABELS, OF MULTIPLE RESOLUTIONS. | |
| US5223701A (en) | System method and apparatus using multiple resolution machine readable symbols | |
| US5814801A (en) | Maxicode data extraction using spatial domain features exclusive of fourier type domain transfer processing | |
| EP0766191B1 (en) | Method and apparatus for decoding two-dimensional symbols in the spatial domain | |
| CN1979522B (en) | Information carrier integrated with an optically readable information symbol | |
| CN100377167C (en) | Two-dimensional code area precisive positioning method for two-dimensional recognition | |
| JP2788604B2 (en) | Information display tag having two-dimensional information pattern, image processing method and image processing apparatus using the same | |
| US7159780B2 (en) | Method for reading a symbol having encoded information | |
| US4817185A (en) | Optical character reader | |
| CA2707633C (en) | Optically readable tag | |
| JP3635829B2 (en) | Bar code reader | |
| ES2239744T3 (en) | SYSTEM OF DETECTION OF BAR CODES AND CORRESPONDING METHOD. | |
| US4797940A (en) | Optical character reader | |
| WO2019048824A1 (en) | Optically Readable Markers | |
| US4596038A (en) | Method and apparatus for character recognition | |
| RU2400812C2 (en) | Method for recognition of identification marking on cylindrical surface | |
| JP6434354B2 (en) | Symbol information reading apparatus and symbol information reading method | |
| US20230169284A1 (en) | Bar code, bar code reader and coffee machine | |
| JPS62114077A (en) | Picture element feature extracting device | |
| JPH0799531B2 (en) | Optical character reader | |
| JPH0449148B2 (en) | ||
| JPH07134756A (en) | Display body provided with two-dimensional code and method for giving two-dimensional code |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |