US 6,754,377 B2Grant
Methods and systems for marking printed documents
Issue Date:2004-06-22
•52 Claims
•3 Drawing Sheets
Abstract
Line structures are provided for printed documents to encode plural-bit digital information. The encoded information can be decoded using suitably-equipped processing equipment and used to identify the printed documents. In one implementation the information is repeated differently in a two dimensional pattern of line structures according to a key.
Metadata
Assignee
- Digimarc Corporation
Inventor
- Geoffrey B. Rhoads
Application Information
Application Number:US 10/165,751
Filing Date:2002-06-06
Priority Date:1995-05-08
Art Unit:7
Classifications
IPC:
H04K 100
Field of Search:
382100382135382232380210380252380287380 54380 55D19 11283 72283 85283 93283113283 57283901283902
Patent Drawings (3 sheets)
Description
Related Application Data
[0002] This application is a continuation of utility application Ser. No. 09/074,034, filed May 6, 1998, now U.S. Pat. No. 6,449,377, which is a continuation-in-part of utility application Ser. No. 08/438,159 (now U.S. Pat. No. 5,850,481), filed May 8, 1995, and claims benefit of provisional application Ser. No. 60/082,228, filed Apr. 16, 1998.
[0003] (The specification of application Ser. No. 08/438,159 is substantially identical to that of applicant's issued Pat. Nos. 5,636,292, 5,710,834, 5,748,763, 5,748,783. The specification of application Ser. No. 60/082,228 is attached hereto as Appendix A.)
[0004] The subject matter of this application is also related to that of the present assignee's other pending applications, namely Ser. Nos. 08/508,083 (now U.S. Pat. No. 5,841,978), 08/534,005 (now U.S. Pat. No. 5,832,119), 08/637,531 (now U.S. Pat. No. 5,822,436), 08/649,419 (now U.S. Pat. No. 5,862,260), 08/746,613 (now U.S. Pat. No. 6,122,403), 08/951,858 (now U.S. Pat. No. 6,026,193), and 08/969,072 (now U.S. Pat. No. 5,809,160), and the allowed applications referenced below.
Field of the Invention
[0005] The present invention relates to methods and systems for inconspicuously embedding binary data in line art images (such as are used in currency and the like), and associated methods/systems for decoding such data from such images. One application of such technology is discouraging counterfeiting of banknotes.
Background and Summary of the Invention
[0006] Watermarking is a quickly growing field of endeavor, with several different approaches. The present assignee's work is reflected in U.S. Pat. Nos. 5,710,834, 5,636,292, 5,721,788, 5,748,763, 5,748,783, and 5,745,604, in allowed U.S. application Ser. Nos. 08/327,426 (now U.S. Pat. No. 5,768,426), 08/508,083 (now U.S. Pat. No. 5,841,978), 08/438,159 (now U.S. Pat. No. 5,850,481), and in laid-open PCT application WO97/43736. (The laid-open PCT application is substantially identical to the disclosure of U.S. Pat. No. 6,122,403.) Other work is illustrated by U.S. Pat. Nos. 5,734,752, 5,646,997, 5,659,726, 5,664,018, 5,671,277, 5,687,191, 5,687,236, 5,689,587, 5,568,570, 5,572,247, 5,574,962, 5,579,124, 5,581,500, 5,613,004, 5,629,770, 5,461,426, 5,743,631, 5,488,664, 5,530,759, 5,539,735, 4,943,973, 5,337,361, 5,404,160, 5,404,377, 5,315,098, 5,319,735, 5,337,362, 4,972,471, 5,161,210, 5,243,423, 5,091,966, 5,113,437, 4,939,515, 5,374,976, 4,855,827, 4,876,617, 4,939,515, 4,963,998, 4,969,041, and published foreign applications WO 98/02864, EP 822,550, WO 97/39410, WO 96/36163, GB 2,196,167, EP 777,197, EP 736,860, EP 705,025, EP 766,468, EP 782,322, WO 95/20291, WO 96/26494, WO 96/36935, WO 96/42151, WO 97/22206, WO 97/26733. Some of the foregoing patents relate to visible watermarking techniques. Other visible watermarking techniques (e.g. data glyphs) are described in U.S. Pat. Nos. 5,706,364, 5,689,620, 5,684,885, 5,680,223, 5,668,636, 5,640,647, 5,594,809.
[0007] Most of the work in watermarking, however, is not in the patent literature but rather in published research. In addition to the patentees of the foregoing patents, some of the other workers in this field (whose watermark-related writings can by found by an author search in the INSPEC database) include I. Pitas, Eckhard Koch, Jian Zhao, Norishige Morimoto, Laurence Boney, Kineo Matsui, A. Z. Tirkel, Fred Mintzer, B. Macq, Ahmed H. Tewfik, Frederic Jordan, Naohisa Komatsu, and Lawrence O'Gorman.
[0008] The artisan is assumed to be familiar with the foregoing prior art.
[0009] In the following disclosure it should be understood that references to watermarking encompass not only the assignee's watermarking technology, but can likewise be practiced with any other watermarking technology, such as those indicated above.
[0010] Watermarking can be applied to myriad forms of information. The present disclosure focuses on its applications to line art imagery, of the sort typically employed in banknotes, travelers checks, passports, stock certificates, and the like (hereafter collectively referred to as “banknotes”). However, it should be recognized that the principles discussed below can also be applied outside this particular field.
[0011] Most of the prior art in image watermarking has focused on pixelated imagery (e.g. bit-mapped images, JPEG/MPEG imagery, VGA/SVGA display devices, etc.). In most watermarking techniques, the luminance or color values of component pixels are slightly changed to effect subliminal encoding of binary data through the image. (This encoding can be done directly in the pixel domain, or in another domain, such as the DCT domain.) In some systems, isolated pixels are changed in accordance with one or more bits of the binary data; in others, plural domain-related groupings of pixels (e.g. locally adjoining, or corresponding to a given DCT component) are so changed. In all cases, however, pixels have served as the ultimate carriers of the embedded data.
[0012] While pixelated imagery is a relatively recent development, line art goes back centuries. One familiar example is U.S. paper currency. On the one dollar banknote, for example, line art is used in several different ways. One is to form intricate webbing patterns around the margin of the note (generally comprised of light lines on dark background). Another is so form grayscale imagery, such as the portrait of George Washington (generally comprised of dark lines on a light background).
[0013] There are two basic ways to simulate grayscales in line art. One is to change the relative spacings of the lines to effect a lightening or darkening of an image region. FIG. 1A shows such an arrangement; area B looks darker than area A due to the closer spacings of the component lines. The other technique is to change the widths of the component lines—wider lines resulting in darker areas and narrower lines resulting in lighter areas. FIG. 1B shows such an arrangement. Again, area B looks darker than area A, this time due to the greater widths of the component lines. These techniques are often used together.
[0014] In my prior applications, I noted that conventional watermarking techniques are unsuitable for use with a type of line art known as vector graphics. (In vector graphics, lines are digitally described by reference to their geometry.) In particular, I noted that a change of even a single bit in a vector graphic can have substantial, unintended effects (e.g. changing a circle to a square), making the subliminal encoding of binary watermark data difficult.
[0015] In those prior applications, I proposed various solutions to this problem. One solution was to recognize that the eye is relatively insensitive to the precise placement and/or contours of a line, permitting slight modulation to effect information encoding. In particular, I noted:
[0016] “The primary example is the borders and contours between where a given line or figure is drawn or not drawn, or exactly where a bit-map changes from green to blue. In most cases, a human viewer of such graphics will be keenly aware of any attempts to “modulate signature signals” via the detailed and methodical changing of the precise contours of a graphic object. Nevertheless, such encoding of the signatures is indeed possible. The distinction between this approach and that disclosed in the bulk of this disclosure is that now the signatures must ultimately derive from what already exists in a given graphic, rather than being purely and separately created and added into a signal. This disclosure points out the possibilities here nonetheless. The basic idea is to modulate a contour, a touch right or a touch left, a touch up or a touch down, in such a way as to communicate an N-bit identification word. The locations of the changes contours would be contained in a an analogous master noise image, though now the noise would be a record of random spatial shifts one direction or another, perpendicular to a given contour. Bit values of the N-bit identification word would be encoded, and read, using the same polarity checking method between the applied change and the change recorded in the master noise image.”
[0017] The present disclosure expands on these principles by reference to several illustrative embodiments.
[0018] One embodiment posits a virtual grid of points imposed on a line art image (e.g. a U.S. one dollar banknote), with the points spaced at regular intervals in vertical and horizontal directions. (The horizontal and vertical intervals need not be equal.) The virtual points may be imposed over some or all of the bill at equal vertical and horizontal spacings of 250 μm. In regions of the banknote having line art, the component lines of the art snake in and amongst these virtual grid points.
[0019] Each grid point is considered to be the center of a rounded-square region. The luminance of the region is a function of the proximity of any line(s) within the boundary of the region to the region's centerpoint, and the thickness of the line(s).
[0020] To change the luminance of the region, the contour of the line(s) is changed slightly within the region. In particular, the line is made slightly thicker to decrease luminance; or thinner to increase luminance. (Unless otherwise noted, dark lines on light backgrounds are presumed.) The ability to effect these slight changes is then employed, in accordance with known pixelation-based watermarking techniques, to encode binary data in the line art. If such a banknote is thereafter scanned by a scanner, the values of the pixel data produced by the scanner will reflect the foregoing alterations in luminance values, permitting embedded watermark data to be decoded.
[0021] In an alternative embodiment, the line widths are not changed. Instead, the positions of the lines are shifted slightly towards or away from certain virtual grid points to effect an increase or decrease in the corresponding area's luminosity, with the same effect. Other embodiments are also detailed.
[0022] By the techniques disclosed herein, line art images can be encoded to subliminally convey binary data. This capability permits various hardware systems to recognize banknotes, and to change or limit their actions in a predetermined manner (e.g. a photocopier equipped with this capability can refuse to reproduce banknotes, or can insert forensic tracer data in the copy).
[0023] The foregoing features and advantages of the invention will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
Brief Description of the Drawings
[0024] FIGS. 1A and 1B show prior art techniques for achieving grayscale effects using line art.
[0025] FIG. 2 shows a virtual array of grid points that can be imposed on an image according to one embodiment of the present invention.
[0026] FIG. 3 shows a virtual array of regions that can be imposed on an image according to the FIG. 2 embodiment.
[0027] FIG. 4 shows an excerpt of FIG. 3 with a line from a line art image passing therethrough.
[0028] FIG. 5 shows changes to the width of the line of FIG. 3 to effect watermark encoding according to one embodiment of the present invention.
[0029] FIG. 6 shows changes to the position of the line of FIG. 3 to effect watermark encoding according to another embodiment of the present invention.
[0030] FIG. 7 is a block diagram of a photocopier according to another embodiment of the invention.
Detailed Description
[0031] Referring to FIG. 2, an illustrative form of the invention employs a grid 10 of imaginary reference points arrayed over a line art image. The spacing between points is 250 μm in the illustrated arrangement, but greater or lesser spacings can of course be used.
[0032] Associated with each grid point is a surrounding region 12, shown in FIG. 3. As described below, the luminosity (or reflectance) of each of these regions 12 is slightly changed to effect the subliminal encoding of binary data.
[0033] Region 12 can take various shapes; the illustrated rounded-rectangular shape is representative only. (The illustrated shape has the advantage of encompassing a fairly large area while introducing fewer visual artifacts than, e.g., square regions.) In other embodiments, squares, rectangles, circles, ellipses, etc., can alternatively be employed.
[0034] FIG. 4 is a magnified view of an excerpt of FIG. 3, showing a line 14 passing through the grid of points. The width of the line, of course, depends on the particular image of which it is a part. The illustrated line is about 25 μm in width; greater or lesser widths can naturally be used.
[0035] In a first embodiment of the invention, shown in FIG. 5, the width of the line is controllably varied so as to change the luminosity of the regions through which it passes. To increase the luminosity (or reflectance), the line is made narrower (i.e. less ink in the region). To decrease the luminosity, the line is made wider (i.e. more ink).
[0036] Whether the luminance in a given region should be increased or decreased depends on the particular watermarking algorithm used. Any algorithm can be used, by changing the luminosity of regions 12 as the algorithm would otherwise change the luminance or colors of pixels in a pixelated image.
[0037] In an exemplary algorithm, the binary data is represented as a sequence of −1s and 1s, instead of 0s and 1s. (The binary data can comprise a single datum, but more typically comprises several. In an illustrative embodiment, the data comprises 100 bits.)
[0038] Each element of the binary data sequence is then multiplied by a corresponding element of a pseudo-random number sequence, comprised of −1s and 1s, to yield an intermediate data signal. Each element of this intermediate data signal is mapped to a corresponding sub-part of the image, such as a region 12. The image in (and optionally around) this region is analyzed to determine its relative capability to conceal embedded'data, and a corresponding scale factor is produced. Exemplary scale factors may range from 0 to 3. The scale factor for the region is then multiplied by the element of the intermediate data signal mapped to the region in order to yield a “tweak” value for the region. In the illustrated case, the resulting tweaks can range from −3 to 3. The luminosity of the region is then adjusted in accordance with the tweak value. A tweak value of −3 may correspond to a −5% change in luminosity; −2 may correspond to −2% change; −1 may correspond to −1% change; 0 may correspond to no change; 1 may correspond to +1% change; 2 may correspond to +2% change, and 3 may correspond to +5% change. (This example follows the basic techniques described in the Real Time Encoder embodiment disclosed in U.S. Pat. No. 5,710,834.)
[0039] In FIG. 5, the watermarking algorithm determined that the luminance of region A should be reduced by a certain percentage, while the luminance of regions C and D should be increased by certain percentages.
[0040] In region A, the luminance is reduced by increasing the line width. In region D, the luminance is increased by reducing the line width; similarly in region C (but to a lesser extent).
[0041] No line passes through region B, so there is no opportunity to change the region's luminance. This is not fatal to the method, however, since the watermarking algorithm redundantly encodes each bit of data in sub-parts spaced throughout the line art image.
[0042] The changes to line widths in regions A and D of FIG. 5 are exaggerated for purposes of illustration. While the illustrated variance is possible, most implementations will modulate the line width 3-50% (increase or decrease).
[0043] (Many watermarking algorithms routinely operate within a signal margin of about +/−1% changes in luminosity to effect encoding. That is, the “noise” added by the encoding amounts to just 1% or so of the underlying signal. Lines typically don't occupy the full area of a region, so a 10% change to line width may only effect a 1% change to region luminosity, etc. Banknotes are different from photographs in that the art need not convey photorealism. Thus, banknotes can be encoded with higher energy than is used in watermarking photographs, provided the result is still aesthetically satisfactory. To illustrate, localized luminance changes on the order of 10% are possible in banknotes, while such a level of watermark energy in photographs would generally be considered unacceptable. In some contexts, localized luminance changes of 20, 30, 50 or even 100% are acceptable.)
[0044] In the illustrated embodiment, the change to line width is a function solely of the tweak to be applied to a single region. Thus, if a line passes through any part of a region to which a tweak of 2% is to be applied, the line width in that region is changed to effect the 2% luminance difference. In variant embodiments, the change in line width is a function of the line's position in the region. In particular, the change in line width is a function of the distance between the region's center grid point and the line's closest approach to that point. If the line passes through the grid point, the full 2% change is effected. At successively greater distances, successively less change is applied. The manner in which the magnitude of the tweak changes as a function of line position within the region can be determined by applying one of various interpolation algorithms, such as the bi-linear, bi-cubic, cubic splines, custom curve, etc.
[0045] In other variant embodiments, the change in line width in a given region is a weighted function of the tweaks for adjoining or surrounding regions. Thus, the line width in one region may be increased or decreased in accordance with a tweak value corresponding to one or more adjoining regions.
[0046] Combinations of the foregoing embodiments can also be employed.
[0047] In the foregoing embodiments, it is sometimes necessary to trade-off the tweak values of adjoining regions. For example, a line may pass along a border between regions, or pass through the point equidistant from four grid points (“equidistant zones”). In such cases, the line may be subject to conflicting tweak values—one region may want to increase the line width, while another may want to decrease the line width. (Or both may want to increase the line width, but differing amounts.) Similarly in cases where the line does not pass through an equidistant zone, but the change in line width is a function of a neighborhood of regions whose tweaks are of different values. Again, known interpolation functions can be employed to determine the weight to be given the tweak from each region in determining what change is to be made to the line width in any given region.
[0048] In the exemplary watermarking algorithm, the average change in luminosity across the image is zero, so no generalized lightening or darkening of the image is apparent. The localized changes in luminosity are so minute in magnitude, and localized in position, that they are essentially invisible (e.g. inconspicuous/subliminal) to human viewers.
[0049] An alternative embodiment is shown in FIG. 6, in which line Position is changed rather than line width.
[0050] In FIG. 6 the original position of the line is shown in dashed form, and the changed position of the line is shown in solid form. To decrease a region's luminosity, the line is moved slightly closer to the center of the grid point; to increase a region's luminosity, the line is moved slightly away. Thus, in region A, the line is moved towards the center grid point, while in region D it is moved away.
[0051] It will be noted that the line on the left edge of region A does not return to its nominal (dashed) position as it exits the region. This is because the region to the left of region A also is to have decreased luminosity. Where possible, it is generally preferable not to return a line to its nominal position, but instead permit shifted lines to remain shifted as they enter adjoining regions. So doing permits a greater net line movement within a region, increasing the embedded signal level.
[0052] Again, the line shifts in FIG. 6 are somewhat exaggerated. More typical line shifts are on the order of 3-50 μm.
[0053] One way to think of the FIG. 6 embodiment is to employ a magnetism analogy. The grid point in the center of each region can be thought of as a magnet. It either attracts or repels lines. A tweak value of −3, for example, may correspond to a strong-valued attraction force; a tweak value of +2 may correspond to a middle-valued repulsion force, etc. In FIG. 6, the grid point in region A exhibits an attraction force (i.e. a negative tweak value), and the grid point in region D exhibits a repulsion force (e.g. a positive tweak value).
[0054] The magnetic analogy is useful because the magnetic effect exerted on a line depends on the distance between the line and the grid point. Thus, a line passing near a grid point is shifted more in position than a line near the periphery of the region.
[0055] Each of the variants discussed above in connection with FIG. 5 is likewise applicable to FIG. 6.
[0056] Combinations of the embodiments of FIGS. 5 and 6 can of course be used, resulting in increased watermark energy, better signal-to-noise ratio and, in many cases, less noticeable changes.
[0057] In still a further embodiment, the luminance in each region is changed while leaving the line unchanged. This can be effected by sprinkling tiny dots of ink in the otherwise-vacant parts of the region. In high quality printing, of the type used with banknotes, droplets on the order of 3 μm in diameter can be deposited. (Still larger droplets are still beyond the perception threshold for most viewers.) Speckling a region with such droplets (either in a regular array, or random, or according to a desired profile such as Gaussian), can readily effect a 1% or so change in luminosity. (Usually dark droplets are added to a region, effecting a decrease in luminosity. Increases in luminosity can be effected by speckling with a light colored ink, or by forming light voids in line art otherwise present in a region.)
[0058] In a variant of the speckling technique, very thin mesh lines can be inserted in the artwork—again to slightly change the luminance of one or more regions.
[0059] Although not previously mentioned, it is contemplated that the banknote will include some manner of calibration information to facilitate registration of the image for decoding. This calibration information can be steganographic or overt. Several techniques for steganographically embedding calibration information are disclosed in my prior patents and applications. Other techniques can be found in others of the cited work.
[0060] To decode watermark data, the encoded line art image must be converted into electronic form for analysis. This conversion is typically performed by a scanner.
[0061] Scanners are well known, so a detailed description is not provided here. Suffice it to say that scanners conventionally employ a line of closely spaced photodetector cells that produce signals related to the amount of the light reflected from successive swaths of the image. Most inexpensive consumer scanners have a resolution of 300 dots per inch (dpi), or a center to center spacing of component photodetectors of about 84 μm. Higher quality scanners of the sort found in most professional imaging equipment and photocopiers have resolutions of 600 dpi (42 μm), 1200 dpi (21 μm), or better.
[0062] Taking the example of a 300 dpi scanner (84 μm photodetector spacing), each 250 μm region 12 on the banknote will correspond to about 3×3 array of photodetector samples. Naturally, only in rare instances will a given region be physically registered with the scanner so that nine photodetector samples capture the luminance in that region, and nothing else. More commonly, the line art is skewed with respect to the scanner photodetectors, or is longitudinally misaligned (i.e. some photodetectors image sub-parts of two adjoining regions). However, since the scanner oversamples the regions, the luminance of each region can unambiguously be determined.
[0063] In one embodiment, the scanned data from the line art is collected in a two dimensional array and processed—according to one of the techniques disclosed in my prior patents and applications—to detect the embedded calibration information. The array is then processed to effect a virtual re-registration of the image data. A software program then analyzes the statistics of the re-registered data (using the techniques disclosed in my prior writings) to extract the bits of the embedded data.
[0064] (Again, the reference to my earlier watermark decoding techniques is exemplary only. Once scanning begins and the data is available in pixel form, it is straightforward to apply any other watermark decoding technique to extract a correspondingly-encoded watermark.)
[0065] In a variant embodiment, the scanned data is not assembled in a complete array prior to the processing. Instead, it is processed in real-time, as it is generated, in order to detect embedded watermark data without delay. (Depending on the parameters of the scanner, it may be necessary to scan a half-inch or so of the line art image before the statistics of the resulting data unambiguously indicate the presence of a watermark.)
[0066] In accordance with another aspect of the invention, various hardware devices are provided with the capability to recognize embedded watermark data in any line art images they process, and to respond accordingly.
[0067] One example is a color photocopier. Such devices employ a color scanner to generate sampled (pixel) data corresponding to an input media (e.g. a dollar bill). If watermark data associated with a banknote is detected, the photocopier can take one or more steps.
[0068] One option is simply to interrupt copying, and display a message reminding the operator that it is illegal to reproduce currency.
[0069] Another option is to dial a remote service and report the attempted reproduction of a banknote. Photocopiers with dial-out capabilities are known in the art, (e.g. U.S. Pat. No. 5,305,199) and are readily adapted to this purpose. The remote service can be an independent service, or can be a government agency.
[0070] Yet another option is to permit the copying, but to insert forensic tracer data in the resultant copy. This tracer data can take various forms. Steganographically encoded binary data is one example. An example is shown in U.S. Pat. No. 5,568,268. The tracer data can memorialize the serial number of the machine that made the copy and/or the date and time the copy was made. To address privacy concerns, such tracer data is not normally inserted in photocopied output, but is so inserted only when the subject being photocopied is detected as being a banknote. (Such an arrangement is shown in FIG. 7.)
[0071] Desirably, the scan data is analyzed on a line-by-line basis in order to identify illicit photocopying with a minimum of delay. If a banknote is scanned, one or more lines of scanner output data may be provided to the photocopier's reprographic unit before the banknote detection decision has been made. In this case the photocopy will have two regions: a first region that is not tracer-marked, and a second, subsequent region in which the tracer data has been inserted.
[0072] Photocopiers with other means to detect not-to-be-copied documents are known in the art, and employ various response strategies. Examples are detailed in U.S. Pat. Nos. 5,583,614, 4,723,149, 5,633,952, 5,640,467, and 5,424,807.
[0073] Another hardware device that can employ the foregoing principles is a standalone scanner. A programmed processor (or dedicated hardware) inside the scanner analyzes the data being generated by the device, and responds accordingly.
[0074] Yet another hardware device that can employ the foregoing principles is a printer. A processor inside the device analyzes graphical image data to be printed, looking for watermarks associated with banknotes.
[0075] For both the scanner and printer devices, response strategies can include disabling operation, or inserting tracer information. (Such devices typically do not have dial-out capabilities.)
[0076] Again, it is desirable to process the scanner or printer data as it becomes available, so as to detect any banknote processing with a minimum of delay. Again, there will be some lag time before a detection decision is made. Accordingly, the scanner or printer output will be comprised of two parts, one without the tracer data, and another with the tracer data.
[0077] Banknotes presently include various visible structures that can be used as aids in banknote detection (e.g. the seal of the issuing central bank, and various geometrical markings). In accordance with a further aspect of the present invention, a banknote is analyzed by an integrated system that considers both the visible structures and watermark-embedded data.
[0078] Visible banknote structures can be sensed using known pattern recognition techniques. Examples of such techniques are disclosed in U.S. Pat. Nos. 5,321,773, 5,390,259, 5,533,144, 5,539,841, 5,583,614, 5,633,952, 4,723,149 and 5,424,807 and laid-open foreign application EP 766,449.
[0079] In photocopiers (and the like) equipped to detect both visible and watermarked banknote markings, the detection of either causes one or more of the above-noted banknote responses to be initiated.
[0080] Again, scanners and printers can be equipped with a similar capability—analyzing the data for either of these banknote hallmarks. If either is detected, the software (or hardware) responds accordingly.
[0081] Identification of banknotes by watermark data provides an important advantage over recognition by visible structures—it cannot so easily be defeated. A banknote can be doctored (e.g. by white-out, scissors, or less crude techniques) to remove/obliterate the visible structures. Such a document can then be freely copied on either a visible structure-sensing photocopier or scanner/printer installation. The removed visible structure can then be added in via a second printing/photocopying operation. If the printer is not equipped with banknote-disabling capabilities, image-editing tools can be used to insert visible structures back into image data sets scanned from such doctored bills, and the complete bill freely printed. By additionally including embedded watermark data in the banknote, and sensing same, such ruses will not succeed.
[0082] (A similar ruse is to scan a banknote image on a non-banknote-sensing scanner. The resulting image set can then be edited by conventional image editing tools to remove/obliterate the visible structures. Such a data set can then be printed—even on a printer/photocopier that examines such data for the presence of visible structures. Again, the missing visible structures can be inserted by a subsequent printing/photocopying operation.)
[0083] Desirably, the visible structure detector and the watermark detector are integrated together as a single hardware and/or software tool. This arrangement provides various economies, e.g., in interfacing with the scanner, manipulating pixel data sets for pattern recognition and watermark extraction, electronically re-registering the image to facilitate pattern recognition/watermark extraction, issuing control signals (e.g. disabling) signals to the photocopier/scanner, etc.
[0084] (To provide a comprehensive disclosure without unduly lengthening the following specification, applicants incorporate by reference the patent documents cited above.)
[0085] From the foregoing, it will be recognized that embodiments according to the present invention allow line art images to serve as subliminal carriers for binary data. Additionally, existing deterrents to banknote counterfeiting have been enhanced to prevent common work-arounds.
[0086] Having described and illustrated the principles of my invention with reference to several illustrative embodiments, it will be recognized that these embodiments are exemplary only and should not be taken as limiting the scope of my invention. Guided by the foregoing teachings, it should be apparent that other watermarking, decoding, and anti-counterfeiting technologies can be substituted for, and/or combined with, the elements detailed above to yield similar effects.
[0087] While the invention has been described with reference to embodiments employing regular rectangular arrays of grid points, those skilled in the art will recognize that other arrays of points—neither rectangular nor regular—can alternatively be used.
[0088] While the invention has been described with reference to embodiments that scale the embedded energy in accordance with local image characteristics, in other embodiments a manually crafted energy profile can be implemented. That is, a mask defining embedded signal magnitudes at different parts of the image can be manually devised, and employed to tailor the change in luminance in each region.
[0089] In view of the many possible embodiments to which the principles of the invention may be put, it should be recognized that the detailed embodiments are illustrative only and should not be taken as limiting the scope of my invention. Rather, I claim as my invention all such embodiments as may come within the scope and spirit of the following claims and equivalents thereto.
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
[Inline image omitted. See PDF.]
Claims
I claim:
1. A banknote having a watermarked line art image formed thereon, the image formed according to a method of watermarking a line art image to convey auxiliary data, the line art image including at least one line art element having a contour, the method being characterized by spatially shifting the location of said contour to effect a change in luminosity of at least one image region through which the element passes, the auxiliary data being detectable through the luminosity change.
2. A method of watermarking an image to convey auxiliary data, the image including at least one image region, the image region including at least one element, the method being characterized by providing ink droplets in the region while leaving spacing or dimensions of the element otherwise unchanged, the provided ink droplets changing the luminance in the region to convey the auxiliary data, and wherein the ink droplets include a diameter of approximately 3 μm.
3. A method of watermarking an image to convey auxiliary data, the image including at least one image region, the image region including at least one element, the method being characterized by providing ink droplets in the region while leaving spacing or dimensions of the element otherwise unchanged, the provided ink droplets changing the luminance in the region to convey the auxiliary data, and wherein the ink droplets are provided as a Gaussian profile.
4. A method of watermarking an image to convey auxiliary data, the image including at least one image region, the image region including at least one element, the method being characterized by providing ink droplets in the region while leaving spacing or dimensions of the element otherwise unchanged, the provided ink droplets changing the luminance in the region to convey the auxiliary data, and wherein relatively dark colored ink droplets are provided to the region to decrease the luminosity in the region.
5. A method of watermarking an image to convey auxiliary data, the image including at least one image region, the image region including at least one element, the method being characterized by providing ink droplets in the region while leaving spacing or dimensions of the element otherwise unchanged, the provided ink droplets changing the luminance in the region to convey the auxiliary data, and wherein relatively light colored ink droplets are provided to the region to increase the luminosity in the region.
6. A method of generating a machine readable code for a printed document to convey auxiliary data, the printed document to include at least one region, the region to include two dimensional pattern of line structures, the method being characterized by:
providing an overt structure for geometric registration;
generating auxiliary data comprising message values;
mapping the message values so as to be conveyed through the two dimensional pattern of line structures; and
repeating the auxiliary data in the two dimensional pattern of line structures, wherein the repeated auxiliary data is represented differently in the two dimensional pattern of line structures according to an independent code signal.
7. The method of claim 6, wherein the code signal comprises a key.
8. The method of claim 7, wherein the document comprises a check.
9. The method of claim 7, wherein the document comprises a security document.
10. The method of claim 7, wherein the document comprises an identification document.
11. The method of claim 7, wherein the document comprises a passport.
12. The method of claim 7, further comprising printing the document so as to include the machine readable code.
13. The method of claim 6, further comprising printing the machine readable code on the document.
14. The method of claim 13, wherein the document comprises a check.
15. The method of claim 13, wherein the document comprises a banknote.
16. The method of claim 13, wherein the document comprises a passport.
17. The method of claim 13, wherein the document comprises a security document.
18. The method of claim 13, wherein the document comprises an identification document.
19. A document having a machine-readable code produced in accordance with claim 6 formed thereon.
20. A method comprising printing a document that includes a machine-readable code generated in accordance with claim 6.
21. The method of claim 6, wherein the machine readable code is steganographic.
22. The method of claim 21, wherein the steganographic machine readable code comprises a digital watermark.
23. A method comprising: receiving scan data corresponding to a document that includes a machine-readable code generated in accordance with claim 6, and decoding the scan data to obtain the auxiliary data.
24. The method of claim 23, wherein the scan data is obtained through visible light scanning of the document.
25. The method of claim 6, wherein the message values comprise plural bits.
26. The method of claim 6, wherein the code signal comprises a spreading signal.
27. The method of claim 6, wherein the code signal comprises a cryptographic key.
28. The method of claim 6, wherein the repeated auxiliary data, which is represented differently in the two dimensional pattern of line structures according to an independent code signal, comprises tiling of the auxiliary data in the two dimensional pattern of line structures.
29. The method of claim 6 further comprising error correcting the message values.
30. A method of generating a machine readable code for a check, the machine readable code conveying auxiliary data, the check to include at least one region, the one region to include a two dimensional pattern of line structures, said method comprising steps of:
providing a visible structure for geometric registration;
generating auxiliary data comprising message values;
mapping the message values so as to be conveyed through the two dimensional pattern of line structures; and
repeating the auxiliary data in the two dimensional pattern of line structures, wherein the repeated auxiliary data is represented differently in the two dimensional pattern of line structures according to a key.
31. The method of claim 30, further comprising printing the machine readable code on the check.
32. A check having a machine-readable code produced in accordance with claim 30 formed thereon.
33. A method comprising printing a check that includes a machine-readable code generated in accordance with claim 30.
34. The method of claim 30, wherein the machine readable code is steganographic.
35. The method of claim 34, wherein the steganographic machine readable code comprises a digital watermark.
36. A method comprising: receiving scan data corresponding to a check that includes a machine-readable code generated in accordance with claim 30, and decoding the scan data to obtain the auxiliary data.
37. The method of claim 36, wherein the scan data is obtained through visible light scanning of the check.
38. The method of claim 30, wherein the message values comprise plural bits.
39. The method of claim 30 further comprising error correcting the message values.
40. A method comprising:
receiving artwork including a machine readable code, the artwork characterized by:
an overt structure for geometric registration; and
a two-dimensional pattern of line structures, wherein the machine readable code comprises auxiliary data, and wherein the auxiliary data is mapped so as to be conveyed through the two dimensional pattern of line structures, the auxiliary data being repeated in the two dimensional pattern of line structures, but represented differently in the two dimensional pattern of line structures according to a key; and
printing a document in accordance with the received artwork.
41. The method of claim 40 wherein the auxiliary data comprises error correction coding.
42. The method of claim 40, wherein the key comprises a cryptographic key.
43. The method of claim 40, wherein the auxiliary data comprises plural bits.
44. The method of claim 40, wherein the machine readable code is steganographic.
45. The method of claim 44, wherein the steganographic machine readable code comprises a digital watermark.
46. A method comprising: receiving scan data corresponding to the document printed according to claim 40, and decoding the scan data to obtain the auxiliary data.
47. The method of claim 46, wherein the scan data is obtained through visible light scanning of the document.
48. The method of claim 40, wherein the document comprises a check.
49. The method of claim 40, wherein the document comprises a banknote.
50. The method of claim 40, wherein the document comprises a passport.
51. The method of claim 40, wherein the document comprises a security document.
52. The method of claim 40, wherein the document comprises an identification document.
Patent Citations (290)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US1002600(A) | 1911-09-01 | Morris et al. | Applicant |
| US2630525(A) | 1953-03-01 | Tomberlin et al. | Applicant |
| US2881244(A) | 1959-04-01 | Pawley et al. | Applicant |
| US3004104(A) | 1961-10-01 | Hembrooke | Applicant |
| US3406344(A) | 1968-10-01 | Hopper | Applicant |
| US3583237(A) | 1971-06-01 | Bayha | Applicant |
| US3638188(A) | 1972-01-01 | Pincoffs et al. | Applicant |
| US3805286(A) | 1974-04-01 | Kavanagh et al. | Applicant |
| US3845391(A) | 1974-10-01 | Crosby | Applicant |
| US3885217(A) | 1975-05-01 | Cintron | Applicant |
| US3894190(A) | 1975-07-01 | Gassmann | Applicant |
| US3900890(A) | 1975-08-01 | Eibner | Applicant |
| US3937565(A) | 1976-02-01 | Alasia | Applicant |
| US3969830(A) | 1976-07-01 | Grasham | Applicant |
| US3977785(A) | 1976-08-01 | Harris | Applicant |
| US4048619(A) | 1977-09-01 | Forman, Jr. et al. | Applicant |
| US4079419(A) | 1978-03-01 | Siegle et al. | Applicant |
| US4086634(A) | 1978-04-01 | Cook | Applicant |
| US4122501(A) | 1978-10-01 | Sordello et al. | Applicant |
| US4184700(A) | 1980-01-01 | Greenaway | Applicant |
| US4237484(A) | 1980-12-01 | Brown et al. | Applicant |
| US4245346(A) | 1981-01-01 | Grady et al. | Applicant |
| US4268983(A) | 1981-05-01 | Cook | Applicant |
| US4307899(A) | 1981-12-01 | Hoppe | Applicant |
| US4310180(A) | 1982-01-01 | Mowry, Jr. et al. | Applicant |
| US4323921(A) | 1982-04-01 | Guillou | Applicant |
| US4337483(A) | 1982-06-01 | Guillou | Applicant |
| US4351547(A) | 1982-09-01 | Brooks, II | Applicant |
| US4425661(A) | 1984-01-01 | Moses et al. | Applicant |
| US4437935(A) | 1984-03-01 | Crane, Jr. | Applicant |
| US4495620(A) | 1985-01-01 | Steele et al. | Applicant |
| US4504084(A) | 1985-03-01 | Jauch | Applicant |
| US4512013(A) | 1985-04-01 | Nash et al. | Applicant |
| US4523311(A) | 1985-06-01 | Lee et al. | Applicant |
| US4534398(A) | 1985-08-01 | Crane | Applicant |
| US4552617(A) | 1985-11-01 | Crane | Applicant |
| US4574190(A) | 1986-03-01 | Nishimura | Applicant |
| US4588212(A) | 1986-05-01 | Castagnoli | Applicant |
| US4593389(A) | 1986-06-01 | Wurzburg et al. | Applicant |
| US4644422(A) | 1987-02-01 | Bedini | Applicant |
| US4652015(A) | 1987-03-01 | Crane | Applicant |
| US4660859(A) | 1987-04-01 | Natesh | Examiner |
| US4672605(A) | 1987-06-01 | Hustig et al. | Applicant |
| US4677466(A) | 1987-06-01 | Lert, Jr. et al. | Applicant |
| US4678322(A) | 1987-07-01 | Finkel et al. | Applicant |
| US4679154(A) | 1987-07-01 | Blanford | Applicant |
| US4697209(A) | 1987-09-01 | Kiewit et al. | Applicant |
| US4723149(A) | 1988-02-01 | Harada | Applicant |
| US4750173(A) | 1988-06-01 | Blüthgen | Applicant |
| US4761205(A) | 1988-08-01 | Crane | Applicant |
| US4777529(A) | 1988-10-01 | Schultz et al. | Applicant |
| US4780397(A) | 1988-10-01 | Tsuchiya | Applicant |
| US4791449(A) | 1988-12-01 | Foley et al. | Applicant |
| US4885757(A) | 1989-12-01 | Provence | Applicant |
| US4914700(A) | 1990-04-01 | Alasia | Applicant |
| US4920503(A) | 1990-04-01 | Cook | Applicant |
| US4941687(A) | 1990-07-01 | Crane | Applicant |
| US4943093(A) | 1990-07-01 | Melling et al. | Applicant |
| US4945412(A) | 1990-07-01 | Kramer | Applicant |
| US4949381(A) | 1990-08-01 | Pastor | Applicant |
| US4965680(A) | 1990-10-01 | Endoh | Applicant |
| US4980782(A) | 1990-12-01 | Ginkel | Applicant |
| US4993068(A) | 1991-02-01 | Piosenka et al. | Applicant |
| US5018767(A) | 1991-05-01 | Wicker | Applicant |
| US5021318(A) | 1991-06-01 | Mayo et al. | Applicant |
| US5040059(A) | 1991-08-01 | Leberl | Applicant |
| US5068008(A) | 1991-11-01 | Crane | Applicant |
| US5073925(A) | 1991-12-01 | Nagata et al. | Applicant |
| US5083224(A) | 1992-01-01 | Hoogendoorn et al. | Applicant |
| US5087507(A) | 1992-02-01 | Heinzer | Applicant |
| US5091966(A) | 1992-02-01 | Bloomberg et al. | Applicant |
| US5093867(A) | 1992-03-01 | Hori et al. | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5113445(A) | 1992-05-01 | Wang | Applicant |
| US5128525(A) | 1992-07-01 | Stearns et al. | Applicant |
| US5134496(A) | 1992-07-01 | Schwab et al. | Applicant |
| US5136436(A) | 1992-08-01 | Kahlman | Applicant |
| US5144658(A) | 1992-09-01 | Takahashi | Applicant |
| US5146457(A) | 1992-09-01 | Veldhuis et al. | Applicant |
| US5157726(A) | 1992-10-01 | Merkle et al. | Applicant |
| US5168147(A) | 1992-12-01 | Bloomberg | Applicant |
| US5178418(A) | 1993-01-01 | Merry et al. | Applicant |
| US5193853(A) | 1993-03-01 | Wicker | Applicant |
| US5208630(A) | 1993-05-01 | Goodbrand et al. | Applicant |
| US5216724(A) | 1993-06-01 | Suzuki et al. | Applicant |
| US5221833(A) | 1993-06-01 | Hecht | Applicant |
| US5231663(A) | 1993-07-01 | Earl et al. | Applicant |
| US5243411(A) | 1993-09-01 | Shirochi et al. | Applicant |
| US5245165(A) | 1993-09-01 | Zhang | Applicant |
| US5254196(A) | 1993-10-01 | Abowitz et al. | Applicant |
| US5258998(A) | 1993-11-01 | Koide | Applicant |
| US5262860(A) | 1993-11-01 | Fitzpatrick et al. | Applicant |
| US5278400(A) | 1994-01-01 | Appel | Applicant |
| US5285498(A) | 1994-02-01 | Johnston | Applicant |
| US5287407(A) | 1994-02-01 | Holmes | Applicant |
| US5291243(A) | 1994-03-01 | Heckman et al. | Applicant |
| US5301257(A) | 1994-04-01 | Tani | Applicant |
| US5310222(A) | 1994-05-01 | Chatwin et al. | Applicant |
| US5315448(A) | 1994-05-01 | Ryan | Applicant |
| US5319475(A) | 1994-06-01 | Kay et al. | Applicant |
| US5319735(A) | 1994-06-01 | Preuss et al. | Applicant |
| US5321470(A) | 1994-06-01 | Hasuo et al. | Applicant |
| US5321773(A) | 1994-06-01 | Kopec et al. | Applicant |
| US5335277(A) | 1994-08-01 | Harvey et al. | Applicant |
| US5335312(A) | 1994-08-01 | Mekata et al. | Applicant |
| US5336871(A) | 1994-08-01 | Colgate, Jr. | Applicant |
| US5337361(A) | 1994-08-01 | Wang et al. | Applicant |
| US5365586(A) | 1994-11-01 | Indeck et al. | Applicant |
| US5367319(A) | 1994-11-01 | Graham | Applicant |
| US5369261(A) | 1994-11-01 | Shamir | Applicant |
| US5374976(A) | 1994-12-01 | Spannenburg | Examiner |
| US5375886(A) | 1994-12-01 | Tsuchiya | Applicant |
| US5379093(A) | 1995-01-01 | Hashimoto et al. | Applicant |
| US5385371(A) | 1995-01-01 | Izawa | Applicant |
| US5385803(A) | 1995-01-01 | Duff et al. | Applicant |
| US5390003(A) | 1995-02-01 | Yamaguchi et al. | Applicant |
| US5390185(A) | 1995-02-01 | Hooijmans et al. | Applicant |
| US5390259(A) | 1995-02-01 | Withgott et al. | Applicant |
| US5408258(A) | 1995-04-01 | Kolessar | Applicant |
| US5408505(A) | 1995-04-01 | Indeck et al. | Applicant |
| US5412718(A) | 1995-05-01 | Narasimhalu et al. | Applicant |
| US5412731(A) | 1995-05-01 | Desper | Applicant |
| US5416307(A) | 1995-05-01 | Danek et al. | Applicant |
| US5424807(A) | 1995-06-01 | Ohmura | Applicant |
| US5426710(A) | 1995-06-01 | Suzuki et al. | Applicant |
| US5428598(A) | 1995-06-01 | Veldhuis et al. | Applicant |
| US5434649(A) | 1995-07-01 | Hasuo et al. | Applicant |
| US5436653(A) | 1995-07-01 | Ellis et al. | Applicant |
| US5437897(A) | 1995-08-01 | Tanaka et al. | Applicant |
| US5444779(A) | 1995-08-01 | Daniele | Applicant |
| US5449895(A) | 1995-09-01 | Hecht et al. | Applicant |
| US5449896(A) | 1995-09-01 | Hecht et al. | Applicant |
| US5450489(A) | 1995-09-01 | Ostrover et al. | Applicant |
| US5453968(A) | 1995-09-01 | Veldhuis et al. | Applicant |
| US5457807(A) | 1995-10-01 | Weinblatt | Applicant |
| US5467169(A) | 1995-11-01 | Morikawa | Applicant |
| US5469222(A) | 1995-11-01 | Sprague | Applicant |
| US5481334(A) | 1996-01-01 | Arimoto et al. | Applicant |
| US5483276(A) | 1996-01-01 | Brooks et al. | Applicant |
| US5493677(A) | 1996-02-01 | Balogh et al. | Applicant |
| US5495282(A) | 1996-02-01 | Mostafa et al. | Applicant |
| US5495581(A) | 1996-02-01 | Tsai | Applicant |
| US5500856(A) | 1996-03-01 | Nagase et al. | Applicant |
| US5504322(A) | 1996-04-01 | Pavlidis et al. | Applicant |
| US5510900(A) | 1996-04-01 | Shirochi et al. | Applicant |
| US5513260(A) | 1996-04-01 | Ryan | Applicant |
| US5515451(A) | 1996-05-01 | Tsuji et al. | Applicant |
| US5521372(A) | 1996-05-01 | Hecht et al. | Applicant |
| US5524933(A) | 1996-06-01 | Kunt et al. | Applicant |
| US5526427(A) | 1996-06-01 | Thomas et al. | Applicant |
| US5530751(A) | 1996-06-01 | Morris | Applicant |
| US5537216(A) | 1996-07-01 | Yamashita et al. | Applicant |
| US5537223(A) | 1996-07-01 | Curry | Applicant |
| US5550932(A) | 1996-08-01 | Blaylock et al. | Examiner |
| US5568268(A) | 1996-10-01 | Tsuji et al. | Applicant |
| US5568550(A) | 1996-10-01 | Ur | Applicant |
| US5572010(A) | 1996-11-01 | Petrie | Examiner |
| US5574787(A) | 1996-11-01 | Ryan | Applicant |
| US5574962(A) | 1996-11-01 | Fardeau et al. | Applicant |
| US5581658(A) | 1996-12-01 | O'Hagan et al. | Applicant |
| US5581800(A) | 1996-12-01 | Fardeau et al. | Applicant |
| US5582103(A) | 1996-12-01 | Tanaka et al. | Applicant |
| US5583614(A) | 1996-12-01 | Hasuo et al. | Applicant |
| US5587743(A) | 1996-12-01 | Montgomery et al. | Applicant |
| US5611575(A) | 1997-03-01 | Petrie | Examiner |
| US5612943(A) | 1997-03-01 | Moses et al. | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5617119(A) | 1997-04-01 | Briggs et al. | Applicant |
| US5627655(A) | 1997-05-01 | Okamoto et al. | Applicant |
| US5629770(A) | 1997-05-01 | Brassil et al. | Examiner |
| US5629980(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5636292(A) | 1997-06-01 | Rhoads | Applicant |
| US5646997(A) | 1997-07-01 | Barton | Applicant |
| US5649054(A) | 1997-07-01 | Oomen et al. | Applicant |
| US5652626(A) | 1997-07-01 | Kawakami et al. | Applicant |
| US5659726(A) | 1997-08-01 | Sandford, II et al. | Applicant |
| US5663766(A) | 1997-09-01 | Sizer, II | Applicant |
| US5671277(A) | 1997-09-01 | Ikenoue et al. | Applicant |
| US5689620(A) | 1997-11-01 | Kopec et al. | Applicant |
| US5710834(A) | 1998-01-01 | Rhoads | Applicant |
| US5712920(A) | 1998-01-01 | Spille | Applicant |
| US5721788(A) | 1998-02-01 | Powell et al. | Applicant |
| US5737025(A) | 1998-04-01 | Dougherty et al. | Applicant |
| US5739864(A) | 1998-04-01 | Copeland | Applicant |
| US5745604(A) | 1998-04-01 | Rhoads | Applicant |
| US5748763(A) | 1998-05-01 | Rhoads | Applicant |
| US5748783(A) | 1998-05-01 | Rhoads | Applicant |
| US5764763(A) | 1998-06-01 | Jensen et al. | Applicant |
| US5768426(A) | 1998-06-01 | Rhoads | Applicant |
| US5772249(A) | 1998-06-01 | Guex et al. | Applicant |
| US5772250(A) | 1998-06-01 | Gasper | Examiner |
| US5774452(A) | 1998-06-01 | Wolosewicz | Applicant |
| US5778102(A) | 1998-07-01 | Sandford, II et al. | Applicant |
| US5790932(A) | 1998-08-01 | Komaki et al. | Applicant |
| US5832119(A) | 1998-11-01 | Rhoads | Applicant |
| US5838814(A) | 1998-11-01 | Moore | Examiner |
| US5843564(A) | 1998-12-01 | Gasper et al. | Examiner |
| US5850481(A) | 1998-12-01 | Rhoads | Applicant |
| US5857038(A) | 1999-01-01 | Owada et al. | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5864623(A) | 1999-01-01 | Messina et al. | Applicant |
| US5872589(A) | 1999-02-01 | Morales | Applicant |
| US5893101(A) | 1999-04-01 | Balogh et al. | Applicant |
| US5907443(A) | 1999-05-01 | Hirata | Applicant |
| US5919730(A) | 1999-07-01 | Gasper et al. | Examiner |
| US5949903(A) | 1999-09-01 | Outa et al. | Applicant |
| US5951055(A) | 1999-09-01 | Mowry, Jr. | Applicant |
| US5960151(A) | 1999-09-01 | Takahashi | Applicant |
| US5982956(A) | 1999-11-01 | Lahmi | Applicant |
| US5991500(A) | 1999-11-01 | Kanota et al. | Applicant |
| US6024287(A) | 2000-02-01 | Takai et al. | Applicant |
| US6076738(A) | 2000-06-01 | Bloomberg et al. | Applicant |
| US6081345(A) | 2000-06-01 | Curry | Examiner |
| US6086706(A) | 2000-07-01 | Brassil et al. | Examiner |
| US6104812(A) | 2000-08-01 | Koltai et al. | Examiner |
| US6111954(A) | 2000-08-01 | Rhoads | Applicant |
| US6122392(A) | 2000-09-01 | Rhoads | Applicant |
| US6148091(A) | 2000-11-01 | DiMaria | Applicant |
| US6185683(B1) | 2001-02-01 | Ginter et al. | Applicant |
| US6198832(B1) | 2001-03-01 | Maes et al. | Applicant |
| US6201881(B1) | 2001-03-01 | Masuda et al. | Applicant |
| US6243480(B1) | 2001-06-01 | Zhao et al. | Applicant |
| US6307949(B1) | 2001-10-01 | Rhoads | Applicant |
| US6325420(B1) | 2001-12-01 | Zhang et al. | Applicant |
| US6343138(B1) | 2002-01-01 | Rhoads | Applicant |
| US6345104(B1) | 2002-02-01 | Rhoads | Applicant |
| US6351815(B1) | 2002-02-01 | Adams | Applicant |
| US6353672(B1) | 2002-03-01 | Rhoads | Applicant |
| US6363159(B1) | 2002-03-01 | Rhoads | Applicant |
| US6389151(B1) | 2002-05-01 | Carr et al. | Applicant |
| US6427020(B1) | 2002-07-01 | Rhoads | Applicant |
| US6449377(B1) | 2002-09-01 | Rhoads | Examiner |
| US6463416(B1) | 2002-10-01 | Messina | Applicant |
| US6522771(B2) | 2003-02-01 | Rhoads | Applicant |
| US6539095(B1) | 2003-03-01 | Rhoads | Applicant |
| US6542620(B1) | 2003-04-01 | Rhoads | Applicant |
| US6546112(B1) | 2003-04-01 | Rhoads | Applicant |
| US6567534(B1) | 2003-05-01 | Rhoads | Applicant |
| US6580819(B1) | 2003-06-01 | Rhoads | Applicant |
| US2001/0002931(A1) | 2001-06-01 | Maes et al. | Applicant |
| US2001/0020270(A1) | 2001-09-01 | Yeung et al. | Applicant |
| US2001/0053237(A1) | 2001-12-01 | Hashimoto | Applicant |
| US2001/0056410(A1) | 2001-12-01 | Ishigaki | Applicant |
| US2002/0021825(A1) | 2002-02-01 | Rhoads | Applicant |
| US2002/0054680(A1) | 2002-05-01 | Huang et al. | Applicant |
| US2002/0061121(A1) | 2002-05-01 | Rhoads et al. | Applicant |
| US2002/0064759(A1) | 2002-05-01 | Durbin et al. | Applicant |
| US2002/0065781(A1) | 2002-05-01 | Hillegass et al. | Applicant |
| US2002/0101597(A1) | 2002-08-01 | Hoover | Applicant |
| US2002/0116509(A1) | 2002-08-01 | DeLaHerga | Applicant |
| US2002/0122568(A1) | 2002-09-01 | Zhao | Applicant |
| DE2943436(A1) | 1981-05-01 | Applicant | |
| DE2943436(A1) | 1981-05-01 | Examiner | |
| EP234885(B1) | 1991-04-01 | Applicant | |
| EP319524(B1) | 1994-06-01 | Applicant | |
| EP178132(B2) | 1994-08-01 | Applicant | |
| EP418964(B1) | 1995-02-01 | Applicant | |
| EP366381(B1) | 1995-03-01 | Applicant | |
| EP651554(A1) | 1995-05-01 | Applicant | |
| EP664642(A2) | 1995-07-01 | Applicant | |
| EP493053(B1) | 1996-05-01 | Applicant | |
| EP691632(B1) | 1998-10-01 | Applicant | |
| EP469864(B1) | 1999-01-01 | Applicant | |
| EP617545(B1) | 1999-01-01 | Applicant | |
| EP690595(B1) | 1999-02-01 | Applicant | |
| EP642060(B1) | 1999-04-01 | Applicant | |
| EP772843(B1) | 1999-05-01 | Applicant | |
| EP991047(A2) | 2000-04-01 | Applicant | |
| GB2346110(A) | 2000-08-01 | Applicant | |
| JP3-185585(A) | 1991-08-01 | Applicant | |
| JP4-248771(A) | 1992-09-01 | Applicant | |
| JP8-030759(A) | 1996-02-01 | Applicant | |
| WO91/19614(A1) | 1991-12-01 | Applicant | |
| WO95/10813(A1) | 1995-04-01 | Applicant | |
| WO95/14289(A2) | 1995-05-01 | Applicant | |
| WO95/26274(A1) | 1995-10-01 | Examiner | |
| WO96/25005(A1) | 1996-08-01 | Applicant | |
| WO96/27264(A1) | 1996-09-01 | Applicant | |
| WO96/36163(A2) | 1996-11-01 | Applicant | |
| WO96/36935(A1) | 1996-11-01 | Applicant | |
| WO96/42151(A2) | 1996-12-01 | Applicant | |
| WO97/02522(A1) | 1997-01-01 | Applicant | |
| WO99/85819(A1) | 1999-07-01 | Applicant | |
| WO/62258(A1) | 2000-10-01 | Applicant | |
| WO2/03328(A1) | 2002-01-01 | Applicant | |
| WO2/065381(A1) | 2002-08-01 | Applicant | |
| WO2/065382(A1) | 2002-08-01 | Applicant | |
| WO2/065383(A1) | 2002-08-01 | Applicant | |
| WO2/065384(A1) | 2002-08-01 | Applicant | |
| WO2/065385(A1) | 2002-08-01 | Applicant |
Non-Patent Literature (42)
- Brassil et al., “Electronic Marking and Identification Techniques to Discourage Document Copying,” IEEE Proc. Infocom'94, Jun. 1994, pp. 1278-1287.Applicant
- Maxemchuk, “Electronic Document Distribution,” AT&T Tech. J., Sep. 1994, pp. 73-80.Applicant
- Brassil et al., “Marking Text Features of Document Images to Deter Illicit Dissemination,” IEEE Proc. Int. Conf. on Pattern Recognition, vol. 2, Oct. 1994, pp. 315-319.Applicant
- Low et al., “Document Marking and Identification using Both Line and Word Shifting,” IEE Proc. Infocom'95, Apr. 1995, pp. 853-860.Applicant
- Gruhl et al. “Information Hiding to Foil the Casual Counterfeiter,” Proc. 2nd Int'l Workshop on Information Hiding, Apr. 14-17, 1998, pp. 1-15.Applicant
- Brassil et al., “Hiding Information in Document Images,” Conf. on Information Sciences and Systems, Mar. 1995, pp. 482-489.Applicant
- Andersen, R., “Stretching the Limits of Steganography,” Proc. 1st Int. Workshop on Information Hiding, May/Jun. 1996, pp. 39-48.Applicant
- Brassil et al., “Hiding Information in Document Images,” 1995.Applicant
- Brin et al., “Copy Detection Mechanisms for Digital Documents,” ACM, pp. 398-409, Jun. 1995.Applicant
- Bruckstein, A.M., et al., “A Holographic Transform Domain Image Watermarking Method,” Circuits, Systems, and Signal Processing, vol. 17 No. 3 pp. 361-389, 1998.Applicant
- Burgett et al., “A Novel Method for Copyright Labeling Digitized Image Data,” Fraunhofer Institute (12 pages), Sep. 18, 1995.Applicant
- Cha et al., “A Solution to the On-Line Image Downgrading Problem,” Proc. of 11th Annual Computer Security Applications Conf., pp. 108-112, 1995.Applicant
- Complaint for Patent Infringement, Demand for Jury Trial filed with the United States District Court, District of Oregon on Oct. 10, 2001, Digimarc Corporation V. Sesac Incorporated.Applicant
- Cox et al., “A Secure, Imperceptable Yet Perceptually Salient, Spread Spectrum Watermark for Multimedia,” IEEE, Southcon/96, Conference Record, pp. 192-197, Jun. 25, 1996.Applicant
- Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” NEC Research Institute Technical Report 95-10, Dec. 5, 1995 (33 pages).Applicant
- Cyphertech Systems, Inc., “Broadcast Monitoring Technology,” Promotional Brochure, Nov. 1992 (4 pages).Applicant
- Franz et al., “Computer Based Steganography: How It Works and Why . . . ,” Proc. of First. Int'l. Workshop on Information Hiding, pp. 7-21, May 30-Jun. 1, 1996.Applicant
- Gale, “Zero-Order Grating Microstructures,” Optical Document Security (van Renesse, R.L., ed.), Artech House, pp. 187-205, 1994.Applicant
- Gerzon et al., “A High Rate Buried Data Channel For Audio CD,” Journal of the Audio Engineering Society, vol. 43 Nos. 1-2 pp. 3-22, Jan./Feb. 1995.Applicant
- Johnson, N., “Steganography,” Information System Security paper, George Mason University, 1995.Applicant
- Kurak et al., “A Cautionary Note On Image Downgrading,” IEEE, pp. 153-159, Nov. 30, 1992.Applicant
- Low et al., “Document Marking and Identification Using Both Line and Word Shifting,” Infocom (Boston), pp. 853-860, Apr. 1995.Applicant
- Oomen et al., “A Variable-Bit-Rate Buried Data Channel for Compact Disc,” Journal of the Audio Engineering Soc., vol. 43 No. 1-2 pp. 23-28, Jan./Feb. 1995.Applicant
- Poirson, A., et al., “Appearance of Colored Patterns: Pattern-Color Separability,” J. Opt. Soc. Am. A., vol. 10, No. 12, Dec. 1993, pp. 2458-2470.Applicant
- Poirson, A., et al., “Pattern-Color Separable Pathways Predict Sensitivity to Simple Colored Patterns,” Vision Res., vol. 36, No. 4, pp 515-526, 1996.Applicant
- Press Release, “Digimarc Settles Patent Infringement Suit Against SESAC,” Nov. 2, 2001.Applicant
- Schell, “The Historical Development of Security Printing: Design and Technology,” Optical Document Security (van Renesse, R.L., ed.), Artech House, pp. 75-93, 1994.Applicant
- Seybold Report (on Publishing Systems), “Keeping Tabs on the Taking and Selling of Digital Images,” Feb. 27, 1995.Applicant
- Spannenburg, “Modulations of Printed Gratings as a Protection Against Copying,” Optical Document Security (van Renesse, R.L., ed.), Artech House, pp. 127-148, 1994.Applicant
- Szepanski, W., “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proc. of 1979 Carnahan Conference on Crime Countermeasures, pp. 101-109, May 16, 1979.Applicant
- Szepanski, W., “Additive Binary Data Transmission for Video Signals,” Presented at Conference of the Communications Engineering Society, Sep. 30, 1980, NTG Technical Reports, vol. 74, pp. 343-351.Applicant
- Szepanski, W., “Binary Data Transmission Over Video Channels with Very Low Amplitude Data Signals,” Fernseh- und KinoTechnik, vol. 32 No. 7 pp. 251-256.Applicant
- Szepanski, W., “Compatibility Problems in Add-On data Transmission for TV-Channels,” Second Symp. and Tech. Exh. on Electromagnetic Compatibility, pp. 263-268, Jun. 28, 1977.Applicant
- Szepanski, W., “Optimization of Add-On Signals by Means of a Modified Training Algorithm for Linear Classifiers,” IEEE Int'l Symp. On Info. Theory, pp. 27-28, Oct. 10, 1977.Applicant
- Tirkel et al, “Electronic Water Mark,” DICTA-93, Macquarie University (Sydney, Australia), pp. 666-673, Dec. 1993.Applicant
- Wasserman, Broadcast Monitoring Technology by Cyphertech Systems Inc. (untitled speech transcript), Worldwide Symp. on the Impact of Digital Tech. On Copyright & Neighboring Rights (Cambridge, MA), Apr. 2, 1993 (5 pages).Applicant
- Watson, “DCT Quantization Matrices Visually Optimized for Individual Images,” Proc. SPIE, vol. 1913: Human Vision, Visual Processing, and Digital Display IV, Feb. 1993, pp. 202-216.Applicant
- Boland, “Watermarking Digital Images for Copyright Protection,” Fifth International Conf. on Image Processing and Its Applications, Conf. Publ. No. 410, pp. 326-330, 1995.Applicant
- D.L. Hecht, “Embedded Data Glyph Technology for Hardcopy Digital Documents,” Proc. Color Imaging: Device-Independent Color, Color Hardcopy and Graphic Arts III, SPIE—The Int'l Soc. Optical Engineering, Bellingham, Wash., vol. 2171, 1994 pp. 340-352.Applicant
- D.L. Hecht, “Printed Embedded Data Graphical User Interfaces,” 2001 Computer IEEE (vol. 34, No. 3), pp 47-55.Applicant
- D.N. Curry, “Color Pictorial Serpentine Halftone for Secure Embedded Data,” Proc. Optical Security and Counterfeit Deterrence Techniques II, SPIE—The Int'l Soc. Optical Engineering, Bellingham, Wash., vol. 3314, 1998, pp. 309-317.Applicant
- “Specification for an Image Replacement Document—IRD,” Draft Standard for Trial Use, DSTU X9.90-2003, Jan. 10, 2003.Applicant