US 7,499,566 B2Grant
Methods for steganographic encoding media
Issue Date:2009-03-03
•21 Claims
•3 Drawing Sheets
Abstract
The present invention relates to digital watermarking and steganographic embedding. In one implementation a method is provided to help associate usage rights with media. The usage rights are used by a rights management system to control how the media is handled by the system. In response to the associating, an identifier is provided and embedded in the media in a steganographic manner.
Metadata
Assignee
- Digimarc Corporation
Inventor
- Geoffrey B. Rhoads
Application Information
Application Number:US 11/187,783
Filing Date:2005-07-22
Priority Date:1995-05-08
Art Unit:2624
Classifications
IPC:
H04K1/00
Patent Drawings (3 sheets)
Description
RELATED APPLICATION DATA
[0001] This application is a continuation of U.S. patent application Ser. No. 10/208,735, filed Jul. 29, 2002 (U.S. Pat. No. 6,922,480), which is a continuation of U.S. patent application Ser. No. 09/293,601, filed Apr. 15, 1999 (U.S. Pat. No. 6,427,020) which is a divisional application of U.S. patent application Ser. No. 09/074,034, filed May 6, 1998 (U.S. Pat. No. 6,449,377), which is a continuation-in-part of application Ser. No. 08/438,159, filed May 8, 1995 (U. S. Pat. No. 5,850,481), and claims priority to provisional application 60/082,228, filed Apr. 16, 1998.
[0002] U.S. patent application Ser. No. 09/293,601 is also a continuation-in-part of application 09/234,780, filed Jan. 20, 1999 (now abandoned), which claims priority to provisional application 60/071,983, filed Jan. 20, 1998.
[0003] (The specification of application Ser. No. 08/438,159 is substantially identical to that of applicant's issued patents U.S. Pat. Nos. 5,636,292, 5,710,834, 5,748,763, 5,748,783. The specification of application 60/082,228 is attached hereto as Appendix A.)
[0004] Patent application Ser. No. 09/293,602 (now U.S. Pat. No. 6,285,776), entitled Methods for Identifying Equipment Used in Counterfeiting, was filed as a sibling application of parent application Ser. No. 09/293,601.
[0005] The subject matter of this application is also related to that of the present assignee's other applications, namely Ser. No. 08/508,083 (now U.S. Pat. No. 5,841,978), Ser. No. 08/534,005 (now U.S. Pat. No. 5,832,119), Ser. No. 08/637,531 (now U.S. Pat. No. 5,822,436), Ser. No. 08/649,419 (now U.S. Pat. No. 5,862,260), Ser. No. 08/746,613 (now U.S. Pat. No. 6,122,403), Ser. No. 08/951,858 (now U.S. Pat. No. 6,026,193), and Ser. No. 08/969,072 (now U.S. Pat. No. 5,809,160), and the allowed applications referenced below.
FIELD OF THE INVENTION
[0006] The present invention relates to methods and devices for recognizing banknotes and responding accordingly (e.g., by intervening to prevent attempted banknote counterfeiting).
BACKGROUND AND SUMMARY OF THE INVENTION
[0007] 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), Ser. No. 08/508,083 (now U.S. Pat. No. 5,841,978), Ser. No. 08/438,159 (now U.S. Pat. No. 5,850,481), and in laid-open PCT application WO 97/43736. 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.
[0008] 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.
[0009] The artisan is assumed to be familiar with the foregoing prior art.
[0010] 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.
[0011] 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.
[0012] 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.
[0013] 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).
[0014] In an illustrative embodiment of the present invention, the line art on a banknote or other security document is slightly changed to effect the encoding of plural-bit digital data (i.e. the banknote is digitally watermarked). When such a banknote is thereafter scanned, the resulting image data can be recognized as corresponding to a banknote by detection of the encoded data. (Alternatively, the image data can be recognized as corresponding to a banknote by machine detection of other forms of watermarking, or by reference to visible structures characteristic of banknotes.)
[0015] In response to detection of a banknote, the detecting apparatus (e.g., a scanner, photocopier, or printer) can intervene so as to prevent or deter counterfeiting. For example, the apparatus can interrupt a copying operation, and display a message reminding the operator that it is illegal to reproduce currency. Another option is to dial a remote service and report the attempted reproduction of a banknote. Yet another option is to permit the copying, but to insert forensic tracer data (e.g. steganographically encoded binary data) in the resultant copy. 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.
[0016] 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.
[0017] 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
[0018] FIGS. 1A and 1B show prior art techniques for achieving grayscale effects using line art.
[0019] FIG. 2 shows a virtual array of grid points that can be imposed on an image according to one embodiment of the present invention.
[0020] FIG. 3 shows a virtual array of regions that can be imposed on an image according to the FIG. 2 embodiment.
[0021] FIG. 4 shows an excerpt of FIG. 3 with a line from a line art image passing therethrough.
[0022] 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.
[0023] 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.
[0024] FIG. 7 is a block diagram of a photocopier according to another embodiment of the invention.
DETAILED DESCRIPTION
[0025] 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.
[0026] 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.
[0027] 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.
[0028] 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.
[0029] 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).
[0030] 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.
[0031] 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.)
[0032] 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 patent 5,710,834.)
[0033] 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.
[0034] 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).
[0035] 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.
[0036] 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).
[0037] (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.)
[0038] 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.
[0039] 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.
[0040] Combinations of the foregoing embodiments can also be employed.
[0041] 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.
[0042] 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.
[0043] An alternative embodiment is shown in FIG. 6 , in which line position is changed rather than line width.
[0044] 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.
[0045] 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.
[0046] Again, the line shifts in FIG. 6 are somewhat exaggerated. More typical line shifts are on the order of 3-50 μm.
[0047] 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).
[0048] 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.
[0049] Each of the variants discussed above in connection with FIG. 5 is likewise applicable to FIG. 6 .
[0050] 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.
[0051] 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.)
[0052] 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.
[0053] 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.
[0054] 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.
[0055] 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.
[0056] Taking the example of a 300 dpi scanner (84 μm photodetector spacing), each 250 μm region 12 on the banknote will correspond to about a 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.
[0057] 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.
[0058] (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.)
[0059] 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.)
[0060] 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.
[0061] 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.
[0062] One option is simply to interrupt copying, and display a message reminding the operator that it is illegal to reproduce currency.
[0063] 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.
[0064] 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 .)
[0065] 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.
[0066] 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.
[0067] 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.
[0068] 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.
[0069] 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.)
[0070] 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.
[0071] 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.
[0072] 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.
[0073] 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.
[0074] 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.
[0075] 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.
[0076] (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.)
[0077] 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.
[0078] (To provide a comprehensive disclosure without unduly lengthening the following specification, applicants incorporate by reference the patent documents cited above (except applications Ser. No. 09/234,780 and 60/071,983).)
[0079] From the foregoing, it will be recognized that embodiments according to the present invention allow banknotes to be recognized based on optical scan data, and responsive actions taken, thereby reducing the risk of counterfeiting. Other devices, responsive to authentic banknotes, are enabled.
[0080] 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.
[0081] 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.
[0082] 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.
[0083] 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.
APPENDIX A
Watermarking Methods, Apparatuses, and Applications
[0084] (To provide a comprehensive disclosure without unduly lengthening the following specification, applicants incorporate by reference the cited patent documents.)
[0085] 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, allowed U.S. application Ser. Nos. 08/327,426, 08/598,083, 08/436,134 (to issue as U.S. Pat. No. 5,748,763), Ser. No. 08/436,102 (to issue as U.S. Pat. No. 5,748,783), and Ser. No. 08/614,521 (to issue as U.S. Pat. No. 5,745,604), and laid-open PCT application WO97/43736. 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.
[0086] 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 1. Pitas, Eckhard Koch, Jian Zhao, Norishige Morimoto, Laurence Boney, Kineo Matsui, Ariz. Tirkel, Fred Mintzer, B. Macq, Ahmed H. Tewfik, Frederic Jordan, Naohisa Komatsu, and Lawrence O'Gorman.
[0087] The artisan is assumed to be familiar with the foregoing prior art.
[0088] 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.
[0089] Watermarking can be applied to myriad forms of information. These include imagery (including video) and audio—whether represented in digital form (e.g. an image comprised of pixels, digital video, etc.), or in an analog representation (e.g. non-sampled music, printed imagery, banknotes, etc) Watermarking can be applied to digital content (e.g. imagery, audio) either before or after compression. Watermarking can also be used in various “description” or “synthesis” language representations of content, such as Structured Audio, Csound, NetSound, SNHC Audio and the like (c.f. http//sound.media.mit.edu/mpeg4/) by specifying synthesis commands that generate watermark data as well as the intended audio signal. Watermarking can also be applied to ordinary media, whether or not it conveys information. Examples include paper, plastics, laminates, paper/film emulsions, etc. A watermark can embed a single bit of information, or any number of bits.
[0090] The physical manifestation of watermarked information most commonly takes the form of altered signal values, such as slightly changed pixel values, picture luminance, picture colors, DCT coefficients, instantaneous audio amplitudes, etc. However, a watermark can also be manifested in other ways, such as changes in the surface microtopology of a medium, localized chemical changes (e.g. in photographic emulsions), localized variations in optical density, localized changes in luminescence, etc. Watermarks can also be optically implemented in holograms and conventional paper watermarks.
[0091] One improvement to existing technology is to employ established web crawler services (e.g. Alta Vista, Excite, or Inktomi) to search for watermarked content (on the Web, in internet news groups, BBS systems, on-line systems, etc.) in addition to their usual data collecting/indexing operations. Such crawlers can download files that may have embedded watermarks (e.g. *.JPG, *.WAV, etc.) for later analysis. These files can be processed, as described below, in real time. More commonly, such files are queued and processed by a computer distinct from the crawler computer. Instead of performing watermark-read operations on each such file, a screening technique can be employed to identify those most likely to be conveying watermark data. One such technique is to perform a DCT operation on an image, and look for spectral coefficients associated with certain watermarking techniques (e.g. coefficients associated with an inclined embedded subliminal grid). To decode spread-spectrum based watermarks, the analyzing computer requires access to the noise signal used to spread the data signal In one embodiment, interested parties submit their noise/key signals to the crawler service so as to enable their marked content to be located. The crawler service maintains such information in confidence, and uses different noise signals in decoding an image (image is used herein as a convenient shorthand for imagery, video, and audio) until watermarked data is found (if present). This allows the use of web crawlers to locate content with privately-coded watermarks, instead of just publicly-coded watermarks as is presently the case. The queueing of content data for analysis provides certain opportunities for computational shortcuts. For example, like-sized images (e.g. 256×256 pixels) can be tiled into a larger image, and examined as a unit for the presence of watermark data. If the decoding technique (or the optional pre-screening technique) employs a DCT transform or the like, the block size of the transform can be tailored to correspond to the tile size (or some integral fraction thereof). Blocks indicated as likely having watermarks can then be subjected to a full read operation. If the queued data is sorted by file name, file size, or checksum, duplicate files can be identified. Once such duplicates are identified, the analysis computer need consider only one instance of the file. If watermark data is decoded from such a file, the content provider can be informed of each URL at which copies of the file were found.
[0092] Some commentators have observed that web crawler-based searches for watermarked images can be defeated by breaking a watermarked image into sub-blocks (tiles). HTML instructions, or the like, cause the sub-blocks to be presented in tiled fashion, recreating the complete image. However, due to the small size of the component sub-blocks, watermark reading is not reliably accomplished.
[0093] This attack is overcome by instructing the web-crawler to collect the display instructions (e.g. HTML) by which image files are positioned for display on a web page, in addition to the image files themselves. Before files collected from a web page are scrutinized for watermarks, they can be concatenated in the arrangement specified by the display instructions. By this arrangement, the tiles are reassembled, and the watermark data can be reliably recovered.
[0094] Another such postulated attack against web crawler detection of image watermarks is to scramble the image (and thus the watermark) in a file, and employ a Java applet or the like to unscramble the image prior to viewing. Existing web crawlers inspect the file as they find it, so the watermark is not detected. However, just as the Java descrambling applet can be invoked when a user wishes access to a file, the same applet can similarly be employed in a web crawler to overcome such attempted circumvention of watermark detection.
[0095] Although “content” can be located and indexed by various web crawlers, the contents of the “content” are unknown. A *.JPG file, for example, may include pornography, a photo of a sunset, etc.
[0096] Watermarks can be used to indelibly associate meta-data within content (as opposed to stored in a data structure that forms another part of the object, as is conventionally done with meta-data). The watermark can include text saying “sunset” or the like. More compact information representations can alternatively be employed (e.g. coded references). Still further, the watermark can include (or consist entirely of) a Unique ID (UID) that serves as an index (key) into a network-connected remote database containing the meta data descriptors. By such arrangements, web crawlers and the like can extract and index the meta-data descriptor tags, allowing searches to be conducted based on semantic descriptions of the file contents, rather than just by file name.
[0097] Existing watermarks commonly embed information serving to communicate copyright information. Some systems embed text identifying the copyright holder. Others embed a UID which is used as an index into a database where the name of the copyright owner, and associated information, is stored.
[0098] Looking ahead, watermarks should serve more than as silent copyright notices. One option is to use watermarks to embed “intelligence” in content. One form of intelligence is knowing its “home.” “Home” can be the URL of a site with which the content is associated. A photograph of a car, for example, can be watermarked with data identifying the web site of an auto-dealer that published the image. Wherever the image goes, it serves as a link back to the original disseminator. The same technique can be applied to corporate logos. Wherever they are copied on the internet, a suitably-equipped browser or the like can decode the data and link back to the corporation's home page. (Decoding may be effected by positioning the cursor over the logo and pressing the right-mouse button, which opens a window of options—one of which is Decode Watermark.)
[0099] To reduce the data load of the watermark, the intelligence need not be wholly encoded in the content's watermark. Instead, the watermark can again provide a UID—this time identifying a remote database record where the URL of the car dealer, etc., can be retrieved. In this manner, images and the like become marketing agents—linking consumers with vendors (with some visual salesmanship thrown in). In contrast to the copyright paradigm, in which dissemination of imagery was an evil sought to be tracked and stopped, dissemination of the imagery can now be treated as a selling opportunity. A watermarked image becomes a portal to a commercial transaction.
[0100] (Using an intermediate database between a watermarked content file and its ultimate home (i.e. indirect linking) serves an important advantage: it allows the disseminator to change the “home” simply by updating a record in the database. Thus, for example, if one company is acquired by another, the former company's smart images can be made to point to the new company's home web page by updating a database record. In contrast, if the old company's home URL is hard-coded (i.e. watermarked) in the object, it may point to a URL that eventually is abandoned. In this sense, the intermediate database serves as a switchboard that couples the file to its current home.
[0101] The foregoing techniques are not limited to digital content files. The same approach is equally applicable with printed imagery, etc. A printed catalog, for example, can include a picture illustrating a jacket. Embedded in the picture is watermarked data. This data can be extracted by a simple hand-scanner/decoder device using straightforward scanning and decoding techniques (e.g. those known to artisans in those fields). In watermark-reading applications employing hand-scanners and the like, it is important that the watermark decoder be robust to rotation of the image, since the catalog photo will likely be scanned off-axis. One option is to encode subliminal graticules (e.g. visualization synchronization codes) in the catalog photo so that the set of image data can be post-processed to restore it to proper alignment prior to decoding.
[0102] The scanner/decoder device can be coupled to a modem-equipped computer, a telephone, or any other communications device. In the former instance, the device provides URL data to the computer's web browser, linking the browser to the catalog vendor's order page. (The device need not include its own watermark decoder; this task can be performed by the computer) The vendor's order page can detail the size and color options of the jacket, inventory availability, and solicit ordering instructions (credit card number, delivery options, etc.)—as is conventionally done with on-line merchants. Such a device connected to a telephone can dial the catalog vendor's toll-free automated order-taking telephone number (known, e.g., from data encoded in the watermark), and identify the jacket to the order center. Voice prompts can then solicit the customer's choice of size, color, and delivery options, which are input by Touch Tone instructions, or by voiced words (using known voice recognition software at the vendor facility).
[0103] In such applications, the watermark may be conceptualized as an invisible bar code employed in a purchase transaction. Here, as elsewhere, the watermark can serve as a seamless interface bridging the print and digital worlds
[0104] Another way of providing content with intelligence is to use the watermark to provide Java or ActiveX code. The code can be embedded in the content, or can be stored remotely and linked to the content. When the watermarked object is activated, the code can be executed (either automatically, or at the option of the user). This code can perform virtually any function. One is to “phone home” —initiating a browser and linking to the object's home The object can then relay any manner of data to its home. This data can specify some attribute of the data, or its use. The code can also prevent accessing the underlying content until permission is received. An example is a digital movie that, when double-clicked, automatically executes a watermark-embedded Java applet which links through a browser to the movie's distributor. The user is then prompted to input a credit card number. After the number has been verified and a charge made, the applet releases the content of the file to the computer's viewer for viewing of the movie. Support for these operations is desirably provided via the computer's operating system, or plug-in software.
[0105] Such arrangements can also be used to collect user-provided demographic information when smart image content is accessed by the consumer of the content. The demographic information can be written to a remote database and can be used for market research, customization of information about the content provided to the consumer, sales opportunities, advertising, etc.
[0106] In audio and video and the like, watermarks can serve to convey related information, such as links to WWW fan sites, actor biographies, advertising for marketing tie-ins (T-shirts, CDs, concert tickets). In such applications, it is desirable (but not necessary) to display on the user interface (e.g. screen) a small logo to signal the presence of additional information. When the consumer selects the logo via some selection device (mouse, remote control button, etc.), the information is revealed to the consumer, who can then interact with it.
[0107] Much has been written (and patented) on the topic of asset rights management. Sample patent documents include U.S. Pat. Nos. 5,715,403, 5,638,443, 5,634,012, 5,629,980. Again, much of the technical work is memorialized in journal articles, which can be identified by searching for relevant company names and trademarks such as IBM's Cryptolope system, Portland Software's ZipLock system, the Rights Exchange service by Softbank Net Solutions, and the DigiBox system from InterTrust Technologies.
[0108] An exemplary asset management system makes content available (e.g. from a web server, or on a new computer's hard disk) in encrypted form. Associated with the encrypted content is data identifying the content (e.g. a preview) and data specifying various rights associated with the content. If a user wants to make fuller use of the content, the user provides a charge authorization (e.g. a credit card) to the distributor, who then provides a decryption key, allowing access to the content. (Such systems are often realized using object-based technology. In such systems, the content is commonly said to be distributed in a “secure container.”)
[0109] Desirably, the content should be marked (personalized/serialized) so that any illicit use of the content (after decryption) can be tracked. This marking can be performed with watermarking, which assures that the mark travels with the content wherever—and in whatever form—it may go. The watermarking can be effected by the distributor—prior to dissemination of the encrypted object—such as by encoding a UID that is associated in a database with that particular container. When access rights are granted to that container, the database record can be updated to reflect the purchaser, the purchase date, the rights granted, etc. An alternative is to include a watermark encoder in the software tool used to access (e.g. decrypt) the content. Such an encoder can embed watermark data in the content as it is released from the secure container, before it is provided to the user. The embedded data can include a UID, as described above. This UID can be assigned by the distributor prior to disseminating the container. Alternatively, the UID can be a data string not known or created until access rights have been granted. In addition to the UID, the watermark can include other data not known to the distributor, e.g. information specific to the time(s) and manner(s) of accessing the content.
[0110] In other systems, access rights systems can be realized with watermarks without containers etc. Full resolution images, for example, can be freely available on the web. If a user wishes to incorporate the imagery into a web page or a magazine, the user can interrogate the imagery as to its terms and conditions of use. This may entail linking to a web site specified by the embedded watermark (directly, or through an intermediate database), which specifies the desired information. The user can then arrange the necessary payment, and use the image knowing that the necessary rights have been secured.
[0111] As noted, digital watermarks can also be realized using conventional (e.g. paper) watermarking technologies. Known techniques for watermarking media (e.g. paper, plastic, polymer) are disclosed in U.S. Pat. Nos. 5,536,468, 5,275,870, 4,760,239, 4,256,652, 4,370,200, and 3,985,927 and can be adapted to display of a visual watermark instead of a logo or the like. Note that some forms of traditional watermarks which are designed to be viewed with transmissive light can also show up as low level signals in reflective light, as is typically used in scanners. Transmissive illumination detection systems can also be employed to detect such watermarks, using optoelectronic traditional-watermark detection technologies known in the art.
[0112] As also noted, digital watermarks can be realized as part of optical holograms. Known techniques for producing and securely mounting holograms are disclosed in U.S. Pat. Nos. 5,319,475, 5,694,229, 5,492,370, 5,483,363, 5,658,411 and 5,310,222. To watermark a hologram, the watermark can be represented in the image or data model from which the holographic diffraction grating is produced. In one embodiment, the hologram is produced as before, and displays an object or symbol. The watermark markings appear in the background of the image so that they can be detected from all viewing angles. In this context, it is not critical that the watermark representation be essentially imperceptible to the viewer. If desired, a fairly visible noise-like pattern can be used without impairing the use to which the hologram is put.
[0113] Digital watermarks can also be employed in conjunction with labels and tags. In addition to conventional label/tag printing processes, other techniques—tailored to security—can also be employed. Known techniques useful in producing security labels/tags are disclosed in U.S. Pat. Nos. 5,665,194, 5,732,979, 5,651,615, and 4,268,983. The imperceptibility of watermarked data, and the ease of machine decoding, are some of the benefits associated with watermarked tags/labels. Additionally, the cost is far less than many related technologies (e.g. holograms). Watermarks in this application can be used to authenticate the originality of a product label, either to the merchant or to the consumer of the associated product, using a simple scanner device, thereby reducing the rate of counterfeit product sales.
[0114] Recent advances in color printing technology have greatly increased the level of casual counterfeiting. High quality scanners are now readily available to many computer users, with 300 dpi scanners available for under $100, and 600 dpi scanners available for marginally more. Similarly, photographic quality color ink-jet printers are commonly available from Hewlett-Packard Co., Epson, etc. for under $300.
[0115] Watermarks in banknotes and other security documents (passports, stock certificates, checks, etc.—all collectively referred to as banknotes herein) offer great promise to reduce such counterfeiting, as discussed more fully below. Additionally, watermarks provide a high-confidence technique for banknote authentication. One product enabled by this increased confidence is automatic teller machines that accept, as well as dispense, cash. The machine is provided with known optical scanning technology to produce digital data corresponding to the face(s) of the bill. This image set is then analyzed to extract the watermark data. In watermarking technologies that require knowledge of a code signal for decoding (e.g. noise modulation signal, crypto key, spreading signal, etc), a bill may be watermarked in accordance with several such codes. Some of these codes are public—permitting their reading by conventional machines. Others are private, and are reserved for use by government agencies and the like. (C.f. public and private codes in the present assignee's issued patents.)
[0116] Banknotes presently include certain markings which can be used as an aid in note authentication. Well known visible structures are added to banknotes to facilitate visual authentication and machine detection. An example is the seal of the issuing central bank. Others are geometrical markings. Desirably, a note is examined by an integrated detection system, for both such visible structures as well as the present watermark-embedded data, to determine authenticity.
[0117] The visible 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. The embedded watermark data can be recovered using the scanning/analysis techniques disclosed in the cited patents and publications.
[0118] To reduce counterfeiting, it is desirable that document-reproducing technologies recognize banknotes and refuse to reproduce same. A photocopier, for example, can sense the presence of either a visible structure *or* embedded banknote watermark data, and disable copying if either is present. Scanners and printers can be equipped with a similar capability—analyzing the data scanned or to be printed for either of these banknote hallmarks. If either is detected, the software (or hardware) disables further operation.
[0119] The watermark detection criteria provides an important advantage not otherwise available. An original bill 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.
[0120] (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.)
[0121] 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.
[0122] A related principle is to insert an imperceptible watermark having a UID into all documents printed with a printer, scanned with a scanner, or reproduced by a photocopier. The UID is associated with the particular printer/photocopier/scanner in a registry database maintained by the products' manufacturers. The manufacturer can also enter in this database the name of the distributor to whom the product was initially shipped. Still further, the owner's name and address can be added to the database when the machine is registered for warranty service. While not preventing use of such machines in counterfeiting, the embedded UID facilitates identifying the machine that generated a counterfeit banknote. (This is an application in which a private watermark might best be used.)
[0123] While the foregoing applications disabled potential counterfeiting operations upon the detection of *either* a visible structure or watermarked data, in other applications, both criteria must be met before a banknote is recognized as genuine. Such applications typically involve the receipt or acceptance of banknotes, e.g. by ATMs as discussed above.
[0124] The foregoing principles (employing just watermark data, or in conjunction with visible indicia) can likewise be used to prevent counterfeiting of tags and labels (e.g. the fake labels and tags commonly used in pirating Levis brand jeans, Microsoft software, etc.)
[0125] The reader may first assume that banknote watermarking is effected by slight alterations to the ink color/density/distribution, etc. on the paper. This is one approach. Another is to watermark the underlying medium (whether paper, polymer, etc) with a watermark This can be done by changing the microtopology of the medium (a la mini-Braille) to manifest the watermark data. Another option is to employ a laminate on or within the banknote, where the laminate has the watermarking manifested thereon/therein. The laminate can be textured (as above), or its optical transmissivity can vary in accordance with a noise-like pattern that is the watermark, or a chemical property can similarly vary.
[0126] Another option is to print at least part of a watermark using photoluminescent ink. This allows, e.g., a merchant presented with a banknote, to quickly verify the presence of *some* watermark-like indicia in/on the bill even without resort to a scanner and computer analysis (e.g. by examining under a black light). Such photoluminescent ink can also print human-readable indicia on the bill, such as the denomination of a banknote. (Since ink-jet printers and other common mass-printing technologies employ cyan/magenta/yellow/black to form colors, they can produce only a limited spectrum of colors. Photoluminescent colors are outside their capabilities. Fluorescent colors—such as the yellow, pink and green dyes used in highlighting markers—can similarly be used and have the advantage of being visible without a black light.).
[0127] An improvement to existing encoding techniques is to add an iterative assessment of the robustness of the mark, with a corresponding adjustment in a re-watermarking operation. Especially when encoding multiple bit watermarks, the characteristics of the underlying content may result in some bits being more robustly (e.g. strongly) encoded than others. In an illustrative technique employing this improvement, a watermark is first embedded in an object. Next, a trial decoding operation is performed. A confidence measure (e.g. signal-to-noise ratio) associated with each bit detected in the decoding operation is then assessed. The bits that appear weakly encoded are identified, and corresponding changes are made to the watermarking parameters to bring up the relative strengths of these bits. The object is then watermarked anew, with the changed parameters. This process can be repeated, as needed, until all of the bits comprising the encoded data are approximately equally detectable from the encoded object, or meet some predetermined signal-to-noise ratio threshold.
[0128] The foregoing applications, and others, can generally benefit by multiple watermarks. For example, an object (physical or data) can be marked once in the spatial domain, and a second time in the spatial frequency domain. (It should be understood that any change in one domain has repercussions in the other. Here we reference the domain in which the change is directly effected)
[0129] Another option is to mark an object with watermarks of two different levels of robustness, or strength. The more robust watermark withstands various types of corruption, and is detectable in the object even after multiple generations of intervening distortion. The less robust watermark can be made frail enough to fail with the first distortion of the object. In a banknote, for example, the less robust watermark serves as an authentication mark. Any scanning and reprinting operation will cause it to become unreadable. Both the robust and the frail watermarks should be present in an authentic banknote; only the former watermark will be present in a counterfeit.
[0130] Still another form of multiple-watermarking is with content that is compressed. The content can be watermarked once (or more) in an uncompressed state. Then, after compression, a further watermark (or watermarks) can be applied.
[0131] Still another advantage from multiple watermarks is protection against sleuthing. If one of the watermarks is found and cracked, the other watermark(s) will still be present and serve to identify the object.
[0132] The foregoing discussion has addressed various technological fixes to many different problems. Exemplary solutions have been detailed above. Others will be apparent to the artisan by applying common knowledge to extrapolate from the solutions provided above.
[0133] For example, the technology and solutions disclosed herein have made use of elements and techniques known from the cited references. Other elements and techniques from the cited references can similarly be combined to yield further implementations within the scope of the present invention. Thus, for example, holograms with watermark data can be employed in banknotes, single-bit watermarking can commonly be substituted for multi-bit watermarking, technology described as using imperceptible watermarks can alternatively be practiced using visible watermarks (glyphs, etc), techniques described as applied to images can likewise be applied to video and audio, local scaling of watermark energy can be provided to enhance watermark signal-to-noise ratio without increasing human perceptibility, various filtering operations can be employed to serve the functions explained in the prior art, watermarks can include subliminal graticules to aid in image re-registration, encoding may proceed at the granularity of a single pixel (or DCT coefficient), or may similarly treat adjoining groups of pixels (or DCT coefficients), the encoding can be optimized to withstand expected forms of content corruption. Etc., etc., etc. Thus, the exemplary embodiments are only selected samples of the solutions available by combining the teachings referenced above. The other solutions necessarily are not exhaustively described herein, but are fairly within the understanding of an artisan given the foregoing disclosure and familiarity with the cited art.
Claims
I claim:
1. A method utilizing steganographic embedding comprising:
associating usage fights with media, wherein the usage rights are to be used by a rights management system to control how the media is handled by the system;
in response to said associating, automatically providing an identifier; and
embedding—through utilizing a processor or electronic processing circuitry—the identifier in the media in a steganographic manner, said act of embedding alters at least some data representing the media to carry the identifier.
2. The method of claim 1 wherein said associating usage rights with media comprises granting a user usage rights.
3. The method of claim 2 wherein granting a user usage rights follows a purchase of the media.
4. The method of claim 1 wherein said providing a steganographic identifier comprises receiving an identifier.
5. The method of claim 1 further comprising associating the identifier with the media in a remote data repository.
6. The method of claim 1 further comprising controlling the media with reference to at least the embedded identifier.
7. The method of claim 1 wherein in addition to embedding the identifier, additional information is steganographically embedded in the media.
8. The method of claim 7 wherein the other information comprises at least a time or manner of accessing the media.
9. The method of claim 1 wherein said embedding the identifier in the media in a steganographic manner involves digital watermarking.
10. A computer readable medium comprising instructions or circuitry to perform the method of claim 1.
11. The method of claim 1 wherein the media comprises video or audio.
12. A method comprising:
associating usage rights with media, wherein the usage rights are to be used by a rights management system to control how the media is handled by the system;
in response to said associating, automatically providing an identifier; and
hiding the identifier in the media in a steganographic manner, said act of hiding utilizes a processor or electronic processing circuitry, and said act of hiding alters at least some data representing the media to carry the identifier.
13. The method of claim 12 wherein said act of hiding utilizes digital watermarking.
14. The method of claim 13 wherein the digital watermarking alters values associated with the media to hide the identifier therein.
15. A computer readable medium comprising instructions or circuitry to perform the method of claim 12.
16. The method of claim 12 wherein the media comprises video or audio.
17. A method comprising:
querying a rights management system to register media therein,
designating desired usage rights for the media, wherein the usage rights are to be used by a rights management system to control how the media is handled by the system;
in response to said designating, receiving without requiring user or operator input a plural-bit identifier; and
hiding—through utilizing a processor or electronic processing circuitry—the plural-bit identifier in the media in a steganographic manner.
18. The method of claim 17 wherein said act of hiding utilizes digital watermarking.
19. The method of claim 18 wherein the digital watermarking alters values associated with the media to hide the identifier therein.
20. A computer readable medium comprising instructions or circuitry to perform the method of claim 17.
21. The method of claim 17 wherein the media comprises video or audio.
Patent Citations (227)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US2573279(A) | 1951-10-01 | Scherbatskoy | Applicant |
| US2766374(A) | 1956-10-01 | Hoffmann | Applicant |
| US3492577(A) | 1970-01-01 | Reiter et al. | Applicant |
| US3586781(A) | 1971-06-01 | Jones | Applicant |
| US3684838(A) | 1972-08-01 | Kahn | Applicant |
| US3696298(A) | 1972-10-01 | Kahn et al. | Applicant |
| US3735048(A) | 1973-05-01 | Tomsa et al. | Applicant |
| US3760275(A) | 1973-09-01 | Ohsawa et al. | Applicant |
| US3885217(A) | 1975-05-01 | Clintron | Applicant |
| US4025851(A) | 1977-05-01 | Haselwood et al. | Applicant |
| US4134127(A) | 1979-01-01 | Campioni | Applicant |
| US4218738(A) | 1980-08-01 | Matyas et al. | Applicant |
| US4230990(A) | 1980-10-01 | Lert, Jr. et al. | Applicant |
| US4238849(A) | 1980-12-01 | Gassmann | Applicant |
| US4245346(A) | 1981-01-01 | Grady et al. | Applicant |
| US4313197(A) | 1982-01-01 | Maxemchuck | Applicant |
| US4379947(A) | 1983-04-01 | Warner | Applicant |
| US4389671(A) | 1983-06-01 | Posner et al. | Applicant |
| US4395600(A) | 1983-07-01 | Lundy et al. | Applicant |
| US4425642(A) | 1984-01-01 | Moses et al. | Applicant |
| US4425661(A) | 1984-01-01 | Moses et al. | Applicant |
| US4512013(A) | 1985-04-01 | Nash et al. | Applicant |
| US4523311(A) | 1985-06-01 | Lee et al. | Applicant |
| US4528588(A) | 1985-07-01 | Löfberg | Applicant |
| US4528643(A) | 1985-07-01 | Freeny, Jr. | Applicant |
| US4581746(A) | 1986-04-01 | Arnold | Applicant |
| US4618890(A) | 1986-10-01 | Kouyama et al. | Applicant |
| US4652915(A) | 1987-03-01 | Heller, III | Applicant |
| US4677435(A) | 1987-06-01 | Causse D'Agraives et al. | Applicant |
| US4677466(A) | 1987-06-01 | Lert, Jr. et al. | Applicant |
| US4688255(A) | 1987-08-01 | Kahn | Applicant |
| US4750053(A) | 1988-06-01 | Allen | Applicant |
| US4771455(A) | 1988-09-01 | Hareyama et al. | Applicant |
| US4782523(A) | 1988-11-01 | Galand et al. | Applicant |
| US4807031(A) | 1989-02-01 | Broughton et al. | Applicant |
| US4827508(A) | 1989-05-01 | Shear | Applicant |
| US4888798(A) | 1989-12-01 | Earnest | Applicant |
| US4931871(A) | 1990-06-01 | Kramer | Applicant |
| US4939515(A) | 1990-07-01 | Adelson | Applicant |
| US4941175(A) | 1990-07-01 | Enescu et al. | Applicant |
| US4943973(A) | 1990-07-01 | Werner | Applicant |
| US4945412(A) | 1990-07-01 | Kramer | Applicant |
| US4956709(A) | 1990-09-01 | Richer et al. | Applicant |
| US4977594(A) | 1990-12-01 | Shear | Applicant |
| US4999806(A) | 1991-03-01 | Chernow et al. | Applicant |
| US5023907(A) | 1991-06-01 | Johnson et al. | Applicant |
| US5025443(A) | 1991-06-01 | Gupta | Applicant |
| US5050213(A) | 1991-09-01 | Shear | Applicant |
| US5079647(A) | 1992-01-01 | Nenezu et al. | Applicant |
| US5103476(A) | 1992-04-01 | Waite et al. | Applicant |
| US5113518(A) | 1992-05-01 | Durst, Jr. et al. | Applicant |
| US5138712(A) | 1992-08-01 | Corbin | Applicant |
| US5182770(A) | 1993-01-01 | Medveczky et al. | Applicant |
| US5227874(A) | 1993-07-01 | Van Kohorn | Applicant |
| US5243423(A) | 1993-09-01 | DeJean et al. | Applicant |
| US5285498(A) | 1994-02-01 | Johnston | Applicant |
| US5315098(A) | 1994-05-01 | Tow | Applicant |
| US5319705(A) | 1994-06-01 | Halter et al. | Applicant |
| US5319735(A) | 1994-06-01 | Preuss et al. | Applicant |
| US5321841(A) | 1994-06-01 | East et al. | Applicant |
| US5349549(A) | 1994-09-01 | Tsutsui | Applicant |
| US5351302(A) | 1994-09-01 | Leighton et al. | Applicant |
| US5355161(A) | 1994-10-01 | Bird et al. | Applicant |
| US5374976(A) | 1994-12-01 | Spannenburg | Applicant |
| US5394274(A) | 1995-02-01 | Kahn | Applicant |
| US5404377(A) | 1995-04-01 | Moses | Applicant |
| US5410541(A) | 1995-04-01 | Hotto | Applicant |
| US5410598(A) | 1995-04-01 | Shear | Applicant |
| US5428731(A) | 1995-06-01 | Powers, III | Applicant |
| US5450490(A) | 1995-09-01 | Jensen et al. | Applicant |
| US5457807(A) | 1995-10-01 | Weinblatt | Applicant |
| US5463423(A) | 1995-10-01 | Tults | Applicant |
| US5464997(A) | 1995-11-01 | Watanabe | Applicant |
| US5473692(A) | 1995-12-01 | Davis | Applicant |
| US5481294(A) | 1996-01-01 | Thomas et al. | Applicant |
| US5481370(A) | 1996-01-01 | Kim | Applicant |
| US5495411(A) | 1996-02-01 | Ananda | Applicant |
| US5519778(A) | 1996-05-01 | Leighton et al. | Applicant |
| US5534941(A) | 1996-07-01 | Sie et al. | Applicant |
| US5535300(A) | 1996-07-01 | Hall, II et al. | Applicant |
| US5548645(A) | 1996-08-01 | Ananda | Applicant |
| US5550593(A) | 1996-08-01 | Nakabayashi | Applicant |
| US5553143(A) | 1996-09-01 | Ross et al. | Applicant |
| US5574962(A) | 1996-11-01 | Fardeau et al. | Applicant |
| US5574963(A) | 1996-11-01 | Weinblatt et al. | Applicant |
| US5579479(A) | 1996-11-01 | Plum | Applicant |
| US5583784(A) | 1996-12-01 | Kapust et al. | Applicant |
| US5583962(A) | 1996-12-01 | Davis et al. | Applicant |
| US5584050(A) | 1996-12-01 | Lyons | Applicant |
| US5594934(A) | 1997-01-01 | Lu et al. | Applicant |
| US5606609(A) | 1997-02-01 | Houser et al. | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5617119(A) | 1997-04-01 | Briggs et al. | Applicant |
| US5629739(A) | 1997-05-01 | Dougherty | Applicant |
| US5629980(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5630011(A) | 1997-05-01 | Lim et al. | Applicant |
| US5630203(A) | 1997-05-01 | Weinblatt | Applicant |
| US5634012(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5636276(A) | 1997-06-01 | Brugger | Applicant |
| US5638443(A) | 1997-06-01 | Stefik et al. | Applicant |
| US5646997(A) | 1997-07-01 | Barton | Applicant |
| US5646999(A) | 1997-07-01 | Saito | Applicant |
| US5652626(A) | 1997-07-01 | Kawakami et al. | Applicant |
| US5652714(A) | 1997-07-01 | Peterson et al. | Applicant |
| US5657462(A) | 1997-08-01 | Brouwer et al. | Applicant |
| US5668805(A) | 1997-09-01 | Yoshinobu | Applicant |
| US5675388(A) | 1997-10-01 | Cooper | Applicant |
| US5689822(A) | 1997-11-01 | Zucker | Applicant |
| US5699124(A) | 1997-12-01 | Nuber et al. | Applicant |
| US5699526(A) | 1997-12-01 | Siefert | Applicant |
| US5703877(A) | 1997-12-01 | Nuber et al. | Applicant |
| US5715403(A) | 1998-02-01 | Stefik | Applicant |
| US5719937(A) | 1998-02-01 | Warren et al. | Applicant |
| US5734119(A) | 1998-03-01 | France et al. | Applicant |
| US5734719(A) | 1998-03-01 | Tsevdos et al. | Applicant |
| US5745569(A) | 1998-04-01 | Moskowitz et al. | Applicant |
| US5748763(A) | 1998-05-01 | Rhoads | Applicant |
| US5748956(A) | 1998-05-01 | Lafer et al. | Applicant |
| US5754661(A) | 1998-05-01 | Weinfurtner | Applicant |
| US5765152(A) | 1998-06-01 | Erickson | Applicant |
| US5765176(A) | 1998-06-01 | Bloomberg | Applicant |
| US5768426(A) | 1998-06-01 | Rhoads | Applicant |
| US5768680(A) | 1998-06-01 | Thomas | Applicant |
| US5801687(A) | 1998-09-01 | Peterson et al. | Applicant |
| US5808689(A) | 1998-09-01 | Small | Applicant |
| US5809160(A) | 1998-09-01 | Powell et al. | Applicant |
| US5822432(A) | 1998-10-01 | Moskowitz et al. | Applicant |
| US5828485(A) | 1998-10-01 | Hewlett | Applicant |
| US5832119(A) | 1998-11-01 | Rhoads | Applicant |
| US5845281(A) | 1998-12-01 | Benson | Applicant |
| US5848424(A) | 1998-12-01 | Scheinkman et al. | Applicant |
| US5852673(A) | 1998-12-01 | Young | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5870405(A) | 1999-02-01 | Hardwick et al. | Applicant |
| US5875249(A) | 1999-02-01 | Mintzer et al. | Applicant |
| US5915019(A) | 1999-06-01 | Ginter et al. | Applicant |
| US5917912(A) | 1999-06-01 | Ginter et al. | Applicant |
| US5920861(A) | 1999-07-01 | Hall et al. | Applicant |
| US5920878(A) | 1999-07-01 | DeMont | Applicant |
| US5926822(A) | 1999-07-01 | Garman | Applicant |
| US5940504(A) | 1999-08-01 | Griswold | Applicant |
| US5943422(A) | 1999-08-01 | Van Wie et al. | Applicant |
| US5974141(A) | 1999-10-01 | Saito | Applicant |
| US5982956(A) | 1999-11-01 | Lahmi | Applicant |
| US5983218(A) | 1999-11-01 | Syeda-Mahmood | Applicant |
| US5991500(A) | 1999-11-01 | Kanota et al. | Applicant |
| US5991876(A) | 1999-11-01 | Johnson et al. | Applicant |
| US5995625(A) | 1999-11-01 | Sudia et al. | Applicant |
| US6035177(A) | 2000-03-01 | Moses et al. | Applicant |
| US6141753(A) | 2000-10-01 | Zhao et al. | Applicant |
| US6151578(A) | 2000-11-01 | Bourcet et al. | Applicant |
| US6182218(B1) | 2001-01-01 | Saito | Applicant |
| US6185683(B1) | 2001-02-01 | Ginter et al. | Applicant |
| US6226618(B1) | 2001-05-01 | Downs et al. | Applicant |
| US6229924(B1) | 2001-05-01 | Rhoads et al. | Applicant |
| US6233684(B1) | 2001-05-01 | Stefik et al. | Applicant |
| US6236971(B1) | 2001-05-01 | Stefik et al. | Applicant |
| US6266430(B1) | 2001-07-01 | Rhoads | Applicant |
| US6272176(B1) | 2001-08-01 | Srinivasan | Applicant |
| US6330335(B1) | 2001-12-01 | Rhoads | Applicant |
| US6353672(B1) | 2002-03-01 | Rhoads | Applicant |
| US6363159(B1) | 2002-03-01 | Rhoads | Applicant |
| US5636292(C1) | 2002-06-01 | Rhoads | Applicant |
| US6398245(B1) | 2002-06-01 | Gruse et al. | Applicant |
| US6433946(B2) | 2002-08-01 | Ogino | Applicant |
| US6442285(B2) | 2002-08-01 | Rhoads et al. | Applicant |
| US6449367(B2) | 2002-09-01 | Van Wie et al. | Applicant |
| US6449379(B1) | 2002-09-01 | Rhoads | Applicant |
| US6505160(B1) | 2003-01-01 | Levy et al. | Applicant |
| US6519352(B2) | 2003-02-01 | Rhoads | Applicant |
| US6539095(B1) | 2003-03-01 | Rhoads | Applicant |
| US6542620(B1) | 2003-04-01 | Rhoads | Applicant |
| US6587821(B1) | 2003-07-01 | Rhoads | Applicant |
| US6590997(B2) | 2003-07-01 | Rhoads | Applicant |
| US6654480(B2) | 2003-11-01 | Rhoads | Applicant |
| US6675146(B2) | 2004-01-01 | Rhoads | Applicant |
| US6694041(B1) | 2004-02-01 | Brunk | Applicant |
| US6754377(B2) | 2004-06-01 | Rhoads | Applicant |
| US6768808(B2) | 2004-07-01 | Rhoads | Applicant |
| US6778682(B2) | 2004-08-01 | Rhoads | Applicant |
| US6807534(B1) | 2004-10-01 | Erickson | Applicant |
| US6816596(B1) | 2004-11-01 | Peinado et al. | Applicant |
| US6829368(B2) | 2004-12-01 | Meyer et al. | Applicant |
| US6868497(B1) | 2005-03-01 | Levy | Applicant |
| US6959100(B2) | 2005-10-01 | Rhoads | Applicant |
| US6987862(B2) | 2006-01-01 | Rhoads | Applicant |
| US6990453(B2) | 2006-01-01 | Wang et al. | Applicant |
| US7006555(B1) | 2006-02-01 | Srinivasan | Applicant |
| US7010144(B1) | 2006-03-01 | Davis et al. | Applicant |
| US7020304(B2) | 2006-03-01 | Alattar et al. | Applicant |
| US7035427(B2) | 2006-04-01 | Rhoads | Applicant |
| US7047241(B1) | 2006-05-01 | Erickson | Applicant |
| US7047413(B2) | 2006-05-01 | Yacobi et al. | Applicant |
| US7050603(B2) | 2006-05-01 | Rhoads et al. | Applicant |
| US7058697(B2) | 2006-06-01 | Rhoads | Applicant |
| US7113614(B2) | 2006-09-01 | Rhoads | Applicant |
| US7127744(B2) | 2006-10-01 | Levy | Applicant |
| US7171016(B1) | 2007-01-01 | Rhoads | Applicant |
| US7248717(B2) | 2007-07-01 | Rhoads | Applicant |
| US7266704(B2) | 2007-09-01 | Levy | Applicant |
| US7372976(B2) | 2008-05-01 | Rhoads et al. | Applicant |
| US7415129(B2) | 2008-08-01 | Rhoads | Applicant |
| US2001/0004736(A1) | 2001-06-01 | Hirano et al. | Applicant |
| US2001/0008557(A1) | 2001-07-01 | Stefik et al. | Applicant |
| US2001/0026618(A1) | 2001-10-01 | Van Wie et al. | Applicant |
| US2001/0032312(A1) | 2001-10-01 | Runje et al. | Applicant |
| US2001/0042043(A1) | 2001-11-01 | Shear et al. | Applicant |
| US2002/0002468(A1) | 2002-01-01 | Spagna et al. | Applicant |
| US2002/0007456(A1) | 2002-01-01 | Peinado et al. | Applicant |
| US2002/0019814(A1) | 2002-02-01 | Ganesan | Applicant |
| US2002/0048369(A1) | 2002-04-01 | Ginter et al. | Applicant |
| US2002/0059238(A1) | 2002-05-01 | Saito | Applicant |
| US2002/0062252(A1) | 2002-05-01 | Van Zoest et al. | Applicant |
| US2002/0065780(A1) | 2002-05-01 | Barritz et al. | Applicant |
| US2002/0107803(A1) | 2002-08-01 | Lisanke et al. | Applicant |
| US2002/0112171(A1) | 2002-08-01 | Ginter et al. | Applicant |
| US2002/0186844(A1) | 2002-12-01 | Levy et al. | Applicant |
| US2003/0056103(A1) | 2003-03-01 | Levy et al. | Applicant |
| DE2943436(A1) | 1981-05-01 | Applicant | |
| EP493091(A1) | 1992-07-01 | Applicant | |
| GB2260246(A) | 1993-07-01 | Applicant | |
| GB2292506(A) | 1996-02-01 | Applicant | |
| JP5-37795(A) | 1993-02-01 | Applicant | |
| WO89/09985(A1) | 1989-10-01 | Applicant | |
| WO93/07689(A1) | 1993-04-01 | Applicant | |
| WO94/11989(A1) | 1994-05-01 | Applicant | |
| WO96/31049(A1) | 1996-10-01 | Applicant |
Non-Patent Literature (27)
- Koch et al., “Copyright Protection for Multimedia Data,” Proc. Int. Conf. on Digital Media and Electronic Publishing, Dec. 1994.Examiner
- Burgett et al., “Copyright Labeling of Digitized Image Data,” IEEE Communications Magazine, Mar. 1998, pp. 94-100.Examiner
- Herrigel et al., “Secure Copyright Protection Techniques for Digital Images,” Information Hiding 1998, LNCS vol. 1525, Apr. 1998, pp. 169-190.Examiner
- Namba, S. et al., “A Program Identification Code Transmission System Using Low-Frequency Audio Signals,” NHK Laboratories Note, Ser. No. 314, Mar. 1985.Applicant
- Steele, R. et al., “Embedding Data in Speech using Scrambling Techniques,” IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 3, May 1982.Applicant
- Steele, R. et al., “Simultaneous Transmission of Speech and Data Using Code-Breaking Techniques,” The Bell System Tech. Jour., vol. 60, No. 9, pp. 2081-2105, Nov. 1981.Applicant
- ten Kate, et al., “Digital Audio Carrying Extra Information,” Philips Research Labs, pp. 1097-1100, IEEE 1990.Applicant
- “Simultaneous subliminal signalling in conventional sound circuits: a feasibility study,” BBC Research Department Report No. 1971/1.Applicant
- P.C.J. Hill, “Simultaneous Subliminal Signalling in Conventional Sound Circuits,” BBC Engineering, No. 90, pp. 14-31, 1972.Applicant
- Bender et al., “Techniques for Data Hiding,” Proc. SPIE vol. 2420: Storage and Retrieval for Image and Video Databases III, Mar. 1995, pp. 164-173.Applicant
- Brassil et al., “Electronic Marking and Identification Techniques to Discourage Document Copying,” Proceedings of INFOCOM '94 Conference on Computers, pp. 1278-1287, Jun. 12-16, 1994 (presented at IEEE Communications Society Conference).Applicant
- Dautzenberg, “Watermarking Images,” Trinity College (Dublin) Dept. of Microelectronics and Electrical Engineering (47 pages), Oct. 1994.Applicant
- Kageyama et al, Melody Retrieval with Humming, Proceedings of Int. Computer Music Conference (ICMC), 1993.Applicant
- Komatsu et al., “Authentication System Using Concealed Image in Telematics,” Memoirs of the School of Science & Engineering, Waseda Univ., No. 52 pp. 45-60, 1988.Applicant
- Matsui, et al., “Video-Steganography: How to Secretly Embed a Signature in a Picture,” IMA Intellectual Property Project Proceeding, vol. 1 issue 1 pp. 187-205, Jan. 1994.Applicant
- Matsutani et al., “A construction of Copyright-Protected Image Data,” Technical Report of IEICE, ISEC94-58, Mar. 1995 (English Translation).Applicant
- Quisquater, J., et al., “Access Control and Copyright Protection for Images, WorkPackage 8: Watermarking” (46 pages), Jun. 30, 1995.Applicant
- Quisquater, J., et al., “Conditional Access and Copyright Protection Based on the Use of Trusted Third Parties” (43 pages), 1995.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
- Tanaka et al., “Embedding the Attribute Information Into a Dithered Image,” Systems and Computers in Japan, vol. 21 No. 7 pp. 43-50, 1990.Applicant
- Tanaka et al., “New Integrated Coding Schemes for Computer-Aided Facsimile,” Proc. of IEEE Int'l Conf. on Sys. Integration, pp. 275-281, Apr. 1990.Applicant
- Tanaka et al., “A Visual Retrieval System with Private Information For Image Database”, Nat'l Defense Academy (Japan) Dept. of Computer Science, Proc. of Int'l Conf. On DSP Applications and Technology, pp. 415-421, Oct. 1991.Applicant
- May 20, 2008 Office Action from Assignee's U.S. Appl. No. 11/775,726 and Jun. 3, 2008 Amendment in response thereto.Applicant
- Claims as filed on May 7, 2008 from assignee's U.S. Appl. No. 12/116,645.Applicant
- Dec. 20, 2005 Amendment after Allowance; Dec. 13, 2005 Notice of Allowance (including Examiner's Interview summary); Nov. 21, 2005 Supplemental Amendment; Oct. 21, 2005 Amendment; Jul. 22, 2005 non-final Office Action; all from assignee's U.S. Appl. No. 10/821,414 (issued as US Patent No. 7,035,427).Applicant
- Mar. 12, 2007 Notice of Allowance; Feb. 16, 2007 Amendment with RCE; Nov. 17, 2006 Notice of Allowance; Oct. 24, 2006 Amendment; Jul. 19, 2006 non-final Office Action; all from assignee's U.S. Appl. No. 11/191,328 (issued as US Patent No. 7,248,717).Applicant