WO2004102464A2 - Tatouage numerique reversible et applications associees - Google Patents

Tatouage numerique reversible et applications associees Download PDF

Info

Publication number
WO2004102464A2
WO2004102464A2 PCT/US2004/014161 US2004014161W WO2004102464A2 WO 2004102464 A2 WO2004102464 A2 WO 2004102464A2 US 2004014161 W US2004014161 W US 2004014161W WO 2004102464 A2 WO2004102464 A2 WO 2004102464A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
reversible
host
values
image
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.)
Ceased
Application number
PCT/US2004/014161
Other languages
English (en)
Other versions
WO2004102464A3 (fr
Inventor
Adnan M. Alattar
John Stach
Jun Tian
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.)
Digimarc Corp
Original Assignee
Digimarc Corp
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
Priority claimed from US10/435,517 external-priority patent/US7006662B2/en
Priority claimed from US10/435,612 external-priority patent/US8059815B2/en
Application filed by Digimarc Corp filed Critical Digimarc Corp
Publication of WO2004102464A2 publication Critical patent/WO2004102464A2/fr
Anticipated expiration legal-status Critical
Publication of WO2004102464A3 publication Critical patent/WO2004102464A3/fr
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/0092—Payload characteristic determination in a watermarking scheme, e.g. number of bits to be embedded
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T1/00—General purpose image data processing
    • G06T1/0021—Image watermarking
    • G06T1/005—Robust watermarking, e.g. average attack or collusion attack resistant
    • G06T1/0071—Robust watermarking, e.g. average attack or collusion attack resistant using multiple or alternating watermarks
    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
    • G10L19/018—Audio watermarking, i.e. embedding inaudible data in the audio signal
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/00086—Circuits for prevention of unauthorised reproduction or copying, e.g. piracy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits 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/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, 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/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32288—Multiple embedding, e.g. cocktail embedding, or redundant embedding, e.g. repeating the additional information at a plurality of locations in the image
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits 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/32101—Display, printing, storage or transmission of additional information, e.g. ID code, date and time or title
    • H04N1/32144—Display, 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/32149—Methods relating to embedding, encoding, decoding, detection or retrieval operations
    • H04N1/32309—Methods relating to embedding, encoding, decoding, detection or retrieval operations in colour image data
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T2201/00—General purpose image data processing
    • G06T2201/005—Image watermarking
    • G06T2201/0051—Embedding of the watermark in the spatial domain

Definitions

  • the invention relates to digital watermarking.
  • Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media.
  • the media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process.
  • digital watermarking is applied to media signals such as images, audio signals, and video signals.
  • documents e.g., through line, word or character shifting, or line/character thickness variations
  • software e.g., multi-dimensional graphics models, and surface textures of objects.
  • Digital watermarking systems typically have two primary components: an encoder that embeds the watermark in a host media signal, and a decoder that detects and reads the embedded watermark from a signal suspected of containing a watermark (a suspect signal).
  • the encoder embeds a watermark by subtly altering the host media signal.
  • the reading component analyzes a suspect signal to detect whether a watermark is present.
  • the reader extracts this information from the detected watermark.
  • Several particular watermarking techniques have been developed. The reader is presumed to be familiar with the literature in this field.
  • the reversible watermark can be recovered and/or the content verified (e.g., via comparison of a hash of the perfectly restored content and a hash of original content carried in watermark), then the content is deemed authentic.
  • Many proposed techniques focus on high data carrying capacity while maintaining fidelity of the content. Others propose making the watermark robust, and conditionally reversible in the event that the content has not been altered.
  • the reversible watermark can be used to degrade fidelity intentionally, and then restore high quality content through reversal of the watermark, assuming the content user has paid for, licensed, or otherwise been granted permission to access the high quality version.
  • the needs of a particular application vary, including the extent to which content quality is preserved, auxiliary data carrying capacity is maximized, and robustness is maintained.
  • the invention provides various methods for reversible watermarking and related software and systems.
  • One aspect of the invention is a method for performing reversible watermarking to embed auxiliary data in an original data set.
  • the method reversibly embeds the auxiliary data into the original data set by expanding values in the original data set that distorts the values, yet enables the values to be perfectly re-constructed.
  • the method applies rate control to determine how to expand the values to minimize distortion for a desired auxiliary data carrying capacity or to maximize data carrying capacity for a desired distortion.
  • the method applies a perceptual model to determine how to expand the values to minimize distortion for a desired auxiliary data carrying capacity or to maximize data carrying capacity for a desired perceptual distortion.
  • This perceptual model may be used in conjunction with a control system with feedback to optimize the embedding based on quality and/or data capacity constraints.
  • Another aspect of the invention is a method for performing reversible watermarking to embed auxiliary data in an original data set.
  • the method selects sets of elements in the original data set for expansion. It reversibly embeds the auxiliary data into the original data set by expanding values associated with the selected sets in a manner that distorts the values, yet enables the values to be perfectly re-constructed.
  • the reversible watermarking is performed iteratively in layers, and for the layers, interleaving sets of elements are selected for expansion in successive layers.
  • the invention provides a software program, and related methods and systems that transform a host data file into a logical storage unit for auxiliary data files by embedding the auxiliary files in the data stored in the host data file.
  • the program embeds auxiliary files in a reversible watermark.
  • This reversible watermark modifies host data such as an image, audio, video, or software code, to carry auxiliary data.
  • the reversible watermark can maintain a desired level of perceptual quality, effectively hiding the auxiliary data in the host data.
  • the reversible watermark enables the original host data prior to modifications due to the embedding to be restored.
  • One aspect of the invention is software for transforming a host data file carrying host media data into a logical storage unit for storing auxiliary data files in a reversible watermark embedded into the host media data.
  • the software stored on a storage medium, includes a watermarking module for modifying original values of host media data elements in the host data file to embed a reversible watermark carrying auxiliary data files.
  • the reversible watermark enables the host media data elements to be restored to the original values.
  • It also includes a user interface module for representing the host data files as a container for the auxiliary data files, and enables the adding or removing of auxiliary data files from the reversible watermark.
  • modules may be included in the software for providing additional functionality, including modules for determining capacity of the host data, partitioning the host data into randomly accessible storage units, displaying overlay files, executing links, such hyperlinks to related information, controlling access to the host data or embedded data layers, controlling distribution of the host, tracking the history of the host data, facilitating visual searching, controlling rendering of the host, etc.
  • FIG. 1 illustrates an example of how to configure vectors for reversible watermarking.
  • Fig. 2 is a diagram of a rate controller for use in reversible watermarking.
  • Fig. 3 is a diagram illustrating recursive embedding of a reversible watermark.
  • Fig. 4 is a diagram illustrating an example of a permutation used for reversible watermark embedding.
  • Fig. 5 is a diagram illustrating an example of a program used to transform a host data file into a logical storage unit using a reversible watermark.
  • Fig. 6 is a diagram illustrating an example of a graphical user interface for the program illustrated in Fig. 5.
  • Fig. 7 is a diagram illustrating an example of a user interface used to depict overlays that are extracted from a reversible watermark and superimposed over a host image, along with links to related information.
  • a reversible watermarking system includes an embedder and a reader.
  • the embedder modifies the host data set to embed auxiliary data, hi some applications, there is a desire to maintain some level of perceptual quality (e.g., embedding auxiliary data, yet making the resulting images or audio with embedded data look or sound substantially the same as the original image or audio).
  • controls can be applied to ensure that a desired level of quality is maintained while maximizing the auxiliary data capacity, or maximizing the quality for a particular amount of auxiliary data.
  • the reader analyzes a data set suspected of carrying embedded auxiliary data, extracts the auxiliary data, and restores the data set to its original values prior to embedding. The method described below performs an expansion of values in a data set to embed auxiliary data.
  • the method performs an invertible transform to convert the input data into a set that includes expandable data values.
  • This transform is not necessary if the input data set is already in a form that includes sufficiently expandable data values to carry the desired amount of auxiliary data.
  • the transform attempts to create a set of values that maintains the perceptual quality of the host (for data sets where perceptual quality is important) and provides expandable values.
  • One way to accomplish this is to exploit redundancy or correlation among values in the host signal by expanding the difference values between redundant or closely correlated values.
  • One particular way to expand the difference values is detailed further below.
  • the vector u (u Q ,u 1 ⁇ A ,u N _p) is formed from N pixel values chosen from N different locations within the same color component for an image according to a predetermined order. This order may serve as a security key.
  • the simplest way to form this vector is to consider every axb adjacent pixel values as shown in Fig. 1 as a vector. If w sad h are the height and the width of the host image, then l ⁇ a ⁇ h , l ⁇ b ⁇ w and a + b ⁇ 2 . For simplicity, we treat each color component independently, and, hence, each component has its own set of vectors.
  • V j t ⁇ , (1)
  • N-l u N-l where
  • _-J is the least nearest integer.
  • equation (2) is the inverse of equation (1) one can substitute v 0 , v ⁇ , ..., v N _ x from equation (1) into u Q of equation (2). This gives:
  • each of vj , v 2 , ... , v N _ x is one-bit left shifted version of the original value v , v 2 ..., v N _ x , respectively, but potentially with a different LSB (least significant bit).
  • the conditions of equation (4), above, ensures that changing the LSBs of v l , v 2 ,...,v N _ x according to equation (5) does not introduce an overflow or underflow in the values of u 0 , u x , ... , u N _ x when the inverse transform is computed.
  • This approach can be extended to embed an auxiliary data value with multiple states by shifting or multiplying the difference value by more than one bit position or a number greater than 2, respectively, as discussed in the patent documents incorporated above. Further, it can be extended to values other than difference values, and data types other than images.
  • D be a matrix that operates on an integer vector with the following 3 properties; (1) the matrix D is full rank, and the matrix-vector product results in (2) an average value of the integer vector, and (3) N - 1 independent differences between vector elements.
  • each element of the integer vector is used to compute at least one difference.
  • the first column of the identity matrix i.e., a 1 followed by N - 1 zeros, must be satisfied when D operates on the first column of D ⁇ l .
  • the inner product of the first row of D and the first column of D ⁇ l must be 1, and the inner product of each of the N - 1 difference rows of D and the first column of D ⁇ l must generate a zero.
  • each element of the first column of D ⁇ must be identical (to satisfy the element differences equal to zero) and the first column of D _1 must be a column of l's (to satisfy the inner product of the first row of D and the first column of D ⁇ l equal 1).
  • p be a vector of integer pixel values.
  • this difference expansion transform and its inverse, provide a more general form of equations 1 and 2, and can be used in place of equations 1 and 2 in implementations of a reversible watermarking method.
  • the embedder may apply a series of reversible integer to integer transforms to the host data to produce a set of expandable values.
  • the transforms applied in series may be recursive in the sense that a reversible transform is applied to the output of the previous iteration.
  • the set of values produced by the last iteration of the transform is modified to embed auxiliary data, and then the transforms are reversed on the modified data in the reverse order of which they were applied.
  • the transforms may also be many to one in the sense that the transform takes as input a vector of length N, and produces a set of potentially expandable values of N-l or less.
  • the embedder has a set of potentially expandable values.
  • the expandable values, x are then modified (e.g., 2x + b, where b is an auxiliary data bit) to carry bits from an auxiliary bit stream.
  • the perceptual distortion is lower.
  • This approach provides a way to distribute the error associated with embedding auxiliary data over a wider number of host data elements than might be achieved by applying only one iteration of the integer to integer transform.
  • the reversible integer to integer transform can be applied repeatedly to generate a smaller set of expandable values.
  • This approach also enables the embedder to produce a set of expandable values through extra iterations of a reversible transform, where one or fewer iterations of the transform yield no or an insufficient number of expandable values.
  • u r ⁇ u 0 ,u x ,A ,u N _ x
  • the vectors in U can now be classified into three groups according to the definitions given in Section (2), above.
  • the first group, S x contains all expandable vectors whose v x ⁇ T x , v 2 ⁇ T 2 ,..., v N _ x ⁇ T N _ , where T x , T 2 ,..., T N _ X are predefined thresholds.
  • the second group, S x contains all expandable vectors whose v x ⁇ T x , v 2 ⁇ T 2 ,..., v N _ x ⁇ T N _ , where T x , T 2 ,..., T N _ X are predefined thresholds.
  • S 2 contains all changeable vectors that are not in S j .
  • the third group, S 3 contains the rest of the vectors (not changeable).
  • the location map can be 1- or 2- dimensional. For example, if vectors are formed from 2x2 adjacent pixels, the location map forms a binary image that has one-half the number of rows and one-half the number of columns as the original image. However, if a random key is used to identify the locations of the entries of each vector, then the location map is a binary stream of ones and zeros. The security key and an indexing table are needed in this case to map the zeros and ones in this stream to the actual locations in the image. Such a table is predefined and assumed to be known to both the embedder and the reader.
  • the embedding algorithm can be summarized using the following steps: 1. For every U e. ⁇ U R , U G , U B ⁇ , do the following:
  • bitstream B must be less than or equal to N - 1 times the size of the set S 4 .
  • the values of the threshold T x , T 2 ,...,T N _ X must be properly set.
  • the algorithm is not limited to RGB images. Using the RGB space in the previous discussion was merely for illustration purpose, and using the algorithm with other type of spectral images is straightforward.
  • the size of the bitstream B is less than or equal to N-l times the size of the set S 4 . This means that
  • bit-stream size 3 1
  • Equation (9), above, indicates that the size of the payload that can be embedded into a given images depends on the number of expandable vectors that can be selected for embedding and on how well their location map can be compressed. wx h With w h host image, the algorithm would generate vectors. Only a portion, a
  • wx h algorithm would generate a binary map, M , containing bits. This map can be loss-
  • Equation (10), above indicates that the algorithm is effective when N and the number of selected expandable vectors are reasonably large. In this case, it does not matter if the binary map, M , is difficult to compress (this is because its size is very small). But, when each vector is formed fromN consecutive pixels (row- or column-wise) in the image, and N is large, the number of expandable vectors may substantially decrease; consequently, the values of the thresholds 7j , T 2 ,...,T N _ X must be increased to maintain the same number of selected expandable vectors. This causes a decrease in the quality of the embedded image. Such a decrease can be ignored by many applications, since the embedding process is reversible and the original image can be obtained at any time.
  • the algorithm becomes more suitable for low signal-to-noise ratio (SNR) embedding than for high SNR embedding.
  • SNR signal-to-noise ratio
  • N must either be kept relatively small or each vector must be formed from adjacent pixels in two-dimensional area in the image.
  • Equation (11), above suggests that the ratio of selected expandable pairs, a , has to be much higher than the achievable compression ratio, ⁇ , in order for this case to be effective. Since pairs of pixels are used as vectors, the correlation of the pixels in each pair is expected to be very high in natural images. This makes the pair easier to satisfy smaller thresholds, and, hence, to produce a large portion of selected expandable pairs.
  • One approach is to apply the algorithm row-wise, then column-wise, in order to almost double the amount of data that can be embedded into the host image.
  • the payload size that can be embedded into an image and the quality of the resulting image is solely determined by the host image itself and by the value of the thresholds used.
  • N the payload size that can be embedded into an image and the quality of the resulting image.
  • an automatic data-rate controller is necessary to adjust the value of the thresholds properly and to compensate for the effect of the host image.
  • the iterative feedback system depicted in Fig. 2 can be used for this purpose.
  • Fig. 2 illustrates a control system with a feedback loop. This system attempts to minimize the distortion to the host signal for a desired payload size. A similar system may be used to maximize the payload size for a desired amount of perceptual distortion. Finally, a system that satisfies both a perceptual distortion constraint can a auxiliary data capacity constraint may be made by constructing a control system that is a function of both constraints.
  • the control system fits the error signal to a function to modify the thresholds.
  • the error signal may be the difference between the desired payload and the actual payload, or the desired perceptual quality and the actual perceptual quality.
  • the perceptual quality may be measured using a measure of distortion between the original and host signal, including, for example, using human visual system models (e.g., the Watson metric as described in USP 5,629,780, a Just Noticeable Difference Metric such as the JNDMetrix TM Technology from Sarnoff Corp.
  • the perceptual model can be used to generate a mask that controls the amount of or sets a threshold for changes to values of the host data set. This mask can be computed as a function of the host data set alone, or as a function of the host data set and the host data set with auxiliary data embedded.
  • the perceptual model can be applied to measure the perceptual quality of the embedded data set relative to a reference data set (such as the previous embedded version or the original host data).
  • the perceptual model can also provide a mask for controlling the amount of changes to the host data set or value representing quality of the embedded data set for use in the control system.
  • T(n) [T x (n),T 2 ( ⁇ ),A T N _ X (n)] is the thresholds vector at the n* iteration, and C is the desired payload length
  • the following proportional feedback controller can be used: where 0 ⁇ ⁇ ⁇ 1 is a constant that controls the speed of convergence.
  • _T(0) is a pre-set value that reflects the relative weights between the entities of the vector used in the difference expansion transform.
  • An alternative feedback controller is:
  • T'( ) T'(n - 1) - ⁇ '(Q - q)T'(n - 1) (13)
  • T'( ⁇ ) ]T x '( ),T 2 (n),A T N '_ X is the thresholds vector at the n* iteration.
  • the threshold vectors from equations (12) and (13) can be combined (e.g., through a weighting function that applies a desired preference to capacity or quality) to form a single composite threshold vector.
  • the algorithm can be applied across spectral components after it is applied independently to each color component.
  • the integer difference expansion transform becomes: R +2G+B v o - 4
  • a spatial triplet is a 1x3 or 3x1 vector formed from three consecutive pixel values in the same color component row- or column-wise, respectively.
  • the achievable embedding capacity depends on the nature of the image itself. Some images can bear more bits with lower distortion in the sense of PS ⁇ R than others. Images with a lot of low frequency contents and high correlation, like Lena and Fruits, produce more expandable triplets with lower distortion (in the PS ⁇ R sense) than high frequency images, such as Baboon, and, hence, can carry more watermark data at higher PS ⁇ R.
  • the embedded images hardly can be distinguished from the original.
  • a sharpening effect can be observed when the original and the embedded images are displayed alternatively. This effect is more noticeable at lower PS ⁇ R than at higher PS ⁇ R.
  • a spatial quad was assembled from 2x2 adjacent pixels in the same color component as shown in Fig. 4a.
  • Our experiments indicate that the achievable embedding capacity depends on the nature of the image itself.
  • the algorithm performs with Fruits and Lena much better than Baboon, and it performs slightly better with Fruits than with Lena. With Fruits, the algorithm is able to embed 867 kbits with image quality of 33.59 dB.
  • the achievable payload size for the spatial quad- based algorithm is about 300,000 bits higher than for the spatial triplets-based algorithm at the same PSNR, and the PSNR is about 5 dB higher for spatial quad-based algorithm than for spatial triplet-based algorithm at the same payload size.
  • the spatial quad-based algorithm has finer control over the payload size and the PSNR than the spatial triplet-based algorithm. For example, it was possible to produce images at PSNRs in the 38 dB to 46 dB range with spatial quad-based algorithm, but not with spatial triplet-based algorithm. This result is because 2x2 spatial quads have higher correlation than 1x3 spatial triplets and because the single location map used by the spatial quad-based algorithm is smaller than each of the two location maps used by the spatial triplet-based algorithm (one location map for each pass).
  • the quality of the embedded images is better than that obtained by the algorithm using spatial triplets. Also, the sharpening effect is less noticeable.
  • cross-color triplets and quads were formed from the RGB values of each pixel, as described above.
  • Our experiments show that the achievable payload size and the PSNR using cross-color vectors are much lower than those using spatial vectors. Hence, for a given PSNR level, we observed that it is better to use spatial vectors than cross-color vectors.
  • Our results show that the cross-color triplet-based algorithm has almost the same performance as the cross-color quad-based algorithm with all test images except Lena at PSNR grater than 30. While the cross-color triplet-based algorithm was able to embed small payloads at these higher PSNRs, the cross-color quad-based algorithm was not.
  • the cross-color triplet-based algorithm has the potential of producing more expandable vectors and a location map of less entropy than the cross-color quad-based transform. And, indeed, this was the case with the Lena image.
  • interleaving Another method for iteratively embedding multiple layers into a data set is called interleaving. This method interleaves selected pairings of data values on which to perform difference expansion.
  • first layer reversible watermarking on the horizontal pairing pattern with pixel coordinates (i,2*j-l) and (i,2*j)
  • second layer reversible watermarking on the horizontal pairing pattern (i,2*j), (i,2*j+l) [3] third layer: reversible watermarking on the vertical pairing pattern (2*i-l j), (2*ij) [4] fourth layer: reversible watermarking on the vertical pairing pattern (2*i,j), (2*i+l j)
  • This interleaving approach may be used in combination with the other multi-layer approaches discussed above.
  • the positions of the elements of the vectors selected for each layer can be overlapped and/or interleaved in a variety of ways to obtain a desired embedding capacity and/or quality level.
  • the reversible watermarking method may be implemented as a computer program that transforms a data file (or defined collection of files) into a data structure acting as storage for auxiliary data files.
  • the program transforms a host data file, or a collection of files, into a logical storage unit, e.g., one that appears as a hard disk through the interface of the program.
  • This program may be designed to store a variety of files and data types in a host image, audio, video, text or object code file.
  • the program retains perceptual quality of the audio, video, graphics or images stored in the host file to a desired level, and retains the format of the perceptual data.
  • standard applications used to view or render output from the file can still be used to view or listen to the host data, notwithstanding the presence of embedded files in the host data.
  • the host data file carries codes whose meaning is changed due to the reversible watermark embedding, such as software code or text representations like ASCII, the file can still retain its same format after embedding, yet the altered data is restored to its original, un-modif ⁇ ed form before use.
  • the reversible watermarking method typically makes the host image less compressible.
  • the extra space needed to store a host file with embedded files is, at least in part, compensated by the space savings created by carrying other files within the host image.
  • the host file may be subject to a lossy compression/decompression process to maximize its embedding capacity for the particular reversible watermarking method. Examples of such lossy compression methods include wavelet based methods such as JPEG 2000.
  • this pre-processing is designed to increase inter-pixel correlation in the image such that the inter-pixel differences are smaller, and thus, more expandable.
  • the auxiliary files to be embedded in the host image may be compressed as well before being inserted into the host image.
  • Fig. 5 is a diagram illustrating an example of a program used to transform a host image file into a storage unit.
  • the program is implemented as an executable application program 500. It also may be implemented as a plug-in module, set of modules, or library that is integrated or linked into another application program or operating system.
  • this application program resides on a computer system, which includes a processor 502, memory 504, persistent storage 506 (e.g., a hard disk), and other peripherals, such as a keyboard, cursor control device, display, printer, audio and video card, etc.
  • the application program is installed in the persistent storage, and is loaded into computer memory for execution by the processor.
  • the application program operates in conjunction with an operating system 508, which provides basic computing services such as file browsing, process scheduling, file system, input/output services, graphical user interface, etc.
  • the application program preferably operates on image files 510 in a standard format, like TIF or GIF, so that other applications can make use of the files after embedding. These image files are stored in persistent storage 506, and are loaded into memory for processing.
  • the application program includes a number of functional component modules. Some of these components manage particular types of embedded data in the host data file. Below, we describe the component and the corresponding data in the host file that it manages.
  • the primary function of the program is to implement the reversible watermark embedding, reading, and original image restoring functions.
  • the watermarking module 512 implements reversible watermarking functions. It operates in conjunction with the other code modules in the program to form an auxiliary bit stream for embedding in the host data set. It also extracts the embedded data stream, and restores the host data to its original unmodified state.
  • a formatting module 514 performs functions to prepare a host data file for embedding. These functions include: • checking the auxiliary data carrying capacity (e.g., using rate control analyzer described above),
  • the partitioning enables the program to provide a form of randomly accessible storage locations within the host data set corresponding to regions in the host. Also, or alternatively, it enables localized control of embedding capacity and perceptual quality constraints, region by region.
  • This partitioning enables the different partitions to be formatted as different logical storage units or "folders" for entirely separate, and independently embedded auxiliary bit streams.
  • Each partition can store different file or files and be accessed randomly and independently via different access control, such as different passwords and/or biometric data used to generate a key for decoding a reversible watermark from the particular partition that it pertains to.
  • the last level embedded (also the first decoded) can be used to store the information on variable partitioning, enabling the program to extract the location of the partitions from the embedded reversible watermark layer, and then randomly access information from each partition.
  • the partitioning is fixed, either by using fixed patterns for partitioning the host data, or by using host data features that are expected to remain fixed, then the partitioning information need not be embedded.
  • Lossy and lossless compression utilities may also be included or may be provided separately to compress data files before embedding them in the host data file.
  • the formatting module also provides file system functions for managing the embedded data.
  • the structure of the embedded files, including file names, sizes and location within the embedded bit stream are stored in the file structure 516. To save embedding capacity, the file structure can be implemented using delimiters in the embedded bit stream.
  • the display/editor module 518 controls display of the host signal (with or without embedded data), and other related images, such as thumbnails, overlays, etc. To display the original, unmodified host image, it invokes the reading and restoring components of the reversible watermarking module to reconstruct the original image. It also includes a graphical user interface for the program that depicts the host data in the host data file as a container for auxiliary data files stored in the reversible watermark.
  • Figs. 6-7 are diagrams illustrating an example of the graphical user interface 600.
  • the program displays this interface 600 when a user selects (e.g., double clicks) on a graphical representation of a host data file 602 stored on the computer's file system using the file browser of the operating system, or when the user selects the program using the operating system, and then selects a file open command on a host data file.
  • the program displays a view of the host image in a separate window 604 as shown in Fig. 6.
  • the program automatically provides the user with an interface 600 for viewing/changing the embedded data files, as well as a host image viewer interface 604 for viewing the host data.
  • This user interface 600 enables the user to add or remove files from the container by dragging and dropping files to and from the window.
  • the program formats them for embedding in a reversible watermark layer, or layers, depending on user's instructions and available auxiliary data capacity per layer.
  • the program invokes the watermarking module to embed the auxiliary data.
  • the program first prompts the user for applicable passwords, and then proceeds to extract at least a first layer including information about the embedded data files. It then displays them in a user interface window depicting the files stored within the host data file such as the interface 600 shown in Fig. 6. The user can select individual files in this window (e.g., with a mouse), and in response, the watermarking module extracts these files and invokes any associated functionality.
  • the program automatically gets the overlay from the embedded data (which may have been previously extracted upon file opening), superimposes it over the host image, and displays the result as shown in Fig. 7.
  • the graphical representations of the overlay files 606, 608 may be shown as simple file icons representing a generic overlay, or as thumbnail images of the specific overlay graphic in the overlay file (e.g., low resolution versions of the overlay graphic).
  • the overlay highlights a region of the host image in this example. It also has associated links (e.g., to another website or to related information) that the user may select to activate a browser and fetch the linked web page at the URL stored in the link file embedded in the host image.
  • the display component automates overlays rather than requiring the user to piece them together from disparate files stored separately.
  • an option window informs the user that the image has overlays. The user can then select the overlays, and in response, the display component superimposes them onto the display of the host image.
  • Another related feature is visible change detection, where changes made by a particular user are highlighted on the image in the region where the change occurred.
  • These change markings may be implemented as an overlay image (stored either as a compressed bitmap or vector graphic including coordinates where the changes occurred). These change markings can also be cross-referenced with tracking data described below to track who made the changes, when the changes were made, and where the changes were made.
  • Another related feature is the use of other graphical structures or image overlays to introduce interactivity or animation in the image.
  • the host image represents a business card, company brochure, product diagram, instruction manual, installation manual, or other marketing document.
  • the display component activates and superimposes the display of embedded graphics files or overlays to create animated effects, provide additional information related to parts of the document, etc.
  • Another related feature is enabling image editing.
  • This component allows the user to make changes, add text annotations or graphical markings and overlays, rotate, crop, scale or otherwise enhance the image. It works in conjunction with the watermarking module to update the host image and then embed or re-embed related files.
  • overlay data and other related graphics and change markings are stored in overlay structures 520 embedded in the host data set.
  • a tracking module 522 creates tracking data 524 representing information tracking the origin, distribution history and change history of the host data, and optionally, the history of changes to embedded data added by users of the host data. This tracking data may be separate from or combined with other embedded data in one or more embedded data files.
  • the tracking data 524 includes information identifying:
  • the tracking module also provides a graphical user interface for displaying the tracking data for authorized users.
  • the linking module 526 provides a mechanism for activating links to related data. This may be implemented using browser software to fetch files from the computer, network or Internet.
  • the links may be pointers to files, hyperlinks, URLs, etc. compatible with known object and hyper-linking software. These links are stored in linking data 528 and form part of the embedded bit stream.
  • the targets of these links may be files embedded in the image, or files stored elsewhere on the computer system or network.
  • the linking module also operates in conjunction with the display module to associate active links with highlighted regions and/or overlays in the image. For example, if the user clicks on a highlighted building portrayed in the image, the display module communicates the coordinates of the selected location to the linking module, which in turn fetches the linked information, such as a text, image or audio file providing related information for a particular semantic object within the host image. This feature enables users of the image to add links and annotations to objects of interest depicted in the host image.
  • a distribution and control module 530 manages rules associated with distribution and control of the host image. These rules are stored in distribution and control data 532 and embedded in the host image.
  • the rules define directions for distribution for the host data file. For example, they may include automated instructions for e-mail distribution of the host data file.
  • the distribution and control module reads these instructions and schedules the delivery and any appropriate follow up tasks of the host file. This may be implemented by interfacing the distribution module with available e-mail and scheduling software, such as Microsoft Outlook ® and Microsoft Exchange ®, for example.
  • the rules may also include a check list of individuals who must review the host data, which gets updated as each person on the list completes his or her review.
  • the rules may also include an auto-destruct rule that destroys the file after a predetermined event has been detected. This event may be, in part, based on a predetermined time or date as measured relative to a system clock. It may be triggered when review is complete. It also may be location or device dependent, where the image is destroyed if an attempt is made to open the file on an unauthorized system, in an unauthorized location, by an unauthorized person or application program.
  • the control information may also include rendering control information. For images, this rendering control information includes information to control printing and/or display.
  • the printing control may include a variety of instructions and parameters for controlling printing on different types of printers. Examples of the information include Page Description Language (PDL) instructions. For instance, formatting and control information typically stored in a PDF file separate from image data in the file may be embedded in the image data using the reversible watermarking application program.
  • PDL Page Description Language
  • the control information may also include instructions for embedding a robust watermark, such as described in 09/503,881 or other robust watermark, in the rendered output.
  • a robust watermark may be used to identify the source device or user that rendered the host data (e.g., for forensic tracing of the output to a particular device or user), to identify the rendered output through an object identifier persistently embedded in the rendered output, to persistently link the rendered output to metadata, including an electronic version of the host data, etc.
  • the control information may also include instructions that govern when copies of the host file can be made, as well as circumstanpes under which the host file can be transferred to another device.
  • Similar control information can be reversibly embedded in other media types like audio, video, and text.
  • the reversible watermark can carry instructions for embedding a robust text or image watermark in the rendered text document.
  • a security module 534 controls access to the host image as well as the auxiliary data embedded in it. This module operates in conjunction with other modules, such as the display and watermarking modules, to control access to the host image and embedded data. It provides an interface for determining the user's permission status, and enabling certain functions of the program, such as display, embedding and reading, based on that status.
  • the program can also be used to provide different levels of quality of the image with access to each level controlled based on the user's permission status.
  • the security module manages this access by determining the permission status, and enabling display of selected parts of the image or selected levels of quality associated with the permission status.
  • Levels of quality can be controlled by providing different levels of spatial resolution, or levels with varying amounts of perceptual distortion (e.g., distortion introduced by the reversible watermark, or some other noise source).
  • Opaque overlays, embedded in the image may be used to block or redact sensitive portions of a host image or document depending on permission level.
  • an image (or other host data set) can be recursively embedded with layers of reversible watermarks.
  • each additional reversible watermark layer is embedded in a host data set that has been previously embedded with a reversible watermark by operating on values that have been modified by previous layers.
  • the process of extracting each layer and restoring the host data set operates in reverse order of the order in which the layers were embedded.
  • An image that serves as a logical storage unit (e.g., image as disk) for files in a first watermark layer can be used as a new disk for storing additional files in a second or subsequent reversible watermark layer.
  • the files in the second layer are extracted and the image is restored to the state that it was in immediately after embedding the first layer.
  • Each layer can store different auxiliary data, enabling a variety of different features or applications.
  • the embedding of several layers in this manner can act as a method for progressively controlling the quality of the host data, where each layer progressively degrades quality such that with the extraction and restoration of the data set for each layer, the quality is improved.
  • the layers provide a method of access control for the auxiliary data.
  • Each layer can be embedded with a different key used to extract and/or de-scramble a layer.
  • the layer key to extract each layer. This enables the program to control access to the auxiliary data for each layer, as well as control access to higher quality versions of the host data, in the case where the layers are used to progressively control quality of the host data.
  • the program may include an access control table that receives user identification, such as a user password or even biometric information (such as a facial image, fingerprint, voice print, iris or retinal scan, etc.) and generates the appropriate key or keys enabling that user to decode one or more reversible watermark layers.
  • user identification such as a user password or even biometric information (such as a facial image, fingerprint, voice print, iris or retinal scan, etc.) and generates the appropriate key or keys enabling that user to decode one or more reversible watermark layers.
  • the program may also be used to detect whether the host data has been altered.
  • alteration can be detected based on the inability to perfectly restore the image, or based on comparing an embedded hash of the original image with a hash of the re-constructed image.
  • This alteration detection may be localized to regions if the host image is partitioned into separate regions.
  • compressed versions of image blocks in the host image may be embedded in other blocks, enabling tampered portions to be restored by replacing them with the compressed version.
  • the security module may also be used to manage keys used to encrypt or scramble parts of the embedded bit stream, or scramble the location of the embedded data. These keys as well as other security data, such as access permissions, may be stored in security data 536 embedded in the host data set. ,
  • a visual search module 538 is used to facilitate searching for contents of host files based on descriptive material of the host content.
  • This module provides descriptive data, such as text or descriptive graphics (e.g., icons) that describe what is depicted in the host image.
  • This descriptive data is stored in visual search data 540 embedded in the host image. It can be used to facilitate automated searching, or manual "visual" searching.
  • it is advantageous to provide efficient mechanisms for searching a large collection of host data files. This can be achieved by using the descriptive data to form a searchable index of descriptive text or images that describe contents of corresponding host data files.
  • One particular way to form the index is by creating a hierarchical structure of the descriptive data of the images in the collection based on content descriptors. These content descriptors may include names or graphical icons representing objects in the images, descriptors of regions of interest, geographic location, etc.
  • the thumbnails of the images can be displayed, along with the graphical descriptors of the file contents extracted from the embedded bit stream, enabling a user to view the search results graphically and quickly pick images that he or she is looking for.
  • the program may also be used to store parameters 542 of any robust watermarks embedded in the host data.
  • One application of robust watermarks for images is to include auxiliary embedded data in a robust watermark that survives digital to analog conversion, such as printing of the image.
  • Methods for embedding robust watermarks in images that survive print are described in 09/503,881 and 6,122,403, incorporated above. These robust watermarks survive one or more generations of printing and re-scanning, and are automatically read from . digital images scanned from printed images. This type of robust digital watermark is useful for forensic tracking to trace a printed image to a source device or user that printed the image.
  • the message carried in a robust watermark may include identifiers, such as content identifier, source identifiers, device identifiers, etc., metadata or pointers to metadata stored in a database, and instructions.
  • the robust watermark parameters include information used to remove the robust watermark in the event that the host image has not been altered. For example, these parameters may include a key or a pointer to a key stored elsewhere that is used to generate a set of difference values that may be added to the host image to perfectly remove changes due to the robust watermark. Alternatively, the parameters may include a compressed version of the actual difference values needed to perfectly restore the original image. For more information on methods to make a robust, reversible watermark, see U.S. Application 10/319,380 incorporated above.
  • the program There are a number of uses for the program, including digital asset management, security, content database searching, medical record management, promotional materials and documentation, document management, and photography.
  • Organizations with collections of documents, images and other embeddable files can use the program for tracking files.
  • the program can also be used to enhance productivity of groups that work on documents, images, etc. by providing overlay capability for graphical annotations, links to related information and analyst annotations, and the capability to embed related data into the host data itself.
  • the program enables multilevel security, controlling access to varying levels of quality of the host data set, as well as varying amounts of information embedded into or associated with the host data set via the reversible watermark.
  • the program facilitates efficient, content- based searching through a database representing a collection of images, documents, etc.
  • the program provides an effective tool for storing and managing patient records by enabling the related records to be encapsulated within a medical image file or set of images.
  • the host medical image e.g., X-ray, patient photo, CAT scan, etc.
  • the program provides access control to sensitive records stored within embedded image files.
  • the medical service provider can add annotations to the medical record that travel with the medical imagery that those annotations pertain to. These annotations can include links to information about related diseases, treatments, test data, etc.
  • Embedded overlays may be used to highlight regions of interest in a medical image, such as a tumor, broken bone, or blocked artery. Color coded overlays may be used to highlight different body parts or regions of interest.
  • Businesses can use the program to provide asset management for documents and images.
  • the above example implementation is adapted to images, and therefore, can be applied to documents rendered as images, such as PDF files or other Page Description Language files that include images.
  • reversible watermarking may be applied to text representations, such as ASCII text, for example, where the numbers representing ASCII text characters are modified to carry auxiliary data.
  • documents such as brochures, manuals, and electronic business cards can be created and made interactive using the program.
  • a host image representing a document can be reversibly embedded with links, additional information, pictures, graphical overlays, animation, etc.
  • the program opens the file and displays the document, along with selectable options for getting the embedded data or activated embedded links. Searching through collections of such documents can be facilitated using the search tools described above.
  • This feature also enables a single file to represent many different versions of a single document. At the time of rendering for display or printing, the user can select which version he or she wants to view or print. Versions of an image or document with or without changes applied, or with or without overlays can be selected and printed.
  • the program also has a number of uses in photography.
  • a photograph may serve as a host data set in which other related data is reversibly embedded and conveniently stored along with the host data.
  • the user can reversibly embed a variety of compressed files into the host photograph, including, for example, a compressed picture of photographer, as well as contact information for the photographer and metadata relating to the photograph.
  • the photographer can distribute a degraded quality image with a key to access a higher quality version of that image to authorized users.
  • the photographer can include audio tracks within the image by embedding compressed audio clips in the image.
  • Frames of video can include related information, such as accompanying audio track and audio- video track synchronization information.
  • Different language audio tracks can be distributed with movies using reversible embedding to carry multiple compressed audiofracks.
  • Audio files similarly, can include song lyrics, links to related information (fan websites) and e- commerce sites to buy related products and services.
  • the reversible watermark can be used to provide progressive levels of quality, which are accessible by removing layers of the reversible watermark.
  • Various versions of a movie, music track or image can be distributed as a single file with embedded data that controls which version to render. For example, a movie with content unsuitable for children can include embedded control flags, and even alternative scenes that are swapped into the movie depending on the age or tastes of the consumer.
  • the program and related functions may be implemented as part of another program.
  • compression utility program such as PKZip ® from PKWare, Inc.
  • the compression and security features of such a program can be combined with reversible watermarking services to create a program that implements some of the functions described above.
  • the host data file such as TIF or GIF image retains its image format, yet serves as a container for other files embedded in it using the reversible watermarking module.
  • the user interface of the program in this example, includes a window that represents the host data as a container for other files, which can be added or removed from the container by dragging and dropping the files' icons into the window. Double clicking the file icon of a host file automatically enables all of the features provided by the embedded data including:
  • GUI graphical user interface
  • GUI e.g., pop up windows for embedded links
  • the program can also be designed to expand the host file size to create additional capacity, and format the extra space in the host file to carry compressed auxiliary data.
  • This additional capacity can be provided in a manner that does not change the basic format of the host image file. For example, in an image file, the compressed data stored in the extra space may appear as a colorful region at the bottom of the image when displayed by a standard image viewer.
  • a software program and related system for placing a structure of files within host media in a host file.
  • Information, software code e.g., application programs, scripts, web pages
  • encryption keys, etc. can be covertly stored within host media files on the computer system to protect sensitive data or thwart hacking.
  • encryption keys can be discovered by a hacker within an application program file or other file by searching the binary data for key-like characteristics. This type of key discovery is more difficult or impossible if the key were stored inside a digital watermark in an image or other host media signal.
  • a hacker or virus may attach malicious code to an executable file or library. This too would be prevented if the executable were hidden inside an image or other host media signal.
  • the technology for reversibly embedding files in other files can also be very useful when the data is to be passed to remote users, either via network downloads or removable media shipments.
  • an image is to be sent along with descriptive analysis
  • the data may not be sensitive, but using this method can ensure that the data is not separated during transmission, while also providing the ease of a single file download or transfer.
  • the overlays could, in fact, be small images that replace certain portions of the host image. This technique could be used to highlight areas where a change has occurred; for example, in the case of satellite imagery, displaying before and after images for damage assessment, natural disaster, traffic flow, crop management, urban sprawl, etc.
  • the technology can be used to assist in compliance with HIPAA (and other future related acts). By hiding sensitive user data in the image, the data can be properly protected so that only appropriate data can be accessed by viewers of the data depending on their need and authorization as defined in HIPAA.
  • Data with different levels of sensitivity can be embedded in the medical image in separate layers of the reversible watermark or randomly accessible reversible watermarks, each having their own decoding keys to restrict access to particular users, devices or systems.
  • the program performs key management in the security module to control and facilitate restricted access to various parts of the embedded data.
  • the reversible watermark may be used to create animation rendered along with the host data.
  • Embedded images or movies could be automatically initiated either by an event, such as opening the image, detecting the mouse cursor has passed over the image or a particular location in the image, or some other event.
  • an event such as opening the image, detecting the mouse cursor has passed over the image or a particular location in the image, or some other event.
  • the reversible watermark application program is associated with the file such that the program is automatically launched by the operating system, and the program automatically extracts the reversible watermark, including any animation or graphic files, and displays the animation in conjunction with the display of the host data.
  • the program displays the image in the host file, and when the user passes the cursor over an item of interest in the displayed image, or selects a feature, the program launches the animation exfracted from the reversible watermark (or linked to the host file via a link embedded in the reversible watermark) that is uniquely associated with that location, feature or item in the image.
  • the animation or link to animation stored elsewhere may be extracted previously from the reversible watermark, or automatically exfracted upon an event, such as the cursor passing over or selecting an item of interest depicted in the image.
  • the reversible watermark embedder can embed auxiliary information in an object code file using reversible watermarking to alter code data values in the file.
  • One approach is to use the reversible watermarking scheme described above using difference expansion of correlated pairs of bytes, where the bytes of data being altered are not image pixel data, but bytes of code.
  • the correlation may be less than in images, leading to lesser embedding capacity.
  • the data carrying capacity need not be as great.
  • the embedded bit stream includes user or machine information for forensic tracking purposes.
  • the auxiliary bit stream can be embedded in segments of code when the program was installed.
  • some code could be embedded with a global identifier or key while other parts could be embedded with auxiliary data customized by the user.
  • This forensic tracking application applies to multimedia content distribution, where files distributed or copied by a user are tagged with that user's ID. This can be used to combat piracy in electronic file delivery and sharing systems, including peer to peer file sharing systems.
  • the embedder can use the user's public key to encrypt the watermark so that only that user's private key would allow decoding of the embedded information, restoration of the original code, and then execution of the un-modified code. While one might alternatively encrypt the code to prevent access to the original executable code, encryption does not have the benefit of being able to include auxiliary data in the software code itself.
  • the object code to be reversibly watermarked could be treated specially and loaded by an application program or operating system equipped with a detector of watermarked code fragments.
  • the program or operating system refrieves the watermark key in order to decode the watermark and restore the original un-modified code before executing it.
  • the program or operating system verifies that the payload of the watermark matches other user or machine information before enabling execution of the code.
  • the reversible embedder can also hide additional object code or software documentation within the reversible watermark of the target object code.
  • AL A tangible medium on which is stored software for transforming a host data file carrying host media data into a logical storage unit for storing auxiliary data files in a reversible watermark embedded into the host media data, the medium including: a watermarking module for modifying original values of host media data elements in the host data file to embed a reversible watermark carrying auxiliary data files, the reversible watermark enabling the host media data elements to be restored to the original values; and a user interface module for representing the host data files as a container for the auxiliary data files, and enables the adding or removing of auxiliary data files from the reversible watermark.
  • the reversible watermark includes a file structure identifying the auxiliary data files stored in the reversible watermark.
  • the medium of feature Al including: a formatting module for determining auxiliary data carrying capacity of the host media data.
  • auxiliary data files comprises an image overlay file
  • the software is operable to extract an image overlay file from the reversible watermark, and display an image overlay stored in the image overlay file superimposed on the host image.
  • A9 The medium of feature Al wherein at least one of the auxiliary data files includes one or more links to additional information related to the host media data, and the software enables the user to activate the one or more links to get additional information related to the host media data.
  • the medium of feature Al further including a tracking module for obtaining and storing tracking data in the reversible watermark indicating identifiers of individuals or devices that have received or opened the host media data file.
  • Al 1 The medium of feature Al further including a distribution confrol module for managing and storing distribution control information in the reversible watermark, the distribution control information controlling distribution of the host media data file.
  • the medium of feature Al wherein the host media data comprises an audio file, and the software transforms audio data in the file into a logical storage device for storing the auxiliary data files in the audio data.
  • the medium of feature Al 3 including a security module for controlling access to the two or more layers.
  • the medium of feature Al including software for partitioning the host media data into partitions that store randomly accessible reversible watermarks embedded in the partitions.
  • the medium of feature Al wherein the reversible watermark includes rendering control information for controlling rendering of the host media data.
  • a method of reversibly embedding forensic tracking information in a host data comprising: obtaining forensic tracking information used to track the host data to a particular device or user; modifying original values in the data file to embed a reversible watermark that carries auxiliary forensic tracking information in the host data file; wherein the reversible watermark enables the original values to be perfectly restored by extracting the reversible watermark and inverting modifications made to embed the reversible watermark.
  • A27 The method of feature A26 wherein the key comprises is one of a public - private key pair.
  • auxiliary data encoding processes may be implemented in a programmable computer or a special purpose digital circuit.
  • auxiliary data decoding may be implemented in software, firmware, hardware, or combinations of software, firmware and hardware.
  • the methods and processes described above may be implemented in programs executed from a system's memory (a computer readable medium, such as an electronic, optical or magnetic storage device).

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Acoustics & Sound (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • Editing Of Facsimile Originals (AREA)
  • Image Processing (AREA)

Abstract

L'invention concerne des procédés de tatouage réversibles permettant à des données auxiliaires d'être incorporées dans des ensembles de données, tels que des images, de l'audio, du vidéo et des logiciels. La nature réversible du procédé permet aux ensembles de données d'origine d'être parfaitement à nouveau stockés. Des systèmes de contrôle à boucles d'asservissement sont utilisés pour optimiser l'incorporation reposant sur une distorsion ou des contraintes de capacité de données auxiliaires. Le tatouage peut être appliqué de manière récursive pour incorporer plusieurs couches, lesdites couches subséquentes étant incorporées dans un ensemble de données tatoué antérieurement. Pour récupérer les données d'origine, chaque couche est extraite et les données sont à nouveau stockées dans un ordre inverse d'incorporation. Des ensembles d'éléments qui sont étendus pour transporter des données auxiliaires dans chaque couche se superposent ou sont entrelacés pour maximiser la capacité ou la qualité d'incorporation des données hôtes. Un programme de tatouage réversible permet de transformer un fichier de données hôtes en une unité de stockage logique pour fichiers de données auxiliaires par incorporation des fichiers auxiliaires dans les données stockées dans le fichier de données hôtes. Le tatouage réversible permet de modifier des données hôtes, telles qu'une image, de l'audio, du vidéo ou un code de logiciel pour transporter des données auxiliaires. En matière de contenu perceptuel, tel que des supports visuels ou audio, le tatouage réversible peut maintenir un niveau souhaité de qualité perceptuelle, pour ce faire les données auxiliaires sont efficacement cachées dans les données hôtes. Ledit tatouage réversible permet aux données hôtes d'origine d'être restaurées avant les modifications provoquées par l'incorporation.
PCT/US2004/014161 2003-05-08 2004-05-07 Tatouage numerique reversible et applications associees Ceased WO2004102464A2 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US10/435,517 2003-05-08
US10/435,517 US7006662B2 (en) 2001-12-13 2003-05-08 Reversible watermarking using expansion, rate control and iterative embedding
US10/435,612 US8059815B2 (en) 2001-12-13 2003-05-08 Transforming data files into logical storage units for auxiliary data through reversible watermarks
US10/435,612 2003-05-08

Publications (2)

Publication Number Publication Date
WO2004102464A2 true WO2004102464A2 (fr) 2004-11-25
WO2004102464A3 WO2004102464A3 (fr) 2006-03-09

Family

ID=33456559

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2004/014161 Ceased WO2004102464A2 (fr) 2003-05-08 2004-05-07 Tatouage numerique reversible et applications associees

Country Status (1)

Country Link
WO (1) WO2004102464A2 (fr)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009057942A3 (fr) * 2007-10-29 2009-07-30 Ji-Yeon Song Appareil pour la création de messages
WO2009101491A3 (fr) * 2007-12-28 2009-12-30 France Telecom Système et procédé de codage extensible
US20170116996A1 (en) * 2014-04-02 2017-04-27 Peter Graham Craven Transparent lossless audio watermarking
CN108805788A (zh) * 2018-05-22 2018-11-13 南开大学 基于图像拓扑结构的可逆水印方法
CN109671010A (zh) * 2018-11-02 2019-04-23 中山大学 一种基于多个二维直方图修改的可逆信息隐藏及提取方法
CN114140308A (zh) * 2021-11-30 2022-03-04 南开大学 基于可逆神经网络的图像盲水印方法
US11847193B2 (en) 2020-10-22 2023-12-19 Microsoft Technology Licensing, Llc Data provenance tracking service
WO2024137146A1 (fr) 2022-12-23 2024-06-27 Digimarc Corporation Filigranage numérique pour liaison entre nft et contenu numérique associé

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5822432A (en) * 1996-01-17 1998-10-13 The Dice Company Method for human-assisted random key generation and application for digital watermark system
US5889868A (en) * 1996-07-02 1999-03-30 The Dice Company Optimization methods for the insertion, protection, and detection of digital watermarks in digitized data
US5825892A (en) * 1996-10-28 1998-10-20 International Business Machines Corporation Protecting images with an image watermark
KR100323441B1 (ko) * 1997-08-20 2002-06-20 윤종용 엠펙2동화상부호화/복호화시스템
US6208745B1 (en) * 1997-12-30 2001-03-27 Sarnoff Corporation Method and apparatus for imbedding a watermark into a bitstream representation of a digital image sequence
US6278791B1 (en) * 1998-05-07 2001-08-21 Eastman Kodak Company Lossless recovery of an original image containing embedded data
FR2794600B1 (fr) * 1999-06-01 2001-08-17 Thomson Multimedia Sa Systeme de tatouage de donnees utilisant de nouvelles methodes d'insertion et de detection de tatouage
US6456726B1 (en) * 1999-10-26 2002-09-24 Matsushita Electric Industrial Co., Ltd. Methods and apparatus for multi-layer data hiding
US7047187B2 (en) * 2002-02-27 2006-05-16 Matsushita Electric Industrial Co., Ltd. Method and apparatus for audio error concealment using data hiding

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2009057942A3 (fr) * 2007-10-29 2009-07-30 Ji-Yeon Song Appareil pour la création de messages
US8161672B2 (en) 2007-10-29 2012-04-24 Ji-Yeon Song Apparatus of generating messages
WO2009101491A3 (fr) * 2007-12-28 2009-12-30 France Telecom Système et procédé de codage extensible
US20170116996A1 (en) * 2014-04-02 2017-04-27 Peter Graham Craven Transparent lossless audio watermarking
US9940940B2 (en) * 2014-04-02 2018-04-10 Peter Graham Craven Transparent lossless audio watermarking
CN108805788A (zh) * 2018-05-22 2018-11-13 南开大学 基于图像拓扑结构的可逆水印方法
CN108805788B (zh) * 2018-05-22 2022-04-26 南开大学 基于图像拓扑结构的可逆水印方法
CN109671010A (zh) * 2018-11-02 2019-04-23 中山大学 一种基于多个二维直方图修改的可逆信息隐藏及提取方法
US11847193B2 (en) 2020-10-22 2023-12-19 Microsoft Technology Licensing, Llc Data provenance tracking service
CN114140308A (zh) * 2021-11-30 2022-03-04 南开大学 基于可逆神经网络的图像盲水印方法
WO2024137146A1 (fr) 2022-12-23 2024-06-27 Digimarc Corporation Filigranage numérique pour liaison entre nft et contenu numérique associé

Also Published As

Publication number Publication date
WO2004102464A3 (fr) 2006-03-09

Similar Documents

Publication Publication Date Title
US8059815B2 (en) Transforming data files into logical storage units for auxiliary data through reversible watermarks
Rakhmawati et al. A recent survey of self-embedding fragile watermarking scheme for image authentication with recovery capability
US8355525B2 (en) Parallel processing of digital watermarking operations
WO2003079606A1 (fr) Systeme de gestion d'image et emploi de filigranes numeriques
Cetin et al. A new steganography algorithm based on color histograms for data embedding into raw video streams
Coatrieux et al. A low distorsion and reversible watermark: application to angiographic images of the retina
Nejati et al. Fragile watermarking based on QR decomposition and Fourier transform
WO2004102464A2 (fr) Tatouage numerique reversible et applications associees
Ramyashree et al. Optimal information hiding: advanced bitstream‐based watermarking for secure and efficient integration of image data in digital videos
Vybornova A new watermarking method for video authentication with tamper localization
Jambhale et al. A deep learning approach to invisible watermarking for copyright protection
Ling et al. Watermarking for image authentication
Memon et al. Reversible watermarking method based on adaptive thresholding and companding technique
US8332646B1 (en) On-demand watermarking of content
Storck A new approach to integrity of digital images
Yasmeen et al. An efficient image steganography approach based on QR factorization and singular value decomposition in non‐subsampled contourlet transform domain
Arab et al. VW16E: a robust video watermarking technique using simulated blocks
El Salam et al. Reversible data-hiding exploiting huffman encoding in dual image using weighted matrix and generalized exploiting modification direction (GEMD)
CA2374323C (fr) Procede de faconnage en filigrane d'une image numerique
US7047410B1 (en) Digital image watermarking method
Sinha Secure embedded data schemes for user adaptive multimedia presentation
Bhattacharyya et al. Handwritten signature authentication scheme using integrated statistical analysis of bi-color images
Jana et al. Voronoi Diagrams Based Digital Tattoo for Multimedia Data Protection
Qian et al. Reversible Data Hiding Based on Improved ISPs and Hierarchical Embedding for Remote Sensing Images
Sahoo et al. Hiding Secret Information in Movie Clip: A Steganographic Approach

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase