US 7,532,741 B2Grant
Data hiding in media
Issue Date:2009-05-12
•20 Claims
•3 Drawing Sheets
Abstract
The present invention provides steganographic embedding and detecting techniques, along with related apparatus. One claim recites a signal detector including: an input and an analyzer. The input obtains media including a signal hidden therein. The signal including plural-bit data, the signal being hidden in the media through an arrangement of message objects. The arrangement is facilitated—at least in part—through thresholding of a steganographic signal representing or carrying the plural-bit data. The analyzer analyzes the media to obtain the plural-bit data. Of course, other combinations are provided and claimed as well.
Metadata
Assignee
- Digimarc Corporation
Inventor
- John Stach
Application Information
Application Number:US 12/017,636
Filing Date:2008-01-22
Priority Date:2002-01-18
Art Unit:2624
Classifications
IPC:
H04K1/00
Patent Drawings (3 sheets)
Description
Related Application Data
[0001] The present application is a continuation of U.S. patent application Ser. No. 11/127,442, filed May 11, 2005 (U.S. Pat. No. 7,321,667), which is a continuation of U.S. patent application Ser. No. 10/074,680, filed Feb. 11, 2002 (published as US 2002-0136429 A1 and now abandoned), which claims the benefit of U.S. Provisional Patent Application No. 60/350,505, filed Jan. 18, 2002, titled “Data Hiding Through Arrangement of Objects.” The present application is also related to U.S. patent application Ser. No. 09/127,502, filed Jul. 31, 1998 (now U.S. Pat. No. 6,345,104), which is a continuation-in-part of U.S. patent application Ser. No. 09/074,034, filed May 6, 1998 (now U.S. Pat. No. 6,449,377). The 09/127,502 application is also a continuation-in-part of U.S. patent application Ser. No. 08/967,693, filed Nov. 12, 1997 (now U.S. Pat. No. 6,122,392), which is a continuation of application Ser. No. 08/614,521, filed Mar. 15, 1996 (now U.S. Pat. No. 5,745,604), which is a continuation of application Ser. No. 08/215,289, filed Mar. 17, 1994 (now abandoned). The Ser. No. 09/127,502 application is also a continuation-in-part of application Ser. No. 08/649,419, filed May 16, 1996 (now U.S. Pat. No. 5,862,260). The 09/127,502 application also claims the benefit of U.S. Provisional application 60/082,228, filed Apr. 16, 1998.
[0002] The present application is also related to U.S. patent application Ser. No. 09/940,872, filed Aug. 27, 2001 (published as US 2003-0039376 A1).
[0003] Each of the above-mentioned patent documents is herein incorporated by reference.
Field of the Invention
[0004] The present invention relates to steganography and data hiding.
Background and Summary of the Invention
[0005] Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process. Most commonly, digital watermarking is applied to media signals such as images, audio signals, and video signals. However, it may also be applied to other types of media objects, including documents (e.g., through line, word or character shifting), software, multi-dimensional graphics models, and surface textures of objects.
[0006] Digital watermarking systems typically have two primary components: an encoder that embeds the watermark in a host media signal, and a decoder that detects and reads the embedded watermark from a signal suspected of containing a watermark (a suspect signal). The encoder embeds a watermark by altering the host media signal. The reading component analyzes a suspect signal to detect whether a watermark is present. In applications where the watermark encodes information, the reader extracts this information from the detected watermark.
[0007] Several particular watermarking techniques have been developed. The reader is presumed to be familiar with the literature in this field. Particular techniques for embedding and detecting imperceptible watermarks in media signals are detailed in the assignee's co-pending U.S. patent application Ser. No. 09/503,881 (now U.S. Pat. No. 6,614,914) and U.S. Pat. No. 6,122,403, which are each herein incorporated by reference.
[0008] In parent application Ser. No. 09/127,502 (now U.S. Pat. No. 6,345,104) we disclose the following: Many security documents are still designed largely by hand. A designer works at a drafting table or computer workstation, and spends many hours laying-out minute (e.g. 5 mm×5 mm) excerpts of the design. To aid integration of watermark and/or calibration pattern data in this process, an accessory layout grid can be provided, identifying the watermark “bias” (e.g. −3 to +3) that is to be included in each 250 micron cell of the security document. If the accessory grid indicates that the luminance should be slightly increased in a cell (e.g. 1%), the designer can take this bias in mind when defining the composition of the cell and include a touch less ink than might otherwise be included. Similarly, if the accessory grid indicates that the luminance should be somewhat strongly increased in a cell (e.g. 5%), the designer can again bear this in mind and try to include more ink than might otherwise be included. Due to the substantial redundancy of most watermark encoding techniques, strict compliance by the designer to these guidelines is not required. Even loose compliance can result in artwork that requires little, if any, further modification to reliably convey watermark and/or calibration information.
[0009] Such “designing-in” of embedded information in security documents is facilitated by the number of arbitrary design choices made by security document designers. A few examples from U.S. banknotes include the curls in the presidents' hair, the drape of clothing, the clouds in the skies, the shrubbery in the landscaping, the bricks in the pyramid, the fill patterns in the lettering, and the great number of arbitrary guilloche patterns and other fanciful designs, etc. All include curves, folds, wrinkles, shadow effects, etc., about which the designer has wide discretion in selecting local luminance, etc. Instead of making such choices arbitrarily, the designer can make these choices deliberately so as to serve an informational—as well as an aesthetic—function.
[0010] To further aid the security document designer, data defining several different information-carrying patterns (both watermark and/or calibration pattern) can be stored on mass storage of a computer a workstation and serve as a library of design elements for future designs. The same user-interface techniques that are employed to pick colors in image-editing software (e.g. Adobe Photoshop) and fill textures in presentation programs (e.g. Microsoft PowerPoint) can similarly be used to present a palette of information patterns to a security document designer. Clicking on a visual representation of the desired pattern makes the pattern available for inclusion in a security document being designed (e.g. filling a desired area).
[0011] In the embodiment earlier-described, the calibration pattern is printed as a visible artistic element of the security document. However, the same calibration effect can be provided subliminally if desired. That is, instead of generating artwork mimicking the gray-scale pattern of the reference calibration block, the reference calibration block can itself be encoded into the security document as small changes in local luminance. In many such embodiments, the bias to localized document luminance due to the calibration pattern is simply added to the bias due to the watermark data, and encoded like the watermark data (e.g. as localized changes to the width or position of component line-art lines, as inserted ink droplets, etc.).
[0012] The present invention continues these inventive ideas. According to one aspect of the present invention, message objects are included in an image. The message objects preferably have characteristics that distinguish them from image background or other image objects. Some such distinguishing characteristics many include, color or gray-scale values, luminance values, and a contrast in comparison to other objects or to a background. The distinguishing characteristics can be subtle and need not be perceptible by a human viewer. For example, the message object may be slightly lighter than the image background or other image objects. Or the message objects may be darker than its background.
[0013] Message objects are arranged within the image to convey (or hide) information, such as a steganographic message or signal. The message is typically indistinguishable by a human viewer. However, computer software can analyze the arrangement to determine the hidden information. In one embodiment, a digital watermark signal is reduced to a set of spatial positions. The set of spatial positions sufficiently conveys the digital watermark signal. Message objects are positioned according to the set of spatial points. Non-message objects are combined with the message objects to form an image or design. The message objects include distinguishable characteristics, e.g., via color, contrast, gray-scale level or luminance, in comparison to the non-message objects. The digital watermark signal is detected by distinguishing the message objects from the non-message objects (e.g., via color or contrast differences) and analyzing the relative placement of the message objects within the image or design.
[0014] Additional features and advantages of the present invention will become even more apparent with reference to the following detailed description and accompanying drawings.
Brief Description of the Drawings
[0015] FIG. 1 is a flow diagram illustrating an image construction method according to one aspect of the present invention.
[0016] FIG. 2 illustrates a digital watermark signal.
[0017] FIG. 3 illustrates a representation of the FIG. 2 watermark signal after thresholding.
[0018] FIG. 4 illustrates a gray-scale image including message objects.
Detailed Description
[0019] We have found that the arrangement of objects within an image can be used to convey information—which is otherwise imperceptible to a human viewer. We arrange so-called “message objects” to convey or represent a steganographic signal (e.g., a digital watermark). We define a message object broadly herein as including an information carrier, an image object, a shape, an object or collection of objects, a pixel or group of pixels, a contrast or color/gray-scale area, etc. A set of message objects is arranged within an image or area to form a steganographic message. A few examples are provided below.
[0020] Consider a drawing illustrating a Dalmatian puppy. The puppy has a white coat complimented with black spots. An artist (or digital editor) can arrange the spots—an example of a message object—so as to convey a hidden or steganographic message. More practical, however, is to align the spots according to a predetermined steganographic signal and then sculpt or design the puppy around the aligned spots.
[0021] Now consider an image or picture depicting hundreds of marbles strewn across a surface. Certain of the marbles have an offsetting color (or luminance, gray-scale level, contrast, etc.) when compared to the surface or to other marbles. We call these offset color marbles our “message marbles.” The message marbles are arranged to represent (or to form) a steganographic signal. More practical, perhaps, is to initially arrange the message marbles according to a predetermined signal (e.g., a digital watermark signal, an orientation signal or various combinations of both) and then “fill-in” non-message marbles to complete the image.
[0022] Another example is particularly appealing to our astronomy friends. Consider an image or graphic depicting a nighttime sky. The sky is populated with “message stars.” The message stars are arranged in the nighttime sky in a predetermined manner according to a steganographic signal. The sky is further populated with non-message stars. The message stars are preferably distinguishable from the non-message stars. The distinguishing characteristics need not be visibly perceptible, and may be based on subtle differences, e.g., as measured in luminance, color levels, brightness, contrast, etc.
[0023] A steganographic decoder, analyzing a digital version (e.g., an optically captured image) of the Dalmatian puppy, marble image or populated nighttime sky, decodes the steganographic message.
[0024] While the above signal-conveying techniques rely on the arrangement of message objects in a spatial domain (e.g., in an image), message formation or detection can be based in either a spatial or transform (e.g., Fourier or frequency) domain. For example, the arrangement of the message objects in the spatial domain may have significance in a frequency domain (e.g., may correspond to a pattern of peaks, etc.). Message detection can be accordingly facilitated, e.g., as discussed in Assignee's U.S. patent application Ser. No. 09/940,872 (published as U.S. 2003-0039376 A1) and U.S. patent application Ser. No.09/503,881 (now U.S. Pat. No. 6,614,914), each of which is herein incorporated by reference. The incorporated by reference patent documents detail many techniques for signal hiding and message detection.
[0025] (Applicant notes that since the Fourier transform is a linear operation, adjustments to pixels in a region may be made in the frequency or spatial domain. For example, a digital watermark embedder can adjust the frequency domain representation of the host signal according to the watermark definition to form a frequency domain representation of the watermarked signal region, and then take the inverse Fourier transform of the watermarked regions to produce the watermarked signal in the spatial domain. Alternatively, the embedder can compute a difference signal to effect the desired changes to the region in the frequency domain, and then compute the inverse transform of the difference signal into the spatial domain, where corresponding pixels of the difference signal and host signal region are summed. Either way, the result is a watermarked signal in the original domain of the host signal.).
Steganographic Image Construction
[0026] We now describe our preferred image construction with reference to FIGS. 1-4 . FIG. 1 illustrates a flow diagram depicting method steps for a first embodiment of the present invention. A digital watermark signal is provided in step 10. The watermark signal preferably includes a message component, e.g., a payload or identifier, and/or an orientation signal. An orientation signal is helpful to resolve image distortion such as scale and rotation. FIG. 2 illustrates an example of a watermark signal shown in a spatial domain. (We note that the FIG. 2 representation is exaggerated to help simplify the discussion.). Although not required, the digital watermark signal is preferably a pure (or “raw”) signal in that it does not include image data.
[0027] Thresholding is applied to the FIG. 2 watermark signal (step 12). Thresholding preferable identifies (or reduces the watermark signal to) a set of relevant points. The relevant points may correspond to or represent a wide range of features, such as signal or frequency peak levels, magnitude peaks, watermark message components, watermark orientation references, spatial domain signal characteristics, etc. Regardless of the relevant features used to determine a relevant point, the set of relevant points is preferably sufficient to represent (or convey) the watermark signal. (We use the term “thresholding” generally herein to include a process to identify a set and location of spatial points for placement of message objects. Alternatively, the thresholding may identify relevant frequency domain points, which can be mapped or transformed into a spatial domain representation.) The thresholding procedure can also be adjusted to provide a more or less robust watermark signal. For example, the spacing of relevant points can be increased, but at a cost of robustness.
[0028] While the term “thresholding” is used as an illustrative technique, the present invention is not so limited. Indeed there are other ways to refine a watermark signal into a set or map of relevant points. For example, a frequency analysis can be used to identify significant frequency characteristics (e.g., peaks). These characteristics can be mapped to the spatial domain to identify a placement point (e.g., a spatial location). Or, as in another implementation, the digital watermark signal is quantitized, e.g., via a root mean square measurement. Of course other techniques can be used to reduce a watermark signal to a set of relevant spatial points sufficient to convey the signal.
[0029] The set of relevant points comprises a placement map as shown in FIG. 3 . (It should be appreciated that there are many, many possible placement map patterns, including many more or less significant positions. FIG. 3 illustrates but one such possible placement map.). The FIG. 3 placement map includes a plurality of spatial positions or points (e.g., 20 and 21). These points guide the placement of message objects.
[0030] In one alternative implementation, the placement map includes a relative contrast indicator. For example, a placement map point may include a relatively darker or larger point (20), indicating a need for a stronger contrast level (or color, gray-scale, etc.) of a message object, in comparison to a relatively lighter or smaller point (21). A higher contrast may signify a predetermined frequency domain characteristic, such as peak magnitude or frequency response, etc.
[0031] Returning to FIG. 1 , message objects are arranged according to the placement mapping (step 14). For example, message marbles (or message stars, black Dalmatian spots, etc.) are placed on or over (or otherwise placed corresponding to) the placement map points. The message objects thus convey the steganographic signal. Other image objects can be placed in the image, e.g., to fill in or otherwise populate the image.
Alternative Steganographic Images
[0032] There are many alternative ways to implement our inventive steganographic techniques. Consider the following illustrative examples.
[0033] Off-the-shelf digital image editing tools (e.g., as provided by Adobe) can be used to place message objects in an image. The operator selects a message object, adjusts the object contrast (or color/gray-level, etc.) to sufficiently set the object apart from other image objects or the image background, and then places the objects according to a digital watermark placement map. Of course this placement process can be automated.
[0034] A farmer's field can be plowed or crops can be planted or cut to represent message objects, all arranged according to a steganographic placement map. An aerial image of the farmer's field then includes the steganographic message.
[0035] Different color tulips (or other flowers) can be planted according to a placement map. For example, groups of white tulips (e.g., message tulips) can be planted in an otherwise purple tulip field. An aerial image captures the field—including the steganographic message.
[0036] Captured images can be used in advertisements, e.g., when the steganographic message carries a link (e.g., a URL or an identifier used to obtain a link). Assignee's U.S. patent application Ser. No. 09/571,422, filed May 15, 2000, discloses many suitable linking techniques that are expressly contemplated as being combined with the present invention. This patent application is herein incorporated by reference.
[0037] Our techniques can even be advantageously employed in the photo-mosaic field. (Photo-mosaic processes are even further discussed, e.g., in U.S. Pat. Nos. 6,137,498 and 5,649,032, which are each incorporated herein by reference.). As disclosed in U.S. Pat. No. 6,137,498, a mosaic image is formed from a database (or collection) of source images. Source images are analyzed, selected and organized to produce the mosaic image. A target image is divided into tile regions, each of which is compared with individual source image portions to determine the best available matching source image. Positioning respective best-matching source images at the respective tile regions forms the mosaic image.
[0038] An improvement to a photo-mosaic process is to arrange message source photos (e.g., representing message objects) according to a watermark placement map. Preferably, the message source photos are subtly distinguishable from other mosaic photos via a gray-scale value, a color value, contrast or luminance, etc. The message source photos form (or convey) a steganographic signal. In one implementation, the arrangement of message source photos is carried out via the “best available matching” discussed above with respect to the U.S. Pat. No. 6,137,498 patent. In a first implementation, the process determines whether a selected best available photo is to be titled over a placement map position. If so, the photo characteristics (luminance, contrast, gray-scale, etc.) are subtly altered to create a message source photo. In a second implementation, the “best available matching” algorithm includes selection criteria, e.g., if selecting a photo for a placement map position, the algorithm selects a photo with sufficient distinguishing characteristics to qualify as a message object. The distinguishing characteristics can be measured in terms of its neighbors (e.g., a message photograph may include an overall different contrast, color or gray-scale level from its neighboring photographs) or in terms of non-message photographs. In a third implementation, message source photos are arranged according to a placement map, and then other source photos are used to fill in or complete the photo mosaic. In a variation of this third implementation, the other, non-message source photos are selected and arranged according to a best available matching technique.
[0039] Similar embedded designs can be made using coins, bills, umbrellas, coffee mugs, opened or closed blinds in an apartment building, shapes, snow flakes, groups of pixels, etc., etc.
[0040] With reference to FIG. 4 , message objects of different colors (or gray-levels, tones, contrasts, luminance, etc.) can be used in the same image. For example, the FIG. 4 image includes a gray background (shown by the diagonal hashes). A message object can be distinguished from the background if it is either lighter 30 or darker 31 than the background. Or if the background is blue, message objects can be red or green, etc.
Message Detection
[0041] An image created according to our inventive techniques can be read using steganographic or digital watermarking decoding techniques, e.g., as described in assignee's Ser. Nos. 09/571,422 and/or 09/503,881 (now U.S. Pat. No. 6,614,914) applications. In one implementation, Digimarc MediaBridge watermark reading software, available from Digimarc Corporation headquartered in Tualatin, Oreg., is used to read an image including a corresponding MediaBridge digital watermark signal represented through our message object arranging techniques. Of course, other decoding techniques can be used, particularly when they correspond to the techniques used to generate the original watermark signal. (For example, when using a Digimarc MediaBridge reader, the watermark signal is preferably created using a MediaBridge signal generator or embedder.). Most commonly, the reader identifies the message objects from the different levels of contrast (or color, gray-scale, luminance, etc.) between a message object and other objects or background.
Conclusion
[0042] The foregoing are just exemplary implementations of the present invention. It will be recognized that there are a great number of variations on these basic themes. The foregoing illustrates but a few applications of the detailed technology. There are many others.
[0043] To provide a comprehensive disclosure without unduly lengthening this specification, applicants incorporate by reference, in their entireties, the disclosures of the above-cited patents and applications. The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this application and the incorporated-by-reference patents/applications are expressly contemplated.
[0044] One application uses our inventive embedding techniques for “long-distance” or aerial digital watermark reading, e.g., for some of the traffic monitoring examples disclosed in Assignee's U.S. Provisional Patent Application No. 60/327,687, filed Oct. 5, 2001. (In one experiment we created a digitally watermarked image using our inventive object placement techniques disclosed herein. We then optically captured an image of the watermarked image with a digital camera augmented with a telescope. The watermarked image was about 100 feet away from the camera/telescope. The watermark was successfully detected.).
[0045] Although not belabored herein, artisans will understand that the systems and methods described above can be implemented using a variety of hardware and software systems. Alternatively, dedicated hardware, or programmable logic circuits, can be employed for such operations.
[0046] The various section headings in this application are provided for the reader's convenience and provide no substantive limitations. The features found in one section may be readily combined with those features in another section.
[0047] In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiments are illustrative only and should not be taken as limiting the scope of the invention. Rather, we claim as our invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.
Claims
What is claimed is:
1. An apparatus comprising:
electronic processing circuitry; and
memory comprising instructions for execution via said electronic processing circuitry, said instructions comprising instructions to:
obtain a steganographic signal;
threshold the steganographic signal to yield a set of points; and
arrange objects in accordance with the set of points to represent the steganographic signal.
2. The apparatus of claim 1 wherein said instructions to arrange utilize a transform domain.
3. The apparatus of claim 1 wherein the set of points correspond to points in a transform domain.
4. A physical document including at least a surface and a hidden signal carried on or in the surface, the hidden signal comprising a set of positions identified through reducing a steganographic signal to the set of positions, the set of positions comprising location positions corresponding to the surface, wherein objects are arranged on or in the surface according to the set of positions to convey the hidden signal.
5. The document of claim 4 wherein the document comprises an image.
6. The document of claim 4 wherein the document comprises a photo-mosaic.
7. The document of claim 6, wherein the objects comprise photographs.
8. An apparatus comprising:
electronic processing circuitry; and
memory comprising instructions for execution via said electronic processing circuitry, said instructions comprising instructions to:
obtain a steganographic signal including data;
reduce the steganographic signal to yield a set of transform domain placement positions, the set of transform domain placement positions comprising a placement map; and
arranging message objects in a host signal according to the placement map, whereby the data is obtainable from analysis of the host signal.
9. The apparatus of claim 8, wherein once arranged, the objects convey the steganographic signal.
10. The apparatus of claim 9, further comprising instructions to arrange non-message objects to form an image or design, the non-message objects differing from the message object in at least one of color, contrast, gray-scale or luminance.
11. The apparatus of claim 8 wherein the host signal comprises at least an image or video.
12. A method comprising:
identifying a set of features in a plural-bit steganographic signal utilizing a processor or processing circuitry, the set of features comprising less features than contained in the steganographic signal;
altering a host signal utilizing the processor or processing circuitry to include a representation of the set of features, whereby the plural-bits of the steganographic signal are detectable from machine-analysis of the set of features.
13. A computer-readable medium comprising circuitry or instructions to perform the method of claim 12.
14. The method of claim 12 wherein said act of altering comprises altering data corresponding to the host signal in a frequency domain.
15. The method of claim 12 wherein the host signal comprises at least an image or video.
16. A detector comprising:
an input to obtain media comprising a signal hidden therein, the signal including plural-bit data, the signal being hidden in the media through an arrangement of message objects, the arrangement being facilitated—at least in part—through thresholding of a steganographic signal representing or carrying the plural-bit data; and
an analyzer comprising at least processing circuitry or a processor to analyze the media to obtain the plural-bit data.
17. The signal detector of claim 16 with said analyzer utilizing a frequency domain transform.
18. The signal detector of claim 16 wherein the media comprises at least an image or video.
19. A signal detector comprising:
an input to obtain media comprising a signal hidden therein, the signal including plural-bit data, the signal being hidden in the media through an arrangement of message objects, the arrangement being facilitated—at least in part—through thresholding of a steganographic signal representing or carrying the plural-bit data;
an analyzer to analyze the media to obtain the plural-bit data;
electronic processing circuitry, and
memory, said memory comprising instructions for execution via said electronic processing circuitry, the instructions comprising instructions to facilitate the input and analyzer.
20. The signal detector of claim 19 with said analyzer utilizing a frequency domain transform.
Patent Citations (79)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3859633(A) | 1975-01-01 | Ho et al. | Applicant |
| US3893080(A) | 1975-07-01 | Ho et al. | Applicant |
| US4748679(A) | 1988-05-01 | Gold et al. | Applicant |
| US4876617(A) | 1989-10-01 | Best et al. | Applicant |
| US5010405(A) | 1991-04-01 | Schreiber et al. | Applicant |
| US5278400(A) | 1994-01-01 | Appel | Applicant |
| US5329108(A) | 1994-07-01 | Lamoure | Applicant |
| US5530759(A) | 1996-06-01 | Braudaway et al. | Applicant |
| US5568570(A) | 1996-10-01 | Rabbani | Applicant |
| US5581800(A) | 1996-12-01 | Fardeau et al. | Applicant |
| US5664018(A) | 1997-09-01 | Leighton | Applicant |
| US5721788(A) | 1998-02-01 | Powell et al. | Applicant |
| US5745604(A) | 1998-04-01 | Rhoads | Applicant |
| US5765176(A) | 1998-06-01 | Bloomberg | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5905800(A) | 1999-05-01 | Moskowitz et al. | Applicant |
| US6101602(A) | 2000-08-01 | Fridrich | Examiner |
| US6121530(A) | 2000-09-01 | Sonoda | Applicant |
| US6122392(A) | 2000-09-01 | Rhoads | Applicant |
| US6122403(A) | 2000-09-01 | Rhoads | Applicant |
| US6131161(A) | 2000-10-01 | Linnartz | Applicant |
| US6154571(A) | 2000-11-01 | Cox et al. | Applicant |
| US6181802(B1) | 2001-01-01 | Todd | Applicant |
| US6185683(B1) | 2001-02-01 | Ginter et al. | Applicant |
| US6198832(B1) | 2001-03-01 | Maes et al. | Examiner |
| US6272176(B1) | 2001-08-01 | Srinivasan | Applicant |
| US6278385(B1) | 2001-08-01 | Kondo et al. | Applicant |
| US6286100(B1) | 2001-09-01 | Morimoto et al. | Applicant |
| US6334187(B1) | 2001-12-01 | Kadono | Applicant |
| US6345104(B1) | 2002-02-01 | Rhoads | Applicant |
| US6415040(B1) | 2002-07-01 | Linnartz et al. | Applicant |
| US6418232(B1) | 2002-07-01 | Nakano et al. | Applicant |
| US6427012(B1) | 2002-07-01 | Petrovic | Applicant |
| US6449367(B2) | 2002-09-01 | Van Wie et al. | Applicant |
| US6449377(B1) | 2002-09-01 | Rhoads | Applicant |
| US6463162(B1) | 2002-10-01 | Vora | Applicant |
| US6477276(B1) | 2002-11-01 | Inoue et al. | Applicant |
| US6493457(B1) | 2002-12-01 | Quackenbush et al. | Applicant |
| US6505160(B1) | 2003-01-01 | Levy et al. | Applicant |
| US6563936(B2) | 2003-05-01 | Brill et al. | Applicant |
| US6567101(B1) | 2003-05-01 | Thomas | Applicant |
| US6614914(B1) | 2003-09-01 | Rhoads et al. | Applicant |
| US6700994(B2) | 2004-03-01 | Maes et al. | Examiner |
| US6804377(B2) | 2004-10-01 | Reed et al. | Applicant |
| US6856977(B1) | 2005-02-01 | Adelsbach et al. | Applicant |
| US6912295(B2) | 2005-06-01 | Reed et al. | Applicant |
| US6947571(B1) | 2005-09-01 | Rhoads et al. | Applicant |
| US6968337(B2) | 2005-11-01 | Wold | Applicant |
| US7162052(B2) | 2007-01-01 | Brundage et al. | Applicant |
| US7162146(B2) | 2007-01-01 | Cookson et al. | Applicant |
| US7321667(B2) | 2008-01-01 | Stach | Examiner |
| US2001/0049788(A1) | 2001-12-01 | Shur | Applicant |
| US2001/0052076(A1) | 2001-12-01 | Kadono | Applicant |
| US2002/0009209(A1) | 2002-01-01 | Inoue et al. | Applicant |
| US2002/0016916(A1) | 2002-02-01 | Natarajan | Applicant |
| US2002/0021808(A1) | 2002-02-01 | Iwamura | Applicant |
| US2002/0051559(A1) | 2002-05-01 | Noda et al. | Applicant |
| US2002/0054355(A1) | 2002-05-01 | Brunk | Applicant |
| US2002/0106104(A1) | 2002-08-01 | Brunk et al. | Applicant |
| US2002/0126869(A1) | 2002-09-01 | Wang et al. | Examiner |
| US2002/0136429(A1) | 2002-09-01 | Stach et al. | Applicant |
| US2002/0172394(A1) | 2002-11-01 | Venkatesan et al. | Applicant |
| US2002/0186861(A1) | 2002-12-01 | Echizen et al. | Applicant |
| US2002/0191811(A1) | 2002-12-01 | Kamijo et al. | Applicant |
| US2003/0021439(A1) | 2003-01-01 | Lubin et al. | Examiner |
| US2003/0039376(A1) | 2003-02-01 | Stach | Applicant |
| US2003/0053654(A1) | 2003-03-01 | Patterson et al. | Applicant |
| US2003/0118208(A1) | 2003-06-01 | Epstein | Examiner |
| US2004/0032972(A1) | 2004-02-01 | Stach et al. | Applicant |
| US2005/0063562(A1) | 2005-03-01 | Brunk et al. | Applicant |
| US2005/0105760(A1) | 2005-05-01 | Eggers et al. | Applicant |
| DE2943436(A1) | 1981-07-01 | Applicant | |
| EP493091(A1) | 1992-07-01 | Applicant | |
| EP838050(B1) | 2000-04-01 | Applicant | |
| EP966837(B1) | 2002-07-01 | Applicant | |
| EP1147495(B1) | 2003-01-01 | Applicant | |
| WO173997(A1) | 2001-10-01 | Applicant | |
| WO203328(A1) | 2002-01-01 | Applicant | |
| WO219269(A2) | 2002-03-01 | Applicant |
Non-Patent Literature (14)
- Caldelli et al., “Geometric-Invariant Robust Watermarking through Constellation Matching in the Frequency Domain,” IEEE Proc. Int. Conf. on Image Processing, vol. 2, Sep. 2000, pp. 65-68.Examiner
- Ding et al., “A Novel Digital Image Hiding Technology Based on Tangram and Conway's Game,” IEEE Proc. Int. Conf. on Image Processing, vol. 1, Sep. 2000, pp. 601-604.Examiner
- Rongen et al., “Digital Image Watermarking by Salient Point Modification Practical Results,” Proc. SPIE vol. 3657: Security and Watermarking of Multimedia Contents, Jan. 1999, pp. 273-282.Examiner
- Maes et al., “Digital Watermarking by Geometric Warping,” IEEE Proc. Int. Conf. on Image Processing, vol. 2, Oct. 19998, pp. 424-426.Examiner
- U.S. Appl. No. 60/082,228, filed Apr. 16, 1998, Rhoads.Applicant
- U.S. Appl. No. 60/350,505, filed Jan. 18, 2002, Stach et al.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 8: Watermarking,” Jun. 30, 1995, 46 pages.Applicant
- Bender et al., “Techniques for Data Hiding,” Proc. SPIE, vol. 2420, Feb. 9, 1995, pp. 164-173.Applicant
- Brassil et al., Electronic Marking and Identification Techniques to Discourage Document Copying, Proceedings of INFOCOM '94 Conference on Computer, IEEE Commun. Soc Conference, Jun. 12-16, 1994, pp. 1278-1287.Applicant
- Brassil et al., “Hiding Information in Document Images,” Nov. 1995, 7 pages.Applicant
- Caldelli et al., “Geometric-Invariant Robust Watermarking Through Constellation Matching in the Frequency Domain.” IEEE Proc. Int. Conf. on Image Processing, vol. 2, Sep. 2000, pp. 65-68.Applicant
- Komatsu et al., “A Proposal on Digital Watermark in Document Image Communication and Its Application to Realizing a Signature,” Electronics and Communications in Japan, Part 1, vol. 73, No. 5, 1990, pp. 22-33.Applicant
- Aug. 28, 2007 Notice of Allowance; Aug. 7, 2007 Supplemental Amendment (Including applicant's Interview Summary); Aug. 3, 2007 Examiner's Interview Summary; Jul. 23, 2007 Amendment; Jul. 18, 2007 non-final Office Action; and Feb. 12, 2007 preliminary Amendment; all from assignee's U.S. Appl. No. 11/127,442 (now US Patent No. 7,321,667).Applicant
- Jun. 20, 2005 Letter of Express Abandonment of the application; Mar. 22, 2005 Notice of Allowance; Nov. 1, 2004 Amendment with RCE; Jul. 30, 2004 Notice of Allowance (including Examiner's Interview Summary); all from U.S. Appl. No. 10/074,680 (published as US 2002-0136429 A1—now abandoned).Applicant