The present invention relates to hidden data systems, and is particularly illustrated with reference to identification documents including digital watermarks.
Digital watermarking technology, a form of steganography, encompasses a great variety of techniques by which plural bits of digital data are hidden in some other object preferably without leaving human-apparent evidence of alteration.
Digital watermarking modifies media content to embed a machine-readable code into the data content. The data may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process. Most commonly, digital watermarking is applied to media such as images, audio signals, and video signals. However, it may also be applied to other types of data, including text documents (e.g., through printing, line, word or character shifting), software, multi-dimensional graphics models, and surface textures of objects. Of course, images, graphics, background patterns, seals, logos and artwork can be watermarked and then printed or applied to documents or other objects.
Other techniques extend the texturing techniques, e.g., by employing an intaglio press to texture the media as part of the printing process (either without ink, or with clear ink).
Printable media—especially for security documents (e.g., banknotes, checks, etc.) and identification documents (e.g., passports, driver's licenses, bank cards, visas, government issued documentation, company cards or badges, photograph identification cards, etc.)—are ideally suited to receive digital watermarking. The terms “ID document” and “card” are sometime interchangeably used for “identification document.”
Digital watermarking systems have two primary components: an embedding component that embeds a watermark in media content, and a reading component that detects and reads the embedded watermark. The embedding component embeds a watermark pattern by subtly altering data samples of the media content. The alterations usually take the form of altered signal values, such as slightly changed pixel values, picture luminance, picture colors, changed 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. The watermark reading component analyzes content to detect whether a watermark pattern is present. In applications where the watermark encodes information, the reading component extracts this information from the detected watermark.
The watermark components may be located in different spatial or temporal locations in a host signal. In images, for example, different components may be located in different parts of the image. Each component may carry a different message or perform a different function.
The watermark components may be defined, embedded and extracted in different domains. Examples of domains include spatial and frequency domains. A watermark may be defined in a domain by specifying how it alters the host signal in that domain to effect the encoding of the watermark component. A frequency domain component alters the signal in the frequency domain, while a spatial domain component alters the signal in the spatial domain. Of course, such alterations may have an impact that extends across many transform domains.
In addition, components may be located in different spatial portions of the host signal, and may carry the same or different messages.
The host signal can vary as well. The host is typically some form of multi-dimensional media signal, such as an image? audio sequence or video sequence. In the digital domain, each of these media types is represented as a multi-dimensional array of discrete samples. For example, a color image has spatial dimensions (e.g., its horizontal and vertical components), and color space dimensions (e.g., YUV or RGB). Some signals, like video, have spatial and temporal dimensions. Depending on the needs of a particular application, the embedder may insert a watermark signal that exists in one or more of these dimensions.
While described here as watermark components, one can also construe the components to be different watermarks. This enables the watermark technology described throughout this document to be used in applications using two or more watermarks. For example, some copy protection applications of the watermark structure may use two or more watermarks, each performing similar or different functions. One mark may be more fragile than another, and thus, disappear when the combined signal is corrupted or transformed in some fashion. The presence or lack of a watermark or watermark component conveys information to the detector to initiate or prohibit some action, such as playback, copying or recording of the marked signal. Or portions of the various watermark components can be compared for authentication.
A watermark system may include an embedder, detector, and reader. The watermark embedder encodes a watermark signal in a host signal to create a combined signal. The detector looks for the watermark signal in a potentially corrupted version of the combined signal, and computes its orientation. Finally, a reader extracts a message in the watermark signal from the combined signal using the orientation to approximate the original state of the combined signal.
In the design of the watermark and its components, developers are faced with several design issues such as: the extent to which the mark is impervious to jamming and manipulation (either intentional or unintentional); the extent of imperceptibility; the quantity of information content; the extent to which the mark facilitates detection and recovery, and the extent to which the information content can be recovered accurately.
For certain applications, such as copy protection or authentication, the watermark is preferably difficult to tamper with or remove by those seeking to circumvent it. To be robust, a watermark preferably withstands routine manipulation, such as data compression, copying, linear transformation, flipping, inversion, etc., and intentional manipulation intended to remove the mark or make it undetectable. Some applications require the watermark signal to remain robust through digital to analog conversion (e.g., printing an image or playing music), and analog to digital conversion (e.g., scanning the image or digitally sampling the music). In some cases, it is beneficial for the watermarking technique to withstand repeated watermarking.
A variety of signal processing techniques may be applied to address some or all of these design considerations. One such technique is referred to as spreading. Sometimes categorized as a spread spectrum technique, spreading is a way to distribute a message into a number of components (chips), which together make up the entire message. Spreading makes the mark more impervious to jamming and manipulation, and makes it less perceptible.
Another category of signal processing technique is error correction and detection coding. Error correction coding is useful to reconstruct the message accurately from the watermark signal. Error detection coding enables the decoder to determine when the extracted message has an error.
Another signal processing technique that is useful in watermark coding is called scattering. Scattering is a method of distributing the message or its components among an array of locations in a particular transform domain, such as a spatial domain or a spatial frequency domain. Like spreading, scattering makes the watermark less perceptible and more impervious to manipulation.
Yet another signal processing technique is gain control. Gain control is used to adjust the intensity of the watermark signal. The intensity of the signal impacts a number of aspects of watermark coding, including its perceptibility to the ordinary observer, and the ability to detect the mark and accurately recover the message from it.
Gain control can impact the various functions and components of the watermark differently. Thus, in some cases, it is useful to control the gain while taking into account its impact on the message and orientation functions of the watermark or its components. For example, in a watermark system described below, the embedder calculates a different gain for orientation and message components of an image watermark.
Another useful tool in watermark embedding and reading is perceptual analysis. Perceptual analysis refers generally to techniques for evaluating signal properties based on the extent to which those properties are (or are likely to be) perceptible to humans (e.g., listeners or viewers of the media content). A watermark embedder can take advantage of a Human Visual System (HVS) model to determine where to place a watermark and how to control the intensity of the watermark so that chances of accurately recovering the watermark are enhanced, resistance to tampering is increased, and perceptibility of the watermark is reduced. Such perceptual analysis can play an integral role in gain control because it helps indicate how the gain can be adjusted relative to the impact on the perceptibility of the mark. Perceptual analysis can also play an integral role in locating the watermark in a host signal. For example, one might design the embedder to hide a watermark in portions of a host signal that are more likely to mask the mark from human perception.
Various forms of statistical analyses may be performed on a signal to identify places to locate the watermark, and to identify places where to extract the watermark. For example, a statistical analysis can identify portions of a host image that have noise-like properties that are likely to make recovery of the watermark signal difficult. Similarly, statistical analyses may be used to characterize the host signal to determine where to locate the watermark.
Each of the techniques may be used alone, in various combinations, and in combination with other signal processing techniques.
In addition to selecting the appropriate signal processing techniques, the developer is faced with other design considerations. One consideration is the nature and format of the media content. In the case of digital images, for example, the image data is typically represented as an array of image samples. Color images are represented as an array of color vectors in a color space, such as RGB or YUV. The watermark may be embedded in one or more of the color components of an image. In some implementations, the embedder may transform the input image into a target color space, and then proceed with the embedding process in that color space.
In most embodiments, a watermark payload is uniform across the medium. In some applications, however, it may be desirable to encode different payloads in different regions of a medium, or to convey different payloads through different digital watermarks or watermark components.
In other arrangements, the same watermark may be encoded in different places (e.g., on front and reverse sides of a document). A different embedded pattern can be used in different places to encode the same watermark payload.
The watermark can convey a payload of arbitrary length, commonly in the 2-256 bit range, and perhaps most commonly between 24 and 72 bits. Error correcting coding, such as convolutional coding or BCH coding, can be employed to transform a base payload (e.g., 52 bits) to a longer data string (e.g., 96-1024 bits), assuring robustness in detection notwithstanding some data corruption (e.g., due to wear and tear of the medium, artifacts from scanning, etc.). The bits of this longer string are mapped, e.g., pseudo-randomly, to define the pattern (e.g., checkerboard or tiled).
Several particular digital watermarking techniques have been developed. The reader is presumed to be familiar with the literature in this field. Some techniques for embedding and detecting imperceptible watermarks in media signals are detailed in the assignee's U.S. Pat. Nos. 6,122,403 and 6,614,914 and International Application No. PCT/US02/20832 (published as WO 03/005291), which are each herein incorporated by reference.
One aspect of the present invention is an age verification system and process. A document includes auxiliary information steganographically embedded therein. The auxiliary data is used to verify a document bearer's age and whether the bearer is an authorized bearer of the document. The auxiliary data may include or link to biometric information that is associated with an authorized bearer of the document. The data may further include or link to information corresponding to the document bearer's age.
Another aspect of the present invention is a shelf-life identification document. The self-life identification document provides an expiration indicator that becomes evident with use or time. In one implementation we provide a digital watermark through low adhesive inks. The ink degrades or rubs off with use. The watermark is lost as the ink degrades. In a related implementation, a digital watermark is provided on a document surface with relatively high-adhesive ink. The digital watermark is overprinted with a second, relatively low-adhesive ink. The second ink degrades or rubs off with time or use, thus revealing the digital watermark below. The absence or presence of a digital watermark on a shelf-life identification document provides an expiration trigger.
One aspect of the present invention relates to identifying different regions in image data. For example, the image data may correspond to a human subject (e.g., as expected with a passport or driver's license photograph). A face locator is used to identify an image region corresponding to a face or human silhouette. Once identified, the image data can be realigned to center the face or silhouette within a predetermined area or in a center of an image frame. A digital watermark can be embedded in the realigned image data. Or a first digital watermark component can be embedded in the face region or silhouette, while a second digital watermark component can be embedded in a background portion (e.g., an image portion which does not include the face region or silhouette). The first and second digital watermark components can be correlated for authentication.
Another aspect of the present invention relates to authenticating and identifying digital images. A digital image is captured, e.g., at a DMV location, depicting a human subject. A so-called reversible digital watermark is embedded in the digital image. The reversible digital watermark includes an identifier or other payload information. The embedded digital image is then distributed to a centralized identification document production facility. The digital watermark is removed from the digital image and the identifier is obtained. The identifier is used to access information associated with the human subject. The associated information can be embedded in the digital image prior to printing the digital image on an identification document. The digital watermark can also be used to authenticate the digital image, e.g., to verify an expected distribution source or image capture location.
This disclosure also provides methods and systems for reading differently hidden information from identification documents. In one implementation an identification document includes first information steganographically embedded in a photograph or background. A preferred form of steganography is digital watermarking. The first information is typically printed on identification document (e.g., on a substrate or laminate layer). The document further includes second information hidden on a document layer. For example, the second information is conveyed through surface topology of a laminate layer. An optical sensor reads the first information, while non-visible light scanner, e.g., a laser, reads the second information.
The foregoing and other features and advantages of the present invention will be even more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
Introduction
The following detailed description is grouped into four main sections. The grouping is not meant to limit the scope of the present invention, and is merely provided for the reader's convenience. Indeed, we anticipate that disclosed methods, systems and identification documents found under one section heading can be readily combined with methods, systems and identification documents under another section heading. The first section, “Digital Watermarking Implementations involving Age or Privacy,” teaches various methods and systems for age-based authentication of individuals or identification documents. Age-related information is communicated or accessed via a digital watermark. The second section, “Self-life Identification Document,” discloses identification documents including to a limited life span. A digital watermark can be used to evidence the expiration of an identification document. The third section, “Image Capture and Watermark Embedding Systems using Reversible Watermarking,” provides systems and methods for handling digital images captured, e.g., for use with identification documents. The fourth section, “Marking Multiple Layers of an Identification Document for Additional Security,” discloses identification documents including multiple, but differently marked, steganographic indicia. Other features and aspects are provided under the respective section headings.
Digital Watermarking Implementations involving Age or Privacy
In accordance with one implementation of the present invention, a document 10 includes plural-bit digital data steganographically encoded therein (e.g., by digital watermarking). The document 10 can be an identification document (e.g., a driver's license, student ID, passport, visa, voter registration cards or voter ballots, photo ID, government issued documentation, company card, employee badge, etc.), a value document (e.g., a banknote, stock certificate, check, or other financial instrument), a credit card, ATM card, a product manual, bank or credit account card, registration card, or virtually any other type of document or object. Although document 10 is illustrated as including a photograph, this aspect of present invention is not so limited.
The encoding of the document can encompass images, seals, logos, background patterns, tints, artwork or graphics (represented generally as the somewhat circular dashed line in
Voting System
One aspect of the present invention utilizes a digitally watermarked document 10 in an online (e.g., internet or other network) voting system. Registered voters receive a digitally watermarked ballot (or other watermarked document). The ballot preferably includes an embedded voting identifier that helps to facilitate access to a voting website or other network interface. In one embodiment, the identifier is used to link to an appropriate voting web site. For example, the identifier, once decoded from a watermark, is provided to a database to index a corresponding URL or IP address stored in a database. Further information regarding watermark-based linking is found, e.g., in assignee's U.S. patent application Ser. No. 09/571,422, filed May 15, 2000 (now U.S. Pat. No. 6,947,571), which is herein incorporated by reference. In another embodiment, a watermark identifier provides an additional security feature or verifies an ability to vote. For example, verifying an ability to vote may include identifying an eligible voter, verifying voter eligibility, identifying a registered voter, verifying residency or citizenship, anonymously identifying a voter, pointing to a voter identifier or account, etc. In a preferred voting embodiment, a voter must have physical possession of the watermarked ballot (or other voter document) to be able to vote. In this voting embodiment, the ballot is presented to a watermark reader, which extracts an embedded identifier, and passes the extracted identifier to a central or distributed voting server. The identifier can be compared against a list or range of valid identifiers.). Of course, a watermarked ballot can be used in combination with other security features, such as a password or PIN. In this case, a voter demonstrates both physical possession of a watermark ballot (or other document), and knowledge of a password or PIN.
Instead of using a watermarked ballot, another embodiment verifies voter identity through machine-sensing a digital watermarked driver's license, passport, and/or ID card. An embedded identifier in such a document is extracted and used to verify identity. For example, a voting system interfaces with a division of motor vehicles (DMV) database to match extracted identifiers with corresponding driver's license identifiers. (Of course, such information can otherwise be shared with a voting server.). Alternatively, a central database manages identifiers for both the DMV and voting system. Voter identity or eligibility can be verified as such.
Once voter identity is verified as discussed above, the actual voting selection is preferably designed to protect voter anonymity. Also, instead of voting, such systems and methods described above may be used to register voters.
In an alternative embodiment, a voter is presented with a voter ballot. The voter ballot includes a digital watermark embedded therein. The voter fills out the ballot and presents the filled-in ballot to a camera, such as a web camera connected to a personal computer. The web camera captures image data representing the filled-in ballot and communicates such to a watermark detector. The watermark detector analyzes the image data to detect and read the watermark. The detector verifies the authenticity of the voter ballot via the watermark. (In some cases the mere absence of an expected digital watermark signals a problem with the ballot. In other cases the watermark includes an identifier which is checked against a data repository of identifiers. If the identifier has been used before, the ballot is considered suspect. In still other cases, the ballot is cross-correlated with another document, like a driver's license, via a digital watermark in each document. The two watermarks must correspond in an anticipated manner for the ballot to be considered valid. In even further embodiments the watermark includes a so-called fragile component, which is designed to be lost or to predictably degrade with copying.). A character recognizer can read the voter's vote by analyzing the captured image data. The recognized vote can be electronically counted. For example, software executing on the personal computer can scan the image data looking for a “check” or other mark indicating a vote. (If the watermark includes a so-called orientation component, the image data can be registered according to the orientation component.). Presenting a watermarked ballot is voter-friendly, alleviating voter's fear to use a computer for voting, as well as providing a secure voting approach via the watermarked ballot. (As alluded to above, this and the other embodiments can identify ballot re-use/copying by saving ballot identification information, such as a document identifier, a voter's name, address, or DOB, etc., in a central database and verifying the watermarked ballot has not yet been used with each use.)
Using Digital Watermark Embedded in Driver's License to Verify Age
Watermarked driver's licenses (or other ID cards, including a passport) can be used to verify age and/or other personal information. To implement, a driver's license is embedded with an identifier. The identifier is used to link to additional information (e.g., age, birth date, address, citizenship, name, social security number, physical characteristics such as height, weight, hair and eye color, biometric and/or an image of the card holder, etc.) stored in a central or distributed database. Of course, a central server or a distributed server can maintain the database.
When image data corresponding to a watermarked driver's license is presented to a watermark reader, the reader extracts the identifier and conveys the identifier to the database. The database is interrogated with the identifier to find the additional information. The additional information, or a portion of the additional information, is passed back to the watermark reader or to a computer cooperating with the reader.
In one implementation a watermark reader, or an online server in communication with the reader, determines whether the watermark license holder is old enough to enter an online web site such as an adult-oriented web site. Another implementation is used by clubs, casinos, and/or alcohol-serving establishments to verify a license holder's age. A watermarked license can be used in connection with so-called fragile watermarks to even further enhance security and prevent tampering. A fragile watermark typically degrades or is lost upon copy and print processing, or when digitally reproduced and printed.
In another embodiment, instead of embedding a database-linked identifier in an ID card, a card is embedded with a different payload. In this embodiment, the payload itself conveys the age (and/or other information) of the cardholder. Typically, the payload may include from 2-256 bits of information, which can be used by a watermark reader to determine age, and other related information.
Thus, a birth date or age indicator can provide anonymous age verification, especially for online verification or age-dependant transactions. For example an online merchant can verify a person's age (e.g., as embedded in a digital watermark) without compromising the person's identity.
Privacy Watermarking
In a related implementation we steganographically embed characteristics associated with a cardholder's biometric features, e.g., fingerprint, facial recognition, DNA-print, etc., in an identification document 10 or other card. The characteristics may even include a hash of such biometric information. The term “hash” is broadly used in this document to include a reduced representation of a value, text or template. To verify that a person is not just, e.g., using their older sister's identification document for an online transaction, the cardholder must present her watermarked document, which includes an embedded age indicator and embedded biometric characteristic, as well as a fresh biometric sample (e.g., her fingerprint). If the biometric sample and the embedded sample match, and if the embedded age indicator is sufficient for the activity, the activity or transaction can proceed. Similar techniques can be used to verify age at a bar, casino, or for the purchase of age-limited goods or merchandise—all without compromising the person's identity. Steganographically embedding biometric information is discussed even further, e.g., in assignee's U.S. patent application Ser. No. 10/366,541 (now U.S. Pat. No. 6,804,378), which is a continuation of U.S. Patent No. 6,546,112, and in U.S. Provisional Patent Application No. 60/493,687, filed Aug. 7, 2003. Each of these patent documents is herein incorporated by reference.
To further illustrate, consider
The data repository 24 may also include an age indicator to help verify the user's age. (Thus, an age verification process may include a two-tiered process which involves comparing biometrics and looking at an age indicator.) For example, the age indicator can be cross-correlated with information (e.g., an age or birth date) carried in the watermark's auxiliary data. Most preferable is to protect the user's identity. For example, the biometric template is preferably not associated with the user's name, social security number or identity. Instead, the auxiliary data includes an identifier, which associates the object with the biometric template.
In a related implementation, the auxiliary data itself carries a control biometric. The control biometric is then compared with a sample biometric as provided by the user. The auxiliary data preferably includes an age identifier, which is used to regulate access to age-restricted activities (e.g., gambling, restricted movies, adult-content or establishments, driving privileges, alcohol, tobacco, voting, etc.).
A website or facility (e.g., bar or casino) has greater assurance that the cardholder is of an appropriate age when the cardholder's biometric sample matches the embedded biometric template and when an age indicator (e.g., as carried by watermark auxiliary data) indicates that the cardholder is a certain age (e.g., indicates that the cardholder is 21).
In a related implementation a biometric sampling device (e.g., fingerprint reader, retinal scanner, etc.) or a computer cooperating with the sampling device incorporates a timestamp with a biometric sample. This may help prevent an unauthorized user from trying to spoof the system by using a stored biometric sample that corresponds to the authorized bearer of object 10, instead of her own biometric sample. A comparison step may then use the timestamp to determine whether the biometric sample is fresh.
These ideas are naturally extended with a copy detect watermark to provide both age verification and security document authentication—both anonymously. (A copy detect watermark is one that indicates whether a detected watermark, or underlying media or document, is a copy. The copy detect watermark can be fragile or can include message bits to indicate the copy, etc.).
For identification document authentication, an embedded message in an identification document photograph (or graphic) is preferably compared to a hash of information printed or carried on the card. A complete hash of the information, e.g., a 64-bit payload, includes two hashes, such as a short hash and long hash. The long hash can be registered in a data repository as a cardholder's official registered identifier. The long hash carries or links to information which will identify the identification document or an authorized bearer of the identification document. Information associated with the person can be stored to be accessed with the full or long hash. The short hash is used to identify the identification document (or simply to identify a certain age or age level). For example, a 12-bit short hash has 4096 numbers—producing an extremely small likelihood of overlap. As such, a bar or casino can demonstrate that they checked everyone in the bar or casino through examination of the short hash, while protecting the anonymity of the patrons since the short hash cannot identify exactly who was in the bar or casino. This more private information can be obtained through the long hash and/or data repository. (A watermark detector reads a watermarked document. The short hash is examined to verify age. The short hash is then stored in a list or data repository to evidence that the identification document was checked to verify age.).
As an alternative to a short hash of information, the cardholder's birth date is used as a semi-unique ID. To provide even further uniqueness, we can add additional bits to the birth date, so the likelihood of overlap with another identification document (short hash) lessens.
In another implementation, an identification document includes a plural-bit watermark payload. The plural-bits include a representation a document bearer's date of birth (DOB). The payload includes a few extra, random bits and can be used to anonymously audit that the establishment, such as a bar or casino, checked the identification document. The random bit can be placed in a predetermined bit location. A bar or casino includes a watermark reader at the establishment's entrance. A patron presents her watermarked identification document including the plural bit payload (which includes, e.g., 2-8 random bits) to the watermark reader. The reader reads the watermark to obtain the DOB and the random bits, which are saved in list or data record. The random bits help distinguish two individuals that may have the same birth date. To audit the bar or casino, an auditor again reads the patron's watermarked identification document to obtain the DOB and random bits. The DOB and random bits are checked against the list or data record. A match evidences that the bar or casino checked the patron's age. A DOB is not unique to a person—since many people have the same DOB—so while a DOB likely shows that an identification document was checked, the DOB and random bits, alone, cannot be used to identify which individual was at the establishment—thus providing anonymous age verification.
Associating random bits with a date of birth (DOB) may also help thwart piracy when the plural-bit payload is encrypted. Since identical bits encrypt to identical, but different bits, adding a few random bits to a payload makes it harder for a pirate to create their own table linking payloads to some other meaningful information. In other words, without encryption a pirate can create a relational table between payloads and meaning, such as an issuing branch, operator ID, timestamp, client code, state office and encrypted forensic ID. Although the pirate's table will not match the real information, the table can still be valuable. For example, the pirate may be able to embed the correct encrypted state forensic ID, embedding location and time (optional) that a document identifier was created, with stolen watermark secrets even if they cannot decrypt the payload. But inserting random bits cause random encryption results —even for the same payload. After decryption, and since the random bits locations are known, the random bits are removed to provide a useful payload for the entity with the authorized decryption key. However, without the decryption key, the random bits provide pirates with random payloads. For example, two random bits provides four potential encrypted results (2^n where n is number of random bits, in general). In addition, a payload may include a few bits for error checking to guarantee that the correct decryption key is used.
Shelf-Life Identification Document
Another aspect of the present invention provides a so-called “shelf-life” digital watermark on an identification document. Of course, our inventive shelf-life watermark can alternatively be placed on another types of security documents, like passports, checks, banknotes, pass cards, etc., and other printed objects like stamps, labels and product packaging. The shelf-life digital watermark is steganographically embedded in the document with an ink or ink combination that degrades or simply rubs off with time or use. For example, the ink degrades over time or after being sufficiently handled or machine-processed. (Thus, the term “shelf-life” is a characteristic provided by the ink or dye, and not a watermark signal characteristic.).
Inks typically have at least two primary components: pigment and a binder (or adhesive). The amount or characteristics of the binder (hereafter interchangeably used with “adhesive”) will determine how readily the ink adheres or stays on a substrate. Most often, a goal is to ensure that the ink adequately adheres to a substrate. In this aspect of the invention, however, we desire that at least one ink includes a binder that has low adhesive qualities.
Consider our inventive implementations.
In a first implementation, we provide (or print) a digital watermark on an identification document with low-adhesive ink. The ink is designed such that it will rub off or degrade with use. One use is handling the card. The ink rubs off or degrades as a cardholder uses the card. Another use is machine-processing the card, e.g., through a chemical or aqueous solution and/or machine swipe (e.g., where a machine includes brushes or rollers that contact the low-adhesion ink, etc.). In other cases, the adhesion is designed to degrade with time—resulting in the ink loosing adhesion with the card. Regardless of which technique is used to constitute use, once the shelf-life ink is gone, the digital watermark is lost.
The absence of a digital watermark on a card triggers or evidences card expiration, a need to reissue a card, or to signal a predetermined length or number of uses, etc.
In a second implementation, we print an identification document with two or more inks. A first ink includes an relatively higher-adhesion adhesive. A digital watermark is embedded on the identification document using the relatively higher-adhesion adhesive. Second ink is printed or applied over the first ink. The second ink includes a relatively lower-adhesion adhesive. The second ink degrades or rubs off with use, which reveals the digital watermark embedded in the first ink below.
The detection of the digital watermark embedded with the first ink is used as a triggers or detection measure, to indicate or evidence expiration, the need for reissue, etc.
Image Capture and Watermark Embedding Systems using Reversible Watermarking
The following section relates to U.S. patent application Ser. Nos. 10/319,404 (published as US 2003-0149879 A1); U.S. patent application Ser. Nos. 10/319,380 (published as US 2003-0179900 A1); 10/435,517 (now U.S. Pat. No. 7,006,662); and U.S. application Ser. No.10/435,612 (published as US 2004-0044894 A1). Each of these patent documents is herein incorporated by reference.
Reversible Watermarking
Some of the above related patent applications teach high capacity digital watermarks that can be removed, restoring a watermarked content object (e.g., an image) to its original, pristine state. (See also Tian, “Wavelet-Based Reversible Watermarking for Authentication,” Proc. of SPIE, Vol. 4675, pp. 679-690, January, 2002; and Tian, “Reversible Watermarking by Difference Expansion,” Proc. Multimedia Security Workshop, Dec. 6, 2002.)
Other reversible watermarking techniques are also known, e.g., in U.S. Pat. Nos. 5,646,997 and 6,278,791, and in Fridrich et al, “Lossless Data Embedding for All Image Formats,” Proc. SPE, Vol. 4675, pp. 572-583, January, 2002; Dittmann et al, “Watermarking Protocols For Authentication And Ownership Protection Based On Timestamps And Holograms,” Proc. SPIE, Vol. 4675, pp. 240-251, Jan., 2002; Fridrich et al, “Invertible Authentication,” Proc. SPIE, Vol. 4314, pp. 197-208, January, 2001; Macq, “Lossless Multiresolution Transform For Image Authenticating Watermarking,” Proceedings of EUSIPCO, Sept. 2000; Vleeschouwer et al, “Circular Interpretation Of Histogram For Reversible Watermarking,” Proceedings of IEEE 4th Workshop on Multimedia Signal Processing, Oct. 2001; Kalker et al, “Capacity bounds And Constructions For Reversible Data Hiding,” Proceedings of the 14th International Conference on Digital Signal Processing, volume 1, pages 71-76, July 2002; and Celik et al, “Reversible Data Hiding,” Proceedings of International Conference on Image Processing, volume II, pages 157-160, Sept. 2002. Other reversible watermarking techniques will doubtlessly be developed in the future.
The ability to remove a digital watermark from an encoded image opens the possibility of various novel applications. Several such applications are detailed herein.
More on Identification Documents
Identification documents play a critical role in today's society. Identification documents are used on a daily basis—to prove identity, to verify age, to access a secure area, to evidence driving privileges, to cash a check, and so on. Airplane passengers are required to show an identification document during check in, security screening, and/or prior to boarding their flight. In addition, because we live in an ever-evolving cashless society, identification documents are used to make payments, access an ATM, debit an account, or make a payment, etc.
Many types of identification documents, such as driving licenses, national or government identification cards, passports, visas, bankcards, credit cards, controlled access cards and smart cards, carry thereon certain items of information which relate to the identity of the bearer. Examples of such information include name, address, birth date, signature, biometrics and photographic image; the documents may in addition carry other variant data (i.e., data specific to a particular card or document, for example an employee number) and invariant data (i.e., data common to a large number of cards, for example the name of an employer).
In the production of images useful in the field of identification documentation, it is oftentimes desirable to embody into an identification document data or indicia representative of a document issuer (e.g., an official seal, or the name or mark of a company or educational institution) and data or indicia representative of the document bearer (e.g., a photographic likeness, name or address). Typically, a pattern, logo or other distinctive marking representative of the document issuer serves as a means of verifying the authenticity, genuineness or valid issuance of the document. A photographic likeness or other data or indicia personal to the bearer will validate the right of access to certain facilities or the prior authorization to engage in commercial transactions and activities.
Manufacture of Identification Documents
Commercial systems for issuing ID documents are of two main types, namely so-called “central” issue (CI), and so-called “on-the-spot” or “over-the-counter” (OTC) issue.
CI type ID documents are not immediately provided to the bearer, but are later issued to the bearer from a central location. For example, in one type of CI environment, a bearer reports to a document station where data is collected, the data is forwarded to a central location where the card is produced, and the card is forwarded to the bearer, often by mail. Another illustrative example of a CI assembling process occurs in a setting where a driver passes a driving test, but then receives her license in the mail from a CI facility a short time later. Still another illustrative example of a CI assembling process occurs in a setting where a driver renews her license by mail or over the Internet, then receives a drivers license card through the mail. Centrally issued identification documents can be produced from digitally stored information and generally comprise an opaque core material (also referred to as “substrate”), such as paper or plastic, sandwiched between two layers of clear plastic laminate, such as polyester, to protect the aforementioned items of information from wear, exposure to the elements and tampering. The materials used in such CI identification documents can offer the ultimate in durability. In addition, centrally issued digital identification documents generally offer a higher level of security than OTC identification documents because they offer the ability to pre-print the core of the central issue document with security features such as “micro-printing,” ultra-violet security features, security indicia and other features currently unique to centrally issued identification documents. Another security advantage with centrally issued documents is that the security features and/or secured materials used to make those features are centrally located, reducing the chances of loss or theft (as compared to having secured materials dispersed over a wide number of “on the spot” locations).
In addition, a CI assembling process can be more of a bulk process facility, in which many cards are produced in a centralized facility, one after another. The CI facility may, for example, process thousands of cards in a continuous manner. Because the processing occurs in bulk, CI can have an increase in efficiency as compared to some OTC processes, especially those OTC processes that run intermittently. Thus, CI processes can sometimes have a lower cost per ID document, if a large volume of ID documents is manufactured.
In contrast to CI identification documents, OTC identification documents are issued immediately to a bearer who is present at a document-issuing station. An OTC assembling process provides an ID document “on-the-spot”. (An illustrative example of an OTC assembling process is a Department of Motor Vehicles (“DMV”) setting where a driver's license is issued to a person, on the spot, after a successful exam.). In some instances, the very nature of the OTC assembling process results in small, sometimes compact, printing and card assemblers for printing the ID document. OTC identification documents of the types mentioned above can take a number of forms, depending on cost and desired features. Some OTC ID documents comprise highly plasticized polyvinyl chloride (PVC), TESLIN, polycarbonate, or have a composite structure with polyester laminated to 0.5-2.0 mil (13-51 .mu.m) PVC film, which provides a suitable receiving layer for heat transferable dyes which form a photographic image, together with any variant or invariant data required for the identification of the bearer. These data are subsequently protected to varying degrees by clear, thin (0.125-0.250 mil, 3-6 .mu.m) overlay patches applied at the print head, holographic hot stamp foils (0.125-0.250 mil 3-6 .mu.m), or a clear polyester laminate (0.5-10 mil, 13-254 .mu.m) supporting common security features. These last two types of protective foil or laminate sometimes are applied at a laminating station separate from the print head. The choice of laminate dictates the degree of durability and security imparted to the system in protecting the image and other data.
Biometrics
Biometrics is a science that refers to technologies that can be used to measure and analyze physiological characteristics, such as eye retinas and irises, facial patterns, hand geometry, and fingerprints. Some biometrics technologies involve measurement and analysis of behavioral characteristics, such as voice patterns, signatures, and typing patterns. Because biometrics, especially physiological-based technologies, measures qualities that an individual usually cannot change, it can be especially effective for authentication and identification purposes.
Systems and methods are known that are capable of analyzing digital images and recognizing human faces. Extraction of facial feature information has been used for various applications such as in automated surveillance systems, monitoring systems, human interfaces to computers, systems that grant a person a privilege (e.g. a license to drive or a right to vote), systems that permit a person to conduct a financial transaction, television and video signal analysis. For example, commercial manufacturers, such as Identix Corp of Minnetonka, Minn. (which includes Visionics Corp.) manufacture biometric recognition systems that can be adapted to be capable of comparing two images, such as facial images or fingerprint images. The IDENTIX FACE IT product may be used to compare two facial images to determine whether the two images belong to the same person. Other commercial products are available that can compare two fingerprint images and determine whether the two images belong to the same person. For example, U.S. Pat. Nos. 6,072,894, 6,111,517, 6,185,316, 5,224,173, 5,450,504 and 5,991,429 further describe various types of biometrics systems, including facial recognition systems and fingerprint recognition systems, and these patents are hereby incorporated by reference in their entirety. Facial recognition has been deployed for applications such as surveillance and identity verification.
Some face recognition applications use a camera to capture one or more successive images of a subject, locate the subject's face in each image, and match the subject's face to a one or faces stored in a database of stored images. In some face recognition applications, the facial images in the database of stored images are stored as processed entities called templates. A template represents the preprocessing of an image (e.g., a facial image) to a predetermined machine-readable format. Encoding the image as a template helps enable automated comparison between images. For example, in a given application, a video camera can capture the image of a given subject, perform processing necessary to convert the image to a template, then compare the template of the given subject to one or more stored templates in a database, to determine if the template of the subject can be matched to one or more stored templates.
In surveillance, for example, a given facial recognition system may be used to capture multiple images of a subject, create one or more templates based on these captured images, and compare the templates to a relatively limited “watch list” (e.g., set of stored templates), to determine if the subject's template matches any of the stored templates. In surveillance systems, outside human intervention may be needed at the time of enrolling the initial image for storage in the database, to evaluate each subject's image as it is captured and to assist the image capture process. Outside human intervention also may be needed during surveillance if a “match” is found between the template of a subject being screened and one or more of the stored templates. In another example, some driver license systems include a large number of single images of individuals collected by so called “capture stations.” The capture stations include components that can capture an image of a person, and then, using circuitry, hardware, and/or software, process the image and then compare the image with stored images, if desired. When configured for face recognition applications, these identification systems can build template databases by processing each of the individual images collect at a capture station to provide a face recognition template thereby creating a template for every individual. A typical driver license system can include millions of images. The face recognition template databases are used to detect individuals attempting to obtain multiple licenses. Another application provides law enforcement agencies with an investigative tool. The recognition database can discover other identities of a known criminal or may help identify an unidentified decedent.
Identifying Image Regions for Watermark Embedding
With reference to
An operator or an automated process feeds information related to the subject or related to the subject's identification document to the watermark embedder. This information may include a birth date or age indicator, document number, name, physical characteristic, biometric, document-based feature or text, unique identifier, computer link, etc., or some combination of these. The information can be manually input or machine-sensed. The information can even be hashed (or reduced in bit size) and/or error corrected.
The face locator module passes processed image data to the watermark embedder. In some cases, the face locator module passes in a silhouette image; in other cases, the module passes in a centered or aligned image. In still other cases two versions of the same image are passed to the watermark embedder, one that will appear as a document portrait and another that will become a so-called “ghost” (or faintly visible) image which is also printed on the document. The watermark embedder embeds the inputted information, an encrypted version of the inputted information, or a hashed variant of the inputted information into the processed image data. The information can be redundantly embedded in the processed image data, or embedded in a select area, e.g., only in a silhouette, or in a region (e.g., face) of the silhouette. In some implementations, we embed a hash or other reduced-bit representation of the information in the image. In other implementations the watermark information is embedded in a centered or aligned image. In still other implementations, a mask is presented to determine an image location(s) that will carry the embedded data.
The watermark embedder optionally employs encryption to achieve an encrypted payload or message. The encryption can include a variety of techniques including PKI or private key encryption. For example, the inputted information is encrypted and then embedded in an image. In another implementation the embedding protocol is keyed or encrypted for security (e.g., an encrypted embedding channel). For example, the watermark embedder uses a unique key in its data hiding methodology. The watermark embedder can even, optionally, interface with a key management system. The key management system helps maintain and organize various keys for different watermark embedders or platforms. An embedder may even use different keys for different watermarks embedded in the same image or document. For example, a first watermark is embedded in an image with a first key and a second watermark is embedded in the image with a second key. Of course, a watermark embedding system can include both an encrypted payload and a keyed (or encrypted) embedding protocol. The embedder is preferably tunable, e.g., the embedding can be varied to best balance intensity, visibility, and robustness to accommodate a printer or printers used for printing the watermarked image. A resulting embedded watermark can either be robust or fragile, depending on the application. The embedded image is printed on an identification document. In some implementations, an embedded image is printed, along with a ghosted (perhaps embedded) version of the embedded image, on an identification document. (Sometimes a document enrollment process is geographically separate from a document printing. In these case watermark embedding can occur at the point of enrollment, or at the point of printing.)
In some implementations the embedder embeds two or more different digital watermarks into the image. (A watermark embedder may use a common or unique key for embedding each watermark.) For example, consider a situation where the face locator identifies multiple regions in an image. A first region corresponds to the subject's face, which may include a face, hair (if any), neck and torso, or a silhouette of the human subject. A second region corresponds to what is typically referred to as an image background. A first watermark is embedded in the face or silhouette region while a second digital watermark is embedded in the background region. The first and second digital watermarks may include redundant or corresponding information. For example, the first digital watermark may include a first portion of a document number, while the second digital watermark may include the second portion of the document number. Or the first digital watermark may include a key to decode or decrypt the second digital watermark. Still further, the first and second watermarks (or payloads carried by the watermarks) may be related through a cryptographic relationship. The cross-correlation of the first and second digital watermarks may help prevent photo swapping or counterfeiting, since a background is then tied to the silhouette.
A second or third digital watermark can be embedded elsewhere on the identification document, e.g., in a background image, ghost image, seal, graphic, text (e.g., though line shifting or varying fonts), patterns, etc. The digital watermarks can be cross-correlated to even further tie the image (and regions within the image) to the identification document.
In one implementation of this embodiment, master stock used as printing paper or as identification document substrate includes a digital watermark, barcode or other machine-readable identifier to uniquely serialize the document. This machine-readable identifier can be read, perhaps by showing the paper/substrate to a camera or scanner or by automatically processing the paper/substrate by a customized optical reader that is attached to a paper feed side of the printer. The embedded data in the substrate can be confirmed for authenticity and perhaps used in computing the information to be embedded in the image.
A few possible combinations are shown below. Of course, these combinations are not meant to limit the scope of this aspect of the invention. Rather, the combinations are provided by way of example only.
A1. A method of digital watermarking image data for use with an identification document, said method comprising: receiving image data corresponding to a human subject; analyzing the image data to identify at least a face region and a non-face region; embedding a first digital watermark in the face region, wherein the first digital watermark includes a first payload; embedding a second digital watermark in the non-face region, wherein the second digital watermark includes a second payload; wherein the first digital watermark payload and the second digital watermark payload include corresponding information; and providing the embedded image data for use with an identification document.
A2. A method of making an identification document comprising: receiving the image data embedded according to combination A1; and providing the embedded image data on an identification document surface.
A3. The method of combination A2, wherein the identification document includes artwork thereon, wherein the artwork comprises a third digital watermark.
A4. The method of claim A1, wherein the corresponding information comprises redundant information found in each of the first payload and the second payload.
A5. The method of claim Al, wherein the first and second payloads correspond through a cryptographic key.
A6. The method of claim 10, wherein the first and second payloads correspond through an embedding protocol.
Watermarking Digital Images for use with Identification Documents
When images are captured at one location (e.g., at a DMV location) and digitally distributed to a remote facility for printing on identification documents, as is common in so-called “central issue” systems, an embedded digital watermark can be used as an authentication measure for a digital image. The digital watermark preferably includes a payload or message. The watermark message can include, for example, a data element that identifies a camera station (or camera serial number) used for image capture or a camera location. This data element can be used or combined with other data to confirm that the digital image originated at an authorized or designated image capture site. Further, the embedded data can be of a type (e.g., a fragile or semi-fragile watermark) to help detect alteration of the image, to indicate if the image had been tampered with between image capture and image delivery, or to date stamp an image. The date stamp can be compared to an expected date as a further authentication tool. (In a related, but alternative embodiment, we carry an image signature in an image header. The image signature is obtained from the header and used to detect whether the image has been changed in transit. We note that a header signature is less secure than a digital watermark implementation, since a header can be separated from the digital image more readily than can a digital watermark.).
As an alternative implementation, we embed a so-called reversible watermark (e.g., a watermark that can be removed from an image without significant image degradation) during an image capture and/or watermark embedding process, e.g., at a DMV location. Several reversible watermarking techniques are disclosed above in the “Reversible Watermarking” sub-section of this patent document. The reversible watermark preferably includes an identifier to identify the image, the subject depicted in the image or information related to the image, subject or subject's identification document. The reversible watermark may also include an authentication component that is station or individual specific to help prevent forgeries.
With reference to
Further information can be maintained in the data repository. For example, the watermark identifier may be linked to a data record, which is updateable to reflect a distribution chain associated with a digital image. The data repository, perhaps accessible through a network, can be updated to reflect image capture times, operator identifiers, transmission channels, handling particulars, identification document printer number or printing time, etc.
Marking Multiple Layers of an Identification Document for Additional Security
In related U.S. patent application Ser. No. 09/938,870, filed Aug. 23, 2001 (published as US 2002-0099943 A1), which are each herein incorporated by reference, we disclose techniques for authentication.
An improvement is provided to help deter photo swapping in identification documents and to elevate the difficulty in forging identification documents. Generally, our techniques link two watermarking processes to ultimately strengthen the difficulty in scanning and reproducing a qualifying watermarked identification document.
With reference to
The watermarked laminate layer preferably includes the watermark information in pels or surface deviation on the card surface (e.g., the laminate layer). The gathering or texturing of a laminate layer creates peaks and valleys in the laminate layer surface when viewed from the side or z-axis (see
Alternatively, the second marking is laser engraved or etched into the surface of the laminate layer. Still further, a pattern is formed in the laminate layer through embossing or lithography. The pattern conveys a steganographic signal. The signal is decoded to reveal a message, which is cross-correlated with the first digital watermark signal.
Document authentication for this implementation requires a dual scanner (or multiple scanners). A person scanning the image must have a scanner that contains an imaging device (e.g., optical sensor) and a measuring device (surface topology reader). The optical (CCD, CMOS etc.) sensor will capture an image (or image data) of the watermarked photograph or document substrate, and the measuring device (e.g., laser or surface detection) interprets the surface topology of the laminate. The first and second watermark components can be respectively recovered from such data. Once recovered, the first and second watermarks are compared to authenticate the identification document.
One advantage of this implementation is that it is extremely hard to scan in an identification card document optically to obtain the first watermark, and then also analyze the laminate's topology to obtain the second watermark, without a second scanner.
A few possible combinations are shown below. Of course, these combinations are not meant to limit the scope of this aspect of the invention. Rather, the combinations are provided by way of example.
B1. A method of authenticating an identification document, the identification document comprising a substrate and a laminate covering at least a portion of the substrate, a first graphic carried by at least one of the substrate and the laminate, the first graphic conveying a recognizable image to human viewers thereof, the first graphic being steganographically encoded to secretly convey first plural bits of digital data recoverable by computer analysis of optical scan data representing at least some of the first graphic, wherein the laminate layer is steganographically encoded to secretly convey second plural bits of digital data through surface deviations in the laminate layer, and wherein the second plural bits of digital data are recoverable computer analysis of the surface deviations in the laminate layer, said method comprising: receiving optical scan data associated with the graphic and analyzing the optical scan data to recover the first plural bits; receiving digital data corresponding to the surface deviations and analyzing the digital data to recover the second plural bits; and cross-correlating the first plural bits and the second plural bits to authenticate the identification document.
B2. The method of combination B1, wherein the optical scan data comprise a result of visible light scanning of the identification document.
B3. The method of combination B2, wherein the digital data is obtained from a non-visible light optical sensor.
B4. The method of combination B3, wherein the sensor comprises a laser.
B5. The method of combination B4, wherein the laser determines relative height of the surface deviations.
B6. The method of combination B5, wherein the second plural bits are conveyed through the relative height of the surface deviations.
B7. The method of combination B1, wherein the first graphic is steganographically encoded with a first digital watermark.
B8. The method of combination B1, wherein cross-correlating of the first plural bits and the second plural bits to authenticate the identification document comprises comparing a sub-sets of the first plural bits and the second plural bits.
B9. The method of combination B1, further comprising visibly altering the identification document if said cross-correlation step reveals that the identification document is not authentic.
B10. The method of combination B9, wherein the identification document is visibly altered by at least one of physically marking the document, perforating the document, exposing ink on the document, providing ink on the document, providing a sticker on the document, exposing the document with polarized light, and applying pressure to the document.
C1. An identification document comprising: a substrate and a laminate covering at least a portion of the substrate; a first graphic carried by at least one of the substrate and the laminate, the first graphic conveying a recognizable image to human viewers thereof, the first graphic being steganographically encoded to secretly convey first plural bits of digital data recoverable by first computer analysis of optical scan data representing at least some of the first graphic; and wherein the laminate layer is steganographically encoded to secretly convey second plural bits of digital data through surface deviations in the laminate layer, wherein the second plural bits of digital data are recoverable second computer analysis of the surface deviations in the laminate layer, and wherein the first plural bits and the second plural bits cooperate to authenticate said identification document.
C2. The identification document of combination C1, wherein the surface deviations in the laminate layer are detectable through laser analysis of the laminate surface.
C3. The identification document of combination C1, wherein the first graphic comprises a photographic representation of an authorized bearer of the identification document.
C4. The identification document of combination C1, wherein the surface deviations comprise laser engraving.
C5. The identification document of combination C1, wherein the surface deviations comprise embossing.
C6. The identification document of combination C1, wherein the surface deviations comprises intentional texturing.
The foregoing are just exemplary implementations of the present invention. It will be recognized that there are a great number of variations on these basic themes. The foregoing illustrates but a few applications of the detailed technology. There are many others.
Consider, for example, the use of embedded watermark data in a document to allow access to a resource. A card may be used to grant physical access through a normally locked door. Or a card may be used to logon to a computer network—with directory privileges tied to the data decoded from the card.
In many embodiments, the data encoded in the card may serve as an index to a larger repository of associated data stored in a remote database. Thus, for example, an index datum read from a passport may allow a passport inspector to access a database record corresponding to the encoded data. This record may include a reference photograph of the passport holder, and other personal and issuance data. If the data obtained from the database does not match the text or photograph included on the card, then the card has apparently been altered.
Having described and illustrated the principles of the invention with reference to illustrative embodiments, it should be recognized that the invention is not so limited.
To provide a comprehensive disclosure without unduly lengthening this specification, applicants incorporate by reference, in their entireties, the disclosures of the above-cited patent documents. 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 application and the incorporated-by-reference patents/applications are also contemplated.
The above-described methods and functionality can be facilitated with computer executable software stored on computer readable mediums, such as electronic memory circuits, RAM, ROM, magnetic media, optical media, removable media, etc. Such software may be stored on a user terminal, and/or distributed throughout a network.
In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiments are illustrative only and should not be taken as limiting the scope of the invention. Rather, we claim as our invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.
The present application claims the benefit of U.S. Provisional Patent Application Nos. 60/418,762, filed Oct. 15, 2002 and 60/421,254, filed Oct. 25, 2002. The present application is also a continuation in part of U.S. patent application Ser. No. 10/275,197, filed Mar. 4, 2003 (published as US 2004-0128512 A1), which is the national stage of International Application No. PCT/US01/14014, filed Apr. 30, 2001 (published in English as WO 01/84438 A1). The present application is also a continuation in part of U.S. patent application Ser. No. 10/394,507, filed Mar. 21, 2003 (published as US 2004-0047490), which claims the benefit of U.S. Provisional Patent Application No. 60/367,033. The present application is also related to assignee's U.S. patent application Ser. No. 09/938,870, filed Aug. 23, 2001 (published as US 2002-0099943 A1), U.S. patent application Ser. No. 10/370,421, filed Feb. 19, 2003 (published as US 2004-0049401) and assignee's concurrently filed U.S. patent application Ser. No. 10/686,495 (published as US 2004-0181671 A1). Each of these patent documents is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4359633 | Bianco | Nov 1982 | A |
4536013 | Haghiri-Therani et al. | Aug 1985 | A |
4590366 | Rothfjell | May 1986 | A |
4675746 | Tetrick et al. | Jun 1987 | A |
4689477 | Goldman | Aug 1987 | A |
4728984 | Daniele | Mar 1988 | A |
4790566 | Boissier et al. | Dec 1988 | A |
4879747 | Leighton et al. | Nov 1989 | A |
4972476 | Nathans | Nov 1990 | A |
4993068 | Piosenka et al. | Feb 1991 | A |
4994831 | Marandi | Feb 1991 | A |
5113445 | Wang | May 1992 | A |
5237164 | Takada | Aug 1993 | A |
5284364 | Jain | Feb 1994 | A |
5319453 | Copriviza et al. | Jun 1994 | A |
5321751 | Ray et al. | Jun 1994 | A |
5337361 | Wang et al. | Aug 1994 | A |
5351302 | Leighton | Sep 1994 | A |
5374976 | Spannenburg | Dec 1994 | A |
5379345 | Greenberg | Jan 1995 | A |
5384846 | Berson | Jan 1995 | A |
5396559 | McGrew | Mar 1995 | A |
5436970 | Ray et al. | Jul 1995 | A |
5469506 | Berson | Nov 1995 | A |
5471533 | Wang et al. | Nov 1995 | A |
5490217 | Wang et al. | Feb 1996 | A |
5505494 | Belluci et al. | Apr 1996 | A |
5515451 | Tsuji et al. | May 1996 | A |
5528222 | Moskowitz et al. | Jun 1996 | A |
5613004 | Cooperman et al. | Mar 1997 | A |
5635012 | Belluci et al. | Jun 1997 | A |
5636292 | Rhoads | Jun 1997 | A |
5646997 | Barton | Jul 1997 | A |
5652626 | Kawakami et al. | Jul 1997 | A |
5659726 | Sandford, II et al. | Aug 1997 | A |
5694471 | Chen et al. | Dec 1997 | A |
5710834 | Rhoads | Jan 1998 | A |
5721583 | Harada et al. | Feb 1998 | A |
5721788 | Powell et al. | Feb 1998 | A |
5748763 | Rhoads | May 1998 | A |
5754675 | Valadier | May 1998 | A |
5760386 | Ward | Jun 1998 | A |
5767496 | Swartz | Jun 1998 | A |
5768426 | Rhoads | Jun 1998 | A |
5772250 | Gasper | Jun 1998 | A |
5786587 | Colgate, Jr. | Jul 1998 | A |
5787186 | Schroeder | Jul 1998 | A |
5790674 | Houvener et al. | Aug 1998 | A |
5799092 | Kristol et al. | Aug 1998 | A |
5822436 | Rhoads | Oct 1998 | A |
5832119 | Rhoads | Nov 1998 | A |
5841886 | Rhoads | Nov 1998 | A |
5841978 | Rhoads | Nov 1998 | A |
5862260 | Rhoads | Jan 1999 | A |
5864622 | Marcus | Jan 1999 | A |
5864623 | Messina et al. | Jan 1999 | A |
5901224 | Hecht | May 1999 | A |
5907149 | Marckini | May 1999 | A |
5912974 | Holloway et al. | Jun 1999 | A |
5982956 | Lahmi | Nov 1999 | A |
5984366 | Priddy | Nov 1999 | A |
6024287 | Takai et al. | Feb 2000 | A |
6084528 | Beach et al. | Jul 2000 | A |
6104812 | Koltai et al. | Aug 2000 | A |
6119932 | Maloney et al. | Sep 2000 | A |
6122403 | Rhoads | Sep 2000 | A |
6148091 | DiMaria | Nov 2000 | A |
6196460 | Shin | Mar 2001 | B1 |
6208746 | Musgrave | Mar 2001 | B1 |
6229924 | Rhoads et al. | May 2001 | B1 |
6243480 | Zhao et al. | Jun 2001 | B1 |
6246775 | Nakamura et al. | Jun 2001 | B1 |
6286761 | Wen | Sep 2001 | B1 |
6289108 | Rhoads | Sep 2001 | B1 |
6292092 | Chow et al. | Sep 2001 | B1 |
6307949 | Rhoads | Oct 2001 | B1 |
6311214 | Rhoads | Oct 2001 | B1 |
6321981 | Ray et al. | Nov 2001 | B1 |
6332031 | Rhoads et al. | Dec 2001 | B1 |
6332193 | Glass et al. | Dec 2001 | B1 |
6343138 | Rhoads | Jan 2002 | B1 |
6381341 | Rhoads | Apr 2002 | B1 |
6385329 | Sharma et al. | May 2002 | B1 |
6389151 | Carr et al. | May 2002 | B1 |
6408082 | Rhoads et al. | Jun 2002 | B1 |
6421070 | Ramos et al. | Jul 2002 | B1 |
6424249 | Houvener | Jul 2002 | B1 |
6424725 | Rhoads et al. | Jul 2002 | B1 |
6427020 | Rhoads | Jul 2002 | B1 |
6434561 | Durst, Jr. et al. | Aug 2002 | B1 |
6442284 | Gustafson et al. | Aug 2002 | B1 |
6463416 | Messina | Oct 2002 | B1 |
6487301 | Zhao | Nov 2002 | B1 |
6516079 | Rhoads et al. | Feb 2003 | B1 |
6522770 | Seder et al. | Feb 2003 | B1 |
6535617 | Hannigan et al. | Mar 2003 | B1 |
6542927 | Rhoads | Apr 2003 | B2 |
6542933 | Durst, Jr. et al. | Apr 2003 | B1 |
6546112 | Rhoads | Apr 2003 | B1 |
6553129 | Rhoads | Apr 2003 | B1 |
6567533 | Rhoads | May 2003 | B1 |
6580808 | Rhoads | Jun 2003 | B2 |
6590996 | Reed et al. | Jul 2003 | B1 |
6608911 | Lofgren et al. | Aug 2003 | B2 |
6611607 | Davis et al. | Aug 2003 | B1 |
6614914 | Rhoads et al. | Sep 2003 | B1 |
6636615 | Rhoads et al. | Oct 2003 | B1 |
6647128 | Rhoads | Nov 2003 | B1 |
6647130 | Rhoads | Nov 2003 | B2 |
6650761 | Rodriguez et al. | Nov 2003 | B1 |
6679425 | Sheppard et al. | Jan 2004 | B1 |
6681028 | Rhoads et al. | Jan 2004 | B2 |
6681029 | Rhoads | Jan 2004 | B1 |
6687345 | Swartz et al. | Feb 2004 | B1 |
6694042 | Seder et al. | Feb 2004 | B2 |
6694043 | Seder et al. | Feb 2004 | B2 |
6700990 | Rhoads | Mar 2004 | B1 |
6700995 | Reed | Mar 2004 | B2 |
6704869 | Rhoads et al. | Mar 2004 | B2 |
6709333 | Bradford et al. | Mar 2004 | B1 |
6711465 | Tomassi | Mar 2004 | B2 |
6718046 | Reed et al. | Apr 2004 | B2 |
6718047 | Rhoads | Apr 2004 | B2 |
6721440 | Reed et al. | Apr 2004 | B2 |
6728390 | Rhoads et al. | Apr 2004 | B2 |
6744906 | Rhoads et al. | Jun 2004 | B2 |
6748533 | Wu et al. | Jun 2004 | B1 |
6751336 | Zhao et al. | Jun 2004 | B2 |
6760463 | Rhoads | Jul 2004 | B2 |
6763123 | Reed et al. | Jul 2004 | B2 |
6768809 | Rhoads et al. | Jul 2004 | B2 |
6775392 | Rhoads | Aug 2004 | B1 |
6782116 | Zhao et al. | Aug 2004 | B1 |
6788800 | Carr et al. | Sep 2004 | B1 |
6798894 | Rhoads | Sep 2004 | B2 |
6804378 | Rhoads | Oct 2004 | B2 |
6813366 | Rhoads | Nov 2004 | B1 |
6823075 | Perry | Nov 2004 | B2 |
6843422 | Jones et al. | Jan 2005 | B2 |
6854642 | Metcalf et al. | Feb 2005 | B2 |
6879701 | Rhoads | Apr 2005 | B1 |
6883716 | DeJong | Apr 2005 | B1 |
6917724 | Seder et al. | Jul 2005 | B2 |
6920232 | Rhoads | Jul 2005 | B2 |
6922480 | Rhoads | Jul 2005 | B2 |
6923378 | Jones et al. | Aug 2005 | B2 |
6926203 | Sehr | Aug 2005 | B1 |
6944650 | Urien | Sep 2005 | B1 |
6947571 | Rhoads et al. | Sep 2005 | B1 |
6968346 | Hekmatpour | Nov 2005 | B2 |
6970573 | Carr et al. | Nov 2005 | B2 |
6975746 | Davis et al. | Dec 2005 | B2 |
6978036 | Alattar | Dec 2005 | B2 |
6988202 | Rhoads et al. | Jan 2006 | B1 |
6996252 | Reed et al. | Feb 2006 | B2 |
6999936 | Sehr | Feb 2006 | B2 |
7003669 | Monk | Feb 2006 | B2 |
7003731 | Rhoads et al. | Feb 2006 | B1 |
7016516 | Rhoads | Mar 2006 | B2 |
7024016 | Rhoads et al. | Apr 2006 | B2 |
7024563 | Shimosato et al. | Apr 2006 | B2 |
7027614 | Reed | Apr 2006 | B2 |
7035427 | Rhoads | Apr 2006 | B2 |
7043052 | Rhoads | May 2006 | B2 |
7044395 | Rhoads et al. | May 2006 | B1 |
7051086 | Rhoads et al. | May 2006 | B2 |
7054465 | Rhoads | May 2006 | B2 |
7062069 | Rhoads | Jun 2006 | B2 |
7095871 | Jones et al. | Aug 2006 | B2 |
7111168 | Lofgren et al. | Sep 2006 | B2 |
7111170 | Rhoads et al. | Sep 2006 | B2 |
7113596 | Rhoads | Sep 2006 | B2 |
7113614 | Rhoads | Sep 2006 | B2 |
7139408 | Rhoads et al. | Nov 2006 | B2 |
7152786 | Brundage et al. | Dec 2006 | B2 |
7158654 | Rhoads | Jan 2007 | B2 |
7159116 | Moskowitz | Jan 2007 | B2 |
7164780 | Brundage et al. | Jan 2007 | B2 |
7167844 | Leong et al. | Jan 2007 | B1 |
7171016 | Rhoads | Jan 2007 | B1 |
7171020 | Rhoads et al. | Jan 2007 | B2 |
7174031 | Rhoads et al. | Feb 2007 | B2 |
7177443 | Rhoads | Feb 2007 | B2 |
7181042 | Tian | Feb 2007 | B2 |
7191156 | Seder | Mar 2007 | B1 |
7213757 | Jones et al. | May 2007 | B2 |
7224819 | Levy et al. | May 2007 | B2 |
7248717 | Rhoads | Jul 2007 | B2 |
7261612 | Hannigan et al. | Aug 2007 | B1 |
7298864 | Jones | Nov 2007 | B2 |
7305104 | Carr et al. | Dec 2007 | B2 |
7308110 | Rhoads | Dec 2007 | B2 |
7313251 | Rhoads | Dec 2007 | B2 |
7319775 | Sharma et al. | Jan 2008 | B2 |
7330564 | Brundage et al. | Feb 2008 | B2 |
7369678 | Rhoads | May 2008 | B2 |
7377421 | Rhoads | May 2008 | B2 |
7391880 | Reed et al. | Jun 2008 | B2 |
7400743 | Rhoads et al. | Jul 2008 | B2 |
7406214 | Rhoads et al. | Jul 2008 | B2 |
7412072 | Sharma et al. | Aug 2008 | B2 |
7424131 | Alattar et al. | Sep 2008 | B2 |
7427030 | Jones et al. | Sep 2008 | B2 |
7433491 | Rhoads | Oct 2008 | B2 |
7444000 | Rhoads | Oct 2008 | B2 |
7444392 | Rhoads et al. | Oct 2008 | B2 |
7450734 | Rodriguez et al. | Nov 2008 | B2 |
7460726 | Levy et al. | Dec 2008 | B2 |
7466840 | Rhoads | Dec 2008 | B2 |
7486799 | Rhoads | Feb 2009 | B2 |
7499566 | Rhoads | Mar 2009 | B2 |
7502759 | Hannigan et al. | Mar 2009 | B2 |
7502937 | McKinley et al. | Mar 2009 | B2 |
7508955 | Carr et al. | Mar 2009 | B2 |
7515733 | Rhoads | Apr 2009 | B2 |
7536034 | Rhoads et al. | May 2009 | B2 |
7537170 | Reed et al. | May 2009 | B2 |
7545952 | Brundage et al. | Jun 2009 | B2 |
7564992 | Rhoads | Jul 2009 | B2 |
7570784 | Alattar | Aug 2009 | B2 |
RE40919 | Rhoads | Sep 2009 | E |
7602978 | Levy et al. | Oct 2009 | B2 |
7628320 | Rhoads | Dec 2009 | B2 |
7630986 | Herz et al. | Dec 2009 | B1 |
7639837 | Carr et al. | Dec 2009 | B2 |
7643649 | Davis et al. | Jan 2010 | B2 |
7650009 | Rhoads | Jan 2010 | B2 |
7653210 | Rhoads | Jan 2010 | B2 |
7657058 | Sharma | Feb 2010 | B2 |
7685426 | Ramos et al. | Mar 2010 | B2 |
7693300 | Reed et al. | Apr 2010 | B2 |
7697719 | Rhoads | Apr 2010 | B2 |
7711143 | Rhoads | May 2010 | B2 |
7724920 | Rhoads | May 2010 | B2 |
7738673 | Reed | Jun 2010 | B2 |
7747038 | Rhoads | Jun 2010 | B2 |
7751588 | Rhoads | Jul 2010 | B2 |
7751596 | Rhoads | Jul 2010 | B2 |
7756290 | Rhoads | Jul 2010 | B2 |
7760905 | Rhoads et al. | Jul 2010 | B2 |
7762468 | Reed et al. | Jul 2010 | B2 |
7787653 | Rhoads | Aug 2010 | B2 |
7792325 | Rhoads et al. | Sep 2010 | B2 |
7822225 | Alattar | Oct 2010 | B2 |
7837094 | Rhoads | Nov 2010 | B2 |
20010025342 | Uchida | Sep 2001 | A1 |
20010034705 | Rhoads et al. | Oct 2001 | A1 |
20010055407 | Rhoads | Dec 2001 | A1 |
20020009208 | Alattar et al. | Jan 2002 | A1 |
20020116508 | Khan et al. | Aug 2002 | A1 |
20020131076 | Davis | Sep 2002 | A1 |
20020141584 | Razdan et al. | Oct 2002 | A1 |
20020150277 | Nishimoto et al. | Oct 2002 | A1 |
20020168082 | Razdan | Nov 2002 | A1 |
20020176003 | Seder et al. | Nov 2002 | A1 |
20020186886 | Rhoads | Dec 2002 | A1 |
20020196272 | Ramos et al. | Dec 2002 | A1 |
20030002710 | Rhoads | Jan 2003 | A1 |
20030026453 | Bradley et al. | Feb 2003 | A1 |
20030040957 | Rhoads et al. | Feb 2003 | A1 |
20030105730 | Davis et al. | Jun 2003 | A1 |
20030130954 | Carr et al. | Jul 2003 | A1 |
20040005093 | Rhoads | Jan 2004 | A1 |
20040064415 | Abdallah et al. | Apr 2004 | A1 |
20040190750 | Rodriguez et al. | Sep 2004 | A1 |
20040240704 | Reed | Dec 2004 | A1 |
20040264733 | Rhoads et al. | Dec 2004 | A1 |
20050041835 | Reed et al. | Feb 2005 | A1 |
20050058318 | Rhoads | Mar 2005 | A1 |
20050063562 | Brunk et al. | Mar 2005 | A1 |
20050171851 | Applebaum et al. | Aug 2005 | A1 |
20050192933 | Rhoads et al. | Sep 2005 | A1 |
20050271246 | Sharma et al. | Dec 2005 | A1 |
20060013435 | Rhoads | Jan 2006 | A1 |
20060041591 | Rhoads | Feb 2006 | A1 |
20060115108 | Rodriguez | Jun 2006 | A1 |
20060251291 | Rhoads | Nov 2006 | A1 |
20070027818 | Lofgren et al. | Feb 2007 | A1 |
20070055884 | Rhoads | Mar 2007 | A1 |
20070108287 | Davis et al. | May 2007 | A1 |
20070154064 | Rhoads et al. | Jul 2007 | A1 |
20070276841 | Rhoads et al. | Nov 2007 | A1 |
20070276928 | Rhoads et al. | Nov 2007 | A1 |
20080082618 | Jones | Apr 2008 | A1 |
20080121728 | Rodriguez | May 2008 | A1 |
20080133555 | Rhoads et al. | Jun 2008 | A1 |
20080215636 | Lofgren et al. | Sep 2008 | A1 |
20080292134 | Sharma et al. | Nov 2008 | A1 |
20090012944 | Rodriguez et al. | Jan 2009 | A1 |
20090116687 | Rhoads et al. | May 2009 | A1 |
20090125475 | Rhoads et al. | May 2009 | A1 |
20090129627 | Levy et al. | May 2009 | A1 |
20090232352 | Carr et al. | Sep 2009 | A1 |
20090286572 | Rhoads et al. | Nov 2009 | A1 |
20090290754 | Rhoads | Nov 2009 | A1 |
20100009714 | Sharma et al. | Jan 2010 | A1 |
20100027837 | Levy et al. | Feb 2010 | A1 |
20100045816 | Rhoads | Feb 2010 | A1 |
20100054529 | Rhoads | Mar 2010 | A1 |
20100062819 | Hannigan et al. | Mar 2010 | A1 |
20100094639 | Rhoads | Apr 2010 | A1 |
20100142749 | Ellingson et al. | Jun 2010 | A1 |
20100172540 | Davis et al. | Jul 2010 | A1 |
20100198941 | Rhoads | Aug 2010 | A1 |
20100296526 | Rhoads | Nov 2010 | A1 |
20110007936 | Rhoads | Jan 2011 | A1 |
Number | Date | Country |
---|---|---|
29 43 436 | May 1981 | DE |
0 629 972 | Dec 1994 | EP |
0 642 060 | Mar 1995 | EP |
0 736 860 | Oct 1996 | EP |
03-185585 | Aug 1991 | JP |
WO 9513597 | May 1995 | WO |
WO 9603286 | Feb 1996 | WO |
WO 0036605 | Jun 2000 | WO |
WO 0143080 | Jun 2001 | WO |
Entry |
---|
U.S. Appl. No. 08/635,531, filed Apr. 25, 1996, Geoffrey B. Rhoads. |
U.S. Appl. No. 09/413,117, filed Oct. 6, 1999, Geoffrey B. Rhoads. |
U.S. Appl. No. 09/507,096, filed Feb. 17, 2000, Geoffrey B. Rhoads et al. |
U.S. Appl. No. 12/912,461, filed Oct. 26, 2010, Adnan M. Alattar. |
U.S. Appl. No. 09/482,749, filed Jan. 13, 2000, Geoffrey B. Rhoads. |
U.S. Appl. No. 09/234,780, filed Jan. 20, 1999, Geoffrey B. Rhoads. |
U.S. Appl. No. 09/343,104, filed Jun. 29, 1999, Tony F. Rodriguez et al. |
U.S. Appl. No. 09/697,009, filed Oct. 25, 2000, Bruce L. Davis et al. |
U.S. Appl. No. 09/967,015, filed Oct. 25, 2000, Bruce L. Davis. |
U.S. Appl. No. 09/633,587, filed Aug. 7, 2000, Geoffrey B. Rhoads et al. |
U.S. Appl. No. 09/567,405, filed May 8, 2000, Geoffrey B. Rhoads et al. |
U.S. Appl. No. 09/689,289, filed Oct. 11, 2000, Geoffrey B. Rhoads et al. |
U.S. Appl. No. 09/629,649, filed Aug. 1, 2000, J. Scott Carr et al. |
U.S. Appl. No. 09/552,998, filed Apr. 19, 2000, Tony F. Rodriguez et al. |
U.S. Appl. No. 09/343,101, filed Jun. 29, 1999, Bruce L. Davis et al. |
U.S. Appl. No. 12/953,190, filed Nov. 23, 2010, Geoffrey B. Rhoads. |
U.S. Appl. No. 09/538,493, filed Mar. 30, 2000, Geoffrey B. Rhoads. |
U.S. Appl. No. 10/137,124, filed May 1, 2002, Brett A. Bradley et al. |
“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, 27 pages. |
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. |
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. |
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. |
Lin, C.-Y. et al., “Generating Robust Digital Signature for Image/Video Authentication,” Proc. Multimedia and Security Workshop at ACM Multimedia'98, Sep. 1998, pp. 49-54. |
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. |
Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proceedings 1979 Carnahan Conference on Crime Countermeasures, May 16, 1979, pp. 101-109. |
Number | Date | Country | |
---|---|---|---|
20040158724 A1 | Aug 2004 | US |
Number | Date | Country | |
---|---|---|---|
60418762 | Oct 2002 | US | |
60421254 | Oct 2002 | US | |
60367033 | Mar 2002 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10275197 | US | |
Child | 10686547 | US | |
Parent | 10686547 | US | |
Child | 10686547 | US | |
Parent | 10394507 | Mar 2003 | US |
Child | 10686547 | US |