US20020168088A1 - Method and arrangement for detecting a watermark - Google Patents

Method and arrangement for detecting a watermark Download PDF

Info

Publication number
US20020168088A1
US20020168088A1 US10/142,588 US14258802A US2002168088A1 US 20020168088 A1 US20020168088 A1 US 20020168088A1 US 14258802 A US14258802 A US 14258802A US 2002168088 A1 US2002168088 A1 US 2002168088A1
Authority
US
United States
Prior art keywords
watermark
threshold
detector
output signal
signal
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10/142,588
Inventor
Johan Linnartz
Maurice Maes
Antonius Kalker
Geert Depovere
Peter Rongen
Christianus Vriens
Marten Van Dijk
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Priority to US10/142,588 priority Critical patent/US20020168088A1/en
Publication of US20020168088A1 publication Critical patent/US20020168088A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N5/00Details of television systems
    • H04N5/76Television signal recording
    • H04N5/91Television signal processing therefor
    • H04N5/913Television signal processing therefor for scrambling ; for copy protection
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00General purpose image data processing
    • G06T1/0021Image watermarking
    • G06T1/005Robust watermarking, e.g. average attack or collusion attack resistant
    • G06T1/0078Robust watermarking, e.g. average attack or collusion attack resistant using multiple thresholds
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32203Spatial or amplitude domain methods
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32101Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title embedded in the image data, i.e. enclosed or integrated in the image, e.g. watermark, super-imposed logo or stamp
    • H04N1/32149Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32203Spatial or amplitude domain methods
    • H04N1/32208Spatial or amplitude domain methods involving changing the magnitude of selected pixels, e.g. overlay of information or super-imposition
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00General purpose image data processing
    • G06T2201/005Image watermarking
    • G06T2201/0065Extraction of an embedded watermark; Reliable detection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3225Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document
    • H04N2201/3233Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of data relating to an image, a page or a document of authentication information, e.g. digital signature, watermark
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N2201/00Indexing scheme relating to scanning, transmission or reproduction of documents or the like, and to details thereof
    • H04N2201/32Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N2201/3201Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N2201/3269Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs
    • H04N2201/327Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title of machine readable codes or marks, e.g. bar codes or glyphs which are undetectable to the naked eye, e.g. embedded codes

Definitions

  • the invention relates to a method and arrangement for detecting a watermark embedded in an information signal.
  • the invention also relates to a method of removing a watermark from an information signal having an embedded watermark.
  • Watermarks are perceptually invisible messages embedded in information signals such as multimedia material, e.g. audio, still pictures, animations or video. Watermarks can be used to identify the copyright ownership of information. They allow a copyright owner to trace illegal copies of his material by inspecting whether his watermark is present in said copies.
  • Watermarks are embedded in an information signal by modifying data samples of the signal (e.g. audio samples of an audio signal, pixels of an image, transform coefficients of a transform-coded signal, etc.) such that the original is not perceptibly affected.
  • data samples of the signal e.g. audio samples of an audio signal, pixels of an image, transform coefficients of a transform-coded signal, etc.
  • Various methods of watermarking are known in the art. For example, pixels of an original image are slightly incremented or decremented in accordance with corresponding bits of a binary watermark pattern.
  • the signal is subjected to a statistical analysis.
  • the statistical analysis yields a parameter, hereinafter referred to as “decision variable”, which indicates to which extent the watermark is present in the signal.
  • the decision variable may be the amount of correlation between the signal and an applied reference copy of the watermark. If an image is watermarked by modifying selected pixels, a prediction for said pixels is calculated from temporally or spatially adjacent pixels. The decision variable may then be the number of pixels being sufficiently different from their prediction.
  • Prior art watermark detectors generate a binary output signal indicating “watermark found” or “no watermark found”. This is achieved by comparing the decision variable with a predetermined threshold. If the value of the decision variable exceeds the threshold, the watermark is considered to be present in the signal.
  • the watermark detector will generally be implemented as a tamperproof box, so that an attacker can neither reversely engineer the detection algorithm nor its implementation parameters. It has been found, however, that an attacker can nevertheless remove a watermark by observing the detector's binary output signal under various input signal conditions.
  • the invention is based on the recognition that the prior art watermark detectors exhibit a sharp transition between the decisions “watermark found” and “no watermark found”. This property allows an attacker to iteratively modify an input signal and observe the detector's output until he has found an input signal which causes the detector to operate in the vicinity of its threshold. Having thus found the transition point, it is not difficult to generate an input signal which closely resembles the watermarked signal but is not recognized as being watermarked. By randomizing the transition point of the detector, the attacker acquires less (or at least less reliable) information from each signal modification.
  • FIG. 1 shows a prior art system comprising a watermark embedder and a watermark detector.
  • FIG. 2 shows a watermark pattern to illustrate the operation of the system shown in FIG. 1.
  • FIG. 3 shows waveforms illustrating the operation of the prior art watermark detector shown in FIG. 1.
  • FIG. 4 shows a flowchart of operations for removing a watermark from a watermarked image using the prior art watermark detector which is shown in FIG. 1.
  • FIGS. 6 - 8 show embodiments of watermark detectors in accordance with the invention.
  • FIG. 9 shows waveforms illustrating the operation of the watermark detectors shown in FIGS. 7 and 8.
  • FIGS. 10 - 12 show further embodiments of watermark detectors in accordance with the invention.
  • the decision variable indicating to which extent the watermark is present in the signal is the amount of correlation between the signal being analyzed and a reference copy of the watermark to be detected.
  • the description should not be interpreted as restricting the invention to such an embodiment.
  • FIG. 1 shows a prior art system comprising a watermark embedder 1 and a watermark detector 2 .
  • the watermark embedder receives an original information signal p and a watermark signal w.
  • the information signal p is assumed to be a digitized image having 8-bit luminance pixel values p(n).
  • An example of such a watermark pattern is shown in FIG. 2.
  • the watermark embedder comprises an adding stage 10 which adds the watermark values w(n) to the spatially corresponding pixels p(n) of the input image. It will be appreciated that this does not affect the visual appearance of the image.
  • the embedded watermark is thus perceptually invisible.
  • the information signal q is applied, after transmission or storage (not shown), to the watermark detector 2 .
  • the watermark detector comprises a multiplication stage 21 and a summing circuit 22 which jointly constitute a correlation circuit.
  • the multiplication stage receives the information signal q and a reference copy of the watermark w, the presence of which in the signal q is to be detected.
  • the pixel values q(n) of the received image and the corresponding values w(n) of the reference watermark are individually multiplied and then summed up to obtain a decision variable y which represents the amount of correlation between input signal q and watermark w.
  • a test image is created which is near the boundary of the watermark to be removed. At this point it does not matter whether the resulting image resembles the original or not. The only criterion is that minor modifications of the test image cause the detector to respond with “watermark found” or “no watermark found” with a probability that is sufficiently different from zero or one.
  • the test image can be created by tampering with a watermarked image (for which y>>y thr ) step-by-step until the detector responds with “no watermark found”.
  • One method is to gradually reduce the contrast in the image just enough to drop below the threshold where the detector reports the presence of the watermark.
  • An alternative method is to replace more and more pixels in the image by neutral grey. There must be a point where the detector makes the transition from seeing a watermark to responding that the image is free of a watermark. Otherwise this step would eventually result in an evenly grey colored image, and no reasonable watermark detector can claim that such an image contains a watermark.
  • a portion of the image is modified in a step 12 , e.g. a particular pixel value is increased or decreased, until the detector detects the watermark again.
  • Step 12 is repeated for every pixel in the image. It should be noted that instead of experimenting pixel by pixel, the attacker may also use another set of orthogonal modifications of the image, e.g. increasing or decreasing the DCT coefficients of a discrete cosine transform coded image.
  • a combination of pixel values which has the largest influence on the detector is estimated in a step 13 . Then, in a step 14 , the estimate is subtracted from the original marked image. It may be necessary to subtract the estimate ⁇ times to cause the detector to report that no watermark is present. ⁇ is found experimentally, and is preferably as small as possible.
  • Embodiments of a watermark detector having the desired property can easily be designed by those skilled in the art.
  • a straightforward example is shown in FIG. 6.
  • the multiplication stage 21 , summing circuit 22 and comparator 23 are the same as shown in FIG. 1.
  • the detector comprises a further comparator 24 which compares the amount of correlation y with the lower threshold value y 1 , and a pseudo-random binary sequence (PRBS) generator 25 which generates a random value R (0 or 1).
  • PRBS pseudo-random binary sequence
  • a logic circuit comprising an AND-gate 26 and an OR-gate 27 combines both comparator outputs and the random value R to obtain the decision output signal D in accordance with the following truth table: y > y 1 y > y 2 D 0 0 0 1 0 R 1 1 1
  • a further embodiment of the watermark detector is arranged to produce the output signal D in the interval y 1 ⁇ y ⁇ y 2 with a (preferably smoothly) increasing probability as y becomes closer to the threshold y 2 .
  • FIG. 7 An embodiment of a watermark detector having such an increasing probability function is shown in FIG. 7.
  • the signal z is applied to the comparator 23 which receives a random number r having a value of between 0 and 1 which is generated by a random number generator 30 .
  • the detector works exactly as the detector shown in FIG. 6 for images having a correlation y>y 2 and y ⁇ y 1 .
  • y ) y - y 1 y 2 - y 1
  • FIG. 8 shows another embodiment of the watermark detector in accordance with the invention.
  • a random number r′ between 0 and y 2 ⁇ y 1 is generated by a random number generator 31 and added to the decision value y by means of an adder 32 .
  • the signal y+r′ is then compared with the threshold value y 2 .
  • Such a probability curve (denoted 92 in FIG. 9) can be obtained by applying an appropriate mathematical function F to the output of random number generator 31 .
  • this function is performed by a conversion circuit 33 between the random number generator 31 and the adder 32 .
  • FIGS. 10 and 11 show further improved watermark detectors which do not suffer from this drawback.
  • the random generator is of a type having a seed input. The generator produces the same random number whenever it receives the same seed. The seed input is derived from the input image so that the watermark detector produces the same output signal D whenever the same input image is applied. As a result thereof, an attacker cannot obtain statistical information about the operation point of the detector on the probability curve by repeatedly applying the same image.
  • the seed is derived from the input image by means of a circuit 34 which converts the received input image q into a number having fewer bits.
  • the function of circuit 34 is usually referred to as “hash” function.
  • the seed (for example, the modulo-N sum of all image pixel values) is then applied to the random generator 31 .
  • the correlation circuit ( 21 , 22 ) acts as the hash function.
  • the decision value y itself is now applied to the seed input of the random number generator 31 . It should be noted that the feature of applying a seed to the random generator can also be adopted for the embodiments shown in FIGS. 6 and 7.
  • a watermark detector is particularly invulnerable to attacks if the above described features (smoothly increasing probability function, seed supply through the hash function and seed supply by the decision variable itself) are combined. Such an embodiment is shown in FIG. 12.
  • the invention can be summarized as follows. Recently developed methods for copy protection rely on a watermark detector to judge whether multimedia content can be copied or not. In such copy protection schemes, a watermark detector examines the multimedia content and outputs a signal (D) indicating whether a watermark is present or not. Known watermark detectors determine a decision variable (y) indicating to which extent the watermark is present, for example, the amount of correlation between the input signal and a reference copy of the watermark to be detected. The watermark is detected if the decision variable exceeds a predetermined threshold (y 2 ). Such a detector is vulnerable to an attack which is described in this patent application.
  • a watermark detector which increases the work load for an attacker by several orders of magnitude. To this end, the detector generates a random output signal for a predetermined range of decision values (y) between the threshold (y 2 ) and a further threshold (y 1 ).

Abstract

Recently developed methods for copy protection rely on a watermark detector to judge whether multimedia content can be copied or not. In such copy protection schemes, a watermark detector examines the multimedia content and outputs a signal (D) indicating whether a watermark is present or not. Known watermark detectors determine a decision variable (y) indicating to which extent the watermark is present, for example, the amount of correlation between the input signal and a reference copy of the watermark to be detected. The watermark is detected if the decision variable exceeds a predetermined threshold (y2). Such a detector is vulnerable to an attack which is described in this patent application.
Disclosed is a watermark detector which increases the work load for an attacker by several orders of magnitude. To this end, the detector generates a random output signal for a predetermined range of decision values (y) between the threshold (y2) and a further threshold (y1).

Description

    FIELD OF THE INVENTION
  • The invention relates to a method and arrangement for detecting a watermark embedded in an information signal. The invention also relates to a method of removing a watermark from an information signal having an embedded watermark. [0001]
  • BACKGROUND OF THE INVENTION
  • Watermarks are perceptually invisible messages embedded in information signals such as multimedia material, e.g. audio, still pictures, animations or video. Watermarks can be used to identify the copyright ownership of information. They allow a copyright owner to trace illegal copies of his material by inspecting whether his watermark is present in said copies. [0002]
  • Watermarks are embedded in an information signal by modifying data samples of the signal (e.g. audio samples of an audio signal, pixels of an image, transform coefficients of a transform-coded signal, etc.) such that the original is not perceptibly affected. Various methods of watermarking are known in the art. For example, pixels of an original image are slightly incremented or decremented in accordance with corresponding bits of a binary watermark pattern. [0003]
  • In order to detect whether an information signal has an embedded watermark, the signal is subjected to a statistical analysis. The statistical analysis yields a parameter, hereinafter referred to as “decision variable”, which indicates to which extent the watermark is present in the signal. For example, if an image signal is watermarked by incrementing or decrementing its pixels in accordance with a watermark pattern, the decision variable may be the amount of correlation between the signal and an applied reference copy of the watermark. If an image is watermarked by modifying selected pixels, a prediction for said pixels is calculated from temporally or spatially adjacent pixels. The decision variable may then be the number of pixels being sufficiently different from their prediction. [0004]
  • Prior art watermark detectors generate a binary output signal indicating “watermark found” or “no watermark found”. This is achieved by comparing the decision variable with a predetermined threshold. If the value of the decision variable exceeds the threshold, the watermark is considered to be present in the signal. In consumer products such as home recorders, the watermark detector will generally be implemented as a tamperproof box, so that an attacker can neither reversely engineer the detection algorithm nor its implementation parameters. It has been found, however, that an attacker can nevertheless remove a watermark by observing the detector's binary output signal under various input signal conditions. [0005]
  • OBJECT AND SUMMARY OF THE INVENTION
  • It is an object of the invention to provide a method and arrangement for detecting a watermark which is less vulnerable to attacks. [0006]
  • To this end, the method in accordance with the invention is characterized by the step of randomly generating said output signal for decision values below said threshold. Preferably, the random output signal is generated for a range of decision values between said threshold and a further predetermined threshold. [0007]
  • The invention is based on the recognition that the prior art watermark detectors exhibit a sharp transition between the decisions “watermark found” and “no watermark found”. This property allows an attacker to iteratively modify an input signal and observe the detector's output until he has found an input signal which causes the detector to operate in the vicinity of its threshold. Having thus found the transition point, it is not difficult to generate an input signal which closely resembles the watermarked signal but is not recognized as being watermarked. By randomizing the transition point of the detector, the attacker acquires less (or at least less reliable) information from each signal modification. [0008]
  • Further advantageous embodiments of the invention are defined in the dependent claims.[0009]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 shows a prior art system comprising a watermark embedder and a watermark detector. [0010]
  • FIG. 2 shows a watermark pattern to illustrate the operation of the system shown in FIG. 1. [0011]
  • FIG. 3 shows waveforms illustrating the operation of the prior art watermark detector shown in FIG. 1. [0012]
  • FIG. 4 shows a flowchart of operations for removing a watermark from a watermarked image using the prior art watermark detector which is shown in FIG. 1. [0013]
  • FIG. 5 shows waveforms illustrating the operation of the watermark detector in accordance with the invention. [0014]
  • FIGS. [0015] 6-8 show embodiments of watermark detectors in accordance with the invention.
  • FIG. 9 shows waveforms illustrating the operation of the watermark detectors shown in FIGS. 7 and 8. [0016]
  • FIGS. [0017] 10-12 show further embodiments of watermark detectors in accordance with the invention.
  • DESCRIPTION OF EMBODIMENTS
  • The invention will now be described with reference to a watermark detector in which the decision variable indicating to which extent the watermark is present in the signal is the amount of correlation between the signal being analyzed and a reference copy of the watermark to be detected. However, the description should not be interpreted as restricting the invention to such an embodiment. [0018]
  • FIG. 1 shows a prior art system comprising a [0019] watermark embedder 1 and a watermark detector 2. The watermark embedder receives an original information signal p and a watermark signal w. The information signal p is assumed to be a digitized image having 8-bit luminance pixel values p(n). The watermark w is assumed to be a specific binary pattern of values w(n)=1 or w(n)=−1. An example of such a watermark pattern is shown in FIG. 2. The watermark embedder comprises an adding stage 10 which adds the watermark values w(n) to the spatially corresponding pixels p(n) of the input image. It will be appreciated that this does not affect the visual appearance of the image. The embedded watermark is thus perceptually invisible.
  • The information signal q is applied, after transmission or storage (not shown), to the [0020] watermark detector 2. The watermark detector comprises a multiplication stage 21 and a summing circuit 22 which jointly constitute a correlation circuit. The multiplication stage receives the information signal q and a reference copy of the watermark w, the presence of which in the signal q is to be detected. The pixel values q(n) of the received image and the corresponding values w(n) of the reference watermark are individually multiplied and then summed up to obtain a decision variable y which represents the amount of correlation between input signal q and watermark w. In mathematical notation: y = n = 1 N w ( n ) × q ( n )
    Figure US20020168088A1-20021114-M00001
  • sin which N is the total number of pixels. [0021]
  • The correlation value y is applied to a [0022] comparator 23 for comparison with a threshold value ythr. As is shown in FIG. 3, the comparator produces an output D=1 (watermark found) for y>ythr and an output D=0 (no watermark found) for y<ythr. The watermark pattern w and the threshold value ythr are carefully chosen in order to prevent the detector from making a false decision too frequently.
  • A method of removing the watermark from a watermarked image using the above described prior art watermark detector will now be described with reference to a flowchart of operations which is shown in FIG. 4. The attack applies to any watermark detector having a sharp transition between the decisions “watermark found” and “no watermark found”. [0023]
  • In a [0024] first step 11, a test image is created which is near the boundary of the watermark to be removed. At this point it does not matter whether the resulting image resembles the original or not. The only criterion is that minor modifications of the test image cause the detector to respond with “watermark found” or “no watermark found” with a probability that is sufficiently different from zero or one. The test image can be created by tampering with a watermarked image (for which y>>ythr) step-by-step until the detector responds with “no watermark found”. One method is to gradually reduce the contrast in the image just enough to drop below the threshold where the detector reports the presence of the watermark. An alternative method is to replace more and more pixels in the image by neutral grey. There must be a point where the detector makes the transition from seeing a watermark to responding that the image is free of a watermark. Otherwise this step would eventually result in an evenly grey colored image, and no reasonable watermark detector can claim that such an image contains a watermark.
  • Having thus found a suitable test image, a portion of the image is modified in a [0025] step 12, e.g. a particular pixel value is increased or decreased, until the detector detects the watermark again. This provides insight into how the watermark embedder modifies the value of that pixel. Step 12 is repeated for every pixel in the image. It should be noted that instead of experimenting pixel by pixel, the attacker may also use another set of orthogonal modifications of the image, e.g. increasing or decreasing the DCT coefficients of a discrete cosine transform coded image.
  • Knowing how sensitive the detector is to modification of each pixel, a combination of pixel values which has the largest influence on the detector is estimated in a [0026] step 13. Then, in a step 14, the estimate is subtracted from the original marked image. It may be necessary to subtract the estimate λ times to cause the detector to report that no watermark is present. λ is found experimentally, and is preferably as small as possible.
  • The above described process results in a new image which is not recognized as being watermarked but only contains a minor distortion compared to the watermarked image or compared to the original unmarked image. This attack works equally well if the watermark is embedded in the DCT domain. The process can be repeated if the watermarking algorithm is suspected to contain non-linear, or image-dependent elements. Known simulation and search techniques, including simulated annealing can be exploited in this iterative process. [0027]
  • The watermark detector in accordance with the invention is substantially less vulnerable to this attack. As is illustrated in FIG. 5, the detector randomizes the transition point from D=0 (no watermark found) to D=1 (watermark found) if the decision variable y has a value in a given interval y[0028] 1<y<y2. Slightly modifying the applied signal while the detector operates in this interval (step 12 in FIG. 4) now does not give reliable feedback to an attacker. Accordingly, the watermark can no longer be estimated. The detector is less vulnerable to attacks as the distance between the threshold levels y1 and y2 is larger.
  • Embodiments of a watermark detector having the desired property can easily be designed by those skilled in the art. A straightforward example is shown in FIG. 6. In this example, the [0029] multiplication stage 21, summing circuit 22 and comparator 23 are the same as shown in FIG. 1. The detector comprises a further comparator 24 which compares the amount of correlation y with the lower threshold value y1, and a pseudo-random binary sequence (PRBS) generator 25 which generates a random value R (0 or 1). A logic circuit comprising an AND-gate 26 and an OR-gate 27 combines both comparator outputs and the random value R to obtain the decision output signal D in accordance with the following truth table:
    y > y1 y > y2 D
    0 0 0
    1 0 R
    1 1 1
  • With the embodiment shown in FIG. 6, the interval end point y=y[0030] 2 where the detector switches from producing D=1 to producing D=R can be relatively easily found by an attacker. As the probability of producing D=0 in the interval is 50%, the first occurrence of D=0 while gradually affecting a watermarked image (step 11 in FIG. 4) is a reasonable indication of having found said end point. To alleviate this problem, a further embodiment of the watermark detector is arranged to produce the output signal D in the interval y1<y<y2 with a (preferably smoothly) increasing probability as y becomes closer to the threshold y2.
  • An embodiment of a watermark detector having such an increasing probability function is shown in FIG. 7. The detector comprises an arithmetic circuit composed of a [0031] subtracter 28 and a multiplier 29 which modifies the decision variable y into a signal z in accordance with: z = y - y 1 y 2 - y 1
    Figure US20020168088A1-20021114-M00002
  • The signal z is applied to the [0032] comparator 23 which receives a random number r having a value of between 0 and 1 which is generated by a random number generator 30. As can easily be understood, the detector works exactly as the detector shown in FIG. 6 for images having a correlation y>y2 and y<y1. However, if the amount of correlation is between y1 and y2 (i.e. 0<z<1), the comparator output signal D depends on the actual value of r, while the probability of producing D=1 increases linearly in accordance with: P r ( D = 1 | y ) = y - y 1 y 2 - y 1
    Figure US20020168088A1-20021114-M00003
  • FIG. 8 shows another embodiment of the watermark detector in accordance with the invention. In this embodiment, a random number r′ between 0 and y[0033] 2−y1 is generated by a random number generator 31 and added to the decision value y by means of an adder 32. The signal y+r′ is then compared with the threshold value y2. As has been attempted to illustrate in FIG. 9, the comparator always produces an output D=0 for y<y1 and an output D=1 for y>y2, whereas it randomly produces 0 or 1 for y1<y<y2. Note that the probability of y+r′ being larger than y2 (resulting in D=1) is very small for values of y just above y1, and very large for values of y just below y2. Consequently, this embodiment inherently has the property of showing a linearly increasing probability of producing D=1 as y becomes larger. The linear probability curve is denoted 91 in FIG. 9.
  • The inventors have found that the best shape of the probability function in the interval y[0034] 1<y <y2 is (or substantially resembles) a raised cosine function: P r ( D = 1 | y ) = 1 2 - 1 2 cos ( π y - y 1 y 2 - y 1 )
    Figure US20020168088A1-20021114-M00004
  • Such a probability curve (denoted [0035] 92 in FIG. 9) can be obtained by applying an appropriate mathematical function F to the output of random number generator 31. In FIG. 8, this function is performed by a conversion circuit 33 between the random number generator 31 and the adder 32.
  • Repeatedly applying the same input image to any one of the above described embodiments of the watermark detector, and thereby counting the number of times the detector produces D=0 or D=1, teaches an attacker on which point of the probability curve the detector operates. FIGS. 10 and 11 show further improved watermark detectors which do not suffer from this drawback. In these embodiments, the random generator is of a type having a seed input. The generator produces the same random number whenever it receives the same seed. The seed input is derived from the input image so that the watermark detector produces the same output signal D whenever the same input image is applied. As a result thereof, an attacker cannot obtain statistical information about the operation point of the detector on the probability curve by repeatedly applying the same image. [0036]
  • In the embodiment shown in FIG. 10, the seed is derived from the input image by means of a [0037] circuit 34 which converts the received input image q into a number having fewer bits. The function of circuit 34 is usually referred to as “hash” function. The seed (for example, the modulo-N sum of all image pixel values) is then applied to the random generator 31. In the embodiment shown in FIG. 11, the correlation circuit (21,22) acts as the hash function. The decision value y itself is now applied to the seed input of the random number generator 31. It should be noted that the feature of applying a seed to the random generator can also be adopted for the embodiments shown in FIGS. 6 and 7.
  • The difference between a watermark detector with and without the seed feature can best be explained by way of an example. Applying the same input image 100 times to a watermark detector not having the seed feature will cause said detector to produce, for example, 90 times an output D=1 (watermark found) and 10 times an output D=0 (no watermark found). Applying the same input image [0038] 100 times to a watermark detector with the seed feature will cause the detector to produce 100 times the same output, the probability of D=1 being 90% and the probability of D=0 being 10%. In the latter case, an attacker cannot gather statistical information by repeating the watermark test for the same image over and over again.
  • A watermark detector is particularly invulnerable to attacks if the above described features (smoothly increasing probability function, seed supply through the hash function and seed supply by the decision variable itself) are combined. Such an embodiment is shown in FIG. 12. [0039]
  • Randomization of the watermark detection point can also be obtained by randomly selecting the pixels considered for calculating the decision variable y (or, conversely, the pixels that are discarded). To this end, randomly selected image pixels q(n) and corresponding watermark values w(n) are applied to the [0040] correlation circuit 21,22 which is shown in FIG. 1. For example, if 60% of the pixels of a watermarked image are considered and the image is not modified by an attacker, the detector will still generate D=1 in spite of the decision value being less than when all pixels are considered. However, if pixels of the image are modified, the decision value can decrease which may result in D=0 being generated, dependent on how many pixels have been modified.
  • The invention can be summarized as follows. Recently developed methods for copy protection rely on a watermark detector to judge whether multimedia content can be copied or not. In such copy protection schemes, a watermark detector examines the multimedia content and outputs a signal (D) indicating whether a watermark is present or not. Known watermark detectors determine a decision variable (y) indicating to which extent the watermark is present, for example, the amount of correlation between the input signal and a reference copy of the watermark to be detected. The watermark is detected if the decision variable exceeds a predetermined threshold (y[0041] 2). Such a detector is vulnerable to an attack which is described in this patent application.
  • Disclosed is a watermark detector which increases the work load for an attacker by several orders of magnitude. To this end, the detector generates a random output signal for a predetermined range of decision values (y) between the threshold (y[0042] 2) and a further threshold (y1).

Claims (13)

1. A method of detecting a watermark (w) embedded in an information signal (q), comprising the steps of:
determining a decision variable (y) indicating to which extent said watermark is present in said signal; and
generating an output signal (D) indicating detection of the watermark if the decision variable exceeds a predetermined threshold (y2); characterized by the step of randomly generating said output signal for decision values below said threshold (y2).
2. A method as claimed in claim 1, characterized by the step of randomly generating said output signal for a range of decision values between said threshold (y2) and a further predetermined threshold (y1).
3. A method as claimed in claim 1 or 2, wherein said random output signal is generated with an increasing probability as the decision variable becomes closer to the predetermined threshold (y2).
4. A method as claimed in claim 3, wherein said probability is a linear function of the decision variable within said range between the threshold (y2) and the further threshold (y1).
5. A method as claimed in claim 3, wherein said probability is a raised cosine function of the decision variable within said range between the threshold (y2) and the further threshold (y1).
6. A method as claimed in claim 1 or 2, wherein the step of randomly generating the output signal includes generating the same output signal whenever the same information signal is received.
7. An arrangement for detecting a watermark (w) embedded in an information signal (q), comprising:
means (21,22) for determining a decision variable (y) indicating to which extent said watermark is present in said signal; and
means for generating an output signal (D) indicating detection of the watermark if the decision variable exceeds a predetermined threshold (y2);
characterized in that the arrangement comprises means for randomly generating said output signal for decision values below said threshold (y2).
8. An arrangement as claimed in claim 7, characterized in that the arrangement comprises means for randomly generating said output signal for a range of decision values between said threshold (y2) and a further predetermined threshold (y1).
9. An arrangement as claimed in claim 7 or 8, comprising means for generating said random output signal with an increasing probability as the decision variable becomes closer to the predetermined threshold (y2).
10. An arrangement as claimed claim 9, wherein said means for randomly generating the output signal includes a random number generator with a seed input, and means for deriving the seed input from the information signal in accordance with a predetermined function.
11. An arrangement as claimed in claim 9, wherein the means (21,22) for determining the decision variable constitute said means for deriving the seed input.
12. A method of removing a watermark from an information signal having an embedded watermark, comprising the steps of:
applying the information signal to a watermark detector generating an indication on whether the information signal has an embedded watermark;
modifying selected portions of the information signal until the watermark detector reverses said indication, to obtain respective portions of an estimated watermark causing said reversal; and
subtracting the estimated watermark from the information signal.
13. A multimedia playing and/or recording apparatus comprising an arrangement as claimed in any one of claims 7-11.
US10/142,588 1997-05-29 2002-05-09 Method and arrangement for detecting a watermark Abandoned US20020168088A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US10/142,588 US20020168088A1 (en) 1997-05-29 2002-05-09 Method and arrangement for detecting a watermark

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
EP97201600.0 1997-05-29
EP97201600 1997-05-29
EP97202276 1997-07-21
EP97202276.8 1997-07-21
US09/082,446 US6415040B1 (en) 1997-05-29 1998-05-20 Device for optically scanning a record carrier
US10/142,588 US20020168088A1 (en) 1997-05-29 2002-05-09 Method and arrangement for detecting a watermark

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/082,446 Division US6415040B1 (en) 1997-05-29 1998-05-20 Device for optically scanning a record carrier

Publications (1)

Publication Number Publication Date
US20020168088A1 true US20020168088A1 (en) 2002-11-14

Family

ID=26146531

Family Applications (2)

Application Number Title Priority Date Filing Date
US09/082,446 Expired - Fee Related US6415040B1 (en) 1997-05-29 1998-05-20 Device for optically scanning a record carrier
US10/142,588 Abandoned US20020168088A1 (en) 1997-05-29 2002-05-09 Method and arrangement for detecting a watermark

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09/082,446 Expired - Fee Related US6415040B1 (en) 1997-05-29 1998-05-20 Device for optically scanning a record carrier

Country Status (10)

Country Link
US (2) US6415040B1 (en)
EP (1) EP0920775A2 (en)
JP (1) JP2000516074A (en)
KR (1) KR20000029626A (en)
CN (1) CN1249106A (en)
AR (1) AR018495A1 (en)
BR (1) BR9804930A (en)
CZ (1) CZ26499A3 (en)
IL (1) IL128233A0 (en)
WO (1) WO1998054897A2 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100416595C (en) * 2006-11-03 2008-09-03 北京启明星辰信息技术有限公司 Blind detecting system and method for digital watermarking flooding
US20080215636A1 (en) * 2000-05-01 2008-09-04 Lofgren Neil E Systems and Methods Facilitating Communication with Remote Computers
US20110164784A1 (en) * 2008-03-14 2011-07-07 Bernhard Grill Embedder for embedding a watermark into an information representation, detector for detecting a watermark in an information representation, method and computer program and information signal
US9037453B2 (en) 2008-03-14 2015-05-19 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Embedder for embedding a watermark into an information representation, detector for detecting a watermark in an information representation, method and computer program
CN110278439A (en) * 2019-06-28 2019-09-24 北京云摄美网络科技有限公司 De-watermarked algorithm based on inter-prediction

Families Citing this family (47)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6516079B1 (en) * 2000-02-14 2003-02-04 Digimarc Corporation Digital watermark screening and detecting strategies
US20020136429A1 (en) * 1994-03-17 2002-09-26 John Stach Data hiding through arrangement of objects
US6116707A (en) * 1997-12-18 2000-09-12 Electronics For Imaging, Inc. Robotic plotter system
CN1153456C (en) * 1998-03-04 2004-06-09 皇家菲利浦电子有限公司 Water-mark detection
US7644282B2 (en) 1998-05-28 2010-01-05 Verance Corporation Pre-processed information embedding system
US6601046B1 (en) 1999-03-25 2003-07-29 Koninklijke Philips Electronics N.V. Usage dependent ticket to protect copy-protected material
US6792535B1 (en) 1999-04-06 2004-09-14 Kwan Software Engineering, Inc. System and method for digitally marking a file with a removable mark
WO2000060589A1 (en) * 1999-04-06 2000-10-12 Kwan Software Engineering, Inc. System and method for digitally marking a file with a removable mark
US6434701B1 (en) 1999-04-06 2002-08-13 Kwan Software Engineering, Inc. System and method for digitally marking a file
IT1308273B1 (en) * 1999-04-16 2001-12-10 Univ Firenze METHOD OF DETECTION OF A BRAND IN DIGITAL IMAGES
US6737957B1 (en) 2000-02-16 2004-05-18 Verance Corporation Remote control signaling using audio watermarks
US6754365B1 (en) * 2000-02-16 2004-06-22 Eastman Kodak Company Detecting embedded information in images
US6751335B1 (en) 2000-11-01 2004-06-15 Eastman Kodak Company Method for generating a dispersed message for data embedding
CN1331142C (en) * 2001-07-06 2007-08-08 皇家菲利浦电子有限公司 Method for protecting content stored on an information carrier
GB2383148A (en) * 2001-12-13 2003-06-18 Sony Uk Ltd Watermarking
US7321667B2 (en) * 2002-01-18 2008-01-22 Digimarc Corporation Data hiding through arrangement of objects
US6766045B2 (en) * 2002-03-11 2004-07-20 Digital Verification Ltd. Currency verification
KR100484230B1 (en) * 2002-03-22 2005-04-20 김태정 Asymmetric Digital Watermarking Method with Highly Improved Security
KR100484231B1 (en) * 2002-03-27 2005-04-20 김태정 Watermark Detection Method with Highly Improved Ability of Resistance to Sensitivity Attack and The System
JP2003304388A (en) * 2002-04-11 2003-10-24 Sony Corp Additional information detection processor, apparatus and method for contents reproduction processing, and computer program
JP2004274092A (en) * 2002-07-23 2004-09-30 Ricoh Co Ltd Image processing apparatus, image processing method, image processing program, and storage medium for storing the image processing program
EP2442566A3 (en) 2002-10-15 2012-08-08 Verance Corporation Media Monitoring, Management and Information System
US20060239501A1 (en) 2005-04-26 2006-10-26 Verance Corporation Security enhancements of digital watermarks for multi-media content
US7616776B2 (en) 2005-04-26 2009-11-10 Verance Corproation Methods and apparatus for enhancing the robustness of watermark extraction from digital host content
US9055239B2 (en) 2003-10-08 2015-06-09 Verance Corporation Signal continuity assessment using embedded watermarks
US7369677B2 (en) 2005-04-26 2008-05-06 Verance Corporation System reactions to the detection of embedded watermarks in a digital host content
CN1306453C (en) * 2003-12-30 2007-03-21 中国人民解放军第一军医大学 Image water print embedding and detecting method of strong antiimpact performance in discrete conversion region
US8020004B2 (en) 2005-07-01 2011-09-13 Verance Corporation Forensic marking using a common customization function
US8781967B2 (en) 2005-07-07 2014-07-15 Verance Corporation Watermarking in an encrypted domain
US8259938B2 (en) 2008-06-24 2012-09-04 Verance Corporation Efficient and secure forensic marking in compressed
KR101005433B1 (en) * 2008-09-22 2011-01-05 주식회사 마크애니 Method for detecting existence of a watermark and inserting a watermark and system therof
US9607131B2 (en) 2010-09-16 2017-03-28 Verance Corporation Secure and efficient content screening in a networked environment
US8682026B2 (en) 2011-11-03 2014-03-25 Verance Corporation Efficient extraction of embedded watermarks in the presence of host content distortions
US8923548B2 (en) 2011-11-03 2014-12-30 Verance Corporation Extraction of embedded watermarks from a host content using a plurality of tentative watermarks
US8533481B2 (en) 2011-11-03 2013-09-10 Verance Corporation Extraction of embedded watermarks from a host content based on extrapolation techniques
US8615104B2 (en) 2011-11-03 2013-12-24 Verance Corporation Watermark extraction based on tentative watermarks
US8745403B2 (en) 2011-11-23 2014-06-03 Verance Corporation Enhanced content management based on watermark extraction records
US9547753B2 (en) 2011-12-13 2017-01-17 Verance Corporation Coordinated watermarking
US9323902B2 (en) 2011-12-13 2016-04-26 Verance Corporation Conditional access using embedded watermarks
US9571606B2 (en) 2012-08-31 2017-02-14 Verance Corporation Social media viewing system
US9106964B2 (en) 2012-09-13 2015-08-11 Verance Corporation Enhanced content distribution using advertisements
US8869222B2 (en) 2012-09-13 2014-10-21 Verance Corporation Second screen content
US8726304B2 (en) 2012-09-13 2014-05-13 Verance Corporation Time varying evaluation of multimedia content
US9262793B2 (en) 2013-03-14 2016-02-16 Verance Corporation Transactional video marking system
US9251549B2 (en) 2013-07-23 2016-02-02 Verance Corporation Watermark extractor enhancements based on payload ranking
US9208334B2 (en) 2013-10-25 2015-12-08 Verance Corporation Content management using multiple abstraction layers
EP3117626A4 (en) 2014-03-13 2017-10-25 Verance Corporation Interactive content acquisition using embedded codes

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5606609A (en) * 1994-09-19 1997-02-25 Scientific-Atlanta Electronic document verification system and method
US5748783A (en) * 1995-05-08 1998-05-05 Digimarc Corporation Method and apparatus for robust information coding
US5933798A (en) * 1996-07-16 1999-08-03 U.S. Philips Corporation Detecting a watermark embedded in an information signal
US6128401A (en) * 1989-02-10 2000-10-03 Canon Kabushiki Kaisha Image reading or processing with ability to prevent copying of certain originals
US6131161A (en) * 1995-10-04 2000-10-10 U.S. Philips Corporation Marking a digitally encoded video and/or audio signal
US6226387B1 (en) * 1996-08-30 2001-05-01 Regents Of The University Of Minnesota Method and apparatus for scene-based video watermarking

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996036163A2 (en) * 1995-05-08 1996-11-14 Digimarc Corporation Steganography systems
EP0766468B1 (en) * 1995-09-28 2006-05-03 Nec Corporation Method and system for inserting a spread spectrum watermark into multimedia data

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6128401A (en) * 1989-02-10 2000-10-03 Canon Kabushiki Kaisha Image reading or processing with ability to prevent copying of certain originals
US5606609A (en) * 1994-09-19 1997-02-25 Scientific-Atlanta Electronic document verification system and method
US5748783A (en) * 1995-05-08 1998-05-05 Digimarc Corporation Method and apparatus for robust information coding
US6131161A (en) * 1995-10-04 2000-10-10 U.S. Philips Corporation Marking a digitally encoded video and/or audio signal
US5933798A (en) * 1996-07-16 1999-08-03 U.S. Philips Corporation Detecting a watermark embedded in an information signal
US6226387B1 (en) * 1996-08-30 2001-05-01 Regents Of The University Of Minnesota Method and apparatus for scene-based video watermarking

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080215636A1 (en) * 2000-05-01 2008-09-04 Lofgren Neil E Systems and Methods Facilitating Communication with Remote Computers
US8606715B2 (en) 2000-05-01 2013-12-10 Digimarc Corporation Systems and methods facilitating communication with remote computers
CN100416595C (en) * 2006-11-03 2008-09-03 北京启明星辰信息技术有限公司 Blind detecting system and method for digital watermarking flooding
US20110164784A1 (en) * 2008-03-14 2011-07-07 Bernhard Grill Embedder for embedding a watermark into an information representation, detector for detecting a watermark in an information representation, method and computer program and information signal
US8625839B2 (en) * 2008-03-14 2014-01-07 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Embedder for embedding a watermark into an information representation, detector for detecting a watermark in an information representation, method and computer program and information signal
US9037453B2 (en) 2008-03-14 2015-05-19 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Embedder for embedding a watermark into an information representation, detector for detecting a watermark in an information representation, method and computer program
CN110278439A (en) * 2019-06-28 2019-09-24 北京云摄美网络科技有限公司 De-watermarked algorithm based on inter-prediction

Also Published As

Publication number Publication date
WO1998054897A2 (en) 1998-12-03
JP2000516074A (en) 2000-11-28
EP0920775A2 (en) 1999-06-09
KR20000029626A (en) 2000-05-25
BR9804930A (en) 1999-09-08
IL128233A0 (en) 1999-11-30
US6415040B1 (en) 2002-07-02
WO1998054897A3 (en) 1999-03-04
CN1249106A (en) 2000-03-29
AR018495A1 (en) 2001-11-28
CZ26499A3 (en) 1999-09-15

Similar Documents

Publication Publication Date Title
US6415040B1 (en) Device for optically scanning a record carrier
US6570996B1 (en) Watermarking an informational signal
JP3946268B2 (en) Method and apparatus for detecting a watermark
Cao et al. Anti-forensics of contrast enhancement in digital images
EP1006710B1 (en) Digital watermark embedding and detection devices
US6226387B1 (en) Method and apparatus for scene-based video watermarking
Nikolaidis et al. Robust image watermarking in the spatial domain
Voyatzis et al. Digital image watermarking using mixing systems
US6240121B1 (en) Apparatus and method for watermark data insertion and apparatus and method for watermark data detection
Lichtenauer et al. Exhaustive geometrical search and the false positive watermark detection probability
Karybali et al. Efficient spatial image watermarking via new perceptual masking and blind detection schemes
US6718287B2 (en) Watermark detection
US20030108219A1 (en) Digital watermark embedding method, digital watermark embedding apparatus, digital watermark detecting method, and digital watermark detecting apparatus
Zhang et al. Detection of LSB matching steganography in decompressed images
KR100339860B1 (en) Method for embedding image watermark into audio signal or extracting watermark from watermarked audio signal and recording medium therefor
MXPA99001089A (en) Method and arrangement for detecting a watermark
Trivedi et al. Locally most-powerful detector for secret key estimation in spread spectrum image steganography
US8155375B2 (en) Video watermarking using temporal analysis
GB2390246A (en) Method of characterising attacks on a watermarked object
MXPA99003941A (en) Watermarking an information signal

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION