US6493457B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Electronic watermarking in the compressed domain utilizing perceptual coding
Assignee: AT&T Properties LLC
•
Filing: 1998-11-16
•
Granted: 2002-12-10
•
Expires: 2018-11-16
Abstract
Abstract A method and apparatus are described for inserting a watermark in the compressed domain. The watermark inserted does not require a reference. An overall watermarking system incorporating the invention combines cleartext, bitstream, and integrated watermarking. In a perceptual coder, the data enters a filterbank, where it is processed into multiple separate coefficients. A rate/distortion control module uses noise threshold information from a perceptual coder, together with bit-count information from a noiseless coder, to compute scale factors. The coefficients are multiplied by the scale factors and quantized, then noiseless coded and then output for further processing/transmission. The invention supports three embodiments for inserting a mark into the bitstream imperceptibly. It is assumed that some set of scale factor bands have been selected, into which mark data will be inserted. In one embodiment, a set of multipliers {xi=2Ni: iepsiM} is chosen. Each triple is modified by dividing the scale factor by x,i multiplying the quantized coefficients by {xi}, and adding mark data to the non-zero modified quantized coefficients. In an alternate embodiment, watermark data is represented via two characteristics of the bitstream data. A Huffinan table is selected for encoding the Scale Factor Band receiving watermark data which is not the table that would normally be used. The watermark data bit is set according to any desired scheme, and the quantized coefficients are derived using the alternate Huffinan table. In another embodiment, watermarking is integrated with quantization. The watermark is therefore difficult to remove without perceptible effects. The fact that marking data is present is again indicated by characteristics of the bitstream data. The modification factors {xi} are now all close to unity.
Inventors
- 👤 Schuyler Reynier Quackenbush
- 👤 Amy Ruth Reibman
- 👤 David Hilton Shur
- 👤 James H. Snyder
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-10 02:36
CPC Classifications
H; H04; H04N; H04N19/00; G; G06; G06T; G06T1/00; G06T1/0021; G06T1/0028; G06T1/0035; G10; G10L; G10L19/00; G10L19/018; H04N1/00; H04N1/32; H04N1/32101; H04N1/32144; H04N1/32149; H04N1/32154; H04N1/32187; H04N1/32267; H04N1/32272; H04N1/32277; H04N1/32288; H04N1/32299; H04N1/32304; H04N19/10; H04N19/134; H04N19/146; H04N19/147; H04N19/189; H04N19/19; H04N19/196; H04N19/46; H04N19/467; H04N19/48; H04N19/90; H04N21/00; H04N21/20; H04N21/23; H04N21/238; H04N21/2389; H04N21/23892; H04N21/80; H04N21/83; H04N21/835; H04N21/8358; G06T2201/00; G06T2201/005; G06T2201/0052; G06T2201/0053; G06T2201/0083; H04N1/32128; H04N2201/00; H04N2201/32; H04N2201/3201; H04N2201/3225; H04N2201/3233; H04N2201/3239; H04N2201/3269; H04N2201/327; H04N2201/328; H04N2201/3281
Claims Analysis
Total Claims: 47
Claim 1
Independent Claim
97 words
A perceptual coder for encoding at least one compressed audio or video signal to include hidden data, comprising, in combination: means for setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said means for setting step sizes employing at least one perceptual technique; means for adding the hidden data to said at least one compressed signal; means for quantizing said at least one compressed signal; and means for selecting a set of multipliers during the quantization, said adding of the hidden data occurring during the quantization.
Claim 2
Dependent Claim
97 words
A perceptual coder for encoding at least one compressed audio or video signal to include hidden data, comprising, in combination: means for setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said means for setting step sizes employing at least one perceptual technique; means for adding the hidden data to said at least one compressed signal; means for quantizing said at least one compressed signal; and means for selecting a set of multipliers during the quantization, said adding of the hidden data occurring during the quantization.
Claim 3
Dependent Claim
23 words
The coder of claim 1 , further including means for selecting a specific Huffman Table for encoding said at least one compressed signal.
Claim 4
Dependent Claim
29 words
The coder of claim 2 , wherein said selected Huffman Table is not the Huffman Table that would normally be selected for encoding said at least one compressed signal.
Claim 5
Dependent Claim
14 words
The coder of claim 1 , wherein said hidden data has a watermarking function.
Claim 6
Dependent Claim
20 words
The coder of claim 4 , wherein said hidden data has the form of at least one watermark data bit.
Claim 7
Dependent Claim
21 words
The coder of claim 1 , further including: means for modifying said encoded compressed signal by utilizing said set of multipliers.
Claim 8
Dependent Claim
18 words
The coder of claim 6 , wherein each member of said set of multipliers is close to unity.
Claim 9
Dependent Claim
54 words
The coder of claim 7 , wherein said compressed signal has at least one associated scale factor and said means for modifying comprises, in combination: means for dividing said at least one scale factor by a respective one of said multipliers; and means for multiplying said integer values by respective ones of said multipliers.
Claim 10
Dependent Claim
54 words
The coder of claim 6 , wherein said compressed signal has at least one associated scale factor and said means for modifying comprises, in combination: means for dividing said at least one scale factor by a respective one of said multipliers; and means for multiplying said integer values by respective ones of said multipliers.
Claim 11
Dependent Claim
25 words
The coder of claim 1 wherein said means for adding hidden data is responsive to said means for quantizing said at least one compressed signal.
Claim 12
Dependent Claim
102 words
A perceptual coder for encoding at least one of compressed audio or video signal to include hidden data, comprising, in combination: means for setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said means for setting step sizes employing at least one perceptual technique; means for quantizing said at least one compressed signal containing said hidden data; noiseless coding means for adding the hidden data to said quantized compressed signals; and means for selecting a set of multipliers during the quantization, said adding of the hidden data occurring during the quantization.
Claim 13
Dependent Claim
102 words
A perceptual coder for encoding at least one of compressed audio or video signal to include hidden data, comprising, in combination: means for setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said means for setting step sizes employing at least one perceptual technique; means for quantizing said at least one compressed signal containing said hidden data; noiseless coding means for adding the hidden data to said quantized compressed signals; and means for selecting a set of multipliers during the quantization, said adding of the hidden data occurring during the quantization.
Claim 14
Dependent Claim
14 words
The coder of claim 11 , wherein said hidden data has a watermarking function.
Claim 15
Dependent Claim
22 words
The coder of claim 12 , wherein said hidden data is added to at least one non-zero one of said integer values.
Claim 16
Dependent Claim
21 words
The coder of claim 11 , further including: means for modifying said encoded compressed signal by utilizing said set of multipliers.
Claim 17
Dependent Claim
54 words
The coder of claim 14 , wherein said compressed signal has at least one associated scale factor and said means for modifying comprises, in combination: means for dividing said at least one scale factor by a respective one of said multipliers; and means for multiplying said integer values by respective ones of said multipliers.
Claim 18
Dependent Claim
38 words
The coder of claim 14 wherein each member, x, of said set of multipliers is equal to 2 Ni , where N is a positive integer and i represents a set of indices associated with said compressed signal.
Claim 19
Dependent Claim
54 words
The coder of claim 16 , wherein said compressed signal has at least one associated scale factor and said means for modifying comprises, in combination: means for dividing said at least one scale factor by a respective one of said multipliers; and means for multiplying said integer values by respective ones of said multipliers.
Claim 20
Independent Claim
91 words
A method of perceptually encoding at least one compressed audio or video signals to include hidden data comprising, in combination, the steps of: setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said setting of step sizes employing at least one perceptual technique; adding the hidden data to said at least one compressed signal; quantizing said at least one compressed signal; and selecting a set of multipliers during the quantization, said adding of the hidden data occurring during the quantization.
Claim 21
Independent Claim
91 words
A method of perceptually encoding at least one compressed audio or video signals to include hidden data comprising, in combination, the steps of: setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said setting of step sizes employing at least one perceptual technique; adding the hidden data to said at least one compressed signal; quantizing said at least one compressed signal; and selecting a set of multipliers during the quantization, said adding of the hidden data occurring during the quantization.
Claim 22
Dependent Claim
24 words
The method of claim 18 , further including the step of selecting a specific Huffman Table for encoding said at least one compressed signal.
Claim 23
Dependent Claim
29 words
The method of claim 19 , wherein said selected Huffman Table is not the Huffman Table that would normally be selected for encoding said at least one compressed signal.
Claim 24
Dependent Claim
14 words
The method of claim 18 , wherein said hidden data has a watermarking function.
Claim 25
Dependent Claim
20 words
The method of claim 21 , wherein said hidden data has the form of at least one watermark data bit.
Claim 26
Dependent Claim
19 words
The method of claim 18 , further including: modifying said encoded compressed signal by utilizing said set of multipliers.
Claim 27
Dependent Claim
18 words
The method of claim 23 , wherein each member of said set of multipliers is close to unity.
Claim 28
Dependent Claim
52 words
The method of claim 24 , wherein said compressed signal has at least one associated scale factor and step of modifying comprises the steps, in combination, of: dividing said at least one scale factor by a respective one of said multipliers; and multiplying said integer values by respective ones of said multipliers.
Claim 29
Dependent Claim
53 words
The method of claim 23 , wherein said compressed signal has at least one associated scale factor and said step of modifying comprises the steps, in combination, of: dividing said at least one scale factor by a respective one of said multipliers; and multiplying said integer values by respective ones of said multipliers.
Claim 30
Dependent Claim
25 words
The method of claim 18 , further including the step of marking said at least one audio or video signal with hidden data before compression.
Claim 31
Dependent Claim
20 words
The method of claim 18 , further including the step of bitstream marking said quantized compressed signal with hidden data.
Claim 32
Dependent Claim
25 words
The method of claim 28 , further including the step of marking said at least one audio or video signal with hidden data before compression.
Claim 33
Dependent Claim
25 words
The method of claim 18 wherein said step of adding hidden data occurs simultaneously with said step of quantizing said at least one compressed signal.
Claim 34
Dependent Claim
24 words
The method of claim 18 wherein said step of adding hidden data occurs after said step of quantizing said at least one compressed signal.
Claim 35
Independent Claim
92 words
A method of perceptually encoding at least one compressed audio or video signal to include hidden data comprising, in combination, the steps of: setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said setting of step sizes employing at least one perceptual technique; quantizing said at least one compressed signal containing said hidden data; adding the hidden data to said quantized compressed signal; and selecting a set of multipliers during the quantization, said adding of the hidden data occurring during quantization.
Claim 36
Independent Claim
92 words
A method of perceptually encoding at least one compressed audio or video signal to include hidden data comprising, in combination, the steps of: setting quantization step sizes to obtain a set of integer values after quantization of said at least one compressed signal, said setting of step sizes employing at least one perceptual technique; quantizing said at least one compressed signal containing said hidden data; adding the hidden data to said quantized compressed signal; and selecting a set of multipliers during the quantization, said adding of the hidden data occurring during quantization.
Claim 37
Dependent Claim
14 words
The method of claim 32 , wherein said hidden data has a watermarking function.
Claim 38
Dependent Claim
22 words
The method of claim 33 , wherein said hidden data is added to at least one non-zero one of said integer values.
Claim 39
Dependent Claim
19 words
The method of claim 32 , further including: modifying said encoded compressed signal by utilizing said set of multipliers.
Claim 40
Dependent Claim
50 words
The coder of claim 35 , wherein said compressed signal has at least one associated scale factor and said step of modifying comprises, in combination: dividing said at least one scale factor by a respective one of said multipliers; and multiplying said integer values by respective ones of said multipliers.
Claim 41
Dependent Claim
39 words
The method of claim 35 , wherein each member, x, of said set of multipliers is equal to 2 Ni , where N is a positive integer and i represents a set of indices associated with said compressed signal.
Claim 42
Dependent Claim
50 words
The method of claim 37 , wherein said compressed signal has at least one associated scale factor and said step of modifying comprises, in combination: dividing said at least one scale factor by a respective one of said multipliers; and multiplying said integer values by respective ones of said multipliers.
Claim 43
Dependent Claim
25 words
The method of claim 32 , further including the step of marking said at least one audio or video signal with hidden data before compression.
Claim 44
Dependent Claim
20 words
The method of claim 32 , further including the step of bitstream marking said quantized compressed signal with hidden data.
Claim 45
Dependent Claim
25 words
The method of claim 40 , further including the step of marking said at least one audio or video signal with hidden data before compression.
Claim 46
Independent Claim
57 words
A method of perceptually coding as signal to add watermark data using a codebook characterized by the steps of: establishing scale factors from perceptual thresholds; establishing scale factor bands to watermark; choosing a set of multipliers approximately equal to 1; and dividing the scale factors by respective multipliers of said set of multipliers for selecting said codebook.
Claim 47
Independent Claim
57 words
A method of perceptually coding as signal to add watermark data using a codebook characterized by the steps of: establishing scale factors from perceptual thresholds; establishing scale factor bands to watermark; choosing a set of multipliers approximately equal to 1; and dividing the scale factors by respective multipliers of said set of multipliers for selecting said codebook.
References Cited (Backward Citations)
US4939515A
Cited
EP0663773A2
Cited
EP0705025A2
Cited
US5530759A
Cited
US5778102A
Cited
US5930369A
Cited
US6061793A
Cited
US6282299B1
Cited
EP0851679A2
Cited
US6298142B1
Cited
US6310962B1
Cited
US6285774B1
Cited
US6285775B1
Cited
US6209094B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-12-09 | 2006-06-10 | 2006-12-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-12-09 | 2010-06-10 | 2010-12-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-12-09 | 2014-06-10 | 2014-12-10 | $7700.00 | Window Closed / Lapsed |