Source: https://patents.justia.com/patent/8787615
Timestamp: 2019-05-19 15:11:09
Document Index: 454018716

Matched Legal Cases: ['Application No. 60', 'Application No. 60', 'Application No. 2', 'Application No. 2', 'Application No. 2', 'Application No. 04776572', 'Application No. 04776572', 'Application No. 05780308', 'Application No. 05780308', 'Application No. 05780308', 'Application No. 05780308', 'Application No. 2004258470', 'Application No. 2004258470', 'Application No. 2010200873', 'Application No. 2010200873', 'Application No. 2005270105', 'Application No. 2005270105', 'Application No. 2011203047', 'Application No. 2011203047', 'Application No. 200480020200', 'Application No. 200480020200', 'Application No. 201010501205', 'Application No. 201010501205', 'Application No. 201010501205', 'Application No. 200580026107', 'Application No. 200580026107', 'Application No. 200580026107', 'Application No. 93117000', 'Application No. 93117000', 'Application No. 07844106', 'Application No. 2012261653', 'Application No. 2', 'Application No. 465', 'Application No. 07844106', 'Application No. 201110460586']

US Patent for Methods and apparatus for embedding watermarks Patent (Patent # 8,787,615 issued July 22, 2014) - Justia Patents Search
Justia Patents ApplicationsUS Patent for Methods and apparatus for embedding watermarks Patent (Patent # 8,787,615)
Dec 7, 2012 - The Nielsen Company (US), LLC
Methods and apparatus for embedding a watermark are disclosed. An example method disclosed herein to embed a watermark in a compressed data stream comprises obtaining a set of transform coefficients included in the compressed data stream, the set of transform coefficients having a respective first set of mantissa codes and a respective set of exponents, the first set of mantissa codes associated with a respective set of mantissa step sizes, identifying a first transform coefficient from the set of transform coefficients having a smallest magnitude among the set of transform coefficients, determining a second set of mantissa codes based on the first transform coefficient and the set of step sizes, and replacing the first set of mantissa codes included in the compressed data stream with the second set of mantissa codes to embed the watermark without uncompressing the compressed data stream.
Systems, methods, and apparatus to identify media devices
Methods and apparatus to calibrate audience measurement ratings based on return path data
Obtaining viewer demographics through advertisement selections
This patent arises from a continuation of U.S. application Ser. No. 13/283,271 filed on Oct. 27, 2011, which is a continuation of U.S. application Ser. No. 12/613,334 filed on Nov. 5, 2009 (now U.S. Pat. No. 8,085,975), which is a continuation of U.S. application Ser. No. 12/269,733 filed on Nov. 12, 2008 (now U.S. Pat. No. 7,643,652), which is a continuation of U.S. application Ser. No. 11/298,040 filed on Dec. 9, 2005 (now U.S. Pat. No. 7,460,684), which is a continuation of PCT Application Serial No. PCT/US2004/018953 filed Jun. 14, 2004, which claims the benefit of the filing date of U.S. Provisional Application No. 60/478,626, filed Jun. 13, 2003, and the benefit of U.S. Provisional Application No. 60/571,258, filed May 14, 2004, the disclosures of which are hereby incorporated herein by reference in their entireties.
As described in detail in the AC-3 compression standard, the compression information also includes a mantissa and an exponent associated with each MDCT coefficient. The AC-3 compression standard employs techniques to reduce the number of bits used to represent each MDCT coefficient. Psycho-acoustic masking is one factor that may be utilized by these techniques. For example, the presence of audio energy Ek either at a particular frequency k (e.g., a tone) or spread across a band of frequencies proximate to the particular frequency k (e.g., a noise-like characteristic) creates a masking effect. That is, the human ear is unable to perceive a change in energy in a spectral region either at a frequency k or spread across the band of frequencies proximate to the frequency k if that change is less than a given energy threshold ΔEk. Because of this characteristic of the human ear, an MDCT coefficient mk associated with the frequency k may be quantized with a step size related to ΔEk without risk of causing any humanly perceptible changes to the audio content. For the AC-3 data stream 240, each MDCT coefficient mk is represented as a mantissa Mk and an exponent Xk such that mk=Mk·2−Xk. The number of bits used to represent the mantissa Mk of each MDCT coefficient of the MDCT coefficient sets 520 may be determined based on known quantization look-up tables published in the AC-3 compression standard (e.g., the quantization look-up table 600 of FIG. 6). In the example of FIG. 6, the quantization look-up table 600 provides mantissa codes or bit patterns and corresponding mantissa values for MDCT coefficients represented by a four-bit number. As described in detail below, the mantissa Mk may be changed (e.g., augmented) to represent a modified value of an MDCT coefficient to embed a watermark in the AC-3 data stream 240.
The modification unit 430 is also configured to insert the watermark 230 into the reconstructed time-domain audio blocks 540 to generate watermarked time-domain audio blocks 550, shown by way of example as TA0W, TA4W, TA5W, TB0W, TB1W and TB5W (blocks TA1W, TA2W, TA3W, TB2W, TB3W and TB4W are not shown). To insert the watermark 230, the modification unit 430 generates a modifiable time-domain audio block by concatenating two adjacent reconstructed time-domain audio blocks to create a 512-sample audio block. For example, the modification unit 430 may concatenate the reconstructed time-domain audio blocks TA5R and TB0R (each being a 256-sample audio block) to form a 512-sample audio block. The modification unit 430 may then insert the watermark 230 into the 512-sample audio block formed by the reconstructed time-domain audio blocks TA5R and TB0R to generate the watermarked time-domain audio blocks TA5W and TBOW. Encoding processes such as those described in U.S. Pat. Nos. 6,272,176, 6,504,870, and 6,621,881 may be used to insert the watermark 230 into the reconstructed time-domain audio blocks 540. The disclosures of U.S. Pat. Nos. 6,272,176, 6,504,870, and 6,621,881 are hereby incorporated by reference herein in their entireties.
Implementing an encoding process such as, for example, one or more of the encoding methods and apparatus described in U.S. Pat. Nos. 6,272,176, 6,504,870, and/or 6,621,881, the modification unit 430 inserts the watermark 230 from the watermark source 220 into the modifiable time-domain audio blocks (block 1040). For example, the modification unit 430 may insert the watermark 230 into the 512-sample time-domain audio block generated using the reconstructed time-domain audio blocks TA5R and TB0R to generate the watermarked time-domain audio blocks TA5W and TB0W. Based on the watermarked time-domain audio blocks and the compression information, the modification unit 430 generates watermarked MDCT coefficient sets (block 1050). As noted above, two watermarked time-domain audio blocks, where each block includes 256 samples, may be used to generate a watermarked MDCT coefficient set. For example, the watermarked time-domain audio blocks TA5W and TBOW may be concatenated and then used to generate the watermarked MDCT coefficient set MA5W.
c 1 ⁡ ( k ) = cos ⁢ ⁢ 2 ⁢ π * 237 ⁢ k 12288
c 1 ⁢ p ⁡ ( m ) = w ⁡ ( m ) ⁢ cos ⁢ ⁢ 2 ⁢ π * 237 * ( p * 256 + m ) 12288
for m=0 through 511 and p=0 through 46, where w(m) is the window function used in the AC-3 compression described above. One having ordinary skill in the art will appreciate that the preceding equation may be used directly to compute c1p(m), or c1(k) may be pre-computed and appropriate segments extracted to generate c1p(m). In either case, the MDCT transform of c1p (m) includes a set of MDCT coefficient values (e.g., 256 real numbers). Continuing with the preceding example, for c1p(m) corresponding to symbol “0,” the MDCT coefficient values associated with the 512-sample frequency indices 9, 10, and 11 may have significant magnitudes because c1p(m) is associated with the 12,288-sample central frequency index 240, which corresponds to the 512-sample central frequency index 10. The MDCT coefficient values associated with other 512-sample frequency indices will be negligible relative to the MDCT coefficient values associated with the 512-sample frequency indices 9, 10, and 11 for the case of c1p(m). Conventionally, the MDCT coefficient values associated with c1p(m) (as well as the other sinusoidal components c2p(m), . . . , c10p(m)) are divided by a normalization factor Q as follows:
In the compressed AC-3 data stream, for example, each AC-3 frame includes MDCT coefficient sets having six MDCT coefficients (e.g., MA0, MA1, MA2, MA3, MA4, and MA5 of FIG. 5) with each MDCT coefficient corresponding to a 512-sample audio block. As described above in connection with FIGS. 5 and 6, each MDCT coefficient is represented as mk=Mk*2−Xk=(Sk*Nk)*2−Xk, where Xk is the exponent and Mk is the mantissa. The mantissa Mk is a product of a mantissa step size sk and an integer value Nk. The mantissa step size sk and the exponent Xk may be used to form a quantization step size Sk=Sk*2−Xk. Referring to the look-up table 600 of FIG. 6, for example, the mantissa step size sk is 2/15 and the integer value Nk is −2 when the original mantissa value is −0.2666 (i.e., − 4/15).
N 9 -> N 9 + - 1.5 * S 11 S 9 ⁢ ⁢ and ⁢ ⁢ N 10 -> N 10 + 4.0 * S 11 S 10 .
1. A method to embed a watermark in a compressed data stream, the method comprising:
obtaining a set of transform coefficients from the compressed data stream, the set of transform coefficients comprising a first set of mantissa codes and a first set of exponents, respective ones of the first set of mantissa codes being represented by a first number of bits;
determining a second set of mantissa codes based on the first set of mantissa codes and the watermark, respective ones of the second set of mantissa codes being represented by the same first number of bits as the respective ones of the first set of mantissa codes; and
replacing the first set of mantissa codes in the compressed data stream with the second set of mantissa codes to embed the watermark in the compressed data stream without uncompressing the compressed data stream.
2. A method as defined in claim 1, wherein the first set of exponents is unchanged in the compressed data stream after the watermark is embedded.
3. A method as defined in claim 1, wherein determining the second set of mantissa codes comprises:
modifying a first mantissa code from the first set of mantissa codes based on the watermark to determine a second mantissa code;
quantizing the second mantissa code based on the first number of bits to determine a third mantissa code; and
including the third mantissa code in the second set of mantissa codes.
4. A method as defined in claim 3, wherein quantizing the second mantissa code based on the first number of bits to determine the third mantissa code comprises setting a value of the third mantissa code to a largest value represented by the first number of bits in response to determining that a value of the second mantissa code is greater than the largest value represented by the first number of bits.
5. A method as defined in claim 3, wherein quantizing the second mantissa code based on the first number of bits to determine the third mantissa code comprises setting a value of the third mantissa code to a smallest value represented by the first number of bits in response to determining that a value of the second mantissa code is less than the smallest value represented by the first number of bits.
6. A method as defined in claim 1, further comprising determining the first number of bits from information included in the compressed data stream.
7. A computer readable storage device or storage disc comprising computer readable instructions which, when executed, cause a computer to at least:
obtain a set of transform coefficients from a compressed data stream, the set of transform coefficients comprising a first set of mantissa codes and a first set of exponents, respective ones of the first set of mantissa codes being represented by a first number of bits;
determine a second set of mantissa codes based on the first set of mantissa codes and a watermark, respective ones of the second set of mantissa codes being represented by the same first number of bits as the respective ones of the first set of mantissa codes; and
replace the first set of mantissa codes in the compressed data stream with the second set of mantissa codes to embed the watermark in the compressed data stream without uncompressing the compressed data stream.
8. A storage device or storage disc as defined in claim 7, wherein the first set of exponents is unchanged in the compressed data stream after the watermark is embedded.
9. A storage device or storage disc as defined in claim 7, wherein to determine the second set of mantissa codes, the instructions, when executed, further cause the computer to:
modify a first mantissa code from the first set of mantissa codes based on the watermark to determine a second mantissa code;
quantize the second mantissa code based on the first number of bits to determine a third mantissa code; and
include the third mantissa code in the second set of mantissa codes.
10. A storage device or storage disc as defined in claim 9, wherein to quantize the second mantissa code based on the first number of bits to determine the third mantissa code, the instructions, when executed, further cause the computer to set a value of the third mantissa code to a largest value represented by the first number of bits in response to determining that a value of the second mantissa code is greater than the largest value represented by the first number of bits.
11. A storage device or storage disc as defined in claim 9, wherein to quantize the second mantissa code based on the first number of bits to determine the third mantissa code, the instructions, when executed, further cause the computer to set a value of the third mantissa code to a smallest value represented by the first number of bits in response to determining that a value of the second mantissa code is less than the smallest value represented by the first number of bits.
12. A storage device or storage disc as defined in claim 7, wherein the instructions, when executed, further cause the computer to determine the first number of bits from information included in the compressed data stream.
13. A watermark embedding device comprising:
an unpacking unit to obtain a set of transform coefficients from a compressed data stream, the set of transform coefficients comprising a first set of mantissa codes and a first set of exponents, respective ones of the first set of mantissa codes being represented by a first number of bits; and
a modification unit to: determine a second set of mantissa codes based on the first set of mantissa codes and a watermark, respective ones of the second set of mantissa codes being represented by the same first number of bits as the respective ones of the first set of mantissa codes; and replace the first set of mantissa codes in the compressed data stream with the second set of mantissa codes to embed the watermark in the compressed data stream without uncompressing the compressed data stream.
14. A watermark embedding device as defined in claim 13, wherein the first set of exponents is unchanged in the compressed data stream after the watermark is embedded.
15. A watermark embedding device as defined in claim 13, wherein to determine the second set of mantissa codes, the modification unit is to:
16. A watermark embedding device as defined in claim 15, wherein to quantize the second mantissa code based on the first number of bits to determine the third mantissa code, the modification unit is to set a value of the third mantissa code to a largest value represented by the first number of bits in response to determining that a value of the second mantissa code is greater than the largest value represented by the first number of bits.
17. A watermark embedding device as defined in claim 15, wherein to quantize the second mantissa code based on the first number of bits to determine the third mantissa code, the modification unit is to set a value of the third mantissa code to a smallest value represented by the first number of bits in response to determining that a value of the second mantissa code is less than the smallest value represented by the first number of bits.
18. A watermark embedding device as defined in claim 13, wherein the unpacking unit is further to determine the first number of bits from information included in the compressed data stream.
4675750 June 23, 1987 Collins et al.
5349549 September 20, 1994 Tsutsui
5455630 October 3, 1995 McFarland et al.
5479299 December 26, 1995 Matsumi et al.
5490170 February 6, 1996 Akagiri et al.
5574952 November 12, 1996 Brady et al.
5621471 April 15, 1997 Kim et al.
5625418 April 29, 1997 Binder et al.
5675610 October 7, 1997 Chinen
5677980 October 14, 1997 Naoe
5727092 March 10, 1998 Sanford, II et al.
5734429 March 31, 1998 Jung
5745184 April 28, 1998 Neal
5778102 July 7, 1998 Sandford et al.
5801782 September 1, 1998 Patterson
5867819 February 2, 1999 Fukuchi et al.
6064748 May 16, 2000 Hogan
6069914 May 30, 2000 Cox
6128736 October 3, 2000 Miller
6154571 November 28, 2000 Cox et al.
6208691 March 27, 2001 Balakrishnan et al.
6208735 March 27, 2001 Cox et al.
6209094 March 27, 2001 Levine et al.
6215526 April 10, 2001 Barton et al.
6243481 June 5, 2001 Tao
6252586 June 26, 2001 Freeman et al.
6266419 July 24, 2001 Lacy et al.
6268866 July 31, 2001 Shibata
6298142 October 2, 2001 Nakano et al.
6330672 December 11, 2001 Shur
6339449 January 15, 2002 Ikeda et al.
6343181 January 29, 2002 Ikeda et al.
6345122 February 5, 2002 Yamato et al.
6370199 April 9, 2002 Bock et al.
6373960 April 16, 2002 Conover et al.
6415041 July 2, 2002 Oami et al.
6421445 July 16, 2002 Jensen et al.
6421450 July 16, 2002 Nakano
6424726 July 23, 2002 Nakano et al.
6425082 July 23, 2002 Matsui et al.
6434253 August 13, 2002 Hayashi et al.
6442283 August 27, 2002 Tewfik et al.
6442284 August 27, 2002 Gustafson et al.
6453053 September 17, 2002 Wakasu
6456724 September 24, 2002 Watanabe
6470090 October 22, 2002 Oami et al.
6493457 December 10, 2002 Quackenbush et al.
6504870 January 7, 2003 Srinivasan
6505223 January 7, 2003 Haitsma et al.
6507299 January 14, 2003 Nuijten
6510233 January 21, 2003 Nakano
6553070 April 22, 2003 Hashimoto
6584138 June 24, 2003 Neubauer et al.
6621881 September 16, 2003 Srinivasan
6665419 December 16, 2003 Oami
6668068 December 23, 2003 Hashimoto
6683996 January 27, 2004 Walmsley
6687663 February 3, 2004 McGrath et al.
6697499 February 24, 2004 Oami
6700993 March 2, 2004 Minematsu
6721439 April 13, 2004 Levy et al.
6724911 April 20, 2004 Cox et al.
6735325 May 11, 2004 Wakasu
6738744 May 18, 2004 Kirovski et al.
6751337 June 15, 2004 Tewfik et al.
6775416 August 10, 2004 Hashimoto
6785399 August 31, 2004 Fujihara
6798893 September 28, 2004 Tanaka
6807528 October 19, 2004 Truman et al.
6826289 November 30, 2004 Hashimoto
6834345 December 21, 2004 Bloom et al.
6839674 January 4, 2005 Absar et al.
6845360 January 18, 2005 Jensen et al.
6853737 February 8, 2005 Watanabe
6856693 February 15, 2005 Miller
6891854 May 10, 2005 Zhang et al.
6901606 May 31, 2005 Wright et al.
6915000 July 5, 2005 Tanaka
6928165 August 9, 2005 Takai
6947562 September 20, 2005 Hashimoto
6947572 September 20, 2005 Terasaki
6985590 January 10, 2006 Tachibana et al.
6996249 February 7, 2006 Miller et al.
7006631 February 28, 2006 Luttrell et al.
7006660 February 28, 2006 Hayashi
7007167 February 28, 2006 Kurahashi
7027611 April 11, 2006 Hashimoto
7047187 May 16, 2006 Cheng et al.
7050604 May 23, 2006 Fujihara et al.
7051207 May 23, 2006 Watanabe
7088844 August 8, 2006 Hannigan et al.
7092546 August 15, 2006 Tanaka
7110566 September 19, 2006 Pelly et al.
7114071 September 26, 2006 Chmounk et al.
7114073 September 26, 2006 Watanabe
7140037 November 21, 2006 Tsutsui et al.
7146394 December 5, 2006 Haitsma et al.
7146501 December 5, 2006 Tanaka
7149324 December 12, 2006 Tanaka
7159117 January 2, 2007 Tanaka
7181022 February 20, 2007 Rhoads
7197156 March 27, 2007 Levy
7206649 April 17, 2007 Kirovski et al.
7266697 September 4, 2007 Kirovski et al.
7269734 September 11, 2007 Johnson et al.
7643652 January 5, 2010 Srinivasan
7949147 May 24, 2011 Rhoads et al.
8085975 December 27, 2011 Srinivasan
8351645 January 8, 2013 Srinivasan
20010027393 October 4, 2001 Touimi et al.
20010053190 December 20, 2001 Srinivasan
20020006203 January 17, 2002 Tachibana et al.
20020034224 March 21, 2002 Srinivasan
20020044225 April 18, 2002 Rakib
20020085736 July 4, 2002 Kalker et al.
20020085737 July 4, 2002 Kitamura
20020087864 July 4, 2002 Depovere et al.
20020106106 August 8, 2002 Sato
20020129253 September 12, 2002 Langelaar
20020147990 October 10, 2002 Lu et al.
20030004589 January 2, 2003 Bruekers et al.
20030016756 January 23, 2003 Steenhof et al.
20030086587 May 8, 2003 Haitsma et al.
20030088400 May 8, 2003 Nishio et al.
20030123660 July 3, 2003 Fletcher et al.
20030128861 July 10, 2003 Rhoads
20030161469 August 28, 2003 Cheng et al.
20030169810 September 11, 2003 Costa
20040024588 February 5, 2004 Watson et al.
20040054525 March 18, 2004 Sekiguchi
20040059918 March 25, 2004 Xu
20040179746 September 16, 2004 Hashimoto
20040258243 December 23, 2004 Shin et al.
20040267532 December 30, 2004 Black
20040267533 December 30, 2004 Hannigan et al.
20050010944 January 13, 2005 Wright et al.
20050062843 March 24, 2005 Bowers et al.
20050144006 June 30, 2005 Oh
20060020809 January 26, 2006 Havashi
20060123443 June 8, 2006 Hamilton et al.
20060171474 August 3, 2006 Ramaswamy et al.
20060187358 August 24, 2006 Lienhart et al.
20060239500 October 26, 2006 Meyer et al.
20070036357 February 15, 2007 Van der Veen et al.
20070300066 December 27, 2007 Srinivasan
20080091288 April 17, 2008 Srinivasan
20080253440 October 16, 2008 Srinivasan et al.
20090074240 March 19, 2009 Srinivasan
20100046795 February 25, 2010 Srinivasan
20120022879 January 26, 2012 Srinivasan
20120039504 February 16, 2012 Srinivasan
2005270105 February 2006 AU
2529310 January 2005 CA
1266586 September 2000 CN
1276936 December 2000 CN
101950561 January 2011 CN
102592638 July 2012 CN
0651554 May 1995 EP
1104969 June 2001 EP
9837513 August 1998 WO
9963443 December 1999 WO
0022605 April 2000 WO
0064094 October 2000 WO
0157783 August 2001 WO
0217214 February 2002 WO
0249363 June 2002 WO
02060182 August 2002 WO
02063609 August 2002 WO
03009602 January 2003 WO
2005002200 January 2005 WO
2005008582 January 2005 WO
2005099385 October 2005 WO
2006014362 February 2006 WO
CIPO, “Office Action,” issued in connection with Canadian Patent Application No. 2,529,310, on Apr. 6, 2011 (3 pages).
CIPO, “Notice of Allowance,” issued in connection with Canadian Patent Application No. 2,529,310, on Mar. 8, 2012 (1 page).
CIPO, “Office Action,” issued in connection with Canadian Patent Application No. 2,572,622, on May 3, 2013 (3 pages).
EPO, “Supplementary European Search Report,” issued in connection with European Patent Application No. 04776572.2, dated Aug. 31, 2011 (3 pages).
EPO, “Examination Report,” issued in connection with European Patent Application No. 04776572.2, dated Apr. 25, 2012 (4 pages).
EPO, “Supplementary European Search Report,” issued in connection with European Patent Application No. 05780308.2, Jun. 24, 2010 (5 pages).
EPO, “Examination Report,” issued in connection with European Patent Application No. 05780308.2, dated Nov. 18, 2011 (9 pages).
EPO, “Summons to Attend Oral Proceedings Pursuant to Rule 115(1) EPC,” issued in connection with European Patent Application No. 05780308.2, dated Jan. 2, 2013 (4 pages).
EPO, “Intention to Grant Pursuant to Rule 71(3) EPC,” issued in connection with European Patent Application No. 05780308.2, dated Apr. 8, 2013 (69 pages).
IP Australia, “Examiner's First Report,” issued in connection with Australian Patent Application No. 2004258470, mailed on Sep. 5, 2008 (9 pages).
IP Australia, “Notice of Acceptance,” issued in connection with Australian Patent Application No. 2004258470, mailed on Nov. 25, 2009 (3 pages).
IP Australia, “Examiner's First Report,” issued in connection with Australian Patent Application No. 2010200873, mailed on Aug. 11, 2011 (2 pages).
IP Australia, “Notice of Acceptance,” issued in connection with Australian Patent Application No. 2010200873, mailed on Aug. 22, 2012 (3 pages).
IP Australia, “Examiner's First Report,” issued in connection with Australian Patent Application No. 2005270105, mailed on Feb. 22, 2010 (2 pages).
IP Australia, “Notice of Acceptance,” issued in connection with Australian Patent Application No. 2005270105, mailed on Mar. 18, 2011 (4 pages).
IP Australia, “Examiner's First Report,” issued in connection with Australian Patent Application No. 2011203047, mailed on Feb. 8, 2012 (2 pages).
IP Australia, “Notice of Acceptance,” issued in connection with Australian Patent Application No. 2011203047, mailed on Mar. 5, 2013 (2 pages).
KIPO, “Notice of Allowance,” issued in connection with Korean Patent Application No. I0-2007-7002769, dated Aug. 29, 2011 (3 pages).
MyIPO, “Substantive Examination Adverse Report,” issued in connection with Malaysian Patent Application No. P120042284, mailed on Mar. 20, 2009 (3 pages).
PCT, “International Search Report and Written Opinion,” issued in connection with PCT Application No. PCT/US2004/018645, mailed Apr. 19, 2005 (9 pages).
PCT, “International Preliminary Report on Patentability,” issued in connection with PCT Application No. PCT/US2004/018645, mailed Dec. 13, 2005 (6 pages).
PCT, “International Search Report and Written Opinion,” issued in connection with PCT Application No. PCT/US2004/018953, mailed Apr. 29, 2005 (8 pages).
PCT, “International Preliminary Report on Patentability,” issued in connection with PCT Application No. PCT/US2004/018953, mailed Jan. 4, 2006 (22 pages).
PCT, “International Search Report and Written Opinion,” issued in connection with PCT Application No. PCT/US2005/023578, mailed on Jan. 11, 2006 (6 pages).
PCT, “International Preliminary Report on Patentability,” issued in connection with PCT Application No. PCT/US2005/023578, completed on Aug. 25, 2006 (20 pages).
PCT, “International Search Report and Written Opinion,” issued in connection with PCT Application No. PCT/US2007/080973, mailed on Apr. 23, 2008 (7 pages).
PCT, “International Preliminary Report on Patentability,” issued in connection with PCT Application No. PCT/US2007/080973, mailed Apr. 23, 2009 (7 pages).
SIPO, “First Notification of Office Action,” issued in connection with Chinese Patent Application No. 200480020200.8, on Mar. 27, 2009 (11 pages).
SIPO, “Notice of Decision of Granting Patent Right for Invention,” issued in connection with Chinese Patent Application No. 200480020200.8, issued on Jul. 23, 2010 (2 pages).
SIPO, “First Notification of Office Action,” issued in connection with Chinese Patent Application No. 201010501205.X, on Mar. 15, 2011 (7 pages).
SIPO, “Second Notification of Office Action,” issued in connection with Chinese Patent Application No. 201010501205.X, on Feb. 20, 2012 (6 pages).
SIPO, “Notice of Decision of Granting Patent Right for Invention,” issued in connection with Chinese Patent Application No. 201010501205.X, on Aug. 30, 2012 (3 pages).
SIPO, “First Notification of Office Action,” issued in connection with Chinese Patent Application No. 200580026107.2, issued on Jul. 11, 2008 (7 pages).
SIPO, “Second Notification of Office Action,” issued in connection with Chinese Patent Application No. 200580026107.2, issued on Jun. 9, 2011 (6 pages).
SIPO, “Notice of Decision of Granting Patent Right for Invention,” issued in connection with Chinese Patent Application No. 200580026107.2, issued on Oct. 20, 2011 (4 pages).
TIPO, “Office Action,” issued in connection with Taiwanese Application No. 93117000, mailed Nov. 4, 2010 (6 pages).
TIPO, “Notice of Allowance,” issued in connection with Taiwanese Application No. 93117000, mailed Feb. 23, 2011 (3 pages).
Abdulaziz et al., “Wavelet Transform and Channel Coding for Data Hiding in Video,” Department of Electrical and Computer Systems Engineering, Monash University, Clayton, Australia, 2001 (5 pages).
Advanced Television Systems Committee, “ATSC Standard: Digital Audio Compression (AC-3), Revision A,” Washington, D.C., USA, Dec. 20, 1995 (140 pages).
Cheng et al., “Enhanced Spread Spectrum Watermarking of MPEG-2, AAC Audio,” Department of Electrical Engineering, Texas A&M University, College Station, T.X., U.S.A, and Panasonic Information and Networking Technologies Lab, Princeton, NJ, USA, pp. IV-3728-IV-3731, 2002 (4 pages).
Cheung, W.N., “Digital Image Watermarking in Spatial and Transform Domains,” Centre for Advanced Telecommunications and Quantum Electronics Research, University of Canberra, Australia, 2000 (6 pages).
Chiariglione, Leonardo, “International Organisation for Standardisation Organisation Internationale de Normalisation,” ISO/IEC JTC I/SC 29/WG 11 N3954, Resolutions of 56th WG 11 Meeting, Mar. 2001 (21 pages).
Davidson, Grant A., “Digital Audio Coding: Dolby AC-3,” pp. 41-1-41-21, CRC Press LLC, 1998 (22 pages).
De Smet et al., “Subband Based MPEG Audio Mixing for Internet Streaming Applications,” 2001 ICASSP (4 pages).
Decarmo, Linden, “Pirates on the Airwaves,” www.emedialive.com, Sep. 1999 (8 pages).
Fraunhofer Institute for Integrated Circuits, “Audio and Multimedia Watermarking,” www.iis.fraunhoder.de/amm/techinf/water, 1998 (7 pages).
Hartung et al., “Watermarking of Uncompressed and Compressed Video,” Telecommunications Institute I, University of Erlangen-Nuremberg, Germany, 1998 (26 pages).
Haskell et al., “Digital Video: An Introduction to MPEG-2,” pp. 55-79, 1996 (26 pages).
Herre et al., “Audio Watermarking in the Bitstream Domain,” Fraunhofer Institute for Integrated Circuits (FhG-IIS), Enlangen, Germany; Signal and Image Processing Lab 25th Anniversary's Project Presentation and Workshop held on Jun. 12-13, 2000 (23 pages).
Lacy et al., “On Combining Watermarking with Perceptual Coding,” AT&T Labs, Florham Park, NJ., USA, pp. 3725-3728, 1998 (4 pages).
Liang et al., “Video Watermarking Combining with Hybrid Coding Scheme,” Department of E.E., Fudan University, Shanghai, China, 2002 (5 pages).
Princen et al., “Analysis/Synthesis Filter Bank Design Based on Time Domain Aliasing Cancellation,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP=34, No. 5, Oct. 1986 (9 pages).
Stautner, John P., “Scalable Audio Compression for Mixed Computing Environments,” Aware, Inc., Cambridge, MA, USA, Presented at the 93rd Convention for an Audio Engineering Society held in San Francisco, CA, USA, on Oct. 1-4, 1992 (4 pages).
Touimi et al., “A summation Algorithm for MPEG-1 Coded Audio Signals: A First Step Towards Audio Processing in the Compressed Domain,” Annals of Telecommunications, vol. 55, No. 3-4, Mar. 1, 2000 (10 pages).
Watson et al., “Design and Implementation of AAC Decoders,” Dolby Laboratories, Inc., San Francisco, CA, USA, 2000 (2 pages).
Xu et al., “Content-Based Digital Watermarking for Compressed Audio,” Department of Computer Science, The University of Sydney, New South Wales, Australia, 2006 (13 pages).
USPTO, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 11/298,040, on May 15, 2008 (15 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 11/298,040, on Aug. 22, 2008 (8 pages).
USPTO, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 12/613,334, on Nov. 15, 2010 (10 pages).
USPTO, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 12/613,334, on Apr. 26, 2011 (7 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 12/613,334, on Oct. 13, 2011 (10 pages).
USPTO, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 13/283,271, on May 3, 2012 (6 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 13/283,271, on Sep. 18, 2012 (11 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 12/269,733, on Aug. 6, 2009 (9 pages).
USPTO, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 11/571,483, on Jun. 13, 2012 (12 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 11/571,483, on Nov. 30, 2012 (5 pages).
USPTO, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 11/870,275, on Nov. 23, 2010 (37 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 11/870,275, on May 20, 2011 (5 pages).
USPTO, “Notice of Allowance,” issued in connection with U.S. Appl. No. 11/870,275, on Sep. 26, 2011 (5 pages).
USPTO, “Supplemental Notice of Allowance,” issued in connection with U.S. Appl. No. 11/870,275, mailed on Oct. 5, 2011 (3 pages).
European Patent Office, “Extended Search Report,” issued in connection with European Application No. 07844106.0, dated May 17, 2013, 6 pages.
IP Australia, “First Examiner's Report,” issued in connection with Australian Patent Application No. 2012261653, dated Jan. 29, 2014, 3 pages.
Canadian Intellectual Property Office, “Office Action,” issued in connection with Canadian Application No. 2,572,622, dated May 3, 2013, 3 pages.
Government of India Patent Office, “First Examination Report,” issued in connection with IN Patent Application No. 465/DEL NP/2007, dated Nov. 26, 2013, 2 pages.
European Patent Office, “Examination Report” issued in connection with European Application No. 07844106.0, dated Feb. 7, 2014, 6 pages.
SIPO, “First Office Action”, issued in connection with corresponding Chinese Patent Application No. 201110460586.6, dated Mar. 5, 2014, and corresponding English translation (13 pages).
Hartung et al., “Digital Watermarking of MPEG-2 Coded Video in the Bitstream Domain,” IEEE, 1997 (4 pages).
Swanson et al., “Transparent Robust Image Watermarking,” IEEE, 1996 (4 pages).
Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” IEEE Transactions on Image Processing, vol. 6, No. 12, Dec. 1997 (15 pages).
Tirkel et al., “Image Watermarking—A Spread Spectrum Application,” IEEE, 1996 (5 pages).
Silvestre et al., “Image Watermarking using Digital Communication Technology,” IEE IPA97, Jul. 15-17, 1997 (5 pages).
Patent number: 8787615
Patent Publication Number: 20130094690
Inventor: Venugopal Srinivasan (Palm Harbor, FL)
Application Number: 13/708,262
International Classification: G06K 9/00 (20060101); H04L 9/32 (20060101);