Two Part Code

Abstract

A graphically representable, machine readable code having first and second parts wherein the first part may be associated with data and a second part may be associated with the first part, such that a relationship between the parts, or lack thereof may be discerned by reading both parts of the code, in order to verify the authenticity of the code.

Description

CROSS REFERENCE TO RELATED APPLICATION

This is a divisional application of U.S. Ser. No. 12/693,215 filed Jan. 25, 2010 entitled “Two Part Code” which is a continuation application of Ser. No. 12/408,328 filed Mar. 20, 2009 entitled “Two Part Code” which is a division of Ser. No. 11/542,300, filed Oct. 2, 2006 entitled “Two Part Code” which is a National filing of a corresponding co-pending application filed in the United Kingdom as U.K. Serial No. GB05200654, filed Oct. 3, 2005, entitled “Two Part Code” all of for which priority is claimed and which are incorporated herein by reference.

BACKGROUND OF THE INVENTION

The present invention relates to codes and is concerned particularly with codes having two parts, which two parts are related.

Graphic, machine-readable codes are commonly used, for example, to identify articles such as consumer products. Several popular codes are currently used, including one and two-dimensional barcodes and matrix-style codes. In each case the code is applied to an article and enables the article to convey information about itself such as the identity of the manufacturer, and the article type.

One sophisticated type of machine readable code is described In our UK Patent No. GB 2383878 (the entire contents of which are incorporated herein by reference) and commercially available under the trade mark Fracture Code®. Advantages of this type of code over other commercial machine-readable codes include a very high population of possible distinct codes as well as the ability to generate unique codes at very high speed.

Articles, such as consumer products or their packaging, are marked with such codes. In order to obtain information about the article, the code must be read by a machine which first performs a scanning operation to acquire digitally an image of the code. The image Is then processed electronically to derive, via application of an algorithm, an alphanumeric character string that may be used to look up data corresponding to the article in a database.

Another major advantage of this code is the difficulty with which the code may be copied. The code, which typically comprises a rectangular box delimiting a series of intersecting lines, Is difficult to copy to the degree of accuracy needed such that when read by a machine the same alphanumeric character string would be generated. This feature is partly a function of the level of detail, including thicknesses of lines and accuracy of angles therebetween, at which the scanning equipment acquires the image during reading. A further difficulty for would-be counterfeiters, is that many of the codes used are no more than 1 mm by 1 mm in area and may be printed in ultraviolet inks, infrared Inks or other security Inks.

A major security advantage of such codes is the fact that at the time of their creation they carry no information whatsoever, but must be scanned, converted into an alphanumeric character string using the algorithm and then related to data held in a database. Only then do they become meaningful.

Thus, without the algorithm, there is no way of deriving the information. A corresponding benefit is that even if a code can be reproduced accurately it cannot be applied to a different product from that to which it was originally applied without this fact becoming immediately detectable by a person undertaking a legitimate scanning/lookup operation.

SUMMARY OF THE INVENTION

Embodiments of the present invention aim to provide a machine-readable code for associating data with articles, the authenticity of which code may be verified without obtaining the article data with which the code is associated.

Embodiments of the invention also aim to provide a code, for associating articles with data stored in a database, in which the data may be obtained at a faster rate than has previously been possible.

In accordance with one aspect of the present invention there is provided a graphically representable, machine readable code having first and second parts wherein a first part may be associated with data and a second part may be associated with the first part, such that a relationship between the parts, or lack thereof, may be discerned by reading both parts of the code, in order to verify the authenticity of the code.

The invention also includes a method of verifying—the authenticity or lack of authenticity of a graphically representable machine readable code, wherein the code comprises a first part and a second part, the method comprising reading both the first part and the second part of the code and determining whether the two parts of the code are related, and verifying that the code is authentic in the event that the two parts are related, or verifying that the code is not authentic in the event that the two parts are not related.

The invention also includes a code system for associating data with articles, the system comprising means for generating graphic codes for application to articles, machine means for reading the codes to convert each code into a string of characters, and storage means arranged to store data associated with each code, wherein the codes each comprise a first part and a second part, wherein said system includes a population N of codes having, within said population, unique first parts, and wherein within the system a population n of the codes has unique second parts, wherein N>n, and wherein for each code the first portion and the second portion are related, such that a number N/n of codes share the same second parts but have unique first parts.

Preferably the relationship between the first and second parts of the codes is detectable by a machine reading both parts and performing a mathematical operation on the two parts to discern whether they are related.

N/n codes, having distinct first parts N share common second parts n. Upon reading of both parts of the code it is possible to determine whether, for that particular code, the first part is one of the set of first parts that has the relationship with the read second part. If the parts are related this suggests that the code may be genuine. If the parts are unrelated then the code is definitely unauthentic.

The relationship between the first and second. parts of the codes is preferably a function of the generation process by which the first parts were created. For example, the second part of the code may represent one or more characteristics of a batch of first parts. such as a relationship between intersecting lines, which is common to all of the first parts in that particular batch of codes.

Thus, provided that future machine-reading of the two portions of the code is performed in a consistent, approved manner, it is possible to detect a mismatch between the first and second parts which mismatch would suggest an unauthorized or counterfeit code.

In another aspect the invention provides a method of looking up a code in a database to determine data associated with the code, wherein the code comprises first and second parts (F and S) wherein the first part (F) is associated with data in the database and is one of a set N of such first parts, and the second part (8) is related to the first part and is one of a set n of such second parts, N being much greater than n, the method comprising looking up in the database the second part (S) of the code among the population n, and then looking up the first part (P) of the code within the subset N/n of first parts which share the same second part (S).

Since each code has a second part which belongs in set n, and since each individual second part has associated with it a large number of first parts, the unique codes may be grouped together in a database according to their shared second parts. Codes can thus be identified in a database by first looking for the subset of codes that has the shared common second part and then searching within the range n for the unique first part. This can speed up the search as compared with searching the entire population N.

The invention also includes any combination of the features and limitations herein, except combinations of such features as are mutually exclusive.

BRIEF DESCRIPTION OF THE DRAWING

A preferred embodiment of the present invention will now be described with reference to the accompanying diagrammatic drawings in which:

FIG. 1 shows a two-part code, in accordance with an embodiment of the invention,

FIG. 2 shows schematically a reader apparatus for reading two-part codes,

FIG. 3 is a flow diagram depicting a reading operation of the apparatus of FIG. 2, and

FIG. 4 is a flow diagram depicting a search process according to another embodiment of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Turning to FIG. 1, this shows generally at 10 a two-part code printed on a substrate 12. The two-part code 10 comprises a first part 14 and a second part 16 which are separated by a portion 12a of the substrate 12. In this case the first part 14 occupies a first, generally rectangular area and the second part 16 occupies a second, smaller generally rectangular area. The relative sizes of the first and second areas, and/or their shape, could be different from the example shown.

Inside the area occupied by the first part 14 is a plurality of straight lines, at least some of which intersect each other. In this example the first part of the two-part code comprises a composite indicium such as is described in our UK Patent No. GB 2383878 B and sold commercially under the trade mark FractureCode® and for which there is currently a co-pending U.S. application Ser. No. 10/383,185. Whilst the example is of a plurality of Intersecting lines, this type of code might comprise other elements or shapes such as dots, rectangles or ellipses or a combination of such elements and/or shapes.

In the example, the second part of the code comprises a two dimensional bar code such as a data matrix code. In practice the second part of the code could be almost any of the currently known codes referred to collectively as “bar codes” and including, but not limited to such codes as: Data Matrix, PDF-417, Micro-PDF-417, QR Code, EAN, MaxiCode, Codabar, RSS, UPC and Interleaved 2 of 5.

Codes of the type used for the first part have a very high population of unique Individuals. That is to say that a very large number of unique composite indicia, each being convertible using an algorithm into a unique alphanumeric character string, exists. Codes of the type used for the second part typically have a much lower population of unique individuals. Both first and second parts of the two-part code may be printed on the substrate, using either conventional inks or covert inks, such as are detectable only when illuminated, or irradiated, with light of a certain frequency range.

FIG. 2 shows, schematically, a hand-held reading apparatus for reading the two-part codes 10. An image acquisition device 20, which includes a camera (not shown) is used to acquire an image of the code being read. The acquired image is error-corrected and enhanced electronically in an error correction and image enhancement unit 22 before being fed to an electronic controller 24. The controller 24 applies algorithms to the first and second parts of the two-part code, to produce first and second respective character strings. The controller 24 then accesses a memory 26, in the form of a look-up table, to look up the second character string—i.e. the character string associated with the second part (16) of the two part code. From the look-up table in memory 26 the controller is then able to determine whether the first character string—Le. of the first part of the two part code—is one of the many first parts which is associated with the second character string. In other words, by performing a look-up function and then comparing the first and second character strings obtained respectively from the first and second parts of the cods, the controller is able to verify whether the first part of the code (being a unique one among a very large population N) belongs to the sub-set of such first parts which is associated with the second part which has been read and is the subject of the look-up operation.

A display device 28 such as for example an LCD panel. is used to provide an indication of the results, which might for example be a message indicating [AUTHENTIC} if the first and second parts are associated, or might be [FAKE} if the first and second parts are not associated.

The controller 24, memory 26 and display device 28 could be separate from the image acquisition device 20 and the unit 22, and may for example be constituted in a PC or PDA.

The UK patent referred to above describes one technique for deriving a character string from a composite indicium such as is used to form the first part of the code in accordance with an embodiment of the present Invention. Minutiae of the composite indicium may be associated with intersections of different oblique lines. The locations of the intersections relative to a reference feature. and optionally the angles between the intersecting lines and/or the thicknesses of certain of the lines, can all be processed to produce an alphanumeric character string. As stated above, a very large number. perhaps 1030 or more of unique composite indicia—i.e. first parts of the two-part code may be created.

One or more characters in the string can be encoded and included in the second part of the code, so that upon decoding the second part of the code it is possible to tell quickly, by reference to a look up table, whether a particular first part “belongs” with the second part being considered.

Of course, the primary purpose of the two-part code is to carry information about the article with which it is associated. For example, the second part of the code may include information such as the name of the manufacturer and the type of product. The first part of the code which may have a unique character string associated therewith and may, when looked up In the database, yield far more information, such as the factory in which the article was manufactured, the date and time of manufacture and the intended destination, price and so on.

It will be appreciated that the first parts of the two part code are created first and then subsequently have data attributed to them in a database.

The second part of the code is created purposefully to include some identifiable characteristics of the first part. However. without applying the algorithm to the first part of the code. the unique alphanumeric character string associated with it cannot be reproduced and hence the second part of the code cannot be designed to “match” the first part. Therefore, without possession of the algorithm it is not possible to produce an authorized two-part code in which the first and second parts are verifiably appropriately matched.

FIG. 3 shows schematically in a flow diagram a process for authenticating the two part code. At step 30, the two part code is scanned and an image (of both parts) is acquired. At step 32 a process of error correction and image enhancement is performed electronically. At step 34 the second part of the code is obtained and at step 36 the second part is looked up in a look-up table of a database. At step 38 the first part of the code Is obtained using the appropriate algorithm and at step 40 a comparison of the first and second parts of the code is made to verify whether the two parts are associated. If the judgment is YES then at step 42 a positive indication is displayed. such as [AUTHENTIC]. On the other hand, if the determination at step 40 is that the first and second parts of the code are not associated then at step 44 a negative indication, such as [FAKE] is displayed.

It will be appreciated that the apparatus and method described above are concerned only with determining whether or not the two-part code is authentic. However, the code itself is used mainly to access information about articles with which it is associated. In order to do so, a reference must be made to a large database which contains many unique alpha numeric character strings, each including Information associated with an article.

The hand-held reader device of the present invention may include such a database, though such is not included in the embodiment described above. More likely is that the database will be located elsewhere and may, for example, be accessed remotely such as by using an Internet or other network connection.

Since the database may contain a very large number of unique entries, comprising unique character strings derivable from respective unique first parts. the searching of the database may take considerable time. In order to lower the time taken to look up each unique entry, in accordance with an embodiment of the present invention a database, holding unique character strings derived from unique first parts of the two part code, groups the unique character strings in regions of the database according to their corresponding second part, which may be far fewer in number. Thus, when looking up a particular first part the look up process initially involves accessing that part of the database corresponding to the second part of the code. Then a search for the data associated with the unique character string derived from the unique first part of the code may be made among a far smaller number of such unique character strings.

FIG. 4 shows schematically a look up method as a flow diagram. In a step 50 an image of both of the first and second parts of the two part code is scanned and electronically acquired. At step 52 the acquired image is error corrected and enhanced. At step 54 the first part of the code is obtained and at step 56 the second part is obtained. The second part of the code obtained at step 56 is then looked up in a main database at step 58 and the sub-region of the main database in which the second part is located is identified at step 60. At step 62 the first part of the code, obtained at step 54, is looked up in the sub-region of the database identified at step 60 and at step 64 the full data associated with the two part code is output to the user. This process is an order of magnitude faster than searching all of the first parts sequentially in the database.

While various embodiments of the invention have been disclosed, it is to be understood that the invention is not so limited and that the invention is limited only by the following claims and equivalents thereof.

Claims

1. A graphically representable, machine readable code having first and second parts wherein the first part may be associated with data and a second part may be associated with the first part, such that a relationship between the parts, or lack thereof may be discerned by reading both parts of the code, in order to verify the authenticity of the code.

2. A method of verifying the authenticity or lack of authenticity of a graphically representable machine readable code, wherein the code comprises a first part and a second part the method comprising machine-reading both the first part and the second part of the code and determining whether the two parts of the code are related, and verifying that the code is authentic in the event that the two parts are related, and verifying that the code is not authentic in the event that the two parts are not related.