The invention relates to verification of the authenticity of an article such as a personal identification (ID) card, vendable product, original document or other item.
Many traditional authentication security systems rely on a process which is difficult for anybody other than the manufacturer to perform, where the difficulty may be imposed by expense of capital equipment, complexity of technical know-how or preferably both. Examples are the provision of a watermark in bank notes and a hologram on credit cards or passports. Unfortunately, criminals are becoming more sophisticated and can reproduce virtually anything that original manufacturers can do.
Because of this, there is a known approach to authentication security systems which relies on creating security tokens using some process governed by laws of nature which results in each token being unique, and more importantly having a unique characteristic that is measurable and can thus be used as a basis for subsequent verification. According to this approach tokens are manufactured and measured in a set way to obtain a unique characteristic. The characteristic can then be stored in a computer database, or otherwise retained. Tokens of this type can be embedded in the carrier article, e.g. a banknote, passport, ID card, important document. Subsequently, the carrier article can be measured again and the measured characteristic compared with the characteristics stored in the database to establish if there is a match.
Within this general approach it has been proposed to use different physical effects. One physical effect that has been considered in a number of prior art documents [1-4] is to use laser speckle from intrinsic properties of an article, typically in the form of a special token, to provide a unique characteristic. According to these techniques a large area, such as the whole of a special token, is illuminated with a collimated laser beam and a significant solid angle portion of the resultant speckle pattern is imaged with a CCD, thereby obtaining a speckle pattern image of the illuminated area made up of a large array of data points.
More recently a further laser speckle based technique has been developed [5] in which the unique characteristic is obtained by scanning a focused laser beam over the article and collecting many data points, typically 500 or more, from light scattered from many different parts of the article to collect a large number of independent data points. By collecting a large number of independent signal contributions specific to many different parts of the article, a digital signature can be computed that is unique to the area of the article that has been scanned. This technique is capable of providing a unique signature from the surfaces of a wide variety of articles, including untreated paper, cardboard and plastic.
An important application of this technique is security verification from a database of stored signatures, referred to as the “master database” in the following. For example, in a perfumery factory, each perfume bottle box can be scanned by a reader to obtain a signature, and these signatures are entered into a master database. The master database includes a signature from every article, i.e. box of perfume, produced. Later, for field verification, a reader can be used to scan any box of perfume to obtain a signature, and this signature is compared with the master database to establish whether there is a matching signature held in the master database. If there is no match, the article is considered to be counterfeit. If there is a match, then the article is considered to be genuine.
In many applications, for example those relating to national security, civil documentation or high volume branded goods, the number of signatures stored in the master database may be very large. The number of entries may be perhaps millions, tens of millions or even hundreds of millions. For example, this would be the case if the scheme is used for passport or driving licence verification for a populous country.
For most if not all applications, it is necessary that the search of the master database can be carried out in a reasonable time. What is reasonable will vary from application to application, but for many applications a maximum reasonable time will only be a few seconds. However, for large master databases, there are two difficulties in achieving a high speed search for a signature match.
Firstly, the scan even from a genuine item will never match its stored database scan perfectly. The test of a match or non-match is one of degree of similarity between the originally scanned signature held in the master database and the re-scanned signature. We find that a typical good quality match has approximately 75% of the bits in agreement, compared to an average of 50% agreement for a fraudulent match. Consequently, standard relational database fast searching methods such as look-up tables cannot be used efficiently. It is therefore necessary to try every entry in the database against the target signature.
Secondly, there may be an unknown bit-shift between the successful database entry and the rescanned signature. This is because the scanned object may not be in precisely the same position for the second scan as it was for the first scan. Any offsets in a direction parallel to the laser scan direction will result in a shifting of the bit pattern. It is therefore not only necessary to try every entry in the database against the target signature, but this must be done assuming a number of different lengths of bit-shifts for each database entry, which may be up to 30 or more, making the total search time potentially very long. The number of bit shifts is a function of the positioning accuracy of the readers and the per bit scan length.
This invention proposes a method of improving the search speed for databases containing very large numbers of digital signature records, thereby overcoming the second difficulty described above. The method involves storing not only a digitised representation of the scanned signature in the database, but also a digitised representation of a part of the Fourier transform of the scanned signature. When an article is rescanned, the scan data from the re-scan is Fourier transformed. The transform is then expressed in polar co-ordinates, i.e. amplitude and phase (as opposed to expressing the Fourier transform in real and imaginary components). The amplitude information is used for searching, but not the phase information which can be discarded. Namely, the database is searched for a match between the Fourier transform amplitude spectrum of the new scan and the Fourier transform amplitude spectrum stored as a thumbnail in each database record. If there is a matching database record for the article, a match between thumbnails should be found regardless of any bit shift between the new scan and the database scan. Specifically, there is no need to repeat the match for different assumed bit shifts as would otherwise be necessary to take account of an unknown bit shift between the original scan and the rescan caused by the article inevitably have a different relative position on the reader when it is re-scanned.
The search is therefore speeded up by a factor of approximately equal to the maximum assumed repositioning error between the original scan and the re-scan for verification divided by the scan length per datum (l/n), as compared with the simple method of comparing full signatures, i.e. comparing signatures in real space (as opposed to frequency space). This factor will typically be in the range 10-50, depending on the relevant parameter values. The increased search speed is at the expense of increasing the database size slightly by needing to store the amplitude spectrum of the Fourier Transform of each record as a thumbnail.
This search method works for the following reasons. A pseudo-random bit sequence, when Fourier transformed, carries some of the information in the amplitude spectrum and some in the phase spectrum. Any bit shift only affects the phase spectrum, however, and not the amplitude spectrum. Amplitude spectra can therefore be matched without any knowledge of the bit shift. Although some information is lost in discarding the phase spectrum, enough remains in order to obtain a rough match against the database. This allows one or more putative (i.e. candidate) matches to the target to be located in the database. Each of these putative matches can then be compared properly using the conventional real-space method against the new scan.
According to one aspect of the invention, there is provided a method of scanning an article arranged in a reading volume, comprising: collecting a set of data points from intensity signals obtained when coherent light scatters from the reading volume, wherein different ones of the data points relate to scatter from different parts of the reading volume; determining a digital signature of the article by digitising the set of data points; and determining a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points.
The scan can be performed in order to obtain and store a digital signature for the article, e.g. at the point of manufacture of an article or at the point of document creation. In this case, the digital signature is stored with its thumbnail digital signature in a database. To avoid duplicate entries, the digital signature is preferably stored with its thumbnail digital signature in the database conditional on there being no match between it and any digital signature already stored in the database. The article may additionally be labelled with a machine-readable marking, such as a barcode, that encodes an approximate record locator to assist finding the digital signature in the database.
The scan can also be performed at a later time for article verification. In this case, the verification method will further comprise: providing a database of previously recorded signatures and their thumbnail digital signatures; searching the database to seek at least one candidate match by performing a comparison between the determined thumbnail digital signature and the previously recorded thumbnail digital signatures; and determining for any candidate match whether there is a match by performing a comparison between the determined digital signature and the at least one previously recorded digital signatures. For each match a confidence level may additionally be determined based on degree of similarity between the determined digital signature and the previously recorded digital signature found to have a match. This can be useful to present to the user. If an approximate record locator marking is provided on the article, the verification method will include reading the machine-readable marking on the article to obtain the approximate record locator, and using the approximate record locator to seek the at least one candidate match in the database.
According to another aspect of the invention there is provided an apparatus for scanning an article arranged in a reading volume, comprising: a source for generating a coherent beam; a detector arrangement for collecting a set of data points from signals obtained when the coherent beam scatters from the reading volume, wherein different ones of the data points relate to scatter from different parts of the reading volume; and a data acquisition and processing module operable to: (i) determine a digital signature of the article by digitising the set of data points; and (ii) determine a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points.
In apparatuses for populating the database, e.g. apparatuses used by a brand owner, or government authorities, the data acquisition and processing module is further operable to store the digital signature with its thumbnail digital signature in a database. To avoid duplicate entries, this may be conditional on there being no match between it and any digital signature already stored in the database.
In apparatuses for verifying the authenticity of articles, e.g. field-use readers, the apparatus will further comprise: a database of previously recorded signatures and their thumbnail digital signatures; and a search tool operable to (i) search the database to seek at least one candidate match by performing a comparison between the determined thumbnail digital signature and the previously recorded thumbnail digital signatures; and (ii) determine for any candidate match whether there is a match by performing a comparison between the determined digital signature and the at least one previously recorded digital signatures. The search tool may be further operable to determine for each match a confidence level based on degree of similarity between the determined digital signature and the previously recorded digital signature found to have a match.
According to a further aspect of the invention there is provided a database, typically resident on a carrier medium such as a server or other system, comprising a plurality of records, each comprising: a digital signature of an article obtained by digitising a set of data points obtained from the article; and a thumbnail digital signature of the article obtained by digitising an amplitude part of a Fourier transform of the set of data points. In embodiments of the invention described below, these data points are obtained from scattering of coherent light from the article, wherein different ones of the data points relate to scatter from different parts of the article.
A still further aspect of the invention provides a system comprising a search tool operable to: search the above-described database for candidate matches by performing a comparison between an input thumbnail digital signature and the thumbnail digital signatures held in the database. The search tool is preferably further operable to determine for any candidate match whether there is a match by performing a comparison between the input digital signature and the digital signature held in the record of the candidate match. Especially for large databases, the search tool may be operable to search the database for candidate matches using an approximate record locator.
It will be understood that the database is remote from the system or integral with the system, or indeed distributed.
The database may be part of a mass storage device that forms part of the reader apparatus, or may be at a remote location and accessed by the reader through a telecommunications link. The telecommunications link may take any conventional form, including wireless and fixed links, and may be available over the internet. The data acquisition and processing module may be operable, at least in some operational modes, to allow the signature to be added to the database if no match is found. This facility will usually only be allowed to authorised persons for obvious reasons.
When using a database, in addition to storing the signature it may also be useful to associate that signature in the database with other information about the article such as a scanned copy of the document, a photograph of a passport holder, details on the place and time of manufacture of the product, or details on the intended sales destination of vendable goods (e.g. to track grey importation).
Reader apparatuses as described above may be used in order to populate a database with signatures by reading a succession of articles, e.g. in a production line, and/or in order subsequently to verify authenticity of an article, e.g. in field use.
The invention allows identification of articles made of a variety of different kinds of materials, such as paper, cardboard and plastic.
The invention allows it to be ascertained whether an article has been tampered with. This is possible if adhesively bonded transparent films, such as adhesive tape, cover the scanned area used to create the signature. If the tape must be removed to tamper with the article, e.g. to open a packaging box, the adhesive bonding can be selected so that it will inevitably modify the underlying surface. Consequently, even if similar tape is used to reseal the box, this will be detectable.
The invention provides a method of identifying an article made of paper or cardboard, comprising: exposing the paper or cardboard to coherent radiation; collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the paper or cardboard; determining a digital signature of the article by digitising the set of data points; and determining a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points.
By intrinsic structure we mean structure that the article inherently will have by virtue of its manufacture, thereby distinguishing over structure specifically provided for security purposes, such as structure given by tokens or artificial fibres incorporated in the article.
By paper or cardboard we mean any article made from wood pulp process. The paper or cardboard may be treated with coatings or impregnations or covered with transparent material, such as cellophane. If long-term stability of the surface is a particular concern, the paper may be treated with an acrylic spray-on transparent coating, for example.
Data points can thus be collected as a function of position of illumination by the coherent beam. This can be achieved either by scanning a localised coherent beam over the article, or by using directional detectors to collect scattered light from different parts of the article, or by a combination of both.
The invention is considered to be particularly useful for paper or cardboard articles from the following list of examples:
The invention also provides a method of identifying an article made of plastic, comprising: exposing the plastic to coherent radiation; collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the plastic; and determining a digital signature of the article by digitising the set of data points; and determining a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points.
If the plastic is opaque to the coherent radiation, the scatter will be from intrinsic surface structure of the plastic, whereas if the plastic is transparent, the scatter may arise from any part of the article impinged upon by the coherent radiation.
The invention is considered to be particularly useful for plastic articles from the following list of examples:
Particularly useful applications may be scanning over the signed strip of an ID card, i.e. after signing, so that digital signature used for authenticity is specific to the signed card and is formed from a combination of the person's signature and the surface structure of the underlying strip.
In the case of an ID article bearing a photograph of a person (which may be a plastic ID card or a pass from other material such as a paper passport) it may be useful for the reader to scan over the photograph part of the ID card (separate from scanning the cover or a blank page) as a test that no tampering has occurred. This is because, if a coating or adhesive film is used to attach a photograph to the ID article, it must be removed by a forger in order to fix a fake photograph into the ID article. This type of forgery would be identified by a reader implementing the present invention, since the new photograph would have a different surface structure.
It is expected that any other material type will be identifiable by the invention provided that it has suitable surface structure. Material types that have very smooth surfaces at a microscopic level may be unsuitable as may be opaque materials that have a very deep and/or unstable surface (e.g. fleece material).
The invention also allows identification of articles of a variety of different types, including packaging, documents, and clothing.
The invention provides a method of identifying a product by its packaging, comprising: exposing the packaging of the product to coherent radiation; collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the packaging; and determining a digital signature of the article by digitising the set of data points; and determining a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points.
The relevant part of the packaging exposed to the coherent radiation may be made of paper, cardboard, plastic (e.g. cellophane shrink wrap), metal or other material with suitable intrinsic surface or internal structure. The article may be contained in the packaging, and optionally the packaging may be sealed in a tamper-proof manner. Alternatively, the packaging may be an appendage to the article, such as a tag secured with a connector that cannot be released without being visibly damaged. This may be especially useful for pharmaceutical products, cosmetic goods and perfume, and spare parts for aircraft or land or water vehicles, for example.
The invention provides a method of identifying a document, comprising: exposing the document to coherent radiation; collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the document; and determining a digital signature of the article by digitising the set of data points; and determining a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points.
The invention also provides a method of identifying an item of clothing or footwear by a tag secured thereto, comprising: exposing the tag to coherent radiation; collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the tag; and determining a digital signature of the article by digitising the set of data points; and determining a thumbnail digital signature of the article by digitising an amplitude part of a Fourier transform of the set of data points. The tag may be the normal unmodified brand tag, e.g. plastic, cardboard, attached to the clothing or footwear.
In summary, the signature can in some cases be obtained from something ancillary to a vendable product, such as its packaging, and in other cases obtained from the object itself, such as from surface structure of a document, or a vendable product. The invention may find many practical applications, for example to control grey market importation or counterfeiting. For such applications, portable readers could be used by customs officers or trading standards officers.
The signature is envisaged to be a digital signature in most applications. Typical sizes of the digital signature with current technology would be in the range 200 bits to 8 k bits, where currently it is preferable to have a digital signature size of about 2 k bits for high security.
For a better understanding of the invention and to show how the same may be carried into effect reference is now made by way of example to the accompanying drawings in which:
Generally it is desirable that the depth of focus is large, so that any differences in the article positioning in the z direction do not result in significant changes in the size of the beam in the plane of the reading aperture. In an example prototype, the depth of focus is approximately 0.5 mm which is sufficiently large to produce good results.
The parameters, of depth of focus, numerical aperture and working distance are interdependent, resulting in a well known trade off between spot size and depth of focus.
A drive motor 22 is arranged in the housing 12 for providing linear motion of the optics subassembly 20 via suitable bearings 24 or other means, as indicated by the arrows 26. The drive motor 22 thus serves to move the coherent beam linearly in the x direction over the reading aperture 10 so that the beam 15 is scanned in a direction transverse to the major axis of the elongate focus. Since the coherent beam 15 is dimensioned at its focus to have a cross-section in the xz plane (plane of the drawing) that is much smaller than a projection of the reading volume in a plane normal to the coherent beam, i.e. in the plane of the housing wall in which the reading aperture is set, a scan of the drive motor 22 will cause the coherent beam 15 to sample many different parts of the reading volume under action of the drive motor 22.
These marks are sampled by a tail of the elongate focus and provide for linearisation of the data in the x direction, as is described in more detail further below. The measurement is performed by an additional phototransistor 19 which is a directional detector arranged to collect light from the area of the marks 28 adjacent the slit.
In an alternative embodiment, the marks 28 are read by a dedicated encoder emitter/detector module 19 that is part of the optics subassembly 20. Encoder emitter/detector modules are used in barcode readers. For example, we have used an Agilent REDS-1500 module that is based on a focused light emitting diode (LED) and photodetector. The module signal is fed into the PIC ADC as an extra detector channel.
With an example minor dimension of the focus of 40 micrometers, and a scan length in the x direction of 2 cm, n=500, giving 2000 data points with k=4. A typical range of values for k×n depending on desired security level, article type, number of detector channels ‘k’ and other factors is expected to be 100<k×n<10,000. It has also been found that increasing the number of detectors k also improves the insensitivity of the measurements to surface degradation of the article through handling, printing etc. In practice, with the prototypes used to date, a rule of thumb is that the total number of independent data points, i.e. k×n, should be 500 or more to give an acceptably high security level with a wide variety of surfaces.
The PIC 30 and PC 34 collectively form a data acquisition and processing module 36 for determining a signature of the article from the set of data points collected by the detectors 16a . . . d. The PC 34 has access through an interface connection 38 to a database (dB) 40. The database 40 may be resident on the PC 34 in memory, or stored on a drive thereof. Alternatively, the database 40 may be remote from the PC 34 and accessed by wireless communication, for example using mobile telephony services or a wireless local area network (LAN) in combination with the internet. Moreover, the database 40 may be stored locally on the PC 34, but periodically downloaded from a remote source.
The database 40 contains a library of previously recorded signatures. The PC 34 is programmed so that in use it accesses the database 40 and performs a comparison to establish whether the database 40 contains a match to the signature of the article that has been placed in the reading volume. The PC 34 may also be programmed to allow a signature to be added to the database if no match is found. This mode of use is reserved for use by authorised users and may be omitted from systems that are to be used in the field exclusively for verification purposes.
A document feeder could be provided to ensure that the article placement was consistent. For example, the apparatus could follow any conventional format for document scanners, photocopiers or document management systems. For packaging boxes, an alternative would be to provide a suitable guide hole, for example a rectangular cross-section hole for accepting the base of a rectangular box or a circular cross-section hole for accepting the base of a tubular box (i.e. cylindrical box).
The functional components of the conveyor-based reader apparatus are similar to those of the stand-alone reader apparatus described further above. The only difference of substance is that the article is moved rather than the laser beam, in order to generate the desired relative motion between scan beam and article.
It is envisaged that the conveyor-based reader can be used in a production line or warehouse environment for populating a database with signatures by reading a succession of articles. As a control, each article may be scanned again to verify that the recorded signature can be verified. This could be done with two systems operating in series, or one system through which each article passes twice. Batch scanning could also be applied at point of sale (POS), or using a reader apparatus that was based on POS equipment components.
The above-described embodiments are based on localised excitation with a coherent light beam of small cross-section in combination with detectors that accept light signal scattered over a much larger area that includes the local area of excitation. It is possible to design a functionally equivalent optical system which is instead based on directional detectors that collect light only from localised areas in combination with excitation of a much larger area.
A hybrid system with a combination of localised excitation and localised detection may also be useful in some cases.
Having now described the principal structural components and functional components of various reader apparatuses suitable for carrying out the invention, the numerical processing used to determine a signature is now described. It will be understood that this numerical processing is implemented for the most part in a computer program that runs on the PC 34 with some elements subordinated to the PIC 30.
The data collection and numerical processing of a scatter signal that takes advantage of the natural structure of an article's surface (or interior in the case of transmission) is now described.
Step S1 is a data acquisition step during which the optical intensity at each of the photodetectors is acquired approximately every 1 ms during the entire length of scan. Simultaneously, the encoder signal is acquired as a function of time. It is noted that if the scan motor has a high degree of linearisation accuracy (e.g. as would a stepper motor) then linearisation of the data may not be required. The data is acquired by the PIC 30 taking data from the ADC 31. The data points are transferred in real time from the PIC 30 to the PC 34. Alternatively, the data points could be stored in memory in the PIC 30 and then passed to the PC 34 at the end of a scan. The number n of data points per detector channel collected in each scan is defined as N in the following. Further, the value ak(i) is defined as the i-th stored intensity value from photodetector k, where i runs from 1 to N. Examples of two raw data sets obtained from such a scan are illustrated in
Step S2 uses numerical interpolation to locally expand and contract ak(i) so that the encoder transitions are evenly spaced in time. This corrects for local variations in the motor speed. This step is performed in the PC 34 by a computer program.
Step S3 is an optional step. If performed, this step numerically differentiates the data with respect to time. It may also be desirable to apply a weak smoothing function to the data. Differentiation may be useful for highly structured surfaces, as it serves to attenuate uncorrelated contributions from the signal relative to correlated (speckle) contributions.
Step S4 is a step in which, for each photodetector, the mean of the recorded signal is taken over the N data points. For each photodetector, this mean value is subtracted from all of the data points so that the data are distributed about zero intensity. Reference is made to
Step S5 digitises the analogue photodetector data to compute a digital signature representative of the scan. The digital signature is obtained by applying the rule: ak(i)>0 maps onto binary ‘1’ and ak(i)<0 maps onto binary ‘0’. The digitised data set is defined as dk(i) where i runs from 1 to N.
Step S6 creates a ‘thumbnail’ digital signature. This is done by computing the Fourier Transform of ak(i). The amplitude spectrum is referred to as Ak(i) and the phase spectrum is referred to as Φk(i). The amplitude spectrum Ak(i) is then digitised. The digitised amplitude spectrum is denoted Dk(i). For the digitisation it is noted that it is not possible to apply the simple rule used to obtain the full digital signature referred to above in Step S5, since the amplitude spectrum is always positive and a simple threshold test against zero cannot be used to digitize it. We propose one of two digitisation methods for the thumbnail signature. For the first method, a threshold value is defined for each channel of the amplitude spectrum. The set of threshold values is denoted g(i). Then the amplitude spectrum is digitized by applying the rule A(i)>g(i) maps onto 1, and A(i)<=g(i) maps onto 0. The threshold values g(i) can be determined by considering a sample of different signatures and taking the mean value for each channel of the amplitude spectrum. For the second method, one differentiates the amplitude spectrum A(i) with respect to i to form A′(i). This will now have both positive and negative values. Then the amplitude spectrum is digitized by applying the rule A′(i)>0 maps onto 1, and A′(i)<=0 maps onto 0. In this case, it is more efficient to store A′(i) as the thumbnail in the database instead of A(i), otherwise it would be necessary to differentiate every record every time the database is searched. The ‘thumbnail’ digital signature is then created from Dk(i) by either taking the first L bits (a typical value for L is 128) or by picking every m-th bit of Dk(i) to form a thumbnail digital signature of length L bits (a typical value for in is 4).
Step S7 is an optional step applicable when multiple detector channels exist. The additional component is a cross-correlation component calculated between the intensity data obtained from different ones of the photodetectors. With 2 channels there is one possible cross-correlation coefficient, with 3 channels up to 3, and with 4 channels up to 6 etc. The cross-correlation coefficients are useful, since it has been found that they are good indicators of material type. For example, for a particular type of document, such as a passport of a given type, or laser printer paper, the cross-correlation coefficients always appear to lie in predictable ranges. A normalised cross-correlation can be calculated between ak(i) and al(i), where k≠l and k, l vary across all of the photodetector channel numbers. The normalised cross-correlation function Γ is defined as
The use of the cross-correlation coefficients in verification processing is described further below.
Step S8 is another optional step which is to compute a simple intensity average value indicative of the signal intensity distribution. This may be an overall average of each of the mean values for the different detectors or an average for each detector, such as a root mean square (rms) value of ak(i). If the detectors are arranged in pairs either side of normal incidence as in the reader described above, an average for each pair of detectors may be used. The intensity value has been found to be a good crude filter for material type, since it is a simple indication of overall reflectivity and roughness of the sample. For example, one can use as the intensity value the unnormalised rms value after removal of the average value, i.e. the DC background.
The signature data obtained from scanning an article can be compared against records held in a signature database for verification purposes and/or written to the database to add a new record of the signature to extend the existing database, in each case using the thumbnail derived from the Fourier transform amplitude spectrum as well as the full digital signature.
A new database record will include the digital signature obtained in Step S5 as well as its thumbnail version obtained in Step S6 for each photodetector channel, and optionally also the cross-correlation coefficients obtained in Step S7 and the average value(s) obtained in Step S8. The thumbnails may be stored on a separate database of their own optimised for rapid searching, and the rest of the data (including the thumbnails) on a main database.
To provide a rapid verification process, the verification process is carried out in two main steps, first using the thumbnails derived from the amplitude component of the Fourier transform of the scan data (and optionally also pre-screening based on the computed average values and cross-correlation coefficients) as now described, and second by comparing the scanned and stored full digital signatures with each other.
Verification Step V1 is the first step of the verification process, which is to scan an article according to the process described above, i.e. to perform Scan Steps S1 to S8.
Verification Step V2 seeks a candidate match using the thumbnail derived from the Fourier transform amplitude component of the scan signal, which is obtained as explained above with reference to Scan Step S6. Verification Step V2 takes each of the thumbnail entries and evaluates the number of matching bits between it and tk(i+j), where j is a bit offset which is varied to compensate for errors in placement of the scanned area. The value of j is determined and then the thumbnail entry which gives the maximum number of matching bits. This is the ‘hit’ used for further processing. A variation on this would be to include the possibility of passing multiple candidate matches for full testing based on the full digital signature. The thumbnail selection can be based on any suitable criteria, such as passing up to a maximum number of, for example 10, candidate matches, each candidate match being defined as the thumbnails with greater than a certain threshold percentage of matching bits, for example 60%. In the case that there are more than the maximum number of candidate matches, only the best 10 are passed on. If no candidate match is found, the article is rejected (i.e. jump to Verification Step V6 and issue a fail result).
This thumbnail based searching method delivers an overall improved search speed, for the following reasons. A pseudo-random bit sequence, when Fourier transformed, carries some of the information in the amplitude spectrum and some in the phase spectrum. Any bit shift only affects the phase spectrum, however, and not the amplitude spectrum. Amplitude spectra can therefore be matched without any knowledge of the bit shift. Although some information is lost in discarding the phase spectrum, enough remains in order to obtain a rough match against the database. This allows one or more putative matches to the target to be located in the database. Each of these putative matches can then be compared properly using the conventional real-space method against the new scan.
Verification Step V3 is an optional pre-screening test that is performed before analysing the full digital signature stored for the record against the scanned digital signature. In this pre-screen, the rms values obtained in Scan Step S8 are compared against the corresponding stored values in the database record of the hit. The ‘hit’ is rejected from further processing if the respective average values do not agree within a predefined range. The article is then rejected as non-verified (i.e. jump to Verification Step V6 and issue fail result).
Verification Step V4 is a further optional pre-screening test that is performed before analysing the full digital signature. In this pre-screen, the cross-correlation coefficients obtained in Scan Step S7 are compared against the corresponding stored values in the database record of the hit. The ‘hit’ is rejected from further processing if the respective cross-correlation coefficients do not agree within a predefined range. The article is then rejected as non-verified (i.e. jump to Verification Step V6 and issue fail result).
Verification Step V5 is the main comparison between the scanned digital signature obtained in Scan Step S5 and the corresponding stored values in the database record of the hit. The full stored digitised signature, dkdb(i) is split into n blocks of q adjacent bits on k detector channels, i.e. there are qk bits per block. A typical value for q is 4 and a typical value for k is 4, making typically 16 bits per block. The qk bits are then matched against the qk corresponding bits in the stored digital signature dkdb(i+j). If the number of matching bits within the block is greater or equal to some pre-defined threshold zthresh, then the number of matching blocks is incremented. A typical value for zthresh is 13. This is repeated for all n blocks. This whole process is repeated for different offset values of j, to compensate for errors in placement of the scanned area, until a maximum number of matching blocks is found. Defining M as the maximum number of matching blocks, the probability of an accidental match is calculated by evaluating:
where s is the probability of an accidental match between any two blocks (which in turn depends upon the chosen value of zthreshold), M is the number of matching blocks and p(M) is the probability of M or more blocks matching accidentally. The value of s is determined by comparing blocks within the database from scans of different objects of similar materials, e.g. a number of scans of paper documents etc. For the case of q=4, k=4 and zthreshold=13, we find a typical value of s is 0.1. If the qk bits were entirely independent, then probability theory would give s=0.01 for zthreshold=13. The fact that we find a higher value empirically is because of correlations between the k detector channels and also correlations between adjacent bits in the block due to a finite laser spot width. A typical scan of a piece of paper yields around 314 matching blocks out of a total number of 510 blocks, when compared against the database entry for that piece of paper. Setting M=314, n=510, s=0.1 for the above equation gives a probability of an accidental match of 10−177.
Verification Step V6 issues a result of the verification process. The probability result obtained in Verification Step V5 may be used in a pass/fail test in which the benchmark is a pre-defined probability threshold. In this case the probability threshold may be set at a level by the system, or may be a variable parameter set at a level chosen by the user. Alternatively, the probability result may be output to the user as a confidence level, either in raw form as the probability itself, or in a modified form using relative terms (e.g. no match/poor match/good match/excellent match) or other classification. In our experiments with paper, we generally find that 75% of bits in agreement represents a good or excellent match, whereas 50% bits in agreement represents no match.
By way of example, we find that a database comprising 1 million records, with each record containing a 128-bit thumbnail of the Fourier transform amplitude spectrum, can be searched in 1.7 seconds on a standard PC computer of 2004 specification. 10 million entries can be searched in 17 seconds. We would expect high-end server computers to achieve up to 10 times faster than this.
A further implementation of the invention is now described.
For many applications, a database of 1-10 million entries will be adequate. However, in some applications larger numbers of entries may be required. It is also noted that larger databases are technologically feasible, since a standard modern (2004 specification) 100 GB hard disk could potentially store 1000-2000 million entries which would be sufficient for a piece of documentation for every person of even the most populous countries. With current technology, the search time of such a large database is potentially prohibitively long using the basic search technique described above, even with the speed advantage of using thumbnails derived from Fourier transform amplitude spectra to substantially eliminate processing time caused by registry errors between the original scan and the re-scan.
The barcode, which need only be relatively short (12-16 bits), is read by the same scanning laser that reads the speckle signature. This barcode acts as a record locator in the database. The barcode does not identify the precise database entry, but simply point to the correct ‘chapter’ of the database, leaving the rapid search algorithm described above to identify the correct signature among the perhaps 1 million records per chapter. A 12 bit barcode would allow 4096 different chapters to be distinguished, allowing a match to be found in a database of up to 4000 million records.
The use of a barcode as only an approximate (i.e. not a precise) record locator has two advantages. First, the barcode can be a conventional low-precision 1D barcode without stringent printing requirements or the need for more sophisticated 2D readers. Second, since the barcode will only locate the database entry to within a “chapter” of perhaps 1 million entries, there is no need to encrypt the barcode with an asymmetric encryption algorithm.
The barcode is applied at the time of manufacture of the ID card by scanning the blank upper area of the card according to the method of the invention, allocating a chapter number to the record used to store the digital signature, and then printing the barcode onto the lower area 52 encoding the record's chapter number. The ID card is thus labelled with an approximate record locator for the digital signature of the intrinsic structure of the article, namely the surface structure in the upper area 58.
It is noted that the barcode may itself be used for linearisation of the scan instead of or in combination with the separate linearisation marks described above. This may be especially useful when the reader has a drive with poor linearity, such as a roller drive of the kind used in automated telling machines (ATMs) for example. Tolerance to drives with poor linearity will allow a reader to be incorporated in many card reading devices such as ATMs with minimum modification. Indeed, a barcode, or even dummy markings, may be printed on the card solely for the purpose of linearisation and not used for the encryption at all. In that case, verification could be performed using reference to a database or by taking data from another part of the card, for example by taking data from a chip (so-called smart card).
As well as using a barcode for storing an approximate record locator, a barcode may be used to mark the article with a label that encodes the articles own signature obtained from its intrinsic physical properties, for example any printable article, including paper or cardboard articles or plastic articles.
In this case, given the public nature of the barcode or other label that follows a publicly known encoding protocol, it is advisable to make sure that the signature has been transformed using an asymmetric encryption algorithm for creation of the barcode, i.e. a one-way function is used, such as according to the well known RSA algorithm. A preferred implementation is for the label to represent a public key in a public key/private key encryption system. If the system is used by a number of different customers, it is advisable that each customer has its own private key, so that disclosure of a private key will only affect one customer. The label thus encodes the public key and the private key is located securely with the authorised persons.
A further perceived advantage of the labelling approach is that a novice user would be unaware of the verification being carried out without special knowledge. It would be natural for the user to assume that the reader apparatus was simply a barcode scanner, and it was the barcode that was being scanned.
Such a labelling scheme could be used to allow articles to be verified without access to a database purely on the basis of the label. This is a similar approach conceptually to the failed banknote scheme reported in the prior art [3].
Such a labelling scheme in which the label encodes the article's own signature could be used in combination with a labelling scheme in which the label represents an approximate record locator, as described above. For example, the barcode could encode a thumbnail form of the digital signature and be used to allow a rapid pre-screen prior to screening with reference to a database. As explained above, this could be a very important approach in practice, since potentially in some database applications, the number of records could become huge (e.g. millions) and searching strategies would become critical. Intrinsically high speed searching techniques, such as the use of bitstrings, could become important.
As explained above, as an alternative to the barcode encoding a thumbnail, the barcode (or other label) can encode a record locator, i.e. be an index or bookmark, which can be used to rapidly find the correct signature in the database for further comparison.
Another variant is that the barcode (or other label) encodes a thumbnail signature, such as one derived from the Fourier transform amplitude component of the scan data as described above, which can be used to get a match with reasonable but not high confidence if a database is not available (e.g. temporarily off-line, or the scanning is being done in an unusually remote location without internet access). That same thumbnail can then be used for rapid record locating within the main database if the database is available, allowing a higher confidence verification to be performed.
Many other commercial examples will be envisaged, the above
From the above detailed description it will be understood how an article made of material, such as paper or cardboard, or plastic, can be identified by exposing the material to coherent radiation, collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the material, and determining a signature of the article from the set of data points.
It will also be understood that the scan area is essentially arbitrary in terms of its size or location on an article. If desired, the scan could be a linear scan rastered to cover a larger two-dimensional area, for example.
Moreover, it will be understood how this can be applied to identify a product by its packaging, a document or an item of clothing, by exposing the article to coherent radiation, collecting a set of data points that measure scatter of the coherent radiation from intrinsic structure of the article, and determining a signature, and a thumbnail, of the product from the set of data points.
From the above description of the numerical processing, it will be understood that degradation of the beam localisation (e.g. beam cross-section enlargement in the reading volume owing to sub-optimum focus of the coherent beam) will not be catastrophic to the system, but merely degrade its performance by increasing the accidental match probability. The apparatus is thus robust against apparatus variations giving a stable gradual degradation in performance rather than a sudden unstable failure. In any case, it is simple to perform a self test of a reader, thereby picking up any equipment problems, by performing an autocorrelation on the collected data to ascertain the characteristic minimum feature size in the response data.
A further security measure that can be applied to paper or cardboard, for example, is to adhesively bond a transparent seal (e.g. adhesive tape) over the scanned area. The adhesive is selected to be sufficiently strong that its removal will destroy the underlying surface structure which it is essential to preserve in order to perform a verification scan. The same approach can be applied to deposition of transparent polymer or plastic films on a card, or its encapsulation with similar materials.
As described above, the reader may be embodied in an apparatus designed specifically to implement the invention. In other cases, the reader will be designed by adding appropriate ancillary components to an apparatus principally designed with another functionality in mind, such as a photocopier machine, document scanner, document management system, POS device, ATM, air ticket boarding card reader or other device.
In summary, a digital signature is obtained by digitising a set of data points obtained by scanning a coherent beam over a paper, cardboard or other article, and measuring the scatter. A thumbnail digital signature is also determined by digitising an amplitude spectrum of a Fourier transform of the set of data points. A database of digital signatures and their thumbnails can thus be built up. The authenticity of an article can later be verified by re-scanning the article to determine its digital signature and thumbnail, and then searching the database for a match. Searching is done on the basis of the Fourier transform thumbnail to improve search speed. Speed is improved, since, in a pseudo-random bit sequence, any bit shift only affects the phase spectrum, and not the amplitude spectrum, of a Fourier transform represented in polar coordinates. The amplitude spectrum stored in the thumbnail can therefore be matched without any knowledge of the unknown bit shift caused by registry errors between the original scan and the re-scan.
Many other variations of the invention will be envisaged by the skilled person in addition to those specifically mentioned above.
Number | Date | Country | Kind |
---|---|---|---|
0418173.1 | Aug 2004 | GB | national |
This application is a National Stage of International Application No. PCT/GB2005/003003, filed Jul. 29, 2005, which claims priority to Great Britain Patent Application No. 0418173.1, filed Aug. 13, 2004 and U.S. Provisional Application No. 60/601,500 filed Aug. 13, 2004.
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/GB2005/003003 | 7/29/2005 | WO | 00 | 7/3/2008 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2006/016114 | 2/16/2006 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
3781109 | Mayer, Jr. et al. | Dec 1973 | A |
3877019 | Auerbach et al. | Apr 1975 | A |
4179212 | Lahr | Dec 1979 | A |
4218674 | Brosow et al. | Aug 1980 | A |
4423415 | Goldman | Dec 1983 | A |
4525748 | Carbone | Jun 1985 | A |
4537504 | Baltes et al. | Aug 1985 | A |
4544266 | Antes | Oct 1985 | A |
4568936 | Goldman | Feb 1986 | A |
4599509 | Silverman et al. | Jul 1986 | A |
4738901 | Finkel et al. | Apr 1988 | A |
4748316 | Dickson | May 1988 | A |
4785290 | Goldman et al. | Nov 1988 | A |
4791669 | Kage | Dec 1988 | A |
4797921 | Shiraishi | Jan 1989 | A |
4817176 | Marshall et al. | Mar 1989 | A |
4820912 | Samyn | Apr 1989 | A |
4920385 | Clarke et al. | Apr 1990 | A |
4929821 | Kocznar et al. | May 1990 | A |
5003596 | Wood | Mar 1991 | A |
5054066 | Riek et al. | Oct 1991 | A |
5058164 | Elmer et al. | Oct 1991 | A |
5059776 | Antes | Oct 1991 | A |
5081675 | Kittirutsunetorn | Jan 1992 | A |
5103479 | Takaragi et al. | Apr 1992 | A |
5120126 | Wertz et al. | Jun 1992 | A |
5133601 | Cohen et al. | Jul 1992 | A |
5142578 | Matyas et al. | Aug 1992 | A |
5194918 | Kino et al. | Mar 1993 | A |
5243405 | Tichenor et al. | Sep 1993 | A |
5258605 | Metlitsky et al. | Nov 1993 | A |
5306899 | Marom et al. | Apr 1994 | A |
5307423 | Gupta et al. | Apr 1994 | A |
5325167 | Melen | Jun 1994 | A |
5384717 | Ebenstein | Jan 1995 | A |
5451759 | Hoshino et al. | Sep 1995 | A |
5453840 | Parker et al. | Sep 1995 | A |
5485312 | Horner | Jan 1996 | A |
5488661 | Matsui | Jan 1996 | A |
5510199 | Martin | Apr 1996 | A |
5521984 | Denenberg et al. | May 1996 | A |
5539840 | Krtolica et al. | Jul 1996 | A |
5546462 | Indeck et al. | Aug 1996 | A |
5637854 | Thomas | Jun 1997 | A |
5647010 | Okubo et al. | Jul 1997 | A |
5673338 | Denenberg et al. | Sep 1997 | A |
5687002 | Itoh | Nov 1997 | A |
5760386 | Ward | Jun 1998 | A |
5767988 | Dobbs et al. | Jun 1998 | A |
5784463 | Chen et al. | Jul 1998 | A |
5790025 | Amer et al. | Aug 1998 | A |
5886798 | Staub et al. | Mar 1999 | A |
5903721 | Sixtus | May 1999 | A |
5912974 | Holloway et al. | Jun 1999 | A |
6029150 | Kravitz | Feb 2000 | A |
6141119 | Tseng et al. | Oct 2000 | A |
6182892 | Angelo et al. | Feb 2001 | B1 |
6223166 | Kay | Apr 2001 | B1 |
6280797 | Kuczynski et al. | Aug 2001 | B1 |
6314409 | Schneck et al. | Nov 2001 | B2 |
6332663 | Puzio | Dec 2001 | B1 |
6360001 | Berger et al. | Mar 2002 | B1 |
6365907 | Staub et al. | Apr 2002 | B1 |
6373573 | Jung | Apr 2002 | B1 |
6389151 | Carr et al. | May 2002 | B1 |
6390368 | Edwards | May 2002 | B1 |
6466329 | Mukai | Oct 2002 | B1 |
6473165 | Coombs et al. | Oct 2002 | B1 |
6560355 | Graves et al. | May 2003 | B2 |
6563129 | Knobel | May 2003 | B1 |
6584214 | Pappu et al. | Jun 2003 | B1 |
6621916 | Smith et al. | Sep 2003 | B1 |
6741360 | D'Agraives et al. | May 2004 | B2 |
6760472 | Takeda et al. | Jul 2004 | B1 |
6779720 | Lewis | Aug 2004 | B2 |
6850147 | Prokoski et al. | Feb 2005 | B2 |
6882738 | Davis et al. | Apr 2005 | B2 |
6928552 | Mischenko et al. | Aug 2005 | B1 |
6950094 | Gordon et al. | Sep 2005 | B2 |
6955141 | Santanam et al. | Oct 2005 | B2 |
6961449 | Mil'shtein | Nov 2005 | B2 |
6970573 | Carr et al. | Nov 2005 | B2 |
6977791 | Zhu et al. | Dec 2005 | B2 |
7002675 | Macgibbon | Feb 2006 | B2 |
7071481 | Nekrasov et al. | Jul 2006 | B2 |
7076084 | Davis et al. | Jul 2006 | B2 |
7077332 | Vershuur et al. | Jul 2006 | B2 |
7080041 | Nagel | Jul 2006 | B2 |
7082216 | Jones et al. | Jul 2006 | B2 |
7111321 | Watts, Jr. et al. | Sep 2006 | B1 |
7119662 | Horiguchi et al. | Oct 2006 | B1 |
7143949 | Hannigan | Dec 2006 | B1 |
7164810 | Schnee et al. | Jan 2007 | B2 |
7170391 | Lane et al. | Jan 2007 | B2 |
7200868 | Mattox et al. | Apr 2007 | B2 |
7221445 | Earthman et al. | May 2007 | B2 |
7222361 | Kemper | May 2007 | B2 |
7277183 | Deck | Oct 2007 | B2 |
7333629 | Patton et al. | Feb 2008 | B2 |
7336842 | Kondo | Feb 2008 | B2 |
7346184 | Carr et al. | Mar 2008 | B1 |
7353994 | Farrall et al. | Apr 2008 | B2 |
7389530 | Raghunath et al. | Jun 2008 | B2 |
7391889 | Kim et al. | Jun 2008 | B2 |
7497379 | Chen et al. | Mar 2009 | B2 |
7506365 | Hirano et al. | Mar 2009 | B2 |
7567349 | Tearney et al. | Jul 2009 | B2 |
7577844 | Kirovski | Aug 2009 | B2 |
7599927 | Lebrat | Oct 2009 | B2 |
7599963 | Fernandez | Oct 2009 | B2 |
7602904 | Juels et al. | Oct 2009 | B2 |
7605940 | Silverbrook et al. | Oct 2009 | B2 |
7647279 | Bourrieres et al. | Jan 2010 | B2 |
7684069 | Kashiwazaki | Mar 2010 | B2 |
7716297 | Wittel et al. | May 2010 | B1 |
20020091555 | Leppink | Jul 2002 | A1 |
20020111837 | Aupperle | Aug 2002 | A1 |
20020116329 | Serbetcioglu et al. | Aug 2002 | A1 |
20030002067 | Miyano | Jan 2003 | A1 |
20030012374 | Wu et al. | Jan 2003 | A1 |
20030018587 | Althoff et al. | Jan 2003 | A1 |
20030028494 | King et al. | Feb 2003 | A1 |
20030035539 | Thaxton | Feb 2003 | A1 |
20030118191 | Wang et al. | Jun 2003 | A1 |
20030178487 | Rogers | Sep 2003 | A1 |
20030219145 | Smith | Nov 2003 | A1 |
20030231806 | Troyanker et al. | Dec 2003 | A1 |
20040016810 | Hori et al. | Jan 2004 | A1 |
20040031849 | Hori et al. | Feb 2004 | A1 |
20040059952 | Newport et al. | Mar 2004 | A1 |
20040101158 | Butler | May 2004 | A1 |
20040155913 | Kosugi et al. | Aug 2004 | A1 |
20040199765 | Kohane et al. | Oct 2004 | A1 |
20050044385 | Holdsworth | Feb 2005 | A1 |
20050060171 | Molnar | Mar 2005 | A1 |
20050101841 | Kaylor et al. | May 2005 | A9 |
20050108057 | Cohen et al. | May 2005 | A1 |
20050122209 | Black | Jun 2005 | A1 |
20050135260 | Todd | Jun 2005 | A1 |
20050178841 | Jones et al. | Aug 2005 | A1 |
20050217969 | Coombs et al. | Oct 2005 | A1 |
20060022059 | Juds | Feb 2006 | A1 |
20060104103 | Colineau | May 2006 | A1 |
20060163504 | Fujimoto et al. | Jul 2006 | A1 |
20060166381 | Lange | Jul 2006 | A1 |
20060256959 | Hymes | Nov 2006 | A1 |
20060294583 | Cowburn et al. | Dec 2006 | A1 |
20070025619 | Cowburn et al. | Feb 2007 | A1 |
20070027819 | Cowburn | Feb 2007 | A1 |
20070028093 | Cowburn et al. | Feb 2007 | A1 |
20070028107 | Cowburn et al. | Feb 2007 | A1 |
20070028108 | Cowburn et al. | Feb 2007 | A1 |
20070036470 | Piersol et al. | Feb 2007 | A1 |
20070053005 | Cowburn | Mar 2007 | A1 |
20070058037 | Bergeron et al. | Mar 2007 | A1 |
20070113076 | Cowburn et al. | May 2007 | A1 |
20070115497 | Cowburn | May 2007 | A1 |
20070136612 | Asano et al. | Jun 2007 | A1 |
20070153078 | Cowburn | Jul 2007 | A1 |
20070162961 | Tarrance et al. | Jul 2007 | A1 |
20070164729 | Cowburn et al. | Jul 2007 | A1 |
20070165208 | Cowburn | Jul 2007 | A1 |
20070188793 | Wakai | Aug 2007 | A1 |
20070192850 | Cowburn | Aug 2007 | A1 |
20070199047 | Gibart et al. | Aug 2007 | A1 |
20070271456 | Ward et al. | Nov 2007 | A1 |
20080002243 | Cowburn | Jan 2008 | A1 |
20080016358 | Filreis et al. | Jan 2008 | A1 |
20080044096 | Cowburn | Feb 2008 | A1 |
20080051033 | Hymes | Feb 2008 | A1 |
20080294900 | Cowburn | Nov 2008 | A1 |
20090016535 | Cowburn | Jan 2009 | A1 |
20090083372 | Teppler | Mar 2009 | A1 |
20090283583 | Cowburn | Nov 2009 | A1 |
20090290906 | Cowburn | Nov 2009 | A1 |
20090303000 | Cowburn | Dec 2009 | A1 |
20090307112 | Cowburn | Dec 2009 | A1 |
20100007930 | Cowburn | Jan 2010 | A1 |
20100008590 | Cowburn | Jan 2010 | A1 |
20100141380 | Pishva | Jun 2010 | A1 |
20100158377 | Cowburn | Jun 2010 | A1 |
20100161529 | Cowburn | Jun 2010 | A1 |
20100277446 | van Veenedaal | Nov 2010 | A1 |
Number | Date | Country |
---|---|---|
1588847 | Mar 2005 | CN |
19632269 | Feb 1997 | DE |
19612819 | Oct 1997 | DE |
10155780 | May 2003 | DE |
10234431 | Feb 2004 | DE |
0234105 | Sep 1987 | EP |
0278058 | Aug 1988 | EP |
0334201 | Sep 1989 | EP |
0472192 | Feb 1992 | EP |
0480620 | Apr 1992 | EP |
0570162 | Nov 1993 | EP |
0590826 | Apr 1994 | EP |
0691632 | Jan 1996 | EP |
1087348 | Mar 2001 | EP |
1273461 | Jan 2003 | EP |
1286315 | Feb 2003 | EP |
1388797 | Feb 2004 | EP |
1418542 | May 2004 | EP |
1434161 | Jun 2004 | EP |
1507227 | Feb 2005 | EP |
1577812 | Sep 2005 | EP |
1587030 | Oct 2005 | EP |
1616711 | Dec 2005 | EP |
1990779 | Nov 2008 | EP |
1319928 | Mar 1972 | GB |
1458726 | Dec 1976 | GB |
2097979 | Nov 1982 | GB |
2221870 | Feb 1990 | GB |
2228821 | Sep 1990 | GB |
2304077 | Dec 1997 | GB |
2346110 | Jan 2000 | GB |
2346111 | Jan 2000 | GB |
2411954 | Sep 2005 | GB |
2417074 | Feb 2006 | GB |
2417592 | Mar 2006 | GB |
2417707 | Mar 2006 | GB |
2426100 | Nov 2006 | GB |
2428846 | Feb 2007 | GB |
2428948 | Feb 2007 | GB |
2429092 | Feb 2007 | GB |
2429097 | Feb 2007 | GB |
2431759 | May 2007 | GB |
2433632 | Jun 2007 | GB |
2434642 | Aug 2007 | GB |
H02-10482 | Jan 1990 | JP |
H03-192523 | Aug 1991 | JP |
H06-301840 | Oct 1994 | JP |
07210721 | Aug 1995 | JP |
H08-003548 | Jan 1996 | JP |
H08-180189 | Jul 1996 | JP |
09218910 | Aug 1997 | JP |
H11-224319 | Aug 1999 | JP |
2000140987 | May 2000 | JP |
2000149087 | May 2000 | JP |
2002-092682 | Mar 2002 | JP |
2004102562 | Apr 2002 | JP |
2003-141595 | May 2003 | JP |
2003-150585 | May 2003 | JP |
2004171109 | Jun 2004 | JP |
2005217805 | Aug 2005 | JP |
2008523438 | Jul 2010 | JP |
20050023050 | Mar 2005 | KR |
8002604 | Dec 1981 | NL |
9401796 | Oct 1994 | NL |
2043201 | Sep 1995 | RU |
2065819 | Aug 1996 | RU |
8900742 | Jan 1989 | WO |
9111703 | Aug 1991 | WO |
9119614 | Dec 1991 | WO |
9322745 | Nov 1993 | WO |
9524691 | Sep 1995 | WO |
9534018 | Dec 1995 | WO |
9636934 | Nov 1996 | WO |
9724699 | Jul 1997 | WO |
9913391 | Mar 1999 | WO |
0045344 | Aug 2000 | WO |
0046980 | Aug 2000 | WO |
0065541 | Nov 2000 | WO |
0118754 | Mar 2001 | WO |
0125024 | Apr 2001 | WO |
0143086 | Jun 2001 | WO |
0186574 | Nov 2001 | WO |
0186589 | Nov 2001 | WO |
0191007 | Nov 2001 | WO |
0250790 | Jun 2002 | WO |
03087991 | Oct 2003 | WO |
2004025548 | Mar 2004 | WO |
2004025549 | Mar 2004 | WO |
2004057525 | Jul 2004 | WO |
2004070667 | Aug 2004 | WO |
2004097826 | Nov 2004 | WO |
2004109479 | Dec 2004 | WO |
2005004039 | Jan 2005 | WO |
2005004797 | Jan 2005 | WO |
2005027032 | Mar 2005 | WO |
2005029447 | Mar 2005 | WO |
2005088517 | Mar 2005 | WO |
2005048256 | May 2005 | WO |
2005078651 | Aug 2005 | WO |
2005080088 | Sep 2005 | WO |
2005086158 | Sep 2005 | WO |
2005088533 | Sep 2005 | WO |
2005122100 | Dec 2005 | WO |
2006016112 | Feb 2006 | WO |
2006016114 | Feb 2006 | WO |
2006021083 | Mar 2006 | WO |
2006132584 | Dec 2006 | WO |
2007012815 | Feb 2007 | WO |
2007012821 | Feb 2007 | WO |
2007028799 | Mar 2007 | WO |
2007072048 | Jun 2007 | WO |
2007080375 | Jul 2007 | WO |
2007111548 | Oct 2007 | WO |
2007144598 | Dec 2007 | WO |
2009141576 | Nov 2009 | WO |
2010004281 | Jan 2010 | WO |
2010004282 | Jan 2010 | WO |
Number | Date | Country | |
---|---|---|---|
20080294900 A1 | Nov 2008 | US |
Number | Date | Country | |
---|---|---|---|
60601500 | Aug 2004 | US |