US6442283B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multimedia data embedding
Assignee: Digimarc Corp
•
Filing: 1999-01-11
•
Granted: 2002-08-27
•
Expires: 2019-01-11
Abstract
Abstract Multimedia data embedding, such as video, image or audio data watermarking. In one embodiment, a computer-implemented method first receives a vector x of N data samples, where X=[x(0)x(1) . . . x(N-1)] and represents multimedia. Next, the method receives a vector p, where P=[p(0)p(1) . . . p(N-1)] and represents a pseudo-random sequence. Finally, the method generates a new vector x' in which the vector p is embedded in the vector x, such that x'=[x'(0)x'(1) . . . x'(N-1)] and x'=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p.
Inventors
- 👤 Ahmed Tewfik
- 👤 Mitchell D. Swanson
- 👤 Bin Zhu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:27
CPC Classifications
G; G06; G06T; G06T1/00; G06T1/0021; G06T1/0028; G06T1/005; G06T2201/00; G06T2201/005; G06T2201/0052; G06T2201/0065; G06T2201/0202; G10; G10L; G10L19/00; G10L19/018
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
158 words
A computer-implemented method comprising: receiving a vector x of N data samples, where x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia; receiving a vector p, where p=[p( 0 )p( 1 ) . . . p(N−b 1 )] and represents a pseudo-random sequence; and, generating a new vector x′ in which the vector p is embedded in the vector x, such that x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x +aq where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; wherein q=p*w, where w represents a weighting function, and wherein w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and f, represents a frequency and N represents a length.
Claim 2
Dependent Claim
158 words
A computer-implemented method comprising: receiving a vector x of N data samples, where x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia; receiving a vector p, where p=[p( 0 )p( 1 ) . . . p(N−b 1 )] and represents a pseudo-random sequence; and, generating a new vector x′ in which the vector p is embedded in the vector x, such that x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x +aq where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; wherein q=p*w, where w represents a weighting function, and wherein w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and f, represents a frequency and N represents a length.
Claim 3
Dependent Claim
24 words
The computer-implemented method of claim 1 , wherein the vector x represents multimedia selected from the group essentially consisting of: audio, image, and video.
Claim 4
Dependent Claim
17 words
The computer-implemented method of claim 1 , wherein the vector p represents a cryptographically secure pseudo-random sequence.
Claim 5
Dependent Claim
37 words
The computer-implemented method of claim 1 , wherein generating the new vector x′ in which the vector p is embedded in the vector x comprises generating the new vector x′ in a discrete cosine transform (DCT) domain.
Claim 6
Dependent Claim
34 words
The computer-implemented method of claim 1 , wherein receiving the vector p comprises generating the vector p using a pseudo-random sequence generator selected from the group essentially consisting of: RSA, Rabin, Blum/Micali, and Blum/Blum/Shub.
Claim 7
Dependent Claim
230 words
A computer-implemented method comprising: receiving a vector x′ of N data samples in which a vector p is embedded in a vector x, such that x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia, p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence, x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; decoding the vector p from the vector x′, including determining 1 T ∑ i = 0 N - 1 p ( i ) x ′ ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) + aq ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) w ( i ) + a T ∑ i = 0 N - 1 p ( i ) q ( i ) w ( i ) , where w comprises a vector of weights, and T determines a quantization step.
Claim 8
Dependent Claim
230 words
A computer-implemented method comprising: receiving a vector x′ of N data samples in which a vector p is embedded in a vector x, such that x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia, p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence, x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; decoding the vector p from the vector x′, including determining 1 T ∑ i = 0 N - 1 p ( i ) x ′ ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) + aq ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) w ( i ) + a T ∑ i = 0 N - 1 p ( i ) q ( i ) w ( i ) , where w comprises a vector of weights, and T determines a quantization step.
Claim 9
Dependent Claim
24 words
The computer-implemented method of claim 6 , wherein the vector x represents multimedia selected from the group essentially consisting of: audio, image, and video.
Claim 10
Dependent Claim
58 words
The computer-implemented method of claim 6 , where w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and where f represents a frequency and N represents a length.
Claim 11
Dependent Claim
14 words
The computer-implemented method of claim 6 , wherein T depends on a weighting mechanism.
Claim 12
Independent Claim
170 words
A system to embed a key into multimedia data to generate keyed multimedia data comprising: means for receiving a vector x of N data samples, where x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia; means for receiving a vector p, where p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence; and, means for generating a new vector x′ in which the vector p is embedded in the vector x, such that x′=[x′( 0 )x′(1) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; wherein q=p*w, where w represents a weighting function, and wherein w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and f represents a frequency and N represents a length.
Claim 13
Independent Claim
170 words
A system to embed a key into multimedia data to generate keyed multimedia data comprising: means for receiving a vector x of N data samples, where x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia; means for receiving a vector p, where p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence; and, means for generating a new vector x′ in which the vector p is embedded in the vector x, such that x′=[x′( 0 )x′(1) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; wherein q=p*w, where w represents a weighting function, and wherein w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and f represents a frequency and N represents a length.
Claim 14
Independent Claim
252 words
A system to decode a key from keyed multimedia data in which the key has been embedded into multimedia data comprising: means for receiving a vector x′ of N data samples in which a vector p is embedded in a vector x, such that x=[x( 0 )x( 1 ) . . . x(N1)] and represents multimedia, p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence, x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; means for decoding the vector p from the vector x′ , including determining 1 T ∑ i = 0 N - 1 p ( i ) x ′ ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) + aq ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) w ( i ) + a T ∑ i = 0 N - 1 p ( i ) q ( i ) w ( i ) , where w comprises a vector of weights, and T determines a quantization step.
Claim 15
Independent Claim
252 words
A system to decode a key from keyed multimedia data in which the key has been embedded into multimedia data comprising: means for receiving a vector x′ of N data samples in which a vector p is embedded in a vector x, such that x=[x( 0 )x( 1 ) . . . x(N1)] and represents multimedia, p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence, x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; means for decoding the vector p from the vector x′ , including determining 1 T ∑ i = 0 N - 1 p ( i ) x ′ ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) + aq ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) w ( i ) + a T ∑ i = 0 N - 1 p ( i ) q ( i ) w ( i ) , where w comprises a vector of weights, and T determines a quantization step.
Claim 16
Dependent Claim
169 words
A computer-readable medium having processor instructions stored thereon for execution by a processor to perform a method comprising: receiving a vector x of N data samples, where x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia; receiving a vector p, where p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence; and generating a new vector x′ in which the vector p is embedded in the vector x, such that x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x +aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; wherein q=p*w, where w represents a weighting function, and wherein w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and f represents a frequency and N a length.
Claim 17
Dependent Claim
169 words
A computer-readable medium having processor instructions stored thereon for execution by a processor to perform a method comprising: receiving a vector x of N data samples, where x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia; receiving a vector p, where p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence; and generating a new vector x′ in which the vector p is embedded in the vector x, such that x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x +aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; wherein q=p*w, where w represents a weighting function, and wherein w ( i ) = 1 Nf ∑ k = - ( Nf - 1 ) / 2 ( Nf - 1 ) / 2 x ( i - k ) , and f represents a frequency and N a length.
Claim 18
Dependent Claim
244 words
A computer-readable medium having processor instructions stored thereon for execution by a processor to perform a method comprising: receiving a vector x′ of N data samples in which a vector p is embedded in a vector x, such that x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia, p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence, x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; decoding the vector p from the vector x′, including determining 1 T ∑ i = 0 N - 1 p ( i ) x ′ ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) + aq ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) w ( i ) + a T ∑ i = 0 N - 1 p ( i ) q ( i ) w ( i ) , where w comprises a vector of weights, and T determines a quantization step.
Claim 19
Dependent Claim
244 words
A computer-readable medium having processor instructions stored thereon for execution by a processor to perform a method comprising: receiving a vector x′ of N data samples in which a vector p is embedded in a vector x, such that x=[x( 0 )x( 1 ) . . . x(N−1)] and represents multimedia, p=[p( 0 )p( 1 ) . . . p(N−1)] and represents a pseudo-random sequence, x′=[x′( 0 )x′( 1 ) . . . x′(N−1)] and x′=x+aq, where a comprises a perception-based scaling factor and the vector q comprises a perceptually weighted pseudo-random sequence based on the vector p; decoding the vector p from the vector x′, including determining 1 T ∑ i = 0 N - 1 p ( i ) x ′ ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) + aq ( i ) w ( i ) = 1 T ∑ i = 0 N - 1 p ( i ) x ( i ) w ( i ) + a T ∑ i = 0 N - 1 p ( i ) q ( i ) w ( i ) , where w comprises a vector of weights, and T determines a quantization step.
References Cited (Backward Citations)
US3406344A
Cited
US3845391A
Cited
US4313197A
Cited
US4425661A
Cited
GB2196167A
Cited
US4939515A
Cited
US4943973A
Cited
US5319735A
Cited
US20010012377A1
Cited
US5649054A
Cited
US5450490A
Cited
US5404377A
Cited
US5774452A
Cited
US5613004A
Cited
US6122403A
Cited
US5822360A
Cited
US5937000A
Cited
US5930369A
Cited
US5822432A
Cited
US5905800A
Cited
US5889868A
Cited
US5933798A
Cited
US6061793A
Cited
US6282299B1
Cited
US6226387B1
Cited
US6031914A
Cited
US5848155A
Cited
US5809139A
Cited
US5915027A
Cited
US6078664A
Cited
US5940429A
Cited
WO1998053565A1
Cited
US5940135A
Cited
US5945932A
Cited
US6233347B1
Cited
US6285774B1
Cited
WO2000000969A1
Cited
WO2000022745A1
Cited
US6219634B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-08-26 | 2006-02-25 | 2006-08-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-08-26 | 2010-02-25 | 2010-08-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-08-26 | 2014-02-25 | 2014-08-27 | $7700.00 | Window Closed / Lapsed |