The present invention relates to digital watermarking and integrating digital watermarking methods with information carriers (e.g., credit cards, smart cards, RFID cards, mag-stripe cards, etc.).
Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media. The media 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 signals such as images, audio signals, and video signals. However, it may also be applied to other types of media objects, including documents (e.g., through line, word or character shifting), software, multi-dimensional graphics models, and surface textures of objects.
Digital watermarking systems typically have two primary components: an encoder that embeds the watermark in a host media signal, and a decoder that detects and reads the embedded watermark from a signal suspected of containing a watermark (a suspect signal). The encoder embeds a watermark by altering the host media signal. The reading component analyzes a suspect signal to detect whether a watermark is present. In applications where the watermark encodes information, the reader extracts this information from the detected watermark.
Several particular watermarking techniques have been developed. The reader is presumed to be familiar with the literature in this field. Particular techniques for embedding and detecting imperceptible watermarks in media signals are detailed in the assignee's application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914) and U.S. Pat. No. 5,862,260.
Digital watermarks can be exploited in a variety of applications, including authenticating electronic and physical objects and counterfeit deterrence. They may also be used in conjunction with other security technologies.
Optically Variable Devices (OVDs) are another type of technology used in security applications. OVD is a class of devices that includes Diffractive Optically Variable Image Devices (DOVIDs), such as holograms. Within the field of holography, there a variety of types of DOVIDs including, for example, Exelgram™, Kinegram™, and Pixelgram™ DOVIDs. This document uses the term hologram to generally encompass diffractive devices, including DOVIDs manufactured on metallized or clear film, by the replication of a surface relief pattern (e.g., embossed hologram), through laser exposure (e.g., photopolymer holograms), or other known processes. The state of the art of manufacturing holograms offers several methods for creating a diffraction pattern and mass reproduction of them.
The photoresist is developed to create a surface relief pattern of the diffraction grating (102). Next, a highly reflective, opaque layer is applied to the surface relief pattern to create a reflective hologram. An image can then be reconstructed and viewed by reflecting light from an ordinary light source. A first order diffracted beam reconstructs the image.
The hologram may be used to create a second hologram. For example, a first hologram is illuminated with coherent light from a laser to reconstruct an image of the original model. A photoresist plate is placed at the location of the reconstructed image. In order to form a new hologram, a beam splitter is positioned in the laser output beam in order to direct a portion of its intensity directly onto the photoresist plate for interference at a finite angle with a first order diffracted beam that is diffracted from the first hologram.
In the process of creating a hologram, several exposures, each with different masks and grating parameters, may be used. For each exposure, the mask controls the portions of the photoresist plate to be exposed. Computer driven machinery may be used to create discrete grating dots or pixels at resolutions of 50 to 2000 dots per inch (dpi). These types of diffraction gratings are sometimes referred to as dot matrix OVDs.
To mass produce the hologram, a metal master of the surface relief pattern is created from the developed photoresist (104). One way to do this is to use a metal electroforming process to apply a metal layer on the developed photoresist plate. The resulting metal layer becomes a surface relief master used to replicate the surface relief pattern (106).
There are a number of ways to reproduce the hologram using the surface relief master. One way utilizes an embossing technique where the metal surface relief master is urged against thin, smooth, clear plastic film under an appropriate amount of pressure and heat in order to form a replica of that surface relief pattern. A second way utilizes a casting technique, where the surface relief metal master is used as a mold to which a clear liquid resin is applied and cured between an optically clear flexible plastic substrate and the master mold. A continuous casting process is used where the master hologram is fitted on the outside of a drum over which the substrate passes, and the resin is cured by passing ultraviolet light through the substrate while in contact with the master.
After reproducing the surface relief pattern on a film, a highly reflective, opaque layer is formed on the surface relief pattern. One way to do this is to evaporate aluminum onto the surface relief pattern formed on the film.
There are a number of alternative ways to create holograms. Another type of hologram is a Denisyuk hologram. Denisyuk holograms are recorded on silver halide film, photopolymer film or dichromated gelatin film. The resulting hologram is laminated into a card or applied to product as a tag or label.
Diffraction gratings can be creating without using light interference, but instead, using microlithography engraving technologies. This class of diffraction gratings may be classified as “non-optically recorded diffraction gratings.” Microlithography based OVD recording technologies, like electron-ion lithography, are used to form diffraction gratings with desired optical properties. Examples of such gratings include binary, blazed, curvilinear, and subwavelength (less than the wavelength of visible light) gratings.
Rather than using physical models, light sources and optical elements, diffractive structures may also be generated by computer (Computer Generated Holograms—“CGH”). For a CGH, a computer makes wavefront calculations to compute the hologram's surface profile or transmission characteristics. To create a master, the resulting holographic structure may be recorded optically by projecting a map of the computer generated holographic structure onto a photosensitive material, or using microlithography such as e-beam lithography to record the holographic structure on a surface of a master. A variety of computer implemented methods, such as Fourier Transform iterative algorithms, are described in published literature relating to computer generated holograms. See P. Stepien, Computer Generated Holograms and Diffraction Gratings in Optical Security Applications In Optical Security and Counterfeit Deterrence Techniques III, Rudolf L. van Renesse, Willem A. Vliegenthart, Editors, Proceedings of SPIE Vol. 3937 (2000).
The invention provides methods for integrating digital watermarks into holograms, watermarked hologram structures, and related applications. One aspect of the invention is a method of embedding a digital watermark in an optically variable device. This method creates a watermark image, and then embeds the watermark image into a holographic structure. Such a watermarked holographic structure can be used in connection with an information carrier, such as a smart card, credit card, integrated circuit card, RFID card, magnetic-stripe card, etc. The digital watermark caries information to assist in authenticating the card, the holograph and/or the card holder.
Another aspect of the invention is a method for integrating a digital watermark into a hologram. This method creates a halftone watermarked image, and forms the halftone watermarked image in the hologram by creating hologram dots corresponding to the dots in the halftone watermarked image.
Another aspect of the invention is a watermark reader operable to decode a watermark from a watermarked hologram. The decoder comprises a watermark decoder and message decoder. The watermark decoder detects a watermark signal in an image scanned from a watermarked hologram. The message decoder extracts a message from the watermark signal.
Further features will become apparent with reference to the following detailed description and accompanying drawings.
This document provides a number of ways to integrate digital watermarks into OVDs, such as holograms. First, the following description provides a description of digital watermark embedding and reading operations. Next, it describes methods for integrating watermarks into OVDs. Finally, it describes applications of watermarked holograms.
Watermark Embedding and Reading Operations
There are a variety of known methods for embedding digital watermarks into images and reading the watermark from a watermarked signal. This section describes examples of digital image watermark methods suitable for integrating with OVDs.
In the following digital watermark method, an embedder modulates a carrier signal with a message comprising one or more binary or M-ary symbols to create a watermark signal. The embedder then embeds the watermark signal into the host image by modulating characteristics of the host such that they carry the watermark signal. The host image may be a multi-level per pixel image representation such as an array of N-bit luminance values (or multilevel color vector per pixel), or a halftone image where each element has a binary value of on or off.
One way to embed the watermark signal into a multilevel per pixel image is to add it to spatial or transform domain samples of the host signal.
Similarly, the watermark signal may be embedded in a halftone image with the following variation. First, a multilevel per pixel watermark signal is created at the resolution of a target halftone image. The watermark embedder produces a multilevel per pixel watermark signal at the desired resolution of the halftone image, or at some other resolution and up or down samples it to match the resolution of a target halftone image. This watermark signal is then added to the host image at the same spatial resolution to create a composite, watermarked image. An error diffusion process or some other type of halftone process may then be applied directly to this composite image to generate a watermarked halftone image. This technique applies to a variety of halftone processes including ordered dithering (e.g., blue noise masks, clustered dot halftones, etc.) as well as error diffusion halftone processes.
There are a variety of ways to generate the watermark signal. One approach takes an auxiliary message comprising binary or M-ary symbols, applies error correction coding to it, and then spread spectrum modulates the error correction encoded message. One way to spread spectrum modulate the message is to spread each binary symbol in the message over a pseudorandom number, using an exclusive OR operation or multiplication operation. The resulting binary message elements in the spread spectrum modulated message signal are then mapped to spatial image locations. The watermark signal may be expressed in a binary antipodal form, where binary symbols are either positive or negative. To increase robustness, the spread spectrum modulated message signal may be repeated throughout the host image, by for example, embedding the message signal in several blocks of the host image. In particular, the watermark encoder may embed instances of the watermark signal into contiguous blocks of pixels throughout a portion of the host image or throughout the entire host image.
Perceptual modeling may be applied to the host image to calculate a gain vector with gain values that correspond to the message signal elements. For example, in the case where the upsampled watermarked signal is added to the host signal, the gain values may be used to scale binary antipodal values of the message signal before adding them to the host signal. Each gain value may be a function of desired watermark visibility and detectability constraints. In particular, the perceptual model analyzes the image to determine the extent to which it can hide a corresponding element of the watermark image. One type of an analysis is to compute local contrast in a neighborhood around each pixel (e.g., signal activity) and select gain for a pixel or group of neighboring pixels as a function of local contrast. A detectability model analyzes the host signal to determine the extent to which pixel values are biased toward the value of the watermark signal at the corresponding pixel locations. It then adjusts the gain up or down depending on the extent to which the host image pixels are biased towards the watermark signal.
This type of watermark may be read from the watermarked halftone image (e.g., binary bit map) or other image representations of that watermarked image, such as a multilevel per pixel representation of the image at a resolution sufficiently high to represent the watermark signal. To decode the watermark, a watermark decoder detects the presence and orientation of the watermark in the watermarked image. It then performs an inverse of the embedding function to extract an estimate watermark message signal.
The message signal is robustly encoded using a combination of the following processes:
The watermark decoder reconstructs an embedded message from the estimated watermark signal by:
In one implementation, the decoder uses an orientation signal component of the watermark to detect its presence and orientation in the watermarked image. It then performs a predictive filtering on the image sample values to estimate the original un-watermarked signal, and subtracts the estimate of the original from the watermarked signal to produce an estimate of the watermark signal. It performs spread spectrum demodulation and error correction decoding to reconstruct an auxiliary message embedded in the watermarked signal.
For more details about embedding an image watermark, and detecting and reading the watermark from a digitized version of the image after printing and scanning see assignee's application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914) and U.S. Pat. No. 5,862,260, which are mentioned above. In order to make the watermark robust to geometric distortion, the watermark includes an orientation watermark signal component. Together, the watermark message signal and the orientation watermark signal from the watermark signal. Both of these components may be added to a host image at the resolution of the halftone image before the host image is converted to a halftone image. Alternatively, these components may be combined to form the watermark signal used in modulating the error diffusion threshold used in an error diffusion type halftone process.
One type of watermark orientation signal is an image signal that comprises a set of impulse functions in the Fourier magnitude domain, each with pseudorandom phase. To detect rotation and scale of the watermarked image (e.g., after printing and scanning of the watermarked image), the watermark decoder converts the image to the Fourier magnitude domain and then performs a log polar resampling of the Fourier magnitude image. A generalized matched filter correlates the known orientation signal with the re-sampled watermarked signal to find the rotation and scale parameters providing the highest correlation. The watermark decoder performs additional correlation operations between the phase information of the known orientation signal and the watermarked signal to determine translation parameters, which identify the origin of the watermark message signal. Having determined the rotation, scale and translation of the watermark signal, the reader then adjusts the image data to compensate for this distortion, and extracts the watermark message signal as described above.
The image watermarks described above may be used in combination with one or more other watermarks. In one application, for example, a robust watermark is used to carry a key that specifies the dot locations of a halftone watermark. In particular, the robust watermark's message payload carries a key that identifies specific dots (the high-resolution binary values) that were turned on or off in a specific pattern. These binary valued bits act as a secondary fragile watermark that can be verified by close inspection of the image. In particular, to authenticate the watermarked object, the user scans the object with a high resolution scanner capable of discerning the halftone dots and then uses the watermark decoding software described above to decode the robust watermark payload specifying the locations of the fragile watermark dots. The software then checks the high resolution scan for the presence of the dots in the fragile watermark.
Using the techniques described in this document, the implementer may embed robust, fragile or combinations of robust and fragile watermarks in holograms. A robust watermark is a watermark designed to be readable despite transformations to the signal that carries the watermark. A fragile watermark is one in which the watermark signal degrades or becomes unreadable as a result of transformations to the signal carrying the watermark. In applications involving watermarked holograms, these transformations may include operations involved in reproducing the hologram, e.g., attempting to reproduce a surface relief pattern. The degradation of a fragile watermark can be measured by determining the decrease in the signal energy of the detected watermark relative to a threshold.
As noted, some applications can advantageously use both robust and fragile watermarks. The robust watermark persistently carries machine readable information such as a digital message conveying information or a machine instruction relating to the object on which the watermarked hologram resides, or an index to a database entry carrying such information or instructions. It may also include information about the fragile watermark, such as a decoding key indicating how to detect and read the fragile watermark. The presence or absence of the fragile watermark indicates tampering with a hologram. In addition, the fragile watermark may include a digital message.
Integrating Watermarks into OVDs
In this section, we describe methods for integrating watermarks into holograms.
The process begins by creating a 2D or 3D digital image model that carries the watermark signal (120). This model is a digital representation comprising an array of discrete samples (e.g., the robust watermark pixels) corresponding to spatial locations in a two-dimensional plane, for a 2D image, or a three dimensional space, for a 3D image. First, a watermark embedder generates the watermark signal by spread spectrum modulating a binary message. The embedder maps the elements in the resulting array of values to spatial locations within the model. For 2D image models, it maps the elements of the watermark signal to samples in a 2D block of the 2D image model. For 3D image models, it maps the elements of the watermark signal to the surface of an object represented in the 3D model. It then modulates the sample values of the model at those locations according to the corresponding values in the watermark signal. There are a number of alternative ways to modulate the sample values of the model. The following paragraphs detail some examples.
In the case of a binary image where the sample values are one of two states, the embedder modulates the values using the halftone embedding process described above. In the case of multi-valued image (e.g., 8 to 32 bits per pixel), the embedder modulates the values by increasing corresponding sample values to encode a 1 and decreasing corresponding sample values to encode a zero. Each element of the watermark signal may modify a single sample or group of neighboring samples at a corresponding location in the model.
In the case of a three dimensional image representing the surface of an object, another approach is to modulate the geometric structure of the object's surface. In particular, the embedder creates a peak in the surface to encode a one from the watermark signal, and creates a trough in the surface to encode a zero. The surface modulation may be in the form of a binary anti-podal watermark signal, where binary elements increase or decrease the surface positions by a fixed amount. Each binary element of the watermark signal may be mapped to a smoothly varying peak or trough that modulates the position of a group of neighboring surface elements. Each of these peaks and troughs in the resulting holographic structure create discrete positive or negative fluctuations in light intensity when the holographic structure is illuminated and imaged at a particular orientation and focal plane. As such, the embedder modulates selected surface elements of the model such that the variations in light intensity created by the peaks and troughs are discernable at the particular orientation and focal plane.
Next, a holographic structure generator makes wavefront calculations to convert the model into a holographic structure (e.g., a kinoform). In particular, an iterative Fourier transform wavefront calculator converts the model into a holographic structure (122). For more information about such methods, see P. Stepień, R. Gajda and T. Szoplik, “Distributed kinoforms in optical security applications,” Opt. Eng. 35, pp. 2453-2458, (1996); and P. Stepień, and R. Gajda, “Pure-phase iteratively generated Fourier hologram as a security mark,” SPIE Proc. 2659, 223-228 (1996).
The process then records the holographic structure on a physical medium. As shown in
The process creates a master by, for example, using electroforming to reproduce the surface relief pattern on a metal master (126).
The process illustrated in
The process of recording the holographic structure on a physical medium (148), creating a master, and reproducing the hologram using the master (150) are the same as described for
While the processes of
Alternatively, the implementer may optically merge an optical projection of a watermark image on the photoresist. The watermark image may be created by mapping a spread spectrum watermark signal to discrete image locations, or may be created by modulating the pixels of a host image, such as a halftone or multilevel per pixel image, with a spread spectrum watermark signal using the watermark embedding techniques described previously. In separate holographic recording processes, the photoresist records one or more interference patterns of holographic structures. The resulting photoresist includes a composite of the watermark image and interference patterns of holographic structures. To mass produce the holographic structure, the manufacturer develops the photoresist and creates a metal master, which may then be used to create replicas of the holographic structure using embossing or casting techniques.
Once the digital image is captured at the desired focal plane, the watermark decoding process described previously decodes the watermark signal (166) using a watermark key (168), which specifies parameters, such as the pseudorandom carrier signal (or its seed number) used to spread spectrum modulate a message, an orientation signal, block size and resolution of embedding, etc. In some applications, such as authentication, detecting the presence of a valid watermark signal is sufficient to authenticate the object bearing the hologram. In other applications, the watermark message carries useful information, such as information about the bearer or issuer of the authentic object, or an index to a database entry storing such information. Since the digital image is captured at a desired focal plane, the orientation signal is not always necessary to calibrate the watermark decoder before reading the message. However, the orientation signal alone may serve as an authenticating watermark, and its presence indicates authenticity of the object bearing the hologram. In this case, there is no need for a spread spectrum carrier of a message.
After reading the watermark, the reading device (e.g., a networked personal computer connected to the light source, camera and holder) takes an action or set of actions associated with the watermark (170). This may include displaying a message indicating whether the object is authentic, displaying the embedded message, fetching relating information from a database using an index embedded in the watermark to index a database entry storing that related information, etc. A URL, for example, may be embedded in the watermark or stored in the database entry. In response to receiving the URL from the decoder or database, the reader fetches, or launches an internet browser to fetch, data stored at a network device at the URL, such as a web page, XML content, etc.
Another method of integrating a digital watermark in a hologram is to construct the hologram as a series of discrete dots or pixels. The dots collectively form a two-dimensional signal comprised of discrete elements that may be modulated using the above techniques to carry a watermark. In one example of this approach, the watermark embedder creates a watermarked halftone image using the technique described above. Then the binary elements in the resulting halftone image are converted to discrete hologram dots in a hologram formation process.
There are a variety of ways to create the discrete hologram dots. One approach is to create an embossed hologram that extends continuously over a film, and then apply a mask on that film to form a collection of dots that each either expose a hologram dot or mask it according to whether a corresponding bit is on or off in the watermarked halftone image.
Alternatively, a dot matrix hologram method may be used to create an array of discrete diffraction gratings in the form of dots. The diffraction gratings reflect light in a manner that is interpreted distinctly as a binary one or zero. In one implementation, for example, the discrete diffraction grating dots are formed at a resolution ranging from 50 to 2000 dpi using computer driven machinery to record each diffraction grating on a photosensitive plate. After recording the diffraction gratings, the plate is developed and then used to form a metal master of the surface relief pattern. The metal master may then be replicated by an embossing technique.
The orientations of the diffraction gratings are modulated according to a watermark signal created using the watermarking method described in the previous section. The modulation of the orientation of the diffraction pattern encodes a one or zero based on the binary value at a corresponding location in the watermark signal.
To read the watermark from the dot matrix hologram, a digital image reader captures an image of the hologram from a predetermined perspective and orientation. The reader decodes a message by interpreting the image created by the diffraction grating dots of varying orientation. In particular, the orientation of the diffraction gratings creates a distinct image attribute that the reader maps to a one or zero. It then spread spectrum demodulates the resulting binary signal derived from interpreting the images of the diffraction grating dots, and performs error correction decoding to reconstruct an embedded message. It is not necessary to manually align the hologram for reading. Instead, the orientation of the dots can be used to re-align the image before decoding the embedded message.
The process begins by creating a halftone watermark signal using the technique described previously. In one implementation, for example, a multilevel per pixel watermark signal is added to a multilevel per pixel host image at a desired halftone resolution (e.g., 75 to 600 dpi). The resulting watermarked image is then converted into a halftone image at that resolution using a halftoning process. The host image may be a natural image or simply a solid monotone image. In the latter case, the resulting halftone image is an image of the watermark signal because it modulates a solid tone background image. In either case, the halftone watermark signal covers a block of image samples. This block is replicated in a two dimensional array of contiguous blocks to tile the watermark signal in a manner that covers the desired amount of surface area of a hologram. The watermark signal block may be replicated to tile the entire host image, or in case where the watermark signal modulates a solid, single tone image, to tile the desired surface area the hologram.
The resulting watermarked digital image is two dimensional pattern of halftone dots, where each dot has a value representing one of two binary states: either the presence or absence of a dot. In the physical representation of the mask, each dot represents the presence or absence of a metal layer after demetalization.
The process shown in
To begin, a reader device, such as personal computer connected to a scanner or digital camera captures a digital image of the dot pattern on the hologram's surface (200). Next, the watermark decoding process described above is used to decode the watermark from the halftone image (202). The decoding process initially performs a detection operation to detect an orientation signal, and then uses the orientation signal to compensate for rotation, spatial scale, and translation distortion. After compensating for the geometric distortion and finding the reference origin for a watermark tile, the reader decodes the message embedded in the spread spectrum modulated watermark signal.
Finally, the reader takes an action or set of actions associated with the watermark signal, or its message payload. The action or actions are application specific. Some examples are listed in the text corresponding to block 170 in
Applications of Watermarking OVDs
This section describes several applications for watermarking OVDs. One application of digitally watermarking a hologram is to embed a machine readable serial number that uniquely identifies a specific hologram device, a hologram design, or a particular lot of holograms.
Once serialized, the number embedded in a hologram's watermark may be used for a variety of applications, including authenticating the watermark and initiating machine, software or system functions associated with a particular serial number.
In authentication applications, the message carried in the digital watermark may be related to information that is printed or stored in machine readable form on another part of the object in which the hologram resides. For example, the hologram message may contain a first identifier that refers to the bearer or issuer of the object (e.g., credit card, identity document, ticket, etc). A second identifier is printed or stored on the object in a machine readable feature such as a bar code, RF tag, magnetic stripe, magnetic ink, etc. If the watermark is unreadable, or the first and second identifiers do not match, then the object is deemed to be a fake. To constitute a match between the first and second identifiers, the identifiers may satisfy a predetermined relationship, such as one being a one way cryptographic hash of the other, one pointing to a database entry that stores the other identifier, both pointing to a database entries with matching information, etc.
In high value documents such as bank notes, the digital watermark may be used as a covert mark that serves to authenticate the document, acts as a series identification, enables circulation control, and controls the usage of the image scanned from the document (e.g., inhibits reproduction or rendering operations like printing, scanning, and photocopying), etc.
Given that the position of the hologram on a document is usually well known, it becomes a good device to carry machine readable features that are processed in devices such as point of sale machines (credit cards), digital cameras, or banknote sorters. The means of reading could be special laser illumination, visible light illumination, optical reader, or a combination of such.
Now consider an embodiment featuring a smart card having a digitally watermarked hologram placed thereon. A smart card is defined broadly herein to generally include a card-shaped device that carries information. (The definition of a smart card used in this application is broad enough to include so-called radio frequency identification cards—RFID cards). Typically, a smart card includes a microprocessor and/or memory embedded therein. A memory smart card stores information in electronic circuits, while a microprocessor card can delete and manipulate information stored in associated memory in the card. A smart card communicates via a contact (or contactless) interface. A contact smart card is typically inserted into a smart card reader, thereby making physical contact with the reader. A contactless smart card may have an antenna through which signals are communicated. Of course, a smart card could have both a contact and contactless interface. Smart cards are available from many vendors, including Gemplus International S. A., ActivCard S. A., PubliCARD, Inc., Smart Card Innovators, Inc., Precis, Inc., American Card Technology, among others.
A smart card is typically passive in that it lacks an internal power source. Power can be supplied through a physical interface, or via an external electromagnetic wave (contactless), which energizes the smart card's internal circuits. (Of course, a smart card could be constructed so as to have an internal power source).
With reference to
Preferably, a digital watermark is embedded in a hologram 212a carried by the smart card 212. Alternatively, the digital watermark is embedded in a graphic, background, picture or photograph, text, image, logo, etc. on the smart card. An optical (or laser or visible illuminator) reader 214 reads the watermarked area. The reader 214 captures a digital image of the watermarked area (hologram, graphic, text, etc.). The captured image data is communicated to a decoding and authentication module 216 (e.g., a personal computer, dedicated circuitry, mobile or handheld device, remote computer, etc.), which is tethered (e.g., physically or wirelessly) to the smart card reader 210. A watermark decoder module 218 detects and decodes the watermark in the captured image. Of course the reader and decoding and authentication module 216 can be integrated into a single unit. Authenticator 220 determines the authenticity of the smart card 212 (or hologram). For example, and as discussed below, the authenticator 220 may compare a decoded watermark identifier to a predetermined value, to information carried by the smart card, and/or to verification information retrieved from a database. Of course, the authenticator 220 and watermark decoder 218 can be combined, and/or can be realized by computer software instructions running on a general-purpose computer. Alternatively, these modules can be realized by dedicated hardware, or via a hardware/software implementation.
Typically, a digital watermark includes a payload or information bits (e.g., between 8-512 bits). These bits can be used as an additional layer of security, or to provide additional information. In a first embodiment, the information bits are compared with information stored in the electronic circuits of the smart card. A smart card is deemed authentic when the watermark information and the smart card information match, or relate in a predetermined mathematical manner. To illustrate, the watermark information can be used to derive (or decode) the smart card information (or vice versa). Or the sum, product, dot product, hash, combination, etc. of the digital watermark information and the smart card information may yield a predetermined value. Matching or achieving a predetermined value can indicate an authentic card or hologram.
In a second embodiment, the watermark information bits are used as an index to retrieve user data from a data repository. The data repository can include user data such as a photograph of an authorized cardholder, fingerprint data, retinal data, valid passwords, PINS, account information, shipping information, user bibliographic information, company information, etc. Assignee's U.S. patent Ser. No. 09/571,422, filed May 15, 2000 (now U.S. Pat. No. 6,947,571), discusses some applicable linking features. Such user data can be compared against information provided by the user.
In a third embodiment, the watermark information bits (or payload) include a key, lifespan time limit, and/or an authentication code. Such is compared against predetermined validation information to determine authenticity of the smart card. In the case of a lifespan time-limit, a purchase or authentication will be thwarted when the lifespan time-limit has expired.
Now consider a point of sale location. A purchaser presents her digitally watermarked smart card to a smart card reader. The smart card reader extracts information from the card, e.g., account number, customer information, etc. (In one embodiment, the smart card (or mag-stripe, RFID) carries information to trigger the watermark reader to look for a watermark. This handles a case of legacy cards (e.g., older cards which are not digitally watermarked). In other words, the smart card chip has an indication that triggers the watermark reader to check the hologram. This is to allow reading of new and legacy (marked and unmarked) cards by the same reader). Returning to the point-of-sale example, a watermark reader (perhaps associated with the smart card reader) captures a watermarked area (e.g., a hologram). A watermark decoder decodes the captured area to determine information bits. These decoded information bits are used to authenticate the smart card (or smart card user). The point of sale location (or terminal) is controlled by the authentication determination. If authenticated, the transaction is carried out. Otherwise, the transaction is terminated, and optionally, reported.
Accordingly, the digitally watermarked information provides security and/or authentication functionality. In some embodiments, the digital watermark information is compared with information stored in the smart card. In other embodiments, the digital watermark information is used to interrogate a database to retrieve additional information.
As noted above, the digital watermark process may be used to encode a robust and/or a fragile watermark. The robust watermark may be used to carry information, such as a serial number. The fragile watermark may be designed to degrade in attempts to counterfeit the hologram. As noted above, the robust watermark message may include a key indicating where the fragile watermark resides (e.g., which locations in a holographic image or pattern of metal dots, etc.). Alternatively, the fragile watermark may be wholly unrelated to the robust mark.
Further, the robust or fragile watermark could be placed in a specific focal plane of the hologram, requiring laser illumination at a specific focal length to capture an image carrying the digital watermark signal, making the digital watermark more covert.
Concluding Remarks
Having described and illustrated the principles of the technology with reference to specific implementations, it will be recognized that the technology can be implemented in many other, different, forms. To provide a comprehensive disclosure without unduly lengthening the specification, applicants hereby incorporate by reference each of the patents and patent applications referenced above, along with U.S. patent application Ser. No. 09/790,322 (now U.S. Pat. No. 7,111,168; published as US 2001-0037313 A1).
The methods, processes, and systems described above may be implemented in hardware, software or a combination of hardware and software. For example, the digital watermark encoding processes and holographic structure generation processes may be implemented in a programmable computer or a special purpose digital circuit. Similarly, auxiliary data decoding may be implemented in software, firmware, hardware, or combinations of software, firmware and hardware. The methods and processes described above may be implemented in programs executed from a system's memory (a computer readable medium, such as an electronic, optical or magnetic storage device).
In one embodiment, instead of a smart card, a conventional credit card (with a magnetic strip) is used. The credit card preferably includes a hologram, which is embedded with a digital watermark as discussed above. The watermark includes information bits to allow authentication or verification, as discussed above. Instead of a hologram, a credit card may have a graphic, personal photograph, picture, logo, text, and/or background, which includes a digital watermark.
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 also expressly contemplated.
This application is a continuation of U.S. patent application Ser. No. 10/465,769, filed Jun. 18, 2003 (published as U.S. 2003-0210805 A1), which is a continuation of U.S. patent application Ser. No. 09/923,762, filed Aug. 6, 2001 (now U.S. Pat. No. 6,608,911), which is a continuation in part of U.S. patent application Ser. No. 09/741,779, filed Dec. 21, 2000 (published as U.S. 2002-0080992 A1, now abandoned). The subject matter of the present application is related to that disclosed in U.S. Pat. No. 5,862,260, and in U.S. patent application Ser. No. 09/503,881, filed Feb. 14, 2000 (now U.S. Pat. No. 6,614,914).
Number | Name | Date | Kind |
---|---|---|---|
4150781 | Silverman et al. | Apr 1979 | A |
4269473 | Flothmann et al. | May 1981 | A |
4421380 | McGrew | Dec 1983 | A |
4532508 | Ruell | Jul 1985 | A |
4590366 | Rothfjell | May 1986 | A |
4641017 | Lopata | Feb 1987 | A |
4778262 | Haines | Oct 1988 | A |
4889366 | Fabbiani | Dec 1989 | A |
4896363 | Taylor et al. | Jan 1990 | A |
4945215 | Fukushima et al. | Jul 1990 | A |
4963756 | Quan et al. | Oct 1990 | A |
5045952 | Eschbach | Sep 1991 | A |
5079648 | Maufe | Jan 1992 | A |
5095194 | Barbanell | Mar 1992 | A |
5117296 | Hoebing | May 1992 | A |
5138468 | Barbanell | Aug 1992 | A |
5145212 | Mallik | Sep 1992 | A |
5194971 | Haines | Mar 1993 | A |
5237433 | Haines et al. | Aug 1993 | A |
5285438 | Marchand et al. | Feb 1994 | A |
5306899 | Marom et al. | Apr 1994 | A |
5321751 | Ray et al. | Jun 1994 | A |
5336871 | Colgate, Jr. | Aug 1994 | A |
5337361 | Wang et al. | Aug 1994 | A |
5347375 | Saito et al. | Sep 1994 | A |
5393634 | Maker et al. | Feb 1995 | A |
5396559 | McGrew | Mar 1995 | A |
5400155 | Ueda et al. | Mar 1995 | A |
5411296 | Mallik | May 1995 | A |
5422744 | Katz et al. | Jun 1995 | A |
5428683 | Indeck et al. | Jun 1995 | A |
5432329 | O'Boyle et al. | Jul 1995 | A |
5436740 | Nakagawa et al. | Jul 1995 | A |
5448053 | Rhoads | Sep 1995 | A |
5475511 | Haines et al. | Dec 1995 | A |
5515498 | Heuring | May 1996 | A |
5530759 | Braudaway et al. | Jun 1996 | A |
5570208 | Kato et al. | Oct 1996 | A |
5607188 | Bahns et al. | Mar 1997 | A |
5612943 | Moses et al. | Mar 1997 | A |
5613004 | Cooperman et al. | Mar 1997 | A |
5636292 | Rhoads | Jun 1997 | A |
5652626 | Kawakami et al. | Jul 1997 | A |
5687236 | Moskowitz et al. | Nov 1997 | A |
5710834 | Rhoads | Jan 1998 | A |
5721781 | Deo et al. | Feb 1998 | A |
5734752 | Knox | Mar 1998 | A |
5745604 | Rhoads | Apr 1998 | A |
5757521 | Walters et al. | May 1998 | A |
5768426 | Rhoads | Jun 1998 | A |
5786587 | Colgate, Jr. | Jul 1998 | A |
5786910 | Walters et al. | Jul 1998 | A |
5789733 | Jachimowicz et al. | Aug 1998 | A |
5790703 | Wang | Aug 1998 | A |
5809139 | Girod et al. | Sep 1998 | A |
5812744 | Allebach et al. | Sep 1998 | A |
5822436 | Rhoads | Oct 1998 | A |
5825892 | Braudaway et al. | Oct 1998 | A |
5832119 | Rhoads | Nov 1998 | A |
5838814 | Moore | Nov 1998 | A |
5841886 | Rhoads | Nov 1998 | A |
5841978 | Rhoads | Nov 1998 | A |
5862247 | Fisun et al. | Jan 1999 | A |
5862260 | Rhoads | Jan 1999 | A |
5869819 | Knowles et al. | Feb 1999 | A |
5875249 | Mintzer et al. | Feb 1999 | A |
5900954 | Katz et al. | May 1999 | A |
5903648 | Javidi | May 1999 | A |
5930377 | Powell et al. | Jul 1999 | A |
5930767 | Reber et al. | Jul 1999 | A |
5932119 | Kaplan et al. | Aug 1999 | A |
5943422 | Van Wie et al. | Aug 1999 | A |
5946455 | Tresser et al. | Aug 1999 | A |
5949055 | Fleet et al. | Sep 1999 | A |
5955961 | Wallerstein | Sep 1999 | A |
6000607 | Ohki et al. | Dec 1999 | A |
6024287 | Takai et al. | Feb 2000 | A |
6031914 | Tewfik et al. | Feb 2000 | A |
6040883 | Johnson et al. | Mar 2000 | A |
6041295 | Hinderks | Mar 2000 | A |
6047888 | Dethloff | Apr 2000 | A |
6068192 | McCabe et al. | May 2000 | A |
6069955 | Coppersmith et al. | May 2000 | A |
6095566 | Yamamoto et al. | Aug 2000 | A |
6101602 | Fridrich | Aug 2000 | A |
6104812 | Koltai et al. | Aug 2000 | A |
6122403 | Rhoads | Sep 2000 | A |
6128411 | Knox et al. | Oct 2000 | A |
6131161 | Linnartz | Oct 2000 | A |
6157330 | Bruekers et al. | Dec 2000 | A |
6163842 | Barton | Dec 2000 | A |
6171734 | Warner et al. | Jan 2001 | B1 |
6193163 | Fehrmann et al. | Feb 2001 | B1 |
6199144 | Arora et al. | Mar 2001 | B1 |
6201881 | Masuda et al. | Mar 2001 | B1 |
6202932 | Rapeli | Mar 2001 | B1 |
6205249 | Moskowitz | Mar 2001 | B1 |
6208745 | Florencio et al. | Mar 2001 | B1 |
6209092 | Linnartz | Mar 2001 | B1 |
6219435 | Horikoshi et al. | Apr 2001 | B1 |
6219634 | Levine | Apr 2001 | B1 |
6229924 | Rhoads et al. | May 2001 | B1 |
6233347 | Chen et al. | May 2001 | B1 |
6243480 | Zhao et al. | Jun 2001 | B1 |
6244514 | Otto | Jun 2001 | B1 |
6246777 | Agarwal et al. | Jun 2001 | B1 |
6247644 | Horne et al. | Jun 2001 | B1 |
6252685 | Yokochi | Jun 2001 | B1 |
6252972 | Linnartz | Jun 2001 | B1 |
6257486 | Teicher et al. | Jul 2001 | B1 |
6263086 | Wang | Jul 2001 | B1 |
6264782 | Oshima et al. | Jul 2001 | B1 |
6266430 | Rhoads | Jul 2001 | B1 |
6268893 | O'Boyle et al. | Jul 2001 | B1 |
6285776 | Rhoads | Sep 2001 | B1 |
6301660 | Benson | Oct 2001 | B1 |
6307949 | Rhoads | Oct 2001 | B1 |
6311214 | Rhoads | Oct 2001 | B1 |
6320965 | Levine | Nov 2001 | B1 |
6321981 | Ray et al. | Nov 2001 | B1 |
6324573 | Rhoads | Nov 2001 | B1 |
6325285 | Baratelli | Dec 2001 | B1 |
6332031 | Rhoads et al. | Dec 2001 | B1 |
6332194 | Bloom et al. | Dec 2001 | B1 |
6337752 | Heckenkamp et al. | Jan 2002 | B1 |
6345104 | Rhoads | Feb 2002 | B1 |
6351537 | Dovgodko et al. | Feb 2002 | B1 |
6351815 | Adams | Feb 2002 | B1 |
6374036 | Ryan et al. | Apr 2002 | B1 |
6377291 | Andoh et al. | Apr 2002 | B2 |
6381341 | Rhoads | Apr 2002 | B1 |
6385329 | Sharma et al. | May 2002 | B1 |
6385330 | Powell et al. | May 2002 | B1 |
6389151 | Carr et al. | May 2002 | B1 |
6401206 | Khan et al. | Jun 2002 | B1 |
6408082 | Rhoads et al. | Jun 2002 | B1 |
6421070 | Ramos et al. | Jul 2002 | B1 |
6424725 | Rhoads et al. | Jul 2002 | B1 |
6427020 | Rhoads | Jul 2002 | B1 |
6442284 | Gustafson et al. | Aug 2002 | B1 |
6443494 | Lieberman Zadjman et al. | Sep 2002 | B1 |
6449377 | Rhoads | Sep 2002 | B1 |
6452594 | Kamen et al. | Sep 2002 | B1 |
6456405 | Horikoshi et al. | Sep 2002 | B2 |
6469969 | Carson et al. | Oct 2002 | B2 |
6487301 | Zhao | Nov 2002 | B1 |
6516079 | Rhoads et al. | Feb 2003 | B1 |
6522770 | Seder et al. | Feb 2003 | B1 |
6527173 | Narusawa et al. | Mar 2003 | B1 |
6535617 | Hannigan et al. | Mar 2003 | B1 |
6536665 | Ray et al. | Mar 2003 | B1 |
6539475 | Cox et al. | Mar 2003 | B1 |
6542927 | Rhoads | Apr 2003 | B2 |
6549638 | Davis et al. | Apr 2003 | B2 |
6553129 | Rhoads | Apr 2003 | B1 |
6567533 | Rhoads | May 2003 | B1 |
6580808 | Rhoads | Jun 2003 | B2 |
6580809 | Stach et al. | Jun 2003 | B2 |
6580819 | Rhoads | Jun 2003 | B1 |
6590996 | Reed et al. | Jul 2003 | B1 |
6608911 | Lofgren et al. | Aug 2003 | B2 |
6608919 | Alattar | Aug 2003 | B1 |
6611607 | Davis et al. | Aug 2003 | B1 |
6614914 | Rhoads et al. | Sep 2003 | B1 |
6618484 | Van Wie et al. | Sep 2003 | B1 |
6636615 | Rhoads et al. | Oct 2003 | B1 |
6636616 | Harrington | Oct 2003 | B1 |
6647128 | Rhoads | Nov 2003 | B1 |
6647130 | Rhoads | Nov 2003 | B2 |
6650761 | Rodriguez et al. | Nov 2003 | B1 |
6661533 | Bhaskar et al. | Dec 2003 | B1 |
6674886 | Davis et al. | Jan 2004 | B2 |
6681028 | Rhoads et al. | Jan 2004 | B2 |
6681029 | Rhoads | Jan 2004 | B1 |
6694041 | Brunk | 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 |
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 |
6738495 | Rhoads et al. | May 2004 | B2 |
6742712 | Kawaguchi et al. | Jun 2004 | B1 |
6744906 | Rhoads et al. | Jun 2004 | B2 |
6750985 | Rhoads | Jun 2004 | B2 |
6760463 | Rhoads | Jul 2004 | B2 |
6760464 | Brunk | Jul 2004 | B2 |
6763121 | Shaked et al. | Jul 2004 | B1 |
6763123 | Reed et al. | Jul 2004 | B2 |
6768809 | Rhoads et al. | Jul 2004 | B2 |
6768980 | Meyer et al. | Jul 2004 | B1 |
6775392 | Rhoads | Aug 2004 | B1 |
6782115 | Decker et al. | Aug 2004 | B2 |
6798537 | Lau et al. | Sep 2004 | B1 |
6798894 | Rhoads | Sep 2004 | B2 |
6813366 | Rhoads | Nov 2004 | B1 |
6822769 | Drinkwater et al. | Nov 2004 | B1 |
6829368 | Meyer et al. | Dec 2004 | B2 |
6879701 | Rhoads | Apr 2005 | B1 |
6882737 | Lofgren et al. | Apr 2005 | B2 |
6917724 | Seder et al. | Jul 2005 | B2 |
6920232 | Rhoads | Jul 2005 | B2 |
6922480 | Rhoads | Jul 2005 | B2 |
6930811 | Brotherton-Ratcliffe et al. | Aug 2005 | B2 |
6947571 | Rhoads et al. | Sep 2005 | B1 |
6973198 | Patton et al. | Dec 2005 | B2 |
6975746 | Davis et al. | Dec 2005 | B2 |
6988202 | Rhoads et al. | Jan 2006 | B1 |
6993149 | Brunk et al. | Jan 2006 | B2 |
6993154 | Brunk | Jan 2006 | B2 |
6996252 | Reed et al. | Feb 2006 | B2 |
7003731 | Rhoads et al. | Feb 2006 | B1 |
7020349 | Brunk | Mar 2006 | B2 |
7024016 | Rhoads et al. | Apr 2006 | B2 |
7027614 | Reed | Apr 2006 | B2 |
7035427 | Rhoads | Apr 2006 | B2 |
7044395 | Rhoads et al. | May 2006 | B1 |
7051086 | Rhoads et al. | May 2006 | B2 |
7054463 | 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 |
7113614 | Rhoads | Sep 2006 | B2 |
7139408 | Rhoads et al. | Nov 2006 | B2 |
7158654 | Rhoads | Jan 2007 | B2 |
7162052 | Brundage et al. | Jan 2007 | B2 |
7164780 | Brundage et al. | Jan 2007 | B2 |
7171016 | Rhoads | Jan 2007 | B1 |
7171020 | Rhoads et al. | Jan 2007 | B2 |
7174031 | Rhoads et al. | Feb 2007 | B2 |
7177443 | Rhoads | Feb 2007 | B2 |
7191156 | Seder | Mar 2007 | B1 |
7213757 | Jones et al. | May 2007 | B2 |
7224819 | Levy et al. | May 2007 | B2 |
7248715 | Levy | Jul 2007 | B2 |
7248717 | Rhoads | Jul 2007 | B2 |
7261612 | Hannigan et al. | Aug 2007 | B1 |
7263203 | Rhoads et al. | Aug 2007 | B2 |
7286685 | Brunk et al. | Oct 2007 | B2 |
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 |
7443537 | Reed | 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 |
7536555 | Rhoads | May 2009 | B2 |
7537170 | Reed et al. | May 2009 | B2 |
7545952 | Brundage et al. | Jun 2009 | B2 |
7564992 | Rhoads | Jul 2009 | B2 |
RE40919 | Rhoads | Sep 2009 | E |
7602817 | Ramalho | Oct 2009 | B2 |
7602978 | Levy et al. | Oct 2009 | B2 |
7628320 | Rhoads | 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 |
7660429 | Shaked et al. | Feb 2010 | B2 |
7685426 | Ramos et al. | Mar 2010 | B2 |
7688996 | Bradley | Mar 2010 | B2 |
7693300 | Reed et al. | Apr 2010 | B2 |
7697719 | Rhoads | Apr 2010 | B2 |
7711143 | 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 |
20010002931 | Maes et al. | Jun 2001 | A1 |
20010020270 | Yeung et al. | Sep 2001 | A1 |
20010030769 | Jacobs | Oct 2001 | A1 |
20010033674 | Chen et al. | Oct 2001 | A1 |
20010034705 | Rhoads et al. | Oct 2001 | A1 |
20010037313 | Lofgren et al. | Nov 2001 | A1 |
20010054144 | Epstein et al. | Dec 2001 | A1 |
20010054150 | Levy | Dec 2001 | A1 |
20010055407 | Rhoads | Dec 2001 | A1 |
20020009208 | Alattar et al. | Jan 2002 | A1 |
20020021823 | Muratani | Feb 2002 | A1 |
20020023020 | Kenyon et al. | Feb 2002 | A1 |
20020057823 | Sharma et al. | May 2002 | A1 |
20020080992 | Decker et al. | Jun 2002 | A1 |
20020085238 | Umeda | Jul 2002 | A1 |
20020095577 | Nakamura et al. | Jul 2002 | A1 |
20020111919 | Weller et al. | Aug 2002 | A1 |
20020116509 | DeLaHuerga | Aug 2002 | A1 |
20020118565 | Matsuo | Aug 2002 | A1 |
20020131076 | Davis | Sep 2002 | A1 |
20020170966 | Hannigan et al. | Nov 2002 | A1 |
20020171853 | Wu | 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 |
20030012548 | Levy et al. | 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 |
20040158724 | Carr et al. | Aug 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 |
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 |
---|---|---|
2943436 | May 1981 | DE |
3185585 | Aug 1991 | JP |
WO9514289 | May 1995 | WO |
WO9636163 | Nov 1996 | WO |
WO9743736 | Nov 1997 | WO |
Entry |
---|
Aoki, Y., Watermarking Technique Using Computer-Generated Holograms, Jul. 1999, Denshi Joho Tsushin Gakkai Ronbunshi, vol. J82-A, No. 7, pp. 1092-1100. |
Table of Contents for vol. 84 Issue 1 showing the English translation of “Watermarking technique using computer generated holograms” was published Online Sep. 12, 2000 at 9:49 AM, http://www3.interscience.wiley.com/journal/73500266/issue. |
Lohman, A.W.; Paris, D.P., “Binary Fraunhofer Holograms, Generated by Computer,” Oct. 1967, Appl. Optics, vol. 6, No. 10, pp. 1739-1748. |
Kermisch, D.; Roetling, P.G., “Fourier spectrum of halftone images,” Jun. 1975, J. Opt. Soc. Am., vol. 65, No. 6, pp. 716-723. |
Allebach, J.P.; Liu, B., “Analysis of halftone dot profile and aliasing in the discrete binary representation of images,” Sep. 1977, J. Opt. Soc. Am., vol. 67, No. 9, pp. 1147-1154. |
Allebach, J.P., “Aliasing and quantization in the efficient display of images,” Jun. 1979, J. Opt. Soc. Am., vol. 69, No. 6, pp. 869-877. |
Fienup, J.R., “Iterative method applied to image reconstruction and to computer-generated holograms,” May/Jun. 1980, Opt. Engineering, vol. 19, No. 3, pp. 297-305. |
Allebach, J.P., “Representation-related errors in binary digital holograms: a unified analysis,” Jan. 15, 1981, Appl. Optics, vol. 20, No. 2, pp. 290-299. |
Hauck, R.; Bryngdahl, O., “Computer-generated holograms with pulse-density modulation,” Jan. 1984, J. Opt. Soc. Am., vol. 1, No. 1, pp. 5-10. |
Lee, A.J.; Casasent, D.P., “Computer generated hologram recording using a laser printer,” Jan. 1, 1987, Appl. Optics, vol. 26, No. 1, pp. 136-138. |
Seldowitz, M.A.; Allebach, J.P.; Sweeney, D.W., “Synthesis of digital holograms by direct binary search,” Jul. 15, 1987, Appl. Optics, vol. 26, No. 14, pp. 2788-2798. |
Eschbach, R., “Comparison of error diffusion methods for computer-generated holograms,” Sep. 10, 1991, Appl. Optics, vol. 30, No. 26, pp. 3702-3710. |
Chang, M.P.; Ersoy, O.K., “Iterative interlacing error diffusion for synthesis of computer-generated holograms,” Jun. 10, 1993, Appl. Optics, vol. 32, No. 17, pp. 3122-3129. |
Sullivan, J.; Miller, R.; Pios, G., “Image halftoning using a visual model in error diffusion,” Aug. 1993, J. Opt. Soc. Am., vol. 10, No. 8, pp. 1714-1724. |
Fetthauer, F.; Weissbach, O.; Bryngdahl, O., “Computer-generated Fresnel holograms: quantization with the error diffusion algorithm,” Feb. 1, 1995, Optics Communications, vol. 114, Issues 3-4, pp. 230-234. |
Lohmann, A.W.; Sinzinger, S., “Graphic codes for computer holography,” Jun. 10, 1995, Appl. Optics, vol. 34, No. 17, pp. 3172-3178. |
Allebach, J.P.; Keegan, J.J., “Computer Synthesis of Binary Fourier Transform Holograms Using Ordered Dither,” Nov. 1978, J. Opt. Soc. Am., vol. 68, p. 1440. |
Jennison, B.K.; Allebach, J.P.; Sweeney, D.W., “Iterative approaches to computer-generated holography,” Jun. 1989, Optical Engineering, vol. 28, pp. 629-637. |
Alattar, “‘Smart Images’ Using Digimarc's Watermarking Technology,”IS&T/SPIE/s 12 Int. Symposium on Electronic Imaging, San Jose, CA, Jan. 25, 2000, vol. 3971, No. 25, 10 pages. |
Aoki, “Watermarking Technique Using Computer-Generated Holograms”, Electronics and Communication in Japan, Part 3, vol. 84, No. 1, 2001, pp. 21-31. |
Boney et al., “Digital Watermarks for Audio Signals”, IEEE 1996, pp. 473-480. |
Bovik, “Handbook of Image and Video Processing”, Academic Press, 2000, pp. 133-136, 154, 155. |
Dittman et al., “Hologram Watermarks for Document Authentications”, IEEE 2001, pp. 60-64. |
Kutter, “Performance Improvement of Spread Spectrum Based Image Watermarking Schemes Through M-ary Modulation”, Lecture Notes in Computer Science, 1999, 16 pages. |
Luc, “Analysis of Spread Spectrum System Parameters for Design of Hidden Transmission”, Radioengineering, vol. 4, No. 2, Jun. 1995, pp. 26-29. |
Puate et al., “Using Fractal Compression Scheme to Embed a Digital Signature Into an Image,” SPIE vol. 2915, Mar. 1997, pp. 108-118. |
Stepien, “Computer Generated Holograms and Diffraction Gratings in Optical Security Applications”, Proc. Of SPIE vol. 3973, 2000, pp. 224-230. |
Stepien et al., “Distributed Kinoforms in Optical Security Applications”, SPIE, Optical Engineering, vol. 35, No. 9, Sep. 1996, pp. 2453-2458. |
Stepien et al., “Pure-Phase Iteratively Generated Fourier Hologram as a Security Mark”, SPIE vol. 2659, 1996, pp. 223-228. |
Zhao et al., “In Business Today and Tomorrow”, Communications of the ACM, Jul. 1998, vol. 41, No. 7, pp. 67-72. |
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. |
Aug. 26, 2004 Notice of Allowance from U.S. Appl. No. 10/465,769. |
Dec. 2, 2003 Notice of Allowance from U.S. Appl. No. 10/465,769. |
Apr. 1, 2003 Notice of Allowance from U.S. Appl. No. 09/923,762. |
Oct. 9, 2002 Office Action, and Jan. 9, 2003 Amendment in response thereto, each from U.S. Appl. No. 09/923,762. |
Mar. 9, 2004 Notice of Allowance from assignee's U.S. Appl. No. 10/282,908. |
Aug. 15, 2003 Office Action, and Dec. 15, 2003 Amendment in response thereto, each from assignee's U.S. Appl. No. 10/282,908. |
May 28, 2002 Office Action from U.S. Appl. No. 09/741,779 (abandoned in favor of U.S. Appl. No. 10/282,908). |
Zhao et al., “In Business Today and Tomorrow,” Communications of the ACM, vol. 41, No. 7, Jul. 1998. |
Baharav, “Watermarking of Dither Halftoned Images”, SPIE vol. 3657, Jan. 1999, pp. 307-316. |
Knox, “Digital Watermarks Using Stochastic Screens”, SPIE vol. 3018, 1997, pp. 316-322. |
Matsui et al., “Embedding A Watermark to Binary Pictures in a Hardcopy System,” Memoirs of the National Defense Academy (Japan) vol. 36, No. 2, pp. 13-20. |
Mei, “Data Hiding in Binary Text Documents”, SPIE vol. 4314, 2001, pp. 369-375. |
Nakamura et al., “A Unified Coding Method of Dithered Image and Text Data Using Micropatterns,” Electronics and Communications in Japan, Part 1, vol. 72, No. 4, 1989, pp. 50-56. |
Nakamura et al., “A Unified Coding Method of Image and Text Data Using Discrete Orthogonal Transform,” Systems and Computers in Japan, vol. 21, No. 3, 1990, pp. 87-92. |
Tanaka et al., “Embedding Secret Information Into a Dithered Multi-Level Image,” Proc. IEEE Military Comm. Conf., Sep. 1990, pp. 216-220. |
Tanaka, “Embedding the Attribute Information into a Dithered Image,” Systems and Computers in Japan, vol. 21, No. 7, 1990, pp. 43-50. |
Wang, “Embedding Digital Watermarks in Halftone Screens”, SPIE vol. 3971, 2000, pp. 218-227. |
Wu, “Data Hiding in Digital Binary Image”, IEEE, 2000, pp. 393-396. |
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. |
Number | Date | Country | |
---|---|---|---|
20060039581 A1 | Feb 2006 | US |
Number | Date | Country | |
---|---|---|---|
60082228 | Apr 1998 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10465769 | Jun 2003 | US |
Child | 11090968 | US | |
Parent | 09923762 | Aug 2001 | US |
Child | 10465769 | US | |
Parent | 09292569 | Apr 1999 | US |
Child | 10379393 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09741779 | Dec 2000 | US |
Child | 09923762 | US | |
Parent | 11090968 | US | |
Child | 09923762 | US | |
Parent | 10379393 | Mar 2003 | US |
Child | 11090968 | US |