US 6,768,809 B2Grant
Digital watermark screening and detection strategies
Issue Date:2004-07-27
•20 Claims
•3 Drawing Sheets
Abstract
To enhance decoding of signals suspected of containing an embedded auxiliary signal, a suspect signal is screened to compute detection values evincing presence and strength of the embedded signal. Screening strategies control detector actions, such as rejecting un-marked signals, improving synchronization of a reader used to extract hidden messages in suspect signals, determining authenticity of signals, and controlling use of the signals.
Metadata
Assignee
- Digimarc Corporation
Inventors
- Geoffrey B. Rhoads
- Ravi K. Sharma
Application Information
Application Number:US 10/359,015
Filing Date:2003-02-04
Priority Date:2000-02-14
Art Unit:7
Classifications
IPC:
G06M 900
Field of Search:
382100382190382195382206382209382219382220382221382224382229382232382233382235382276382278382280382286382287713155713160713161713162713168713176713179713180713181713187713189380200380252380253380254380277380 56348465348604
Patent Drawings (3 sheets)
Description
Related Application Data
[0002] This patent application is a continuation of Ser. No. 09/526,982, filed Mar. 15, 2000, (now U.S. Pat. No. 6,516,079), which is a continuation-in-part of application Ser. No. 09/503,881, filed Feb. 14, 2000 (Now U.S. Pat. No. 6,614,914).
Technical Field
[0003] The invention relates to digital watermarking, and more particularly relates to watermark detection in multimedia content (e.g., still image, video and audio signals).
Background and Summary
[0004] The reader is presumed to be familiar with digital watermarking technology. See, e.g., co-pending application Ser. No. 09/503,881, filed Feb. 14, 2000, entitled Watermark Reader and Embedder, the disclosure of which is incorporated by reference.
[0005] One objective of watermark detectors is to reject unmarked signals (e.g., image, audio, video signals) at the earliest possible stage of detection. The detector may conclude that a signal is unmarked based on quantitative evidence of the watermark (or lack thereof) in a signal suspected of having a watermark. The signal might be an unmarked component of a marked signal, or simply an unmarked signal. Also, in some cases, the signal, though previously marked, may appear to be unmarked due to removal or degradation of the watermark. By accurately identifying an unmarked signal at an early stage, the detector can avoid unnecessary processing. Also, the apparent absence of a watermark may trigger some action (or prevent an action) such as providing output indicating that the signal has been tampered with or controlling processing of the signal (e.g., preventing copying, playing or recording in copy protection applications).
[0006] A related objective of a watermark detector is measuring the strength of a watermark signal. Based on the watermark strength, the detector can assess whether a suspect signal has a valid watermark, and the extent to which a signal has been transformed. The detector can also determine the likelihood that a suspect signal includes a valid watermark or recoverable watermark message. Such an evaluation helps the detector allocate its processing resources on portions of the suspect signal that are likely to contain a valid watermark or recoverable watermark message.
[0007] The cited application describes a variety of techniques for detecting a watermark. Some of these techniques correlate attributes of a watermark signal with a signal suspected of containing a watermark. By measuring the extent of correlation, a watermark detector assesses whether a watermark is present, and in some cases, determines its orientation in the suspect signal. Related techniques detect a watermark signal by at least partially decoding a message from the suspect signal and then comparing attributes of the message with expected attributes to assess the likelihood that a watermark signal is present. These and other techniques may be used to compute a detection value that quantifies the likelihood that the suspect signal has a watermark.
[0008] This disclosure describes methods of using detection values ascertained from signals suspected of being watermarked to control the detection process. The detection values may be used to reject unmarked signals. In addition, they may be used to refine the detection process by focusing the detector on signals or portions of signals that are likely to contain a watermark and/or a recoverable watermark message. Each portion of a suspect signal may be defined by an orientation parameter (or set of parameters like rotation, scale, origin, shear, differential scale, etc.). Also, each portion may represent different orientations of the suspect signal, or a component of the signal.
[0009] This disclosure also describes a method for using two or more detection metrics to control the detection process. The multiple metrics could be derived from independent measurements in multiple stages or could be different features of the same measurement. Each detection metric evaluates detection values to control detection actions. One type of detection metric is a screen used to evaluate suspect signals or portions of a suspect signal for the presence of a watermark. Each stage evaluates detection values to assess whether a suspect signal, or portion of it, is marked.
[0010] This disclosure also describes a method for using absolute and relative detection measures to assess whether a suspect signal is marked. An absolute measure of detection represents quantitative evidence of a watermark signal in a suspect signal, and is usually evaluated independently from other detection values. A relative measure is based on the relative values of two or more detection values, which may be relative or absolute measures. A relative measure may be implemented by computing absolute detection values for different portions of a suspect signal and then computing a relative detection value as a function of the absolute detection values.
[0011] Both absolute and relative detection values may be evaluated relative to desired limits or thresholds to determine an appropriate action. One action is to reject the candidate signal associated with the detection value as being unmarked. Another action is to use the detection values to direct further actions of the detector. One advantage of using both absolute and relative detection values is that they usually contain complementary information. This complementary information helps in improving the watermark screening and detection process.
[0012] In one implementation, a detector computes detection values for different orientation parameter candidates, sorts the detection values in terms of likelihood of representing a valid watermark, and then takes a ratio of a top detection value relative to one or more lesser detection values. The orientation parameter candidates define an approximate orientation and/or location of a watermark in a suspect signal, and as such are associated with a portion of a suspect signal.
[0013] The invention provides a method of analyzing a signal suspected of being embedded with an auxiliary signal. This method computes detection values from a suspect signal. Each detection value corresponds to a measure of an auxiliary signal embedded in the suspect signal. The auxiliary signal being detected comprises a set of attributes embedded at locations within the suspect signal, and each detection value is a measure of the set of attributes. The method computes a relative detection value based on an analysis of two or more of the detection values relative to each other, and controls detector action based on the relative detection value. This detector action may include distinguishing signals that are marked with an auxiliary signal from those that are not. It may also include determining whether the suspect signal is authentic based on the detection values associated with an embedded auxiliary signal.
[0014] Another aspect of the invention is a method of detecting an auxiliary signal embedded in a suspect signal. The embedded auxiliary signal has a set of attributes embedded at locations within the suspect signal. The method computes detection values for two or more auxiliary signal candidates in the suspect signal. It evaluates a detection metric based on the detection values, and controls a detector action based on the detection metric. The metric provides a measure of an embedded auxiliary signal that adapts to the suspect signal according to detection values computed from the suspect signal. The detection values are each computed as a measure of the set of attributes of the auxiliary signal.
[0015] Another aspect of the invention is a detector for analyzing suspect signals having embedded auxiliary signals. The detector has a first screening stage for classifying a suspect signal based on a first detection metric that measures a set of attributes of an auxiliary embedded signal. It also has at least a second screening stage for classifying the suspect signal based on a second detection metric that measures a set of attributes of an auxiliary embedded signal. The first and second stages form a multistage classifier for determining whether a suspect signal is authentic based on measures derived from an embedded auxiliary signal.
[0016] The foregoing and additional features and advantages of the present invention will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
Brief Description of the Drawings
[0017] FIG. 1 is a flow diagram illustrating a watermark detection process.
[0018] FIG. 2 is a flow diagram showing a watermark detector that correlates a calibration signal with a suspect signal to compute detection values.
[0019] FIG. 3 is a flow diagram showing a watermark detector that computes detection values by comparing an expected signature with a watermark signature taken from a suspect signal.
[0020] FIG. 4 is a flow diagram of a process for screening un-marked signals based on detection metrics.
Detailed Description
[0021] A watermark decoder detects a watermark in a suspect signal by computing evidence of watermark signal attributes in the suspect signal. The watermark signal attributes used in detection may be referred to as a calibration or synchronization signal (hereafter referred to as “calibration signal”). The calibration signal may be watermark signal attributes that correspond to message symbols embedded in a watermark. For example, a watermark message may include a “signature” of one or more symbols known to the decoder. In the process of encoding the signature, a watermark encoder modifies a host media signal to compute a composite signal with signal attributes of the signature. To detect the watermark in a suspect signal, a detector analyzes the suspect signal to find evidence of the signature. In this case, the calibration signal corresponds to the attributes of the composite signal used to encode the signature.
[0022] The calibration signal may also be an orientation watermark. To encode the orientation mark, the watermark encoder modifies the host signal to compute a composite signal with signal attributes of the orientation signal. To detect the watermark, a detector analyzes a suspect signal to find evidence of the orientation signal. In this case, the calibration signal corresponds to the orientation signal. Both a message signature and an orientation signal may be embedded in a host signal. Some watermark signals may perform a dual function of encoding a signature and an orientation signal (e.g., a watermark signal acts as a signature and an orientation signal).
[0023] The following description uses the term “calibration signal” to broadly encompass watermark signal attributes used to identify a watermark in a suspect signal. Unless specified otherwise, the calibration signal should be construed to encompass watermark message symbols and/or an orientation signal used to detect a watermark.
[0024] To detect a watermark in a suspect signal, a detector computes quantitative evidence of the calibration signal. One form of evidence is a detection value indicating the extent to which a portion of the suspect signal has attributes that match those of the calibration signal. One such measure is a correlation value that quantifies the correlation between the calibration signal and a portion of the suspect signal. Another measure is the extent to which the known signature matches a signature computed from the suspect signal.
[0025] In the process of detecting a watermark in a suspect signal, the detector may analyze several portions of the suspect signal. In many watermark systems, a key specifies where a watermark is located in an unmodified watermarked signal. However, the decoder does not know whether there is a watermark in a suspect signal. Moreover, transformation of the composite signal may degrade the watermark and alter its orientation in a suspect signal. For many applications, the detector must search for the presence of a watermark and determine its orientation. This process is sometimes referred to as synchronization.
[0026] The synchronization process varies depending on the type of host and watermark signal. In images, the orientation of the watermark may change due to transformations of the host image (e.g., geometric transforms, spatial frequency transforms, phase transforms etc.). In audio, the location of the watermark may also change due to transformations (e.g., temporal shifting or scaling due to up-sampling or down-sampling, frequency shifting, phase shifting, etc.). In video signals, the location of the watermark may change due to these and other transformations.
[0027] Because these transforms may alter a watermark, the detector analyzes several different portions of the suspect signal to find evidence of it. A watermark key may help guide the analysis around certain portions of the suspect signal. Each of these portions has one or more orientation parameters that define a location (and/or orientation) in the suspect signal. In an audio sequence, the portion might be a time window or range of frequencies within an audio segment. In an image, the portion may be a two-dimensional spatial area or range of frequencies. To simplify the discussion, these portions of the suspect signal and their corresponding orientation parameter (or parameters) are generally referred to as candidates. The detector may compute a detection value for each candidate. Then, based on these detection values, the detector may assess whether a watermark is present, and the strength of the watermark.
[0028] FIG. 1 illustrates a process for detecting a watermark in a suspect signal. The detector identifies candidates in the suspect signal (100, 102). A watermark key may be used to locate the candidates. Used in the watermark encoder to embed the calibration signal, the key generally specifies the location of the calibration signal in an unmodified marked signal. The detector then computes a detection value for the candidates (104). Next, it determines how to direct further detector actions based on the detection values (106). The detection value may be an absolute measure derived from a single candidate. Alternatively, it may be relative measure, computed by evaluating the detection value of one or more candidates relative to other candidates.
[0029] The detector may implement different actions based on evaluation of the detection values. One action is to reject the suspect signal as being un-marked. Another action is to use the detection measures to refine initial detection results. One way to refine the initial detection result is to select additional candidates that may increase the likelihood of accurate detection of a watermark and/or recovery of a message embedded in it. In short, the detector may use the detection values to focus detector resources on portions of the suspect signal that show promising evidence of a watermark and/or its calibration signal.
Example Embodiments
[0030] FIG. 2 illustrates an example embodiment of a watermark detector that uses detection values to reject unmarked signals and to direct further detection actions. In this example, the detector correlates the calibration signal (or attributes of it) with the suspect signal (200, 202). In performing the correlation process, the detector may use a watermark key to select initial portions of the suspect signal expected to contain a watermark. For example, the key may specify that the calibration signal has been encoded into marked signals in a particular spatial or temporal location in some given transform domain.
[0031] The correlation process (202) computes correlation values for candidate portions of the suspect signal that exhibit some evidence of the calibration signal (204). A variety of correlation methods may be employed, including, for example general matched filtering. Each candidate may be defined by one or more orientation parameters that describe its location and orientation within the suspect signal. The correlation values for each candidate are absolute detection values.
[0032] Next, the detector computes relative detection values based on the detection values calculated previously from the suspect signal (206). One example of a relative detection value is a ratio of a top absolute detection value to one or more lesser detection values. The detection process may repeat, iteratively refining candidates by adjusting their orientation parameters. In this case, there may be several sets of absolute detection values, and corresponding relative detection values for each set.
[0033] After the detector has computed detection values, it uses those values to control further detection actions. One action is to screen and reject un-marked signals (including un-marked portions of a signal, or portions where a watermark has been degraded) (208). Another action is to use promising detection values (e.g., those values falling within a desired range or exceeding a limit) to direct further detection operations on the suspect signal (210). The cited application provides an example of this action where orientation parameter candidates associated with top detection values are refined to improve detection and watermark message recovery. These types of actions can be used in detectors for different types of signals, including still image, audio and video signals.
[0034] FIG. 3 illustrates an example embodiment of a watermark detector in which the calibration signal is in the form of a signature. In this example, the detector begins by evaluating candidates in the suspect signal (300). As in the prior example, a watermark key may be used to specify an initial candidate location of a calibration signal, assuming that the suspect signal has been marked (302). Using the key to identify a candidate location of a watermark, the detector attempts to decode the signature at the candidate location (304). Even if the suspect signal has been watermarked, the signature may be degraded and/or geometrically transformed due to manipulation of the watermarked signal.
[0035] Next, the detector evaluates the decoded signature relative to the signature used in the encoder (the expected signature) (306). One way to evaluate the signature is to measure the similarity between the decoded signature and the expected signature. An example of this similarity measure is the percentage agreement computation in the cited application. The similarity measure is another example of a detection value associated with a particular candidate.
[0036] Another way to evaluate the presence of a signature in the suspect signal is to perform correlation between signal attributes of the one or more expected symbols and the suspect signal. In fact, some implementations use correlation to decode watermark message symbols. The extent of correlation provides a measure of similarity between an expected signature and a signature observed in the suspect signal.
[0037] Based on the detection value, the detector may reject the signal as being unmarked (308). For example, if the detection value falls below a limit (either predetermined or adapted based on the suspect signal), then the detector may conclude that the associated signal is unmarked.
[0038] The detector may also quantify the extent of watermark degradation. For example, a low detection value represents significant degradation, while a high detection value represents minimal degradation. Such detection values are useful in signal authentication or copy control applications where the extent of degradation is used, for example, to determine whether the suspect signal is authentic or to control use of the suspect signal (e.g., enable/prevent its transmission, playback, recording or copying).
[0039] The detector may also use the detection value to refine its search for a valid calibration signal (310). For example, when the detection values fall within certain limits, then they direct the detector to focus its attempt to synchronize with the calibration signal around the orientation parameter or parameters that yield such detection values.
[0040] The cited application describes methods for computing detection values and using them to direct the actions of the detector. In one implementation, the detector performs multiple stages of detection. One form of calibration signal is an orientation signal. The detector performs correlation between an orientation signal and the suspect signal. Based on the measure of correlation, the detector determines whether to reject the suspect signal. A detection value derived from the correlation is then used to make a decision whether to reject the suspect signal as un-watermarked, or to allow it to proceed to later detection stages.
[0041] In a particular implementation in the cited application, an initial detection stage decides whether a watermark is present in a suspect image and, if so, provides estimates of orientation parameters to later detection stages. In other words, the initial detection stage acts as a classifier that discriminates between marked and unmarked images. The initial detection stage computes rotation and scale parameter candidates, and a measure of correlation for these candidates. It then determines whether to reject the suspect signal based on these measures of correlation. One test for screening unmarked signals is to compute a ratio of the top correlation value to other lesser correlation values for the candidates and then reject the signal as unmarked if the ratio does not exceed a limit. If the screen does not reject the suspect image, later detection stages refine the orientation parameter candidates by computing translation parameters (i.e. the origin of the watermark) and/or other parameters such as differential scale and shear.
[0042] For the orientation parameter candidate, the detector computes correlation between the orientation signal and the suspect signal. This correlation can be computed in the spatial domain, the Fourier magnitude domain, or some other transform domain.
[0043] In some applications, the detection strategy can be improved by performing one or more additional tests on candidates to control further detector processing actions.
[0044] One strategy, detailed below, uses a two stage test to reject un-marked images. This strategy uses both absolute and relative detection values. In experiments, this strategy rejects approximately 99% of unmarked images at an initial detection stage.
[0045] Ideally, the initial detection stage should allow all watermarked images to proceed to later detection stages but reject all unmarked images. However, any practical classifier would accept some number of unmarked images (false positives) and reject some number of marked images (false negatives). The goal is to minimize both the false positives and the false negatives.
[0046] FIG. 4 illustrates an example of a screening strategy that achieves this goal.
[0047] Screen I—This screening strategy uses a detection metric based on relative detection values. Correlation values corresponding to the top candidates are used to compute the relative detection value. In particular, the relative detection value is computed as a ratio of a top correlation value to one or more lesser correlation values or combination of lesser correlation values (e.g., an average of the next N best correlation values). The detection value is compared to a pre-determined threshold T1. If the detection value exceeds T1, the detector proceeds to screen II. If the detection value fails to exceed T1, the suspect image is labeled an unmarked image and further processing ceases.
[0048] The correlation value may be computed in a variety of ways, depending on the nature of the orientation and suspect signals. For images, the correlation may be performed in one or more of the following domains: spatial, transform domain (e.g., Fourier domain), etc. In the case where the orientation signal is an array of impulse functions in the Fourier domain, the detector preferably computes the correlation in the Fourier domain. One measure of correlation analyzes the extent to which the impulse functions of the orientation signal are present in the Fourier Magnitude domain. This is a type of correlation strength and is referred to as Fourier Magnitude Correlation (FMC).
[0049] One way to compute the correlation strength in this context is to compute the dot product of the impulse functions of the orientation signal and the suspect signal in the Fourier Magnitude domain. The dot product is computed between the two signals after transforming the orientation signal to a candidate orientation (e.g., rotating and scaling it based on rotation and scale parameter candidates).
[0050] A related method is to perform an additional filtering process of the samples of the suspect signal in a neighborhood around the location of each impulse function and then summing the result of filtering around each impulse function location. This operation gives an indication of the extent to which the impulse functions are present in the suspect signal. The neighborhood can be defined in a variety of ways, including a square neighborhood of samples centered at the location of the impulse function, or a neighborhood defined along a line or lines through the impulse function (e.g., horizontal line, vertical line, or radial line through the origin of the coordinate space).
[0051] One such filtering operation is to divide the sample in the suspect signal at the impulse location by an average of neighboring samples. If the average value is zero, then the filter result is set to some constant value. In one implementation, the result of filtering at each impulse function location in the Fourier magnitude domain is added to compute a measure of correlation.
[0052] A number of variations to this filtering operation are possible. One such variation is to insert a thresholding function before adding the filtering results. One example is a thresholding process that subtracts a first constant from each filtered result, and then clips values greater than a second constant to that constant value. The result of the thresholding operation is summed to derive a measure of correlation strength.
[0053] Screen II—In this screen, the correlation strength (corresponding to the top candidate after Fourier magnitude correlation) is compared to a pre-determined threshold T2. If the correlation strength exceeds T2, then the suspect image is allowed to proceed to the later detection stages. If the correlation strength fails to exceed T2, the suspect image is labeled an unmarked image and rejected.
[0054] Empirical data shows that for unmarked images, whose correlation strength is high, the remaining correlation values are also comparatively high. Therefore the resulting detection value is low. Screen I is well suited to reject such unmarked images. Most of the unmarked images that do make it beyond Screen I have lower correlation strengths and are rejected by the second step. The combination of the two screens gives high rejection rates.
[0055] The correlation strength is a useful figure of merit since it gives an approximate indication of how many orientation signal impulses (out of the total number of impulses in the orientation signal) were detected. Its use as a measure of the strength of the orientation signal can provide a further metric useful in later stages of detection.
[0056] A beneficial consequence of high rejection rates at an early detection stage is faster performance (speed of detection). Higher rejection means that the detector can avoid additional processing of later detection stages, which may by more computationally complex. As a result, the mean performance times are reduced.
[0057] The following points can be made about this two stage screening:
[0058] 1) There are two screening stages to reject unmarked images. The first stage uses a metric based on a relative detection value. Images that pass this test are subjected to an additional screen where the correlation strength is compared to a pre-determined threshold. Images that do not exceed this threshold are rejected; others proceed to the later detection stages.
[0059] 2) The improved false positive rate means that the overall false positive statistics (all stages combined) improves commensurately.
[0060] 3) The reduction in false positives translates into major performance improvements since very few (approximately 1%) of the unmarked images now reach the next stage of detection. In the cited application, additional stages used to refine the orientation parameter candidates (e.g., compute differential scale, shear, translation) and to decode a watermark message can be avoided or can be made more efficient by focusing on candidates that are more likely to represent a valid, recoverable watermark signal.
[0061] 4) The correlation strength can be used as a figure of merit for the orientation signal.
[0062] 5) The method can be extended to more than two screens.
[0063] 6) In some cases, the order of the screens may be important. For example, interchanging the order of Screen I and Screen II may not provide good results. The order can be determined empirically using training data.
[0064] 7) In each stage of detection, the detector can compute detection values based on one or more features of the suspect signal. Then, using possibly independent detection values from these stages, the detector can combine these values in metrics for screening and refining orientation parameters. Detection values may be considered independent if they are computed independently, rather than derived from each other. For example, a measure of correlation for an orientation signal in a watermark may be independent from a measure of similarity between expected and decoded message symbols from a watermark message.
[0065] The detector may compute different measures of correlation in each stage and evaluate a metric that combines information from these correlation measures to get improved rejection of unmarked signals.
[0066] The measures of correlation may be different in that they are computed in different domains (e.g., spatial, temporal, transform domains), are based on different orientation parameters, are computed for different parts of the suspect signal, or are based on different attributes of the watermark.
[0067] The features evaluated in each stage need not be measures of correlation. For example, one stage may evaluate the similarity between a decoded symbol or symbols from the suspect signal and symbol or symbols expected to be in a watermark message. A statistical analysis may be employed to indicate the likelihood that the decoded symbols represent expected symbols. Based on the similarity measure and/or statistical likelihood, the detection stage provides a detection value that can be combined with a detection value derived from another detection stage. In sum, effective detection metrics may be constructed by combining information from different stages. These detection metrics can then be used to control detector action, such as rejected unmarked signals or focusing further detection on portion of the suspect signal that appear more likely to have a valid, recoverable watermark.
Concluding Remarks
[0068] Having described the principles of my invention with reference to an illustrative embodiment, it should be apparent that the invention can be modified in arrangement and details without departing from such principles. Accordingly, we claim as our invention all such embodiments as may come within the scope and spirit of the following claims, and equivalents thereto.
[0069] To provide a comprehensive disclosure without unduly lengthening the specification, applicant incorporates by reference any patents and patent applications referenced above.
[0070] The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patents/applications are also contemplated.
Claims
We claim:
1. A method of analyzing a signal suspected of being embedded with an auxiliary signal, the method comprising:
computing detection values from a suspect signal, where each detection value corresponds to a measure of an auxiliary signal embedded in the suspect signal, the auxiliary signal being detected comprises a set of attributes embedded at locations within the suspect signal, and each detection value is a measure of the set of attributes;
computing a relative detection value based on an analysis of two or more of the detection values relative to each other; and
controlling detector action based on the relative detection value.
2. The method of claim 1 wherein the detector action comprises determining whether the suspect signal is authentic.
3. The method of claim 1 where the detection values have corresponding orientation parameters; and wherein the orientation parameters approximate a spatial or temporal transform that at least a portion of the suspect signal has undergone subsequent to being embedded with an auxiliary signal.
4. A tangible medium on which is stored instructions for performing the method of claim 1.
5. The method of claim 1 wherein the auxiliary signal carries hidden message symbols in the suspect signal.
6. The method of claim 1 wherein the auxiliary signal performs a dual function of carrying a message of two or more symbols and an orientation signal.
7. The method of claim 1 wherein the attributes comprise impulse functions in a transform domain.
8. The method of claim 7 wherein the transform domain comprises a frequency domain.
9. The method of claim 7 including filtering impulse functions detected in the suspect signal as a function of neighboring samples of the detected impulse functions.
10. The method of claim 1 wherein the detection values comprise correlation values.
11. The method of claim 10 wherein the detection values comprise correlation values in a two dimensional correlation.
12. A method of detecting an auxiliary signal embedded in a suspect signal, the embedded auxiliary signal having a set of attributes embedded at locations within the suspect signal, the method comprising:
computing detection values for two or more auxiliary signal candidates in the suspect signal;
evaluating a detection metric based on the detection values; and controlling a detector action based on the detection metric; wherein the metric provides a measure of an embedded auxiliary signal that adapts to the suspect signal according to detection values computed from the suspect signal; and wherein the detection values are each computed as a measure of the set of attributes of the auxiliary signal.
13. The method of claim 12 wherein the detection metric comprise a measure of strength of an auxiliary signal embedded in the suspect signal.
14. The method of claim 13 wherein the measure of strength is used to determine whether the suspect signal is authentic; and wherein a further detection action is evaluating the metric to determine whether the suspect signal is authentic.
15. The method of claim 12 wherein the detection values comprise correlation values.
16. The method of claim 12 wherein the detection metric is part of a multistage classifier for classifying the suspect signal.
17. The method of claim 16 wherein the classifier classifies the suspect signal as being marked or un-marked with an auxiliary embedded signal.
18. The method of claim 16 wherein the classifier determines whether the suspect signal is authentic.
19. A tangible medium on which is stored instructions for performing the method of claim 12.
20. A detector for analyzing suspect signals having embedded auxiliary signals comprising:
a first screening stage for classifying a suspect signal based on a first detection metric that measures a set of attributes of an auxiliary embedded signal;
a second screening stage for classifying the suspect signal based on a second detection metric that measures a set of attributes of an auxiliary embedded signal;
wherein the first and second stages form a multistage classifier for determining whether a suspect signal is authentic based on measures derived from an embedded auxiliary signal.
Patent Citations (371)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US2630525(A) | 1953-03-01 | Tomberlin et al. | Applicant |
| US3493674(A) | 1970-02-01 | Houghton | Applicant |
| US3562420(A) | 1971-02-01 | Thompson | Applicant |
| US3569619(A) | 1971-03-01 | Simjian | Applicant |
| US3585290(A) | 1971-06-01 | Sanford | Applicant |
| US3665162(A) | 1972-05-01 | Yamamoto et al. | Applicant |
| US3703628(A) | 1972-11-01 | Philipson, Jr. | Applicant |
| US3805238(A) | 1974-04-01 | Rothfjell | Applicant |
| US3809806(A) | 1974-05-01 | Walker et al. | Applicant |
| US3838444(A) | 1974-09-01 | Loughlin et al. | Applicant |
| US3845391(A) | 1974-10-01 | Crosby | Applicant |
| US3914877(A) | 1975-10-01 | Hines | Applicant |
| US3922074(A) | 1975-11-01 | Ikegami et al. | Applicant |
| US3971917(A) | 1976-07-01 | Maddox et al. | Applicant |
| US3982064(A) | 1976-09-01 | Barnaby | Applicant |
| US3984624(A) | 1976-10-01 | Waggener | Applicant |
| US3998160(A) | 1976-12-01 | Pearce | Applicant |
| US4025851(A) | 1977-05-01 | Haselwood et al. | Applicant |
| US4038596(A) | 1977-07-01 | Lee | Applicant |
| US4225967(A) | 1980-09-01 | Miwa et al. | Applicant |
| US4230990(A) | 1980-10-01 | Lert, Jr. et al. | Applicant |
| US4231113(A) | 1980-10-01 | Blasbalg | Applicant |
| US4237484(A) | 1980-12-01 | Brown | Applicant |
| US4238849(A) | 1980-12-01 | Gassmann | Applicant |
| US4252995(A) | 1981-02-01 | Schmidt et al. | Applicant |
| US4262329(A) | 1981-04-01 | Bright et al. | Applicant |
| US4313197(A) | 1982-01-01 | Maxemchuk | Applicant |
| US4367488(A) | 1983-01-01 | Leventer et al. | Applicant |
| US4379947(A) | 1983-04-01 | Warner | Applicant |
| US4380027(A) | 1983-04-01 | Leventer et al. | Applicant |
| US4389671(A) | 1983-06-01 | Posner et al. | Applicant |
| US4395600(A) | 1983-07-01 | Lundy et al. | Applicant |
| US4423415(A) | 1983-12-01 | Goldman | Applicant |
| US4425642(A) | 1984-01-01 | Moses et al. | Applicant |
| US4425661(A) | 1984-01-01 | Moses et al. | Applicant |
| US4476468(A) | 1984-10-01 | Goldman | Applicant |
| US4495620(A) | 1985-01-01 | Steele et al. | Applicant |
| US4528588(A) | 1985-07-01 | Lofberg | Applicant |
| US4532508(A) | 1985-07-01 | Ruell | Applicant |
| US4547804(A) | 1985-10-01 | Greenberg | Applicant |
| US4553261(A) | 1985-11-01 | Froessl | Applicant |
| US4590366(A) | 1986-05-01 | Rothfjell | Applicant |
| US4595950(A) | 1986-06-01 | Lofberg | Applicant |
| US4637051(A) | 1987-01-01 | Clark | Applicant |
| US4639779(A) | 1987-01-01 | Greenberg | Applicant |
| US4644582(A) | 1987-02-01 | Morishita et al. | Applicant |
| US4647974(A) | 1987-03-01 | Butler et al. | Applicant |
| US4654867(A) | 1987-03-01 | Labedz et al. | Applicant |
| US4660221(A) | 1987-04-01 | Dlugos | Applicant |
| US4663518(A) | 1987-05-01 | Borror et al. | Applicant |
| US4665431(A) | 1987-05-01 | Cooper | Applicant |
| US4672605(A) | 1987-06-01 | Hustig et al. | Applicant |
| US4675746(A) | 1987-06-01 | Tetrick et al. | Applicant |
| US4677435(A) | 1987-06-01 | Cause D'Aggraives et al. | Applicant |
| US4677466(A) | 1987-06-01 | Lert, Jr. et al. | Applicant |
| US4682794(A) | 1987-07-01 | Margolin | Applicant |
| US4697209(A) | 1987-09-01 | Kiewit et al. | Applicant |
| US4703476(A) | 1987-10-01 | Howard | Applicant |
| US4712103(A) | 1987-12-01 | Gotanda | Applicant |
| US4718106(A) | 1988-01-01 | Weinblatt | Applicant |
| US4739377(A) | 1988-04-01 | Allen | Applicant |
| US4750173(A) | 1988-06-01 | Bluthgen | Applicant |
| US4765656(A) | 1988-08-01 | Becker et al. | Applicant |
| US4775901(A) | 1988-10-01 | Nakano | Applicant |
| US4776013(A) | 1988-10-01 | Kafri et al. | Applicant |
| US4805020(A) | 1989-02-01 | Greenberg | Applicant |
| US4807031(A) | 1989-02-01 | Broughton et al. | Applicant |
| US4811357(A) | 1989-03-01 | Betts et al. | Applicant |
| US4811408(A) | 1989-03-01 | Goldman | Applicant |
| US4820912(A) | 1989-04-01 | Samyn | Applicant |
| US4835517(A) | 1989-05-01 | van der Gracht et al. | Applicant |
| US4855827(A) | 1989-08-01 | Best | Applicant |
| US4864618(A) | 1989-09-01 | Wright et al. | Applicant |
| US4866771(A) | 1989-09-01 | Bain | Applicant |
| US4874936(A) | 1989-10-01 | Chandler et al. | Applicant |
| US4876617(A) | 1989-10-01 | Best et al. | Applicant |
| US4879747(A) | 1989-11-01 | Leighton et al. | Applicant |
| US4884139(A) | 1989-11-01 | Pommier | Applicant |
| US4885632(A) | 1989-12-01 | Mabey et al. | Applicant |
| US4903301(A) | 1990-02-01 | Kondo et al. | Applicant |
| US4908836(A) | 1990-03-01 | Rushforth et al. | Applicant |
| US4908873(A) | 1990-03-01 | Philibert et al. | Applicant |
| US4920503(A) | 1990-04-01 | Cook | Applicant |
| US4921278(A) | 1990-05-01 | Shiang et al. | Applicant |
| US4939515(A) | 1990-07-01 | Adelson | Applicant |
| US4941150(A) | 1990-07-01 | Iwasaki | Applicant |
| US4943973(A) | 1990-07-01 | Werner | Applicant |
| US4943976(A) | 1990-07-01 | Ishigaki | Applicant |
| US4944036(A) | 1990-07-01 | Hyatt | Applicant |
| US4963998(A) | 1990-10-01 | Maufe | Applicant |
| US4965827(A) | 1990-10-01 | McDonald | Applicant |
| US4967273(A) | 1990-10-01 | Greenberg | Applicant |
| US4969041(A) | 1990-11-01 | O'Grady et al. | Applicant |
| US4972471(A) | 1990-11-01 | Gross et al. | Applicant |
| US4972476(A) | 1990-11-01 | Nathans | Applicant |
| US4977594(A) | 1990-12-01 | Shear | Applicant |
| US4979210(A) | 1990-12-01 | Nagata et al. | Applicant |
| US4993068(A) | 1991-02-01 | Piosenka | Applicant |
| US4996530(A) | 1991-02-01 | Hilton | Applicant |
| US5010405(A) | 1991-04-01 | Schreiber et al. | Applicant |
| US5027401(A) | 1991-06-01 | Soltesz | Applicant |
| US5036513(A) | 1991-07-01 | Greenblatt | Applicant |
| US5063446(A) | 1991-11-01 | Gibson | Applicant |
| US5073899(A) | 1991-12-01 | Collier et al. | Applicant |
| US5075773(A) | 1991-12-01 | Pullen et al. | Applicant |
| US5077608(A) | 1991-12-01 | Dubner | Applicant |
| US5077795(A) | 1991-12-01 | Rourke et al. | Applicant |
| US5079648(A) | 1992-01-01 | Maufe | Applicant |
| US5083224(A) | 1992-01-01 | Hoogendoorn et al. | Applicant |
| US5086469(A) | 1992-02-01 | Gupta et al. | Applicant |
| US5091966(A) | 1992-02-01 | Bloomberg et al. | Applicant |
| US5095196(A) | 1992-03-01 | Miyata | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5113437(A) | 1992-05-01 | Best | Applicant |
| US5128525(A) | 1992-07-01 | Stearns et al. | Applicant |
| US5134496(A) | 1992-07-01 | Schwab et al. | Applicant |
| US5144660(A) | 1992-09-01 | Rose | Applicant |
| US5146457(A) | 1992-09-01 | Veldhuis et al. | Applicant |
| US5148498(A) | 1992-09-01 | Resnikoff et al. | Applicant |
| US5150409(A) | 1992-09-01 | Elsner | Applicant |
| US5161210(A) | 1992-11-01 | Druyvesteyn et al. | Applicant |
| US5166676(A) | 1992-11-01 | Milheiser | Applicant |
| US5168147(A) | 1992-12-01 | Bloomberg | Applicant |
| US5181786(A) | 1993-01-01 | Hujink | Applicant |
| US5185736(A) | 1993-02-01 | Tyrrell et al. | Applicant |
| US5199081(A) | 1993-03-01 | Saito et al. | Applicant |
| US5200822(A) | 1993-04-01 | Bronfin et al. | Applicant |
| US5212551(A) | 1993-05-01 | Conanan | Applicant |
| US5213337(A) | 1993-05-01 | Sherman | Applicant |
| US5228056(A) | 1993-07-01 | Schilling | Applicant |
| US5243423(A) | 1993-09-01 | DeJean et al. | Applicant |
| US5245165(A) | 1993-09-01 | Zhang | Applicant |
| US5245329(A) | 1993-09-01 | Gockebay | Applicant |
| US5247364(A) | 1993-09-01 | Banker et al. | Applicant |
| US5253078(A) | 1993-10-01 | Balkanski et al. | Applicant |
| US5257119(A) | 1993-10-01 | Funada et al. | Applicant |
| US5258998(A) | 1993-11-01 | Koide | Applicant |
| US5259025(A) | 1993-11-01 | Monroe et al. | Applicant |
| US5267334(A) | 1993-11-01 | Normille et al. | Applicant |
| US5278400(A) | 1994-01-01 | Appel | Applicant |
| US5280537(A) | 1994-01-01 | Sugiyama et al. | Applicant |
| US5293399(A) | 1994-03-01 | Hefti | Applicant |
| US5295203(A) | 1994-03-01 | Krause et al. | Applicant |
| US5299019(A) | 1994-03-01 | Pack et al. | Applicant |
| US5305400(A) | 1994-04-01 | Butera | Applicant |
| US5315098(A) | 1994-05-01 | Tow | Applicant |
| US5315448(A) | 1994-05-01 | Ryan | Applicant |
| US5319453(A) | 1994-06-01 | Copriviza | Applicant |
| US5319724(A) | 1994-06-01 | Blonstein et al. | Applicant |
| US5319735(A) | 1994-06-01 | Preuss et al. | Applicant |
| US5325167(A) | 1994-06-01 | Melen | Applicant |
| US5327237(A) | 1994-07-01 | Gerdes et al. | Applicant |
| US5337361(A) | 1994-08-01 | Wang et al. | Applicant |
| US5337362(A) | 1994-08-01 | Gormish et al. | Applicant |
| US5349655(A) | 1994-09-01 | Mann | Applicant |
| US5351302(A) | 1994-09-01 | Leighton et al. | Applicant |
| US5374976(A) | 1994-12-01 | Spannenburg | Applicant |
| US5379345(A) | 1995-01-01 | Greenberg | Applicant |
| US5387941(A) | 1995-02-01 | Montgomery et al. | Applicant |
| US5394274(A) | 1995-02-01 | Kahn | Applicant |
| US5396559(A) | 1995-03-01 | McGrew | Applicant |
| US5398283(A) | 1995-03-01 | Virga | Applicant |
| US5404160(A) | 1995-04-01 | Schober et al. | Applicant |
| US5404377(A) | 1995-04-01 | Moses | Applicant |
| US5408542(A) | 1995-04-01 | Callahan | Applicant |
| US5410598(A) | 1995-04-01 | Shear | Applicant |
| US5418853(A) | 1995-05-01 | Kanota et al. | Applicant |
| US5422963(A) | 1995-06-01 | Chen et al. | Applicant |
| US5422995(A) | 1995-06-01 | Aoki et al. | Applicant |
| US5425100(A) | 1995-06-01 | Thomas et al. | Applicant |
| US5428606(A) | 1995-06-01 | Moskowitz | Applicant |
| US5428607(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5432542(A) | 1995-07-01 | Thibadeau et al. | Applicant |
| US5432870(A) | 1995-07-01 | Schwartz | Applicant |
| US5436653(A) | 1995-07-01 | Ellis et al. | Applicant |
| US5444779(A) | 1995-08-01 | Daniele | Applicant |
| US5446273(A) | 1995-08-01 | Leslie | Applicant |
| US5449895(A) | 1995-09-01 | Hecht et al. | Applicant |
| US5450122(A) | 1995-09-01 | Keene | Applicant |
| US5450490(A) | 1995-09-01 | Jensen et al. | Applicant |
| US5453968(A) | 1995-09-01 | Veldhuis et al. | Applicant |
| US5461426(A) | 1995-10-01 | Limberg et al. | Applicant |
| US5469506(A) | 1995-11-01 | Berson | Applicant |
| US5473631(A) | 1995-12-01 | Moses | Applicant |
| US5479168(A) | 1995-12-01 | Johnson et al. | Applicant |
| US5481294(A) | 1996-01-01 | Thomas et al. | Applicant |
| US5488664(A) | 1996-01-01 | Shamir | Applicant |
| US5499294(A) | 1996-03-01 | Friedman | Applicant |
| US5500856(A) | 1996-03-01 | Nagase et al. | Applicant |
| US5510900(A) | 1996-04-01 | Shirochi et al. | Applicant |
| US5513011(A) | 1996-04-01 | Matsumoto et al. | Applicant |
| US5513260(A) | 1996-04-01 | Ryan | Applicant |
| US5515081(A) | 1996-05-01 | Vasilik | Applicant |
| US5521372(A) | 1996-05-01 | Hecht et al. | Applicant |
| US5524933(A) | 1996-06-01 | Kunt et al. | Applicant |
| US5526427(A) | 1996-06-01 | Thomas et al. | Applicant |
| US5530751(A) | 1996-06-01 | Morris | Applicant |
| US5530759(A) | 1996-06-01 | Braudaway et al. | Applicant |
| US5530852(A) | 1996-06-01 | Meske, Jr. et al. | Applicant |
| US5532920(A) | 1996-07-01 | Hartrick et al. | Applicant |
| US5537216(A) | 1996-07-01 | Yamashita et al. | Applicant |
| US5537223(A) | 1996-07-01 | Curry | Applicant |
| US5539471(A) | 1996-07-01 | Myhrvold et al. | Applicant |
| US5541662(A) | 1996-07-01 | Adams et al. | Applicant |
| US5541741(A) | 1996-07-01 | Suzuki | Applicant |
| US5544255(A) | 1996-08-01 | Smithies et al. | Applicant |
| US5548646(A) | 1996-08-01 | Aziz et al. | Applicant |
| US5557333(A) | 1996-09-01 | Jungo et al. | Applicant |
| US5559559(A) | 1996-09-01 | Jungo et al. | Applicant |
| US5568179(A) | 1996-10-01 | Diehl et al. | Applicant |
| US5568268(A) | 1996-10-01 | Tsuji et al. | Applicant |
| US5568570(A) | 1996-10-01 | Rabbani | Applicant |
| US5572010(A) | 1996-11-01 | Petrie | Applicant |
| US5572247(A) | 1996-11-01 | Montgomery | Applicant |
| US5574787(A) | 1996-11-01 | Ryan | Applicant |
| US5576532(A) | 1996-11-01 | Hecht | Applicant |
| US5579124(A) | 1996-11-01 | Aijala et al. | Applicant |
| US5581800(A) | 1996-12-01 | Fardeau et al. | Applicant |
| US5582103(A) | 1996-12-01 | Tanaka et al. | Applicant |
| US5587743(A) | 1996-12-01 | Montgomery | Applicant |
| US5590197(A) | 1996-12-01 | Chen et al. | Applicant |
| US5602920(A) | 1997-02-01 | Bestler et al. | Applicant |
| US5606609(A) | 1997-02-01 | Houser et al. | Applicant |
| US5611575(A) | 1997-03-01 | Petrie | Applicant |
| US5612943(A) | 1997-03-01 | Moses et al. | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5613012(A) | 1997-03-01 | Hoffman et al. | Applicant |
| US5614940(A) | 1997-03-01 | Cobbley et al. | Applicant |
| US5617148(A) | 1997-04-01 | Montgomery | Applicant |
| US5627655(A) | 1997-05-01 | Okamoto et al. | Applicant |
| US5629770(A) | 1997-05-01 | Brassil | Applicant |
| US5629980(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5636292(A) | 1997-06-01 | Rhoads | Applicant |
| US5638443(A) | 1997-06-01 | Stefik et al. | Applicant |
| US5638446(A) | 1997-06-01 | Rubin | Applicant |
| US5646997(A) | 1997-07-01 | Barton | Applicant |
| US5647017(A) | 1997-07-01 | Smithies et al. | Applicant |
| US5649054(A) | 1997-07-01 | Oomen et al. | Applicant |
| US5652626(A) | 1997-07-01 | Kawakami et al. | Applicant |
| US5659613(A) | 1997-08-01 | Copeland et al. | Applicant |
| US5659726(A) | 1997-08-01 | Sandford, II et al. | Applicant |
| US5659732(A) | 1997-08-01 | Kirsch | Applicant |
| US5661574(A) | 1997-08-01 | Kawana | Applicant |
| US5663766(A) | 1997-09-01 | Sizer, II | Applicant |
| US5664018(A) | 1997-09-01 | Leighton | Applicant |
| US5666487(A) | 1997-09-01 | Goodman et al. | Applicant |
| US5671277(A) | 1997-09-01 | Ikenoue et al. | Applicant |
| US5678155(A) | 1997-10-01 | Miyaza | Applicant |
| US5680223(A) | 1997-10-01 | Cooper et al. | Applicant |
| US5687191(A) | 1997-11-01 | Lee et al. | Applicant |
| US5689587(A) | 1997-11-01 | Bender et al. | Applicant |
| US5689623(A) | 1997-11-01 | Pinard | Applicant |
| US5709932(A) | 1998-01-01 | Glez et al. | Applicant |
| US5712920(A) | 1998-01-01 | Spille | Applicant |
| US5719937(A) | 1998-02-01 | Warren et al. | Applicant |
| US5719984(A) | 1998-02-01 | Yamagata et al. | Applicant |
| US5721788(A) | 1998-02-01 | Powell et al. | Applicant |
| US5727092(A) | 1998-03-01 | Sandford, II et al. | Applicant |
| US5737025(A) | 1998-04-01 | Dougherty et al. | Applicant |
| US5737026(A) | 1998-04-01 | Lu et al. | Applicant |
| US5739864(A) | 1998-04-01 | Copeland | Applicant |
| US5745569(A) | 1998-04-01 | Moskowitz et al. | Applicant |
| US5761686(A) | 1998-06-01 | Bloomberg | Applicant |
| US5764763(A) | 1998-06-01 | Jensen et al. | Applicant |
| US5764770(A) | 1998-06-01 | Schipper et al. | Applicant |
| US5768426(A) | 1998-06-01 | Rhoads | Applicant |
| US5774452(A) | 1998-06-01 | Wolosewicz | Applicant |
| US5778102(A) | 1998-07-01 | Sandford, II et al. | Applicant |
| US5799081(A) | 1998-08-01 | Kim et al. | Applicant |
| US5799082(A) | 1998-08-01 | Murphy et al. | Applicant |
| US5819289(A) | 1998-10-01 | Sanford, II et al. | Applicant |
| US5822360(A) | 1998-10-01 | Lee et al. | Applicant |
| US5822432(A) | 1998-10-01 | Moskowitz et al. | Applicant |
| US5826227(A) | 1998-10-01 | Jayant | Applicant |
| US5828325(A) | 1998-10-01 | Wolosewicz et al. | Applicant |
| US5835639(A) | 1998-11-01 | Honsinger et al. | Applicant |
| US5850249(A) | 1998-12-01 | Massetti et al. | Applicant |
| US5857038(A) | 1999-01-01 | Owada et al. | Applicant |
| US5859920(A) | 1999-01-01 | Daly et al. | Applicant |
| US5862218(A) | 1999-01-01 | Steinberg | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5878010(A) | 1999-03-01 | Okamoto et al. | Applicant |
| US5889868(A) | 1999-03-01 | Moskowitz et al. | Applicant |
| US5893067(A) | 1999-04-01 | Bender et al. | Applicant |
| US5905505(A) | 1999-05-01 | Lesk | Applicant |
| US5905819(A) | 1999-05-01 | Daly | Applicant |
| US5907443(A) | 1999-05-01 | Hirata | Applicant |
| US5929920(A) | 1999-07-01 | Sizer, II | Applicant |
| US5930369(A) | 1999-07-01 | Cox et al. | Applicant |
| US5937000(A) | 1999-08-01 | Lee et al. | Applicant |
| US5940135(A) | 1999-08-01 | Petrovic et al. | Applicant |
| US5940429(A) | 1999-08-01 | Lam et al. | Applicant |
| US5945932(A) | 1999-08-01 | Smith et al. | Examiner |
| US5960151(A) | 1999-09-01 | Takahashi | Applicant |
| US5970140(A) | 1999-10-01 | Sandford, II et al. | Applicant |
| US5987459(A) | 1999-11-01 | Swanson et al. | Applicant |
| US5991500(A) | 1999-11-01 | Kanota et al. | Applicant |
| US6000621(A) | 1999-12-01 | Hecht et al. | Applicant |
| US6031914(A) | 2000-02-01 | Tewfik et al. | Applicant |
| US6035177(A) | 2000-03-01 | Moses et al. | Applicant |
| US6044156(A) | 2000-03-01 | Honsinger et al. | Applicant |
| US6061793(A) | 2000-05-01 | Tewfik et al. | Applicant |
| US6078664(A) | 2000-06-01 | Moskowitz et al. | Applicant |
| US6086706(A) | 2000-07-01 | Brassil et al. | Applicant |
| US6101602(A) | 2000-08-01 | Fridrich | Examiner |
| US6181802(B1) | 2001-01-01 | Todd | Applicant |
| US6185312(B1) | 2001-02-01 | Nakamura et al. | Applicant |
| US6209094(B1) | 2001-03-01 | Levine et al. | Applicant |
| US6219634(B1) | 2001-04-01 | Levine | Applicant |
| US6246777(B1) | 2001-06-01 | Agarwal et al. | Examiner |
| US6324303(B1) | 2001-11-01 | Todd | Examiner |
| US6332031(B1) | 2001-12-01 | Rhoads et al. | Applicant |
| US6415040(B1) | 2002-07-01 | Linnartz et al. | Examiner |
| US6480825(B1) | 2002-11-01 | Sharma et al. | Examiner |
| US6516079(B1) | 2003-02-01 | Rhoads et al. | Examiner |
| US6546114(B1) | 2003-04-01 | Venkatesan et al. | Applicant |
| US6570996(B1) | 2003-05-01 | Linnartz | Examiner |
| US6574349(B1) | 2003-06-01 | Linnartz et al. | Examiner |
| US6611599(B2) | 2003-08-01 | Natarajan | Examiner |
| US6625295(B1) | 2003-09-01 | Wolfgang et al. | Examiner |
| US6636615(B1) | 2003-10-01 | Rhoads et al. | Applicant |
| US2001/0017709(A1) | 2001-08-01 | Murakami et al. | Applicant |
| US2001/0024510(A1) | 2001-09-01 | Iwamura | Applicant |
| US2002/0010684(A1) | 2002-01-01 | Moskowitz | Examiner |
| US2002/0037093(A1) | 2002-03-01 | Murphy | Applicant |
| US2002/0061121(A1) | 2002-05-01 | Rhoads et al. | Applicant |
| US2002/0090110(A1) | 2002-07-01 | Braudaway et al. | Applicant |
| US2002/0097892(A1) | 2002-07-01 | Oami et al. | Examiner |
| DE2943436 | 1971-05-01 | Applicant | |
| DE3806411 | 1989-09-01 | Applicant | |
| EP58482 | 1982-08-01 | Applicant | |
| EP366381 | 1990-05-01 | Applicant | |
| EP372601 | 1990-06-01 | Applicant | |
| EP493091 | 1990-12-01 | Applicant | |
| EP411232 | 1991-02-01 | Applicant | |
| EP418964 | 1991-03-01 | Applicant | |
| EP441702 | 1991-08-01 | Applicant | |
| EP551016 | 1994-02-01 | Applicant | |
| EP581317 | 1994-02-01 | Applicant | |
| EP605208 | 1994-07-01 | Applicant | |
| EP629972 | 1994-12-01 | Applicant | |
| EP642060 | 1995-03-01 | Applicant | |
| EP649074 | 1995-04-01 | Applicant | |
| EP650146 | 1995-04-01 | Applicant | |
| EP651554 | 1995-05-01 | Applicant | |
| EP651554 | 1995-05-01 | Applicant | |
| EP705025 | 1996-04-01 | Applicant | |
| EP1077570 | 2001-02-01 | Applicant | |
| GB2063018 | 1981-05-01 | Applicant | |
| GB2067871 | 1981-07-01 | Applicant | |
| GB2196167 | 1988-04-01 | Applicant | |
| GB2204984 | 1988-11-01 | Applicant | |
| JP4-248771 | 1992-09-01 | Applicant | |
| JP5/242217 | 1993-09-01 | Applicant | |
| JP8-30759 | 1996-02-01 | Applicant | |
| WO89/08915 | 1989-09-01 | Applicant | |
| WO93/25038 | 1993-12-01 | Applicant | |
| WO95/10835 | 1995-04-01 | Applicant | |
| WO95/14289 | 1995-05-01 | Applicant | |
| WO95/20291 | 1995-07-01 | Applicant | |
| WO96/21290 | 1996-07-01 | Applicant | |
| WO96/26494 | 1996-08-01 | Applicant | |
| WO96/27259 | 1996-09-01 | Applicant | |
| WO9731440 | 1997-08-01 | Applicant | |
| WO97/33392 | 1997-09-01 | Applicant | |
| WO9746012 | 1997-12-01 | Applicant | |
| WO98/53565 | 1998-11-01 | Applicant | |
| WO/00969 | 2000-01-01 | Applicant | |
| WO/22745 | 2000-04-01 | Applicant | |
| WO106755 | 2001-01-01 | Applicant | |
| WO173997 | 2001-10-01 | Applicant |
Non-Patent Literature (138)
- “Access Control and COpyright Protection for Images, Conditional Access and Copyright Protection Based on the Use of Trusted Third Parties,” 1995, 43 pages.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 8: Watermarking,” Jun. 30, 1995, 46 pages.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 3: Evaluation of Existing Systems,” Apr. 19, 1995, 68 pages.Applicant
- “Access Control and COpyright Protection for Images, WorkPackage 1: Access Control and Copyright Protection for Images Need Evaluation,” Jun., 1995, 21 pages.Applicant
- Anderson, “Stretching the Limits of Steganography,” Information Hiding, First International Workshop Proc., May 30-Jun. 1, 1996, pp. 39-48.Applicant
- Arachelian, “White Noise Storm,” Apr. 11, 1994, Internet reference, 13 pages.Applicant
- Arazi, et al., “Intuition, Perception, and Secure Communication,” IEEE Transactionson Systems, Man, and Cybernetics, vol. 19, No. 5, Sep./Oct. 1989, pp. 1016-1020.Applicant
- Arthur, “Digital Fingerprints Protect Artwork,” New Scientist, Nov. 12, 1994, p. 24.Applicant
- Aura, “Invisible Communication,” Helskinki University of Technology, Digital Systems Laboratory, Nov. 5, 1995, 13 pages.Applicant
- Aura, “Practical Invisibility in Digital Communication,” Information Hiding, First Int. Workshop Proc. May 30-Jun. 1, 1996, pp. 265-278.Applicant
- Bartlett, et al., “An Overview of HighWater FBI Technology,” Posted on Internet Mar. 22, 1996, 12 pages.Applicant
- Bender et al, “Techniques for Data Hiding,” Draft Preprint, Private Correspondence, dated Oct. 30, 1995, 45 pages.Applicant
- Bender et al., “Techniques for Data Hiding,” Massachusetts Institute of Technology, Media Laboratory, Jan. 1995, 10 pages.Applicant
- Bender et al., “Techniques for Data Hiding,” Massachusetts Institute of Technology, Media Laboratory, Draft Preprint, Apr. 13, 1995, 10 pages.Applicant
- Bender Techniques for Data Hiding, Proc. SPIE, Vo. 2420, Feb. 9, 1995, pp. 164-173.Applicant
- Boland et al., “Watermarking digital images for copyright protection”, Image Processing and it's Applications, 1995, Conference on, 1995, pp. 326-330.Applicant
- Boneh, “Collusion-Secure Fingerprinting for Digital Data,” Department of Computer Science, Princeton University, 1995, 31 pages.Applicant
- Boney et al., “Digital Watermarks for Audio Signals,” Proceedings of Multimedia ′96, 1996 IEEE, pp. 473-480.Applicant
- Bors et al., “Image watermarking using DCT domain constraints”, Image Processing, 19996, Proceedings, International Conference on, vol. 3, 1996, pp. 231-234, vol. 3.Applicant
- Bors et al., “Embedding Parametric Digital Signatures in Images,” EUSIPCO-96, Trieste, Italy, accepted for publication, Sep. 1996 (Published on internet Apr. 9, 1996, (http://poseidon.csd.auth.gr/papers/confers.1_ind.html)), 4 pages.Applicant
- Boucqueau et al., Equitable Conditional Access and Copyright Protection for Image Based on Trusted Third Parties, Teleservices & Multimedia Communications, 2nd Int. Cost 237 Workshop, Second International Cost 237 Workshop, Nov., 1995; published 1996, pp. 229-243 Brandt et al., “Representations that Uniquely Characterize Images Modulo Translation, Rotation, and Scaling,” Pattern Recognition Letters, Aug. 1, 1996, pp. 1001-1015.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, 1278-1287.Applicant
- Brassil et al., “Hiding Information in Document Images,” Nov., 1995, 7 pages.Applicant
- Braudaway et al., “Protecting Publicly-Available Images with a Visible Image Watermark,” SPIE vol. 2659, Feb. 1, 1996, pp. 126-133.Applicant
- Brown, “S-Tools for Window, Version 1.00; What is Steganography,” Internet reference, Mar. 6, 1994, 6 pages.Applicant
- Bruckstein, A.M.; Richardson, T.J., A holographic transform domain image watermarking method, Circuits, Systems, and Signal Processing vol. 17, No. 3 pp. 361-389, 1998. This paper includes an appendix containing an internal memo of Bell Labs, which according to the authors of the paper, was dated Sep. 1994.Applicant
- Bruyndonckx et al., Neural Network Post-Processing of Coded Images Using Perceptual Masking, 1994, 3 pages.Applicant
- Bruyndonckx et al., “Spatial Method for Copyright Labeling of Digital Images,” 1994, 6 pages.Applicant
- Burgett et al., “A Novel Method for Copyright Labeling Digitized Image Data,” requested by e-mail from author (unavailable/password protected on IGD WWW site); received Sep. 18, 1995, 12 pages.Applicant
- Caronni, “Assuring Ownership Rights for Digital Images,” Published in the Proceedings of ‘Reliable IT Systems,’ VIS ′95, HH. Bruggemannn and W. Gerhardt-Hackl (Ed.), Vieweg Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pages.Applicant
- Caronni, “Assuring Ownership Rights for Digital Images,” Published in the Proceedings of ‘Reliable IT Systems,’ VIS ′95, HH. Bruggemannn and W. Gerhardt-Haackl (Ed.), ViewegApplicant
- Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pages (originally published as an ETH (Zurich) Technical Report, “Ermitteln Unauthorisierter Verteiler von Maschinenlesbaren Daten,” Aug. 1993.Applicant
- Caruso, “Digital Commerce, 2 plans for watermarks, which can bind proof of authorship to electronic works.” New York Times, Aug. 7, 1995, one page.Applicant
- Castro et al., “Registration of Translated and Rotated Images Using Finite Fourier Transforms,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-9, No. 5, Sep. 1987, pp. 700-703.Applicant
- Cha et al., “A Solution to the On-Line Image Downgrading Problem,” Proc. 11th Annual Computer Security Applications Conf., Dec. 11, 1995, pp. 108-112.Applicant
- Cheong, “Internet Agent, Spiders, Wanderers, Brokers, and Bots,” New Riders Publishing Indianapolis, IN, 1996, 413 pages.Applicant
- Choudhury, et al., “Copyright Protection for Electronic Publishing over Computer Networks,” IEEE Network Magazine, Jun. 1994, 18 pages.Applicant
- Chudy, “Handcuff Digital Thieves,” Byte Magazine, Apr. 1996, 4 pages.Applicant
- “The Copyright Can of Worms Opened Up By The New Electronic Media,” Computergram Internations, pCGN07170006, Jul. 17, 1995 and “The Copyright Can of Worms Opened Up By the New Electronic Media-2,” Computergram Internations, pCGN07210008, Jul. 21, 1995, 3 pages total.Applicant
- “Copyright Protection for Digital Images, Digital Fingerprinting from FBI,” Highwater FBI brochure, 1995, 4 pages.Applicant
- Cox et al., “A Secure, Imperceptable Yet Perceptually Salient, Spread Spectrum Watermark for Multimedia,” IEEE, Southcon/96, Conference Record, pp. 192-197, 1996.Applicant
- Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” NEC Research Institute Technical Report, Dec. 5, 1995, 33 pages.Applicant
- Craver et al., “Can Invisible Watermarks Resolve Rightful Ownerships?” IBM Technical Report RC 20509, Jul. 25, 1996, pp. 1-21. (also published Proc. SPIE—Int. Soc. Opt. Eng. vol. 3022, pp. 310-321, conf. Feb. 13-14, 1997).Applicant
- “Cyphertech Systems: Introduces Digital Encoding Device to Prevent TV Piracy,” Hollywood Reporter, Oct. 20, 1993, p. 23.Applicant
- Dautzenberg, “Watermarking Images,” Department of Microelectronics and Electrical Engineering, Trinity College Dublin, 47 pages, Oct. 1994.Applicant
- Delaigle et al., “A Psychovisual Approach for Digital Picture Watermarking,” 1995, 20 pages.Applicant
- Delaigle et al., “Digital Watermarking,” Proc. SPIE-Int. Soc. Opt. Eng., vol. 2659, pp. 99-110, 1996.Applicant
- DICE Digital Watermark System, Q&A, Dec., 1995, 12 pages.Applicant
- Digimarc presentation at RSA Conference, approximately Jan. 17, 1996, 4 pages.Applicant
- Fimmerstad, “The Virtual Art Museum,” Ericsson Connexion, Dec., 1995, pp. 29-31.Applicant
- Fitzgerald, “Invisible Digital Copyright ID,” Editor & Publisher, Jun. 25, 1994, p. 62.Applicant
- “Foiling Card Forgers With Magnetic ‘Noise,’”, Wall Street Journal, Feb. 8, 1994.Applicant
- Franz et al., “Computer Based Steganography: How It Works and Why Therefore Any Restrictions on Cryptography are Nonsense, at Best,” Information Hiding, First Int. Workshop Proc, May 30-Jun. 1, 1996, pp. 7-21, (a counterpart was publsihed in German by Steffen Moller et al in 1994).Applicant
- Frequently Asked Questions About Digimarc Signature Technology, Aug. 1, 1995, http://www.digimarc.com, 9 pages.Applicant
- Friedman, “The Trustworthy Digital Camera: Restoring Credibility to the Photographic Image,” IEEE Transactions on Consumer Electronics, vol. 39, No. 4, Nov., 1993, pp. 905-910.Applicant
- Gabor, et al., “Theory of Communication,” J. Inst. Elect. Eng. 93, 1946, pp. 429-441.Applicant
- Gerzon, M.A., et al, “A High-Rate Buried-Data Channel for Audio CD,” Journal of the Audio Engineering Society, vol. 43, No. 1-2, p. 3-22, Jan.-Feb., 1995.Applicant
- Haitsma et al., “Audio Watermarking for Monitoring and Copy Protection,” ACM Multimedia workshop marina Del Rey, CA ACM 2000 1-58113-311-1/00/11, pp. 119-122.Applicant
- Hartung et al., Digital Watermarking of Raw and Compressed Video, Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, Oct., 1996, pp. 205-213.Applicant
- Hecht, “Embedded Data Glyph Technology for Hardcopy Digital Documents,” SPIE vol. 2171, Feb. 1994, pp. 341-352.Applicant
- “High Water FBI Limited Presentation Image Copyright Protection Software,” FBI Ltd brochure, Jul., 1995, 17 pages.Applicant
- “Holographic signatures for digital images,” The Seybold Report on Desktop Publishing, Aug. 1995, one page.Applicant
- Honsinger et al., “Data Embedding Using Phase Dispersion,” 2000 Eastman Kodak Company, 9 pages.Applicant
- Horak, “From ‘Steganographia’ to Subliminal Communication,” “Communications and Multimedia Security,” Sep. 1995, pp. 205-213.Applicant
- Humphrey, “Stamping Out Crime,” Hollywood Reporter, Jan. 26, 1994, p. S48.Applicant
- Jain, “Image Coding Via a Nearest Neighbors Image Model,” IEEE Transactions on Communications, vol. COM-23, No. 3, Mar. 1975, pp. 318-331.Applicant
- Johhnson, “Steganography,” Dec. 10, 1995, 32 pages.Applicant
- JPEG Group's JPEG Software (release 4), ftp.csua.berekeley.edu/pub/cypherpunks/applications/jsteg/jpeg.announcement.gz, Jun. 7, 1992 2 pages.Applicant
- Kassam, Signal Detection in Non-Gaussian Noise, Dowden & Culver, 1988, pp. 1-96.Applicant
- Koch et al., “Copyright Protection for Multimedia Data,” Proc. of the International Conference on Digital Media and Electronic Publishing, Dec. 6-8, 1994, Leeds. U.K., 15 pages.Applicant
- Koch et al., “Digital Copyright Labeling: Providing Evidence of Misuse and Tracking Unauthorized Distribution of Copyrighted Materials,” Oasis Magazine, Dec. 1995, 3 pages.Applicant
- Koch et al., “Towards Robust and Hidden Image Copyright Labeling,” Proc. of 20995 IEEE Workshop on Nonlinear Signal and Image Processing, Jun. 20-22, 1995, 4 pages.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
- Komatsu et al., “Authentication System Using Concealed Image in Telematics,” Memoirs of the School of Science & Engineering, Waseda Univ., No. 52, 1988, pp. 45-60.Applicant
- Kurak et al., “A Cautionary Note On Image Downgrading,” 1992 IEEE, pp. 153-159.Applicant
- Lesk, “Digital Libraries Meet Electronic Commerce: On-Screen Intellectual Property,” Proceedings of the Third Forum on Research and Technology Advances in Digital Libraries—ADL—'96—(Cat No. 96TB100053), 1996, pp. 58-64.Applicant
- Luc, “Analysis of Spread Spectrum System Parameters for Design of Hidden Transmission,” Radioengineering, vol. 4, No. 2, Jun. 1995, pp. 26-29.Applicant
- Machado, “Announcing Stego 1.0a2, The First Steganography Tool for the Macintosh,” Internet reference, Nov. 28, 1993, 3 pages.Applicant
- Macq, “Cryptology for Digital TV Broadcasting,” Proceedings of the IEEE, vol. 83, No. 6, Jun. 1995, pp. 944-957.Applicant
- Matsui et al., “Video-Steganography: How to Secretly Embed a Signature in a Picture,” IMA Intellectual Property Project Proceedings, Jan. 1994, vol. 1, Issue 1, pp. 187-205.Applicant
- Matthews, “When Seeing is Not Believing,” New Scientist, Oct. 16, 1993, pp. 13-15.Applicant
- Mintzer et al., “Toward on-line, Worlwide Access to Vatican Library Materials,” IBM J. Res. Develop. vol. 40 No. 2, Mar., 1996, pp. 139-162.Applicant
- Moller, et al., “Rechnergestutzte Steganographic: Wie sie Funktioniert und warum folglich jede Reglementierung von Verschlusselung unsinning ist,” DuD, Datenschutz und Datensicherung, 18/6 1994 318-326.Applicant
- “NAB-Cyphertech Starts Anti-Piracy Broadcast Tests,” Newsbytes, NEW03230023, Mar. 23, 1994.Applicant
- Nakamura et al., “A Unified Coding Method of Dithered Image and Text Data Using Micropatterns,” Electronics and Communications in Japan, Part 1, vol. 72, No. 4, 1989, pp. 50-56.Applicant
- Nikoladis et al., “Copyright Protection of Images Using Robust Digital Signatures,” IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP-96), accepted for publication, May 1996 (Published on internet Apr. 9, 1996, (http://poseidon.csd.auth.gr/papers/confers.1_ind.html)), 4 pages. (Also published 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings, May 7-10, 1996, vol. 4, pp. 2168-71).Applicant
- Ohnishi et al., Embedding a Seal into a Picture Under Orthogonal Wavelet Transform, Proceedings of Multimedia '96, 1996, IEEE, pp. 514-521.Applicant
- Oomen, A. et al, “A Variable-Bit Rate Buried-Data Channel for Compact Disc,” Journal of the Audio Engineering Society vol. 43, No. 1-2, pp. 23-28, Jan.-Feb., 1995.Applicant
- O'Ruanaidh et al., “Phase watermarking of digital images” , Image Processing, 19996, Proceedings, International Conference on, vol. 3, 1996, pp. 239-242, vol. 3.Applicant
- ORuanaidh et al, “Watermarking Digital Images for Copyright Protection,” http://www.kalman.mee.tcd.ic/people/jjr/eva_pap.html, Feb. 2, 1996, 8 pages. (Also published Aug., 1996, IEE Proceedings-Vision, Image and Signal Processing, vol. 143, No. 4, pp. 250-256.).Applicant
- Pennebaker et al., JPEG Still Image Data Compression Standard, Chapter 3, “Aspects of the Human Visual System,” pp. 23-27, 1993, Van Nostrand Reinhold, New York.Applicant
- Pickholtz et al., “Theory of Spread-Spectrum Communications—A Tutorial,” Transactions on Communications, vol. COM-30, No. 5, May, 1982, pp. 855-884.Applicant
- Pitas et al., “Applying Signatures on Digital Images,” IEEE Workshop on Nonlinear Image and Signal Processing, Neos Marmaras, Greece, pp. 460-463, Jun., 1995.Applicant
- Pitas, “A Method for Signature Casting on Digital Images,” 1996 IEEE International Conference on Image Processing (ICIP'96), Lausanne, Switzerland, accepted for publication, Sep. 16-19, 1996 (Published on internet Apr. 9, 1996, (http://poseidon.csd.auth.gr/papers/confers.1_ind.html)), 4 pages.Applicant
- Port, “Halting Highway Robbery on the Internet,” Business Week, Oct. 17, 1994, p. 212.Applicant
- Proudler, Graeme J., “Authentication and Display of Signatures on Electronic Documents,” 2244 Research Disclosure, Feb., 1994, No. 358, Emsworth, GB, 1 page.Applicant
- Quisquater, J., “Access Control and COpyright Protection for Images, Conditional Access and Copyright Protection Based on the Use of Trusted Third Parties,” 1995, 43 pages.Applicant
- Rindfrey, “Towards an Equitable System for Access Control and Copyright Protection in Broadcast Image Services: The Equicrypt Approach,” Intellectual Property Rights and New Technologies, Proc. of the Conference, R. Oldenbourg Verlag Wien Munchen 1995, 12 pages.Applicant
- Roberts, “Picture Coding Using Pseudorandom Noise,” IRE Trans. on Information Theory, vol. 8, No. 2, Feb., 1962, pp. 145-154.Applicant
- Sandford II et al., “The Data Embedding Method”, SPIE vol. 2615, pp. 226-259.Applicant
- Sapwater et al., “Electronic Copyright Protection,” Photo>Electronic Imaging, vol. 37, No. 6, 1994, pp. 16-21.Applicant
- Schneier, “Digital Signatures, Cryptographic Algorithms Can Create Nonforgeable Signatures for Electronic Documents, Making Them Valid Legal Instruments” Byte, Nov. 1993, pp. 309-312.Applicant
- Schreiber et al., “A Compatible High-Definition Television System Using the Noise-Margin Method of Hiding Enhancement Information,” SMPTE Journal, Dec. 1989, pp. 873-879.Applicant
- [email protected], “Hide and Seek v. 4.0,” Internet reference, Apr. 10, 1994, 3 pages.Applicant
- Sheng et al., “Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,” Journal of Optical Society of America, vol. 3, No. 6, Jun., 1986, pp. 771-776.Applicant
- Short, “Steps Toward Unmasking Secure Communications,” International Journal of Bifurcation and Chaos, vol. 4, No. 4, 1994, pp. 959-977.Applicant
- Simmons, “Subliminal Channels; Past and Present,” ETT, vol. 5, No. 4, Jul.-Aug. 1994, pp. 45-59.Applicant
- Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part I,” IEEE Communications Magazine, Aug., 1983, pp. 1-17.Applicant
- Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part II,” IEEE Communications Magazine, Oct., 1983, pp. 6-21.Applicant
- “Steganography,” Intellectual Property and the National Information Infrastructure The Report of the Working Group on Intellectual Property Rights, Sep. 1995, pp. 212-213.Applicant
- Stone, Analysis of Attacks on Image Watermarks with Randomized Coefficients, May 17, 1996, pp. 1-27.Applicant
- Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proceedings 1979 Carnahan Conference on Crime Countermeasures, May 16, 1979, pp. 101-109.Applicant
- Szepanski, “Binary Data Transmission Over Video Channels with Very Low Amplitude Data Signals,” Fernseh- und Kino-Technik, vol. 32, No. 7, Jul., 1978, pp. 251-256, (German text with full English translation.)Applicant
- Szepanski, “Compatibility Problems in Add-On Data Transmission for TV-Channels,” 2d Symp. and Tech. Exh. On Electromagnetic Compatibility, Jun. 28, 1977, pp. 263-268.Applicant
- Szepanski, “Optimization of Add-On Signals by Means of a Modified Training Algorithm for Linear Classifiers,” IEEE Int'l Symp. On Info. Theory, Oct. 10, 1977, pp. 27-28.Applicant
- Szepanski, “Additive Binary Data Transmission for Video Signals,” Conference of the Communications Engineering Soc. 1980, NGT Technical Reports, vol. 74, pp. 343-351. (German text with full English translation).Applicant
- Tanaka et al., “A Visual Retrieval System with Private Information for Image Database,” Proceeding International Conference on DSP Applications and Technology, Oct. 1991, pp. 415-421.Applicant
- Tanaka et al., “Embedding Secret Information Into a Dithered Multi-Level Image,” Proc. IEEE Military Comm. Conf., Sep. 1990, pp. 216-220.Applicant
- Tanaka et al., “New Integrated Coding Schemes for Computer-Aided Facsimile,” Proc. IEEE Int'l Conf. on Sys. Integration, Apr. 1990, pp. 275-281.Applicant
- Tanaka, “Embedding the Attribute Information Into a Dithered Image,” Systems and Computers in Japan, vol. 21, No. 7, 1990, pp. 43-50.Applicant
- Tirkel et al, “Electronic Water Mark,” DICTA-93, Macquarie University, Sydney, Australia, Dec., 1993, pp. 666-673.Applicant
- Tirkel et al., A Two-Dimensional Digital Watermark, Conf. Proc. DICTA-95, Dec. 6-8, 1995. 10 pages.Applicant
- Tirkel, et al “Image Watermarking-A Spread Spectrum Application” Proc. IEEE, ISSSTA '96, Mainz, Germany, Sep. 22-25, 1996, vol. II, p. 785-789.Applicant
- Toga et al., “Registration Revisited,” Journal of Neuroscience Methods, 48 (1993), pp. 1-13.Applicant
- Van Schyndel et al., “A Digital Watermark,” IEEE International Conference on Image Processing, Nov. 13-16, 1994, pp. 86-90.Applicant
- van Schyndel et al., “Towards a Robust Digital Watermark,” ACCV ′95, vol. 2, Dec., 1995, pp, 504-508.Applicant
- Voyatzis et al., “Applications of Total Automorphisms in Image Watermarking,” 1996 IEEE International Conference on Image Processing (ICIP'96), Lausanne, Switzerland, Part vol. 2, pp. 237-240, Sep. 16-19, 1996 (Published on internet Apr. 9, 1996, (http://poseidon.csd.auth.gr/papers/confers.1_ind.html)), pages. 1996 IEEE, sep. 16-19, 1996 Laussane, Switzerland, pp. 237-239.Applicant
- Voyatzis, et al., Chaotic Mixing of Digital Images and Applications to Watermarking, European Conference on Multimedia Applications, Services and Techniques (ECMAST'96), Louvain-la-Neuve, Belgium accepted for publication, May 1996 (Published on internet Apr. 9, 1996), (http://poseidon.csd.auth.gr/papers/confers.1_ind.html)), 8 pages.Applicant
- Wagner, “Fingerprinting,” 1983 IEEE, pp. 18-22.Applicant
- Walton, “Image Authentication for a Slippery New Age,” Dr. Dobb's Journal, Apr. 1995, pp. 18-26, 82-87.Applicant
- “Watermarking & Digital Signature: Protect Your Work!” Published on Internet 1996, http://Itswww.epfl.ch/.about.jordan/watermarking.html.Applicant
- Weber et al., “Correlative Image Registration,” Seminars in Nuclear Medicine, vol. XXIV, No. 4, (Oct.), 1994, pp. 311-323.Applicant
- Wise, “The History of Copyright, Photographer' Rights Span Three Centuries,” Photo>Electronic Imaging, vol. 37, No. 6, 1994.Applicant
- Zhao, et al., “Embedding Robust Labels Into Images for Copyright Protection,” Proc. of the International Congress on Intellectual Property Rights for Specialized Information, Knowledge and New Technolgies (Vienna, Austria) Aug. 21-25, 1995, 10 pages.Applicant
- Zhao, “A WWW Service to Embed and Prove Digital Copyright Watermarks,” in Proc. of the European Conf. on Multimedia Applications, Serivces and Techniques, Louvain-La-Neuve, Belgium, May 1996, 14 pages.Applicant
- Alattar, “Smart Images”Using Digimarc's Watermark Technology, SPIE 12th , Int'l Symposium on Electronic Imaging, Vo. 3971, No. 25, pp. 1-10, Jan. 25, 2000.Applicant
- Bender et al., “Applications for Data Hiding,” IBM Systems Journal, vol. 39, No. 3-4, pp. 547-568, 2000.Applicant
- Yeung et al., “Digital Watermarks: Shedding Light on the Invisible,” IEEE Computer, pp. 32-41, 1998.Applicant