US 7,806,322 B2Grant
Authentication methods and systems including embedded auxiliary data
Issue Date:2010-10-05
•26 Claims
•5 Drawing Sheets
Abstract
The present invention generally relates to steganography and digital watermarking. An authentication method is provided in one embodiment. The method includes receiving an object including a host object and auxiliary data steganographically embedded within the host object; determining geometric characteristics of the host object relative to expected geometric characteristics of the host object; and detecting the auxiliary data from the host object. The method can further include re-aligning or correcting geometric characteristics of the object based on a result of the act of determining prior to the act of detecting. Other embodiments, method and apparatus and described as well.
Metadata
Assignee
- Digimarc Corporation
Inventors
- Trent J. Brundage
- Brett T. Hannigan
Application Information
Application Number:US 11/613,088
Filing Date:2006-12-19
Priority Date:2002-02-12
Art Unit:2876
Classifications
IPC:
G06K9/00G06K5/00
Patent Drawings (5 sheets)
Description
RELATED APPLICATION DATA
[0001] This application is a continuation of U.S. patent application Ser. No. 10/830,975, filed Apr. 22, 2004 (now U.S. Pat. No. 7,152,786). The 10/830,975 application is a continuation of U.S. patent application Ser. No. 10/094,593 (published as US 2002-0170966 A1), filed Mar. 6, 2002, which claims the benefit of U.S. Provisional Patent Application No. 60/356,881, filed Feb. 12, 2002.
[0002] The present application is also related to assignee's U.S. patent application Ser. No. 09/452,021 (now U.S. Pat. No. 7,044,395), which is a continuation-in-part of application Ser. No. 09/130,624 (now U.S. Pat. No. 6,324,573). The 09/130,624 application is a continuation of U.S. patent application Ser. No. 08/508,083 (now U.S. Pat. No. 5,841,978). This application is also related to the following U.S. patent application Ser. Nos. 09/292,569, 09/314,648 (now U.S. Pat. No. 6,681,028), 09/343,104, 09/452,023 (now U.S. Pat. No. 6,408,082), Ser. No. 09/452,022 (U.S. Pat. No. 6,959,098), Ser. No. 09/571,422 (U.S. Pat. No. 6,947,571) and 10/027,783 (published as US 2002-0126872 A1; now U.S. Pat. No. 7,289,643). The technology disclosed in this application can advantageously be used in the methods and systems disclosed in the foregoing patent and applications.
[0003] Each of the above-mentioned patent documents is hereby incorporated by reference.
TECHNICAL FIELD
[0004] The invention relates to digital watermarking and the cooperation of digital watermarking with other machine-readable codes such as barcodes.
BACKGROUND AND SUMMARY
[0005] There are a variety of standard ways to encode information in a machine-readable code that is either affixed to or applied to the surface of a tangible object. Perhaps the most widespread form of machine-readable code is the barcode, but there are many others. Other forms of machine-readable identification include magnetic stripe, magnetic ink character recognition (MICR), optical character recognition (OCR), optical mark recognition (OMR), radio frequency identification (RF/ID) etc.
[0006] While these forms of machine-readable identification are widely used and effective for many applications, they all have the disadvantage that they must occupy a dedicated portion of the physical object that they reside on. For example, if one wishes to apply a barcode or magnetic stripe to an object, the physical implementation of the code must occupy some portion of the object's surface apart from the other information content on the object. For some applications, this limitation does not pose a problem. For many applications, however, the need to locate the code on a dedicated portion of the object is a significant drawback. One drawback is that it requires the user to position the object so that the portion carrying the code can be read. Another drawback is that the code is not aesthetically pleasing, and may detract from the overall appearance of the object. In addition, the placement of the code may require an expensive and cumbersome manufacturing and application process.
[0007] Another characteristic of these forms of machine-readable identification is that they are perceptible to the users of the object. Again, for many applications, this characteristic is not a concern, and may in fact be a benefit. In some cases, however, it is a disadvantage for the code to be visually perceptible. As noted above, one drawback is that it detracts from the aesthetic appearance of the object. Another drawback is that it may be more likely to be tampered with.
[0008] In some applications, however, it may be advantageous to combine barcodes (or other machine-readable codes) and digital watermarks. Watermarks may be embedded in the information content (e.g., an image, photograph or graphics) or texture of an object's surface, and thus, do not require a separate, dedicated portion of the surface area. While some forms of image watermarks are visible, many others may be embedded such that they are virtually imperceptible to a user, yet readable by a machine.
[0009] In the following detailed description, watermarks and related machine-readable coding techniques are used to embed data within the information content on object surfaces. These techniques are used in combination with standard machine-readable coding methods such as bar codes, magnetic stripes, etc. As such, the coding techniques extend to many applications, such as linking documents together, identification card authentication, etc.
[0010] Further features and advantages will become even more apparent with reference to the following detailed description and accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
[0011] FIG. 1 is a flow diagram illustrating an overview of a digital watermarking embedding process.
[0012] FIG. 2 is a flow diagram illustrating an overview of a digital watermark detecting process.
[0013] FIG. 3 is a flow diagram illustrating an overview of an authentication process.
[0014] FIG. 4 is a flow diagram illustrating an alternative implementation of an authentication process.
[0015] FIG. 5 is a flow diagram illustrating a barcode authentication process.
[0016] FIG. 6 is a flow diagram illustrating an authentication process that compares digital watermark information with another machine-readable code.
DETAILED DESCRIPTION
Overview of a Digital Watermark System
[0017] The primary components of a watermarking system are an embedder and a reader. The embedder encodes information into a watermark and applies it to an object, while the reader detects the watermark and decodes its information content. FIG. 1 is a flow diagram illustrating an overview of an embedding process. While advantageous to perform automatically, some of the steps may be performed manually, and may be implemented in distinct system components.
[0018] The process begins by obtaining an object message (100). In this context, an object message is a general term referring to information associated with an object, including object identifiers, an index to other information or instructions, and machine instructions. For example, the message may be a product identifier such as a Universal Product Code (UPC). Or the message may include information that is also encoded on the object in other machine-readable code formats such as in a barcode. For many applications, it is advantageous to leverage an existing object messaging scheme such as a UPC symbology, a magnetic stripe coding format, or some other extrinsic standard. However, it is also possible to develop a customized messaging scheme tailored to meet the demands of a particular application.
[0019] Next, the object message is converted into an object reference (102). The objective of this stage is to place the message in a data format suitable for transforming into a watermark signal. In some instances, the message may already be in a data format that can be directly converted to a watermark information signal (e.g., a binary number). In this case, there is no need to transform the object message into a different data format. In other instances, the object message may be expressed as a numeric or alphanumeric string representing some coded format. In this case, the embedding process decodes and transforms the message into a form suitable for conversion to a watermark. This process may involve, for example, decoding and mapping each character or groups of adjacent characters into a binary number.
[0020] Next, the object reference is transformed into a watermark signal (104). The watermark signal defines how to manipulate the information content conveyed on the object's surface so as to place a watermark on the object. The specific details of this process depend on the nature of the watermark.
[0021] The watermark may be embedded in the information content of a digital image, for example. A digital image is comprised of a two or more dimensional array of image samples. In this case, the image sample values are manipulated to embed the watermark signal in the image. The term “image sample” refers generally to a discrete value in the image array. The image sample constitutes a value in any one of several domains, such as a spatial or frequency domain. In any given domain, image content may be represented in a variety of standard or custom formats or color spaces. A color space may have one or more dimensions. For example, a monochrome image typically has a single dimension representing a gray-scale value, while a color image typically has three dimensions, e.g., RGB (Red, Green, and Blue); or YUV (Luminance, and two Chrominance components).
[0022] While a digital watermark is typically applied to digital content, it may be implemented so as to remain with the content even through transformations to and from the analog domain. In addition to images, it applies to a variety of different media types, including audio and video.
[0023] The assignee's watermarking technology is reflected in U.S. patent application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914), U.S. Pat. No. 5,862,260 and laid-open PCT Application W097/43736 (corresponding to U.S. patent application Ser. No. 08/746,613). Of course, other digital watermarking embedding techniques can be employed with our present invention, particular when other techniques provide a digital watermark with information carrying capacity.
[0024] Another way to encode additional information in an image is in the form of a data glyph. An implementation of data glyphs is described in U.S. Pat. No. 5,315,098. Related visible watermarking work is illustrated in U.S. Pat. Nos. 5,706,364, 5,689,620, 5,684,885, 5,680,223, 5,668,636, 5,640,647 and 5,594,809.
[0025] Alternatively, the watermark may be embedded in line graphics or text by varying the position of lines or characters in a manner that encodes the object reference.
[0026] In summary, watermarking can be applied to myriad forms of information. These include imagery (including video) and audio—whether represented in digital form (e.g., an image comprised of pixels, digital video, etc.), or in an analog representation (e.g., non-sampled music, printed imagery, banknotes, etc.). Watermarking can be applied to digital content (e.g. imagery, audio) either before or after compression (MPEG2, MPEG4, MP3). Watermarking can also be used in various “description” or “synthesis” language representations of content, such as Structured Audio, Csound, NetSound, SNHC Audio and the like (c.f. http://sound.media.mit.edu/mpeg4/) by specifying synthesis commands that generate watermark data as well as the intended audio signal.
[0027] Watermarking can also be applied to ordinary media, whether or not it conveys information. Examples include paper, plastics, laminates, product labels and packaging, paper/film emulsions, etc. A watermark can embed a single bit of information, or any number of bits.
[0028] The physical manifestation of watermarked information most commonly takes the form of altered signal values, such as slightly changed pixel values, picture luminance, picture colors, DCT coefficients, instantaneous audio amplitudes, etc. However, a watermark can also be manifested in other ways, such as changes in the surface microtopology of a medium, localized chemical changes (e.g. in photographic emulsions), localized variations in optical density, localized changes in luminescence, etc. The surface texture of an object may be altered to create a watermark pattern. This may be accomplished by manufacturing an object in a manner that creates a textured surface or by applying material to the surface (e.g., an invisible film or ink) in a subsequent process. Watermarks can also be optically implemented in holograms and conventional paper watermarks.
[0029] When determining how to implement this aspect of the embedder, there are a number of design objectives to consider. One objective to consider is the degree to which the watermark is imperceptible upon ordinary inspection. As the watermark becomes less perceptible, it may also become more difficult to detect and read accurately. Another objective is the quantity of information that one wishes to embed in the watermark. As the quantity of information increases, the watermark will need to support larger object references. Yet another objective is security. In some applications, it is desirable to employ an object reference scheme that makes the object references more difficult to decipher or remove from the objects.
[0030] Having created a watermark signal, the embedder creates the watermarked object (106). As referenced above, this process may involve printing or applying a watermarked image to the surface of the object, or texturing the surface of the object so as to impart the watermark to the object.
[0031] Once embedded in the object, the object reference serves as a machine-readable code that conveys information about the object, a machine instruction or instructions, or an index to information or instructions. Any compatible reader may extract the object reference. FIG. 2 is a flow diagram illustrating an overview of the reading process. Typically, the reader system incorporates a combination of hardware and software elements. First, the reader scans the object surface to capture a digital representation of the surface (e.g., an image, or map of surface topology) (200). Next, the reader processes the surface representation to detect whether a watermark is present (202). If so, the reader proceeds to read the watermark payload (204). In some implementations, a separate detection process is not performed.
[0032] Bar Codes
[0033] Over the years, a number of standards organizations and private entities have formed symbology standards for bar codes. Some examples of standards bodies include the Uniform Code Council (UCC), European Article Numbering (EAN, also referred to as International Article Numbering Association), Japanese Article Numbering (JAN), Health Industry Bar Coding Counsel (HIBC), Automotive Industry Action Group (AIAG), Logistics Application of Automated Marking and Reading Symbols (LOGMARS), Automatic Identification Manufacturers (AIM), American National Standards Institute (ANSI), and International Standards Organization (ISO).
[0034] The UCC is responsible for the ubiquitous bar code standard called the Universal Product Code (UPC). AIM manages standards for industrial applications and publishes standards called Uniform Symbology Standards (USS).
[0035] Some well know bar code schemes include UPC and UCC/EAN-128, Codabar developed by Pitney Bowes Corporation, 12 of 5 and Code 128 developed by Computer Identics, Code 39 (or 3 of 9) developed by Intermec Corporation, and code 93.
[0036] Some bar codes, such as UPC, are fixed length, while others are variable length. Some support only numbers, while others support alphanumeric strings (e.g., Code 39 supports full ASCII character set). Some incorporate error checking functionality.
[0037] While the bar codes listed above are generally one-dimensional in that they consist of a linear string of bars, bar codes may also be two-dimensional. Two dimensional bar codes may be in a stacked form (e.g., a vertical stacking of one-dimensional codes), a matrix form, a circular form, or some other two-dimensional pattern. Some examples of 2D barcodes include code 49, code 16k, Data Matrix developed by RVSI, Maxicode, QR code, micro PDF-417 and PDF-417. Of course, this is not an exhaustive list of 2-D barcodes. The present invention can be suitably utilized with other barcode symbologies. All of the above bar code schemes encode a relatively small amount of information and such information (or a subset of such information) may be converted into watermark signals using the method outlined in FIG. 1 .
[0038] For more information on bar codes, see D. J. Collins, N. N. Whipple, Using Bar Code-Why It's Taking Over, (2d ed.) Data Capture Institute; R. C. Palmer, The Bar Code Book, (3rd ed.) Helmers Publishing, Inc., and P. L. Grieco, M. W. Gozzo, C. J. Long, Behind Bars, Bar Coding Principles and Applications, PT Publications Inc., which are hereby incorporated by reference.
Applications
[0039] Interrelating Digital Watermarks and Barcodes
[0040] Digital watermarks can be used in connection with traditional barcodes. For example, a digital watermark can include information to verify, decrypt or decode the barcode, or vice versa. In one implementation, a digital watermark includes a payload carrying information related to the barcode. For instance, the digital watermark may include a hash of the barcode information or of a subset of the barcode information. In another implementation, the digital watermark includes a key to decrypt or decode the barcode. Or the digital watermark payload and the barcode information interrelate (e.g., match or mathematically coincide).
[0041] Identification Cards
[0042] Now consider an identification card. An identification card can include a driver's license, passport, company identification, identification document, membership card, national identification card, insurance card, etc., etc., etc. The identification card includes a barcode, e.g., carrying at least variable information such as a cardholder's name, address, card number, and optionally, a photograph information, biometric information, etc., etc. The barcode can be printed on either side of the identification card. Most frequently, however, the barcode is positioned on a backside of the card. The identification card will typically include a photograph and printed information to identify the cardholder. The card can also include so-called fixed information. (For example, fixed information on a driver's license may identify the State, DMV information, or other information that is not personal with respect to the card's holder).
[0043] The identification card includes a digital watermark embedded therein. The digital watermark includes a payload or other information bits. While the digital watermark can be embedded variously throughout the card (e.g., in printed areas, background texture, photograph, etc.), embedding preferably occurs in at least the photograph.
[0044] In a first implementation, the watermark payload includes a hash of the information carried by the barcode. Most generally, a hash includes the result of an algorithm that converts data into a lower number of bits. Examples of hashing algorithms include MD5, MD2, SHA, and SHA1, among others. A hash can also include a subset of the barcode's information set. For instance, the barcode may include a cardholder's photograph, birth date, name and card number. A subset hash may then include a subset of this information, e.g., only the birth date and card number.
[0045] The interrelationship between the barcode and digital watermark are used to verify the authenticity of the identification card. One verification implementation is described with reference to FIG. 3 . A digital watermark is detected and decoded (step 10). The digital watermark includes a payload having verification information, such as a hash as discussed above. And the barcode is read and decoded in step 12. We note that the order of steps 10 and 12 is not critical, unless either the digital watermark or the barcode includes a key to decode or decrypt the other. The digital watermark data is compared with the barcode information (step 14). The comparison may include recalculating a hash of the barcode information and comparing the recalculated hash against a hash carried by the digital watermark. Or if the digital watermark hash includes a subset of the barcode information, the subset is compared against the barcode information set. (For example, the subset hash may include the cardholder's birth date and card number. This information is compared against the barcode birth date and card number). Or if the digital watermark payload includes a key for decoding/decrypting the barcode, the comparison step may include determining whether the barcode can be successfully decoded/decrypted, or vice versa. In still another case, the digital watermark includes the full set of barcode information, and not just a subset of such information. Still further a comparison may determine whether the watermark information coincides with the barcode information.
[0046] The result of the comparison step 14 is used to determine whether this digital watermark and barcode information match or otherwise coincide (step 16). The term “match” is defined broadly herein to include an exact match and a predetermined relationship, such as a cryptographic relationship, overlap of data sets or other predetermined relationship. The process preferably provides an indication of whether the card is authentic (18) or not (20).
[0047] This authentication method is helpful in preventing counterfeiters or forgers. For example, suppose an identification card is embedded with a first digital watermark. The identification card belongs to say 16-year old Joan. The identification card further includes Joan's photograph and a barcode including at least Joan's variable information (name, sex, age, etc.). The first digital watermark includes a hash or other information that corresponds in some manner to Joan's barcode information. Joan decides that she wants to “up-grade” her age, by cutting and pasting her identification card photograph onto her 22-year old sister, Molly's, identification card. Molly's identification card also includes a barcode with her variable information.
[0048] Joan pulls off a professional job replacing Molly's photo with her own. All seems fine for Joan until the verification process of FIG. 2 is used to verify the identification card. Joan's first digital watermark hash (included in Joan's photograph) does not match Molly's barcode information—confirming that the photograph does not belong to the identification card. The counterfeit is justly determined.
[0049] A similar verification process can be carried out for watermarks embedded in regions other than a photograph.
[0050] In some counterfeiting scenarios, a photograph without a digital watermark is used to replace an original, digitally watermarked photograph. To handle this case, the authentication method of FIG. 3 may be modified to include steps 10′ and 10a to determine whether the digital watermark is recovered or successfully read, e.g., prior to step 14. If the digital watermark is not recovered the document is considered fraudulent or at least not valid. Similar steps 12′ and 12b are optionally implemented to determine whether the barcode is decoded. Our alternative implementation is shown in FIG. 4 .
[0051] Another alternative implementation is shown in FIG. 5 . In this implementation, we compare barcode information against information printed on or otherwise contained in or on the identification card. The barcode is decoded (step 12). As discussed above with respect to FIG. 4 , step 12a (not shown in FIG. 5 ) is optionally provided to ensure that the barcode is successfully recovered. Information contained on or in the identification card is captured through, e.g., optical character recognition (OCR), manual input, magnetic stripe, data retrieved from electronic circuitry in the identification card (if provided), etc. (step 13). The captured information is compared with the barcode information (step 14). The result of the comparison step 14 is used to determine whether the captured text and barcode information match or otherwise coincide (step 16). The process preferably provides an indication of whether the card is authentic (18) or not (20). This implementation helps detect a situation where Joan decides to also “cut-and-paste” her barcode onto Molly's ID card. Of course, this method can be combined with those shown in FIGS. 3 and 4 . For example, the method illustrated in FIG. 5 can be carried out between steps 12 and 14 in FIG. 3 and/or between steps 12a and 14 in FIG. 4 .
[0052] In another implementation shown in FIG. 6 , comparison data is alternatively captured instead of retrieving the comparison data from a barcode (step 30). For example, the comparison data is gathered via optical character recognition (OCR), a magnetic stripe, magnetic ink character recognition (MICR), optical mark recognition (OMR), manual input, or in a case where the identification card includes so-called Smartcard or RFID circuitry, from electronically stored data. The FIG. 6 implementation otherwise proceeds as discussed above with respect to FIG. 3 . (We note that the FIG. 6 implementation can be modified to include the optional steps 10′ and 10a as discussed with respect to FIG. 4 ).
[0053] Watermark Reading Devices
[0054] There are many suitable computing devices that can be used with the present invention. One is a general-purpose computer including standard processing structure, an image capture device (e.g., a digital camera, optical.sensor, etc.) and memory. The memory includes digital watermark detecting software instructions stored therein for execution on the processing structure (e.g., a CPU). The image capture device can be tethered to the computer or can wirelessly communicate with the computer.
[0055] We have also found that conventional 2-D barcode readers can be modified to achieve digital watermark detection. Such barcode readers generally include an imaging sensor such as a CMOS sensor or a CCD array. One such suitable imaging sensor is the OmniVision Technologies barcode camera. OmniVision is headquartered in Sunnyvale, Calif., 94085, USA. See www.ovt.com for even more information. Another suitable barcode reader is the Welch Allyn Dolphin product, which includes Intel's StrongArm processor and runs Windows CE. Symbol Technologies, Inc., which is headquartered in Holtsville, N.Y., USA, develops other suitable barcode readers. Examples of such include Symbol's VS4000 and P300IMG models. These readers include a progressive scan CCD with an optical resolution of about 640×480 pixels×256 shades of gray. (Even more information about Symbol's readers can be obtained from Symbol Technologies or at www.symbol.com/products/barcode_scanners).
[0056] Of course, there are many other known barcode readers that can be suitably interchanged with the present invention. We also anticipate that barcode readers will continue to improve and advance. Such improvements are anticipated to be suitably interchangeable with the present invention.
[0057] A 2-D barcode reader is programmed with digital watermark detecting software. The 2-D barcode reader captures an image of a document or object that is embedded with a digital watermark. The digital watermark detecting software analyzes the captured image to decode the digital watermark. (We note that such digital watermark detecting software is readily implemented in view of this and the incorporated by reference patent documents).
[0058] A 2-D barcode/digital watermark reader is an advantageously solution since it can read and decode both 2-D barcodes and digital watermarks. A 2-D barcode reader can even be programmed to carry out the authentication method of FIG. 3 and other document verification methods.
[0059] Such a 2-D barcode is also capable of capturing relatively high quality images. This advantageous feature can be combined with our digital watermarking techniques. For example, a 2-D bar code reader captures an image of a cardholder's face. Facial recognition software processes the image to generate a hash. The same 2-D barcode reader is used to decode the digital watermark and/or barcode. The digital watermark (and/or barcode) includes a related facial recognition hash. If the hashes match or otherwise coincides the individual and identification document are authenticated. Or the 2-D barcode reader can be configured to image a fingerprint to determine authenticity.
[0060] It should be appreciated that while we have referenced “2-D barcode readers” the present invention is not limited to such. Indeed, as mentioned above, a general purpose computer communicating with an imaging device can be used to achieve similar functionality.
[0061] Watermarking Identification Card Stock
[0062] Another inventive aspect of our present invention is to pre-digitally watermark identification card stock. For example, before being personalized, identification card stock is digitally watermarked. The watermark may be embedded in background print or texturing for example, or in printed fixed information.
[0063] To verify authenticity, an identification card must include the pre-embedded digital watermark. This watermark need not include a unique identifier, but rather can include the same identifier per card batch, run or for all cards. (If a batch of cards is misappropriated, cards having that batch watermark identifier can be flagged as suspect).
[0064] The digital watermark may even include a so-called fragile watermark. A fragile watermark is designed to destruct or predictably degrade upon signal processing such as scanning and printing. A fragile watermark will help prevent unauthorized copying of the card stock. (Fragile digital watermarking technology and various applications of such are even further disclosed, e.g., in assignee's U.S. patent application Ser. Nos. 09/234,780, 09/433,104 (now U.S. Pat. No. 6,636,615), 09/498,223 (now U.S. Pat. No. 6,574,350), 60/198,138, 09/562,516, 09/567,405, 09/625,577 (now U.S. Pat. No. 6,788,800), 09/630,243 (now U.S. Pat. No. 6,735,324), 09/645,779 (now U.S. Pat. No. 6,714,683), 09/689,226 (now U.S. Pat. No. 6,694,041), 09/689,289, 09/689,293 (now U.S. Pat. No. 6,683,966), 60/232,163, 60/247,389, and 09/898,901 (now U.S. Pat. No. 6,721,440). Each of these applications is herein incorporated by reference).
[0065] Linking Documents through Digital Watermarking
[0066] Documents can be linked together, and to a bearer/creator through secure indicia on a photo ID and subsequently issued documents.
[0067] Consider the following inventive combination of steps:
-
- [0068] 1. Decode a digital watermark identifier embedded within a photo ID presented by a bearer of the photo ID;
- [0069] 2. Embed that watermark identifier or a cryptographic permutation of the identifier into a first document issued to the bearer (e.g., a boarding pass, ticket, etc.); and
- [0070] 3. Now, the photo ID and first document are linked through the two digital watermark identifiers. This enables an additional layer of verification when the bearer presents the photo ID and first document to gain access, get on a plane, etc. etc. In particular, the bearer has to present the photo ID and first document, AND the watermarks extracted from the photo ID and first document must match or otherwise satisfy a predetermined relationship, like a cryptographic function.
[0071] The two watermarks can be related in many ways. Preferably, the watermarks are readable by the same detector to simplify deployment. But to prevent someone from merely copying the watermark from the ID to some fake document, it is useful to alter the watermark in some way that maintains the relationship between the two documents but does not yield the same watermark.
[0072] This concept applies to other forms of printable secure indicia, like some types of bar codes and scrambled indicia. We can even extend this to other machine-readable codes, but these codes should be readable from the photo ID and then be writable to the document that is issued. Some examples may include magnetic strip readers and writers, smart cards, etc.
[0073] Our inventive system for linking documents in a secure fashion also provides a solution for home printing of say tickets and boarding passes (e.g., a user presents her photo ID at home, the digital watermark identifier is extracted from the photo ID and is printed on tickets, the embedded ticket is then verified at the airport gate).
[0074] Orientation Signals Versus Object or Area Detection
[0075] In some digital watermarking techniques, the components of the watermark structure may perform the same or different functions. For example, one component may carry a message, while another component may serve to identify the location or orientation of the watermark in a combined signal. This orientation component is helpful in resolving signal distortion issues such as rotation, scale and translation. (Further reference to orientation signals can be made, e.g., to assignee's U.S. patent application Ser. No. 09/503,881, now U.S. Pat. No. 6,614,914, which is herein incorporated by reference).
[0076] We have found that we can forego an orientation signal when embedding a digital watermark message component in an identification card photograph, since most identification cards, e.g., a driver's license, include a standard rectangular-shaped photograph. We use object detection techniques to locate the photograph shape, determine distortion based on the expected shape of the photograph area, adjust the photograph area to compensate for the determined distortion and then detect the digital watermark from the reshaped (or adjusted) photograph area. We can include even more message bits without significantly effecting visibility when we forego an orientation signal.
[0077] Once the photograph is realigned we can successfully detect and decode a digital watermark embedded therein. The watermark can be used for authentication purposes as discussed above.
[0078] Perceptual Hashes and Facial Recognition
[0079] Another inventive implementation compares a perceptual hash (or facial recognition data) of a photograph in an identification document with a similarly computed hash (or data) carried by either a barcode or digital watermark. In a detection process, we can use a digital watermark orientation signal or the object recognition techniques discussed above to help realign a distorted captured image of the photograph. A perceptual hash (or facial recognition analysis) is determined from the realigned photograph. The determined perceptual hash is compared with a stored hash recovered from a digital watermark or barcode.
CONCLUDING REMARKS
[0080] Having described and illustrated the principles of the invention with reference to specific implementations, it will be recognized that the principles thereof can be implemented in many other, different, forms. To provide a comprehensive disclosure without unduly lengthening the specification, applicants incorporate by reference the patents and patent applications referenced above.
[0081] While the above implementations have focused on authenticating identification documents, it should be understood that the present invention is not so limited. Indeed, digital watermark information can be compared with information carried by other machine readable codes to authenticate or compliment product packaging, product labels, product hang tags, receipts, inventory, sale documentation, medical records, credit cards, paper files, software, DVDs, CDs, products, etc., etc., and any other document or object including a machine readable code and digital watermark.
[0082] The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patents/applications are expressly contemplated.
Claims
What is claimed is:
1. An authentication method comprising:
receiving optical scan data representing at least a portion of an identification document, the portion of the identification document comprising a first region including a photographic representation of an authorized bearer of the identification document;
comparing geometric characteristics of the first region from the data representing the portion to predetermined geometric characteristics of the first region;
based at least in part on a result of said act of comparing, adjusting a detection process; and
utilizing a programmed electronic processor for detecting steganographic encoding with the adjusted detection process to obtain information steganographically encoded in the photographic representation of the authorized bearer of the identification document.
2. The method of claim 1 wherein the act of adjusting the detection process includes adjusting geometric characteristics of the optical scan data.
3. The method of claim 2 wherein adjusting the geometric characteristics of the optical scan data comprises re-aligning the first region to approximate the predetermined geometric characteristics.
4. The method of claim 1, wherein the information is steganographically encoded with digital watermarking.
5. The method of claim 1 wherein the information comprises a reduced-bit representation corresponding to the photographic representation.
6. The method of claim 1 wherein the predetermined geometric characteristics comprise at least scale, translation or rotation.
7. The method of claim 1 wherein the predetermined geometric characteristics correspond to a rectangle.
8. A machine-readable medium comprising instructions to cause an electronic processor to perform the method of claim 1.
9. The method of claim 1 wherein the optical scan data is obtained through visible light scanning.
10. A programmed computing device storing instructions in memory, said instructions are executable by said programmed computing device to perform the acts of claim 1.
11. A computer readable media comprising instructions stored thereon to cause a multi-purpose processor to perform the acts of claim 1.
12. An authentication method comprising:
receiving an object comprising a host object and auxiliary data steganographically embedded within the host object;
determining geometric characteristics of the host object relative to expected geometric characteristics of the host object;
re-aligning or adjusting data representing the host object to compensate for geometric characteristics of the host object based on a result of said act of determining; and then
utilizing a programmed electronic processor for detecting the auxiliary data from the host object.
13. The method of claim 12 wherein the host object comprises a representation of an identification document photograph.
14. The method of claim 12 wherein the auxiliary data is steganographically embedded within the host object with digital watermarking.
15. The method of claim 12 wherein the host object represents a photograph and the auxiliary data includes a reduced-bit representation of the photograph.
16. A machine-readable medium comprising instructions to cause an electronic processor to perform the method of claim 12.
17. A programmed computing device storing instructions in memory, said instructions are executable by said programmed computing device to perform the acts of claim 12.
18. A computer readable media comprising instructions stored thereon to cause a multi-purpose processor to perform the acts of claim 12.
19. A method comprising:
receiving data representing an identification document photograph and auxiliary data steganographically hidden within the identification document photograph;
determining geometric characteristics of the identification document photograph relative to expected geometric characteristics of the identification document photograph, in which the expected geometric characteristics are represented in terms of at least scale, translation or rotation; and
utilizing a programmed electronic processor for detecting the auxiliary data from the data representing the identification document photograph based at least in part on a result from said act of determining.
20. The method of claim 19 further comprising re-aligning or correcting geometric characteristics of the identification document photograph based at least in part on the result prior to said act of detecting.
21. The method of claim 19, wherein the auxiliary data is steganographically hidden within the identification document photograph with digital watermarking.
22. The method of claim 19 wherein the auxiliary data comprises a reduced-bit representation corresponding to the identification document photograph.
23. The method of claim 19 wherein the expected geometric characteristics correspond to a rectangle.
24. A machine-readable medium comprising instructions to cause an electronic processor to perform the method of claim 19.
25. A programmed computing device storing instructions in memory, said instructions are executable by said programmed computing device to perform the acts of claim 19.
26. A computer readable media comprising instructions stored thereon to cause a multi-purpose processor to perform the acts of claim 19.
Patent Citations (159)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4213038(A) | 1980-07-01 | Silverman et al. | Examiner |
| US4359633(A) | 1982-11-01 | Bianco | Applicant |
| US4590366(A) | 1986-05-01 | Rothfjell | Applicant |
| US4663518(A) | 1987-05-01 | Borror et al. | Applicant |
| US4675746(A) | 1987-06-01 | Tetrick et al. | Applicant |
| US4689477(A) | 1987-08-01 | Goldman | Applicant |
| US4790566(A) | 1988-12-01 | Boissier et al. | Applicant |
| US4807031(A) | 1989-02-01 | Broughton et al. | Applicant |
| US4879747(A) | 1989-11-01 | Leighton et al. | Applicant |
| US4939515(A) | 1990-07-01 | Adelson | Applicant |
| US4969041(A) | 1990-11-01 | O'Grady et al. | Applicant |
| US4972476(A) | 1990-11-01 | Nathans | Applicant |
| US4994831(A) | 1991-02-01 | Marandi | Applicant |
| US5113445(A) | 1992-05-01 | Wang | Applicant |
| US5237164(A) | 1993-08-01 | Takada | Applicant |
| US5284364(A) | 1994-02-01 | Jain | Applicant |
| US5319453(A) | 1994-06-01 | Copriviza et al. | Applicant |
| US5319735(A) | 1994-06-01 | Preuss et al. | Applicant |
| US5321751(A) | 1994-06-01 | Ray et al. | Applicant |
| US5337361(A) | 1994-08-01 | Wang et al. | Applicant |
| US5351302(A) | 1994-09-01 | Leighton | Applicant |
| US5379345(A) | 1995-01-01 | Greenberg | Applicant |
| US5384846(A) | 1995-01-01 | Berson et al. | Applicant |
| US5396559(A) | 1995-03-01 | McGrew | Applicant |
| US5436970(A) | 1995-07-01 | Ray et al. | Applicant |
| US5469506(A) | 1995-11-01 | Berson et al. | Applicant |
| US5471533(A) | 1995-11-01 | Wang et al. | Applicant |
| US5488664(A) | 1996-01-01 | Shamir | Applicant |
| US5490217(A) | 1996-02-01 | Wang et al. | Applicant |
| US5495581(A) | 1996-02-01 | Tsai | Applicant |
| US5505494(A) | 1996-04-01 | Belluci et al. | Applicant |
| US5515451(A) | 1996-05-01 | Tsuji et al. | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5635012(A) | 1997-06-01 | Belluci et al. | Applicant |
| US5636292(A) | 1997-06-01 | Rhoads | Applicant |
| US5646997(A) | 1997-07-01 | Barton | Applicant |
| US5652626(A) | 1997-07-01 | Kawakami et al. | Applicant |
| US5659726(A) | 1997-08-01 | Sandford, II et al. | Applicant |
| US5687191(A) | 1997-11-01 | Lee et al. | Applicant |
| US5694471(A) | 1997-12-01 | Chen et al. | Applicant |
| US5710834(A) | 1998-01-01 | Rhoads | Applicant |
| US5721788(A) | 1998-02-01 | Powell et al. | Applicant |
| US5742685(A) | 1998-04-01 | Berson et al. | Applicant |
| US5748783(A) | 1998-05-01 | Rhoads | Applicant |
| US5760386(A) | 1998-06-01 | Ward | Applicant |
| US5767496(A) | 1998-06-01 | Swartz | Applicant |
| US5768426(A) | 1998-06-01 | Rhoads | Applicant |
| US5786587(A) | 1998-07-01 | Colgate, Jr. | Applicant |
| US5787186(A) | 1998-07-01 | Schroeder | Examiner |
| US5799092(A) | 1998-08-01 | Kristol et al. | Applicant |
| US5809160(A) | 1998-09-01 | Powell et al. | Applicant |
| US5832119(A) | 1998-11-01 | Rhoads | Applicant |
| US5835639(A) | 1998-11-01 | Honsinger et al. | Applicant |
| US5841886(A) | 1998-11-01 | Rhoads | Applicant |
| US5859920(A) | 1999-01-01 | Daly et al. | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5864622(A) | 1999-01-01 | Marcus | Applicant |
| US5864623(A) | 1999-01-01 | Messina | Applicant |
| US5907149(A) | 1999-05-01 | Marckini | Applicant |
| US5912974(A) | 1999-06-01 | Holloway et al. | Applicant |
| US5930369(A) | 1999-07-01 | Cox et al. | Applicant |
| US5949055(A) | 1999-09-01 | Fleet et al. | Applicant |
| US5951055(A) | 1999-09-01 | Mowry, Jr. | Applicant |
| US5984366(A) | 1999-11-01 | Priddy | Applicant |
| US6024287(A) | 2000-02-01 | Takai et al. | Applicant |
| US6044182(A) | 2000-03-01 | Daly et al. | Applicant |
| US6078664(A) | 2000-06-01 | Moskowitz et al. | Applicant |
| US6111954(A) | 2000-08-01 | Rhoads | Applicant |
| US6122403(A) | 2000-09-01 | Rhoads | Applicant |
| US6128401(A) | 2000-10-01 | Suzuki et al. | Applicant |
| US6208735(B1) | 2001-03-01 | Cox et al. | Applicant |
| US6233347(B1) | 2001-05-01 | Chen et al. | Applicant |
| US6240121(B1) | 2001-05-01 | Senoh | Applicant |
| US6243480(B1) | 2001-06-01 | Zhao et al. | Applicant |
| US6249226(B1) | 2001-06-01 | Harrison | Applicant |
| US6282300(B1) | 2001-08-01 | Bloom et al. | Applicant |
| US6286761(B1) | 2001-09-01 | Wen | Applicant |
| US6289108(B1) | 2001-09-01 | Rhoads | Applicant |
| US6292092(B1) | 2001-09-01 | Chow et al. | Applicant |
| US6321981(B1) | 2001-11-01 | Ray et al. | Applicant |
| US6343138(B1) | 2002-01-01 | Rhoads | Applicant |
| US6370258(B1) | 2002-04-01 | Uchida | Applicant |
| US6389151(B1) | 2002-05-01 | Carr et al. | Applicant |
| US6408082(B1) | 2002-06-01 | Rhoads et al. | Applicant |
| US6411725(B1) | 2002-06-01 | Rhoads | Applicant |
| US6424249(B1) | 2002-06-01 | Houvener | Applicant |
| US6424725(B1) | 2002-07-01 | Rhoads et al. | Applicant |
| US6422285(B1) | 2002-08-01 | Rhoads et al. | Applicant |
| US6430306(B2) | 2002-08-01 | Slocum | Applicant |
| US6430307(B1) | 2002-08-01 | Souma et al. | Applicant |
| US6442285(B2) | 2002-08-01 | Rhoads et al. | Applicant |
| US6463416(B1) | 2002-10-01 | Messina | Applicant |
| US6487301(B1) | 2002-11-01 | Zhao | Applicant |
| US6522769(B1) | 2003-02-01 | Rhoads et al. | Applicant |
| US6536665(B1) | 2003-03-01 | Ray et al. | Applicant |
| US6546112(B1) | 2003-04-01 | Rhoads | Applicant |
| US6553494(B1) | 2003-04-01 | Glass | Applicant |
| US6591249(B2) | 2003-07-01 | Zoka | Applicant |
| US6608911(B2) | 2003-08-01 | Lofgren et al. | Applicant |
| US6614914(B1) | 2003-09-01 | Rhoads et al. | Applicant |
| US6704869(B2) | 2004-03-01 | Rhoads et al. | Applicant |
| US6724914(B2) | 2004-04-01 | Brundage et al. | Applicant |
| US6748533(B1) | 2004-06-01 | Wu et al. | Applicant |
| US6751336(B2) | 2004-06-01 | Zhao et al. | Applicant |
| US6765950(B1) | 2004-07-01 | Nuytkens et al. | Applicant |
| US6782116(B1) | 2004-08-01 | Zhao et al. | Applicant |
| US6795565(B2) | 2004-09-01 | Wendt | Applicant |
| US6804375(B2) | 2004-10-01 | Muratani | Applicant |
| US6845170(B2) | 2005-01-01 | Wendt | Applicant |
| US6973197(B2) | 2005-12-01 | Miller | Applicant |
| US6975744(B2) | 2005-12-01 | Sharma et al. | Applicant |
| US6975745(B2) | 2005-12-01 | Bradley | Applicant |
| US7024563(B2) | 2006-04-01 | Shimosato et al. | Applicant |
| US7046819(B2) | 2006-05-01 | Sharma et al. | Applicant |
| US7050201(B2) | 2006-05-01 | Alattar | Applicant |
| US7072526(B2) | 2006-07-01 | Sakuramoto | Examiner |
| US7113596(B2) | 2006-09-01 | Rhoads | Applicant |
| US7116781(B2) | 2006-10-01 | Rhoads | Applicant |
| US7152786(B2) | 2006-12-01 | Brundage et al. | Applicant |
| US7174031(B2) | 2007-02-01 | Rhoads et al. | Applicant |
| US7213757(B2) | 2007-05-01 | Jones et al. | Applicant |
| US7280672(B2) | 2007-10-01 | Powell et al. | Applicant |
| US7305104(B2) | 2007-12-01 | Carr et al. | Applicant |
| US7424131(B2) | 2008-09-01 | Alattar et al. | Applicant |
| US7506169(B2) | 2009-03-01 | Brundage et al. | Applicant |
| US7529647(B2) | 2009-05-01 | Alattar et al. | Applicant |
| US7555139(B2) | 2009-06-01 | Rhoads et al. | Applicant |
| US7602977(B2) | 2009-10-01 | Rhoads et al. | Applicant |
| US7639837(B2) | 2009-12-01 | Carr et al. | Applicant |
| US7657058(B2) | 2010-02-01 | Sharma | Applicant |
| US2002/0046171(A1) | 2002-04-01 | Hoshino | Applicant |
| US2002/0076084(A1) | 2002-06-01 | Tian et al. | Applicant |
| US2002/0099943(A1) | 2002-07-01 | Rodriguez et al. | Applicant |
| US2002/0116508(A1) | 2002-08-01 | Khan et al. | Applicant |
| US2002/0126870(A1) | 2002-09-01 | Wendt | Applicant |
| US2002/0136459(A1) | 2002-09-01 | Imagawa | Applicant |
| US2002/0150277(A1) | 2002-10-01 | Nishimoto | Applicant |
| US2002/0157005(A1) | 2002-10-01 | Brunk et al. | Applicant |
| US2002/0170966(A1) | 2002-11-01 | Hannigan et al. | Applicant |
| US2003/0002710(A1) | 2003-01-01 | Rhoads | Applicant |
| US2003/0039376(A1) | 2003-02-01 | Stach | Applicant |
| US2003/0039377(A1) | 2003-02-01 | Rhoads et al. | Applicant |
| US2003/0081857(A1) | 2003-05-01 | Tapson | Applicant |
| US2003/0099379(A1) | 2003-05-01 | Monk et al. | Applicant |
| US2003/0102660(A1) | 2003-06-01 | Rhoads | Applicant |
| US2003/0126121(A1) | 2003-07-01 | Khan et al. | Applicant |
| US2003/0133589(A1) | 2003-07-01 | Deguillaume et al. | Applicant |
| US2004/0181671(A1) | 2004-09-01 | Brundage et al. | Applicant |
| US2004/0187004(A1) | 2004-09-01 | Ray et al. | Applicant |
| US2004/0267533(A1) | 2004-12-01 | Hannigan et al. | Applicant |
| US2007/0016790(A1) | 2007-01-01 | Brundage et al. | Applicant |
| DE2943436 | 1981-05-01 | Applicant | |
| EP629972 | 1994-12-01 | Applicant | |
| EP736860 | 1996-10-01 | Applicant | |
| EP642060 | 1999-04-01 | Applicant | |
| EP977434 | 2000-02-01 | Applicant | |
| JP3-185585 | 1991-08-01 | Applicant | |
| WO9603286 | 1996-02-01 | Applicant | |
| WO211326 | 2002-02-01 | Applicant |
Non-Patent Literature (28)
- “Best Practices for the Use of Magnetic Stripes,” MVIS Magnetic Stripe Working Group, Report to AAMVA, Version 2.0, Apr. 1996, Including a history on p. 3.Applicant
- Chow et al., “Forgery and Tamper-Proof Identification Document,” IEEE Proc. 1993 Int. Carnahan Conf. on Security Technology, Oct. 13-15, 1993, pp. 11-14.Applicant
- Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents For Automatic Verification,” 1979 Carnahan Conference on Crime Countermeasures, University of Kentucky, Lexington, Kentucky, May 16-18, 1979.Applicant
- Kawaguchi et al., “Principle, and Applications of BPCS-Steganography,” Proc. SPIE vol. 3528: Multimedia Systems and Applications, Nov. 2-4, 1998, pp. 464-473.Applicant
- Komatsu et al., “A Proposal on Digital Watermarking in Document Image Communication and Its Application to Realizing a Signature,” Electronics and Communications in Japan, Part I, vol. 73, No. 5, 1990, pp. 22-33.Applicant
- Komatsu et al., “Authentication System Using Concealed Image in Telematics,” Memoirs of the School of Science & Engineering, Waseda Univ., No. 52, 1988, pp. 45-60.Applicant
- Seybold Report on desktop Publishing, “Holographic Signatures for Digital Images,” Aug. 1995, 1 page.Applicant
- May 19, 2004 Notice of Abandonment; Apr. 26, 2004 Letter of Express Abandonment of Application, Oct. 23. 2003 non-final Office Action; and Sep. 9, 2003 Preliminary Amendment; all from assignee's U.S. Appl. No. 10/094,593 (published as US 2002-0170966 A1).Applicant
- Aug. 15, 2006 Notice of Allowance; Jun. 12, 2006 Appeal Brief; Jan. 10, 2006 final Office Action: Nov. 23, 2005 Amendment; Jul. 25, 2005 non-final Office Action; Jun. 15, 2005 Amendment; Apr. 4, 2005 non-final Office Action; all from assignee's U.S. Appl. No. 10/830,975 (now U.S. Patent No. 7,152,786).Applicant
- Fleet et al., “Embedding Invisible Information in Color Images,” IEEE Int. Conf. on Image Proc., Oct. 1997, vol. 1, pp. 532, 535.Applicant
- O'Ruanaidh et al., “Rotation, Scale And Translation Invariant Speed Spectrum Digital Image Watermarking,” Signal Processing, vol. 66, May 1998, pp. 303-317.Applicant
- O'Runanaidh, “Rotation, Scale and Translation Invariant Digital Image Watermarking,” 1997 IEEE, pp. 536-539.Applicant
- Pereira et al., “Template Based Recovery of Fourier-Based Watermarks Using Log-Polar and Log-log Maps,” Proc. IEEE Int. Conf. on Multimedia Computing and Systems, vol. 1, Jun. 1999, pp. 870-874.Applicant
- Lin et al., “Rotation, Scale, and Translation Resilient Public Watermarking for Images,” Proc. SPIE vol. 3971: Security and Watermarking of Multimedia Contents II, Jan. 2000, pp. 90-98.Applicant
- Su et al., “An Image Watermarking Scheme to Resist Generalized Geometrical Transforms,” Proc. SPIE vol. 4209: Multimedia Systems and Applications III, Nov. 2000, pp. 354-365.Applicant
- Su et al., “Synchronized Detection of the Block-based Watermark with Invisible Grid Embedding,” Proc. SPIE vol. 4314: Securi and Watermarking of Multimedia Contents III, Jan. 2001, pp. 406-417.Applicant
- Lin et al., “Rotation, Scale, and Translation Resilient Watermarking for Images,” IEEE Transactions on Image Processing, vol. 10, No. 5, May 2001, pp. 767-782.Applicant
- Nikolaidis et al., “Region-Based Image Watermarking,” IEEE Transactions on Image Processing, vol. 10, No. 11, Nov. 2001, pp. 1726-1740.Applicant
- Bender et al., “Techniques for Data Hiding,” SPIE vol. 2420, Jan. 1995, pp. 164-173.Applicant
- Brassil et al., “Electronic Marking and Identification Techniques to Discourage Document Copying,” IEEE Proc. Infocom'94, Jun. 1994, pp. 1278-1287.Applicant
- Sheng et al., “Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,” Journal of Optical Society of America, vol. 3, No. 6, Jun. 1986, pp. 771-776.Applicant
- O Ruanaidh, et al., Phase Watermarking of Digital Images. Proc ICIP-96, Lausanne, Switzerland, Sep. 16-19, 1996. p. 239-242.Applicant
- ORuanaidh et al, “Watermarking Digital Images for Copyright Protection,” http://www.kalman.mee.tcd.ie/people/jjr/leva.sub.--pap.html, Feb. 2, 1996, 8 pages. (Also published Aug. 1996, IEE Proceedings-Vision, Image and Signal Processing, vol. 143, No. 4, pp. 250-256.).Applicant
- Ohnishi et al., Embedding a Seal into a Picture Under Orthogonal Wavelet Transform, Proceedings of Multimedia '96, 1996, IEEE, pp. 514-521.Applicant
- Meerwald et al., “A Survey of Wavelet-Domain Watermarking Algorithms,” Proc. of SPIE vol. 4314 (2001), pp. 505-516.Applicant
- Matsui et al., “Embedding a Signature to Pictures Under Wavelet Transformation,” Transactions of the Institute of Electronics Information and Communication Engineers D-II, vol. J79D-II, No. 6, Jun. 1996, pp. 1017-1024.Applicant
- Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” NEC Research Institute Technical Report, Dec. 5, 1995, 33 pages.Applicant
- Kutter, “Watermarking Resisting To Translation, Rotation, And Scaling,” Proc. SPIE vol. 3528: Multimedia Systems and Applications, Nov. 1998, pp. 423-431.Applicant