The computational cost of embedding information in a digital representation is reduced by making a set of at least two copies of the digital representation and altering subdivisions of the copies so that corresponding subdivisions in the copies are distinguishable from each other. The subdivisions may be arbitrary or may be functional subdivisions of the digital representation. The subdivisions may be distinguishable by features such as watermarks that do not affect the way in which the digital representation is normally used. The marked copy in which the information is embedded is then made by selecting a given subdivision in the marked copy from one of the set of copies. Selection may be done using a selection string that has an element for each subdivision. The value of the element indicates which of the set of digital representations the subdivision corresponding to the element is to be selected from. The result of this procedure is a sequence of distinguishable subdivisions in the marked copy, and the sequence carries the embedded information. Each marked copy may have a unique sequence, in which case the sequence functions as a fingerprint for the copy. The sequence may also encode information. Examples are an identification of the recipient of the copy, information about the transaction that resulted in the copy being made, or encoded information about the content of the marked copy.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method for use in a watermarking device comprising: making a plurality of versions of a digital representation in said watermarking device, each of the versions having a plurality of corresponding subdivisions, the subdivisions in a given version being distinguishable from the corresponding subdivisions in each of the other versions by prewatermarking the subdivisions of the given version with a digital watermark; selecting the prewatermarked subdivisions from the given version according to a selection string, the selection string having a plurality of elements, each of the elements corresponding to a different prewatermarked subdivision, and each element's value specifying the given version; and assembling a marked copy from the selected prewatermarked subdivisions of the given version according to the selection string, whereby the marked copy's watermark is the sequence of prewatermarked subdivisions of the given version.
2. The method set forth in claim 1 wherein: the subdivisions are made distinguishable in a way which does not affect the manner in which the digital representation is normally used.
3. The method set forth in claim 1 wherein: the subdivisions are made further distinguishable by means of distinguishable headers associated therewith.
4. The method set forth in claim 1 wherein: the subdivisions are made further distinguishable by encoding the subdivisions such that they are distinguishable.
5. The method set forth in claim 1 wherein: the subdivisions are made distinguishable such that encoding and/or compression of the digital representation does not render the subdivisions indistinguishable.
6. The method set forth in claim 1 , wherein: the sequence of subdivisions encodes information about the marked copy.
7. The method set forth in claim 6 wherein: the encoded information concerns a transaction involving the marked copy.
8. The method set forth in claim 6 wherein: the encoded information renders the marked copy traceable.
9. The method set forth in claim 6 wherein: the encoded information is encoded from information that is contained in the marked copy.
10. The method set forth in claim 1 wherein: a plurality of marked copies are assembled in assembling a marked copy from the plurality of versions; and the sequences of prewatermarked subdivisions identify subsets of the plurality of marked copies.
11. The method set forth in claim 1 wherein: a plurality of marked copies are assembled in assembling a marked copy from the plurality of versions; and each of the plurality of marked copies has a unique sequence of prewatermarked subdivisions.
12. The method set forth in claim 11 wherein: the unique sequence of prewatermarked subdivisions further encodes information about the marked copy.
13. The method set forth in claim 1 wherein: a plurality of marked copies are assembled in assembling the marked copy from the plurality of versions; and the sequences of prewatermarked subdivisions in the marked copies function as anti-collusion units.
14. The method set forth in claim 1 wherein: a plurality of marked copies are assembled in the step of assembling the marked copy from the plurality of versions; and there are sufficient versions and sufficient prewatermarked subdivisions in the versions that the sequence of prewatermarked subdivisions specified by the selection string for each marked copy may be unique to the marked copy.
15. The method set forth in claim 1 further comprising the step of: transferring the assembled marked copy to a client.
16. The method set forth in claim 15 further comprising the step of: verifying that the client may receive the marked copy, assembling being performed only if the verifying is successful.
17. The method set forth in claim 1 further comprising the step of: transferring the digital representation to a client; and making a plurality of versions and assembling the marked copy are performed in the client.
18. The method set forth in claim 1 further comprising the step of: transferring the plurality of versions to a client; and the step of assembling the marked copy is performed at the client.
19. The method set forth in claim 1 wherein: the elements' order in the selection string corresponds to the prewatermarked subdivisions' order in the versions of the digital representation and to the selected prewatermarked subdivisions' order in the marked copy.
20. The method set forth in claim 1 wherein: the digital representation comprises 3 versions, ‘n’ represents the number of prewatermarked subdivisions, and a total number of watermarks is equal to 3 n .
21. The method set forth in claim 1 wherein: a subdivision comprises a frame.
22. The method set forth in claim 1 wherein: a subdivision comprises a group of frames where N is greater than 1.
23. The method set forth in claim 13 wherein: an anti-collusion unit comprises one embedded binary digit value and a plurality of embedded binary digits of the other binary digit value.
24. The method set forth in claim 1 wherein: a server provides the given version of prewatermarked subdivisions to a client, the client assembling the marked copy.
25. A method for use in a watermarking device comprising: making a plurality of versions of a digital representation in said watermarking device, each of the versions having a plurality of corresponding subdivisions, the subdivisions in a given version being distinguishable from the corresponding subdivisions in each of the other versions by encoding the subdivisions such that they are distinguishable, selecting the distinguishably encoded subdivisions from the given version according to a selection string, the selection string having a plurality of elements, each of the elements corresponding to a different distinguishably encoded subdivision, and each element's value specifying the given version; and assembling a marked copy from the selected distinguishably encoded subdivisions of the given version according to the selection string, whereby the marked copy's watermark is the sequence of distinguishably encoded subdivisions of the given version.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
March 17, 2003
June 30, 2009
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.