AOptix Technologies v. Blue Spike

c:...
..J
..J ~
13
f- <
V> ..J
OJ >-
3: ~
14 .?J 1;;
z
'" '"
~ ~
3: <
z
15
OJ
~
16
17
18
19
20
21
22
23
24
25
26
27
28
UNITED STATES DISTRICT COURT
NORTHERN DISTRICT OF CALIFORNIA
ED
AOPTIX TECHNOLOGIES, INC., a Delaware . casGM
13
1105
corporation,
Plaintiff,
v.
BLUE SPIKE, LLC, a Texas limited liability
company
Defendant.
COMPLAINT FOR .
DECLARATORY JUDGMENT OF
PATENT NONINFRINGEMENT &
PATENT INVALIDITY
JURY TRIAL DEMANDED
Plaintiff AOptix Techonologies, Inc. ("AOptix"), for its Complaint for Declaratory
Judgment against Defendant Blue Spike, LLC ("Blue Spike"), avers the following:
NATURE OF THE ACTION
1. This action is based on the patent laws of the United States, Title 35 ofthe United
States Code. Blue Spike has asserted rights under U.S. Patent Nos. 7,346,472, 7,660,700,
7,949,494, and 8,214, 175 (collectively "the Patents-in-Suit") based on certain ongoing activity by
COMPLAINT FOR DECLARATORY
JUDGMENT
1
2
3
4
5
6
7
8
9
10
11
12
..
..,
.., ,
e <
l3
~ "
w ~
" ~ 14 .)J t;
~ ~
" ~ <
z 15
w
~
16
17
18
19
20
21
22
23
24
25
26
27
28
AOptix. AOptix contends that it has the right to engage in the accused activity without license to
any of the Patents-in-Suit. True and correct copies of the Patents-in-Suit are attached hereto as
Exhibits A, B, C, & D. Plaintiffs thus seek a declaration that they do not infringe the Patents-in-
Suit and that the Patents-in-Suit are invalid.
THE PARTIES
2. AOptix is a Delaware corporation having its principal place of business at 675
Campbell Technology ParkwaY, Campbell, California 95008.
3. On information and belief, Blue Spike is a Texas limited liability company having
a principal place of business at 1820 Shiloh Road, Suite 1201-C, Tyler, Texas 75703.
JURISDICTION AND VENUE
4. This is a civil action regarding allegations of patent infringement and patent
invalidity arising under the patent laws of the United States, Title 35 of the United States Code, in
which AOptix seeks declaratory relief under the Declaratory Judgment Act. Thus, the court has
subject matter jurisdiction over this action pursuant to 28 U.S.C. l331, 1338,2201, and 2202.
5. An actual controversy exists between AOptix on the one hand and Blue Spike on
the other by virtue of Blue Spike's allegations that AOptix infringes the Patents-in-Suit by
making, using, offering to sell or selling its InSight Duo, InSight ESS, InSight VM, and Dash
Six Iris Recognition Enterprise SDK products.
6. AOptix contends that it has a right to make and sell biometric software, systems,
and technology, including those incorporated in its products InSight Duo, InSight ESS, InSight
VM, and Dash Six Iris Recognition Enterprise SDK, without license from Blue Spike.
7. The Court has personal jurisdiction over Blue Spike inter alia because, on
information and belief, Blue Spike has conducted substantial business in the state of California,
including this District, related to licensing the Patents-in-Suit. On information and belief, Blue
Spike has asserted the Patents-in-Suit against companies in the Northem District of California and
engaged in negotiations with those companies seeking licensing fees. On information and belief,
Blue Spike has also entered into licenses covering the Patents-in-Suit with companies in this
WDGMENT
2
I
2
3
4
5
6
7
8
9
10
11
12
"-
-'
-'
13
~
~
w
;:
14 ~
"
u
~
15 z
w
""
16
17
18
19
20
21
22
23
24
25
26
27
28
District, including Yahoo! Inc. and RPX Corporation. Blue Spike has also accused AOptix,
which resides in this District, of infringing the Patents-in-Suit.
8. Venue is proper in this court pursuant to 28 U.S.C. 1391 because Blue Spike is
subject to personal jurisdiction in this District.
INTRADISTRICT ASSIGNMENT
9. This is an Intellectual Property Action subject to district-wide assignment under
Local Rule 3-2(c}.
FACTUAL BACKGROUND
10. AOptix delivers highly intuitive and accurate biometric identity verification
solutions for a wide range of mobile and high throughput applications.
II. On information and belief; Blue Spike is a non-practicing licensing entity whose
sole purpose is to engage in the enforcement of the Patents-in-Suit, including the collection of
licensing fees.
12. On July 3,2012, the United States Patent Office issued United States Patent No.
8,214,175 B2 ("the' 175 Patent") entitled "Method and Device for Monitoring and Analyzing
Signals." The '175 patent states on its face that it was assigned to Blue Spike, Inc. of Sunny Isles
Beach, Florida. On August 4, 2012, Blue Spike, Inc. purportedly assigned its interests in the ' 175
patent to Blue Spike, LLC. A true and correct copy of the ' 175 patent is attached to this
Complaint as Exhibit A.
13. On May 24,2011, the United States Patent Office issued United States Patent No.
7,949,494 B2 ("the '494 Patent") entitled "Method and Device for Monitoring and Analyzing
Beach, Florida. On August 4, 2012, Blue Spike, Inc. purportedly assigned its interests in the '494
patent to Blue Spike, LLC. A true and correct copy ofthe '494 patent is attached to this
Complaint as Exhibit B.
14. On February 9, 2010, the United States Patent Office issued United States Patent
No. 7,660,700 B2 (''the '700 Patent") entitled "Method and Device for Monitoring and Analyzing
JUDGMENT
3
I
2
3
4
5
6
7
8
9
10
11
12
..
..l
..l
13
~
~
"
14 ..
" ~
15 z
~
'"
16
17
18
19
20
21
22
23
24
25
26
27
28
Beach, Florida. On August 4,2012, Blue Spike, Inc. purportedly assigned its interests in the '700
patent to Blue Spike, LLC. A true and correct copy of the '700 patent is attached to this
Complaint as Exhibit C.
IS. On March 18,2008, the United States Patent Office issued United States Patent
No. 7,346,472 BI ("the '472 Patent") entitled "Method and Device for Monitoring and Analyzing
Signals." The' 4 72 patent states on its face that it was assigned to Blue Spike, Inc. of Sunny Isles
Beach, Florida. On August 4,2012, Blue Spike, Inc. purportedly assigned its interests in the '472
patent to Blue Spike, LLC. A true and correct copy of the '472 patent is attached to this
Complaint as Exhibit D.
16. Blue Spike asserts that they have right, title, and interest in the Patents-in-Suit.
17. On or about January 8, 2013, Blue Spike filed suit in the Eastern District of Texas
against AOptix, asserting that the Patents-in-Suit are being directly and indirectly infringed by
AOptix. That case is pending as Blue Spike, LLC v. AOptix Technologies, Inc., Eastern District of
Texas, Tyler Division, Civil Action No. 6:13-CV-40. The complaint filed in that suit is
fundamentally flawed at least because AOptix is not subject to personal jurisdiction in the Eastern
District of Texas.
18. AOptix does not infringe the Patents-in-Suit. Additionally, the Patents-in-Suit are
invalid. Accordingly, an actual controversy exists between AOptix and Blue Spike as to whether
AOptix infringes any valid claim of the Patents-in-Suit. Absent a declaration of non-infringement
and/or invalidity, Blue Spike will continue to wrongly assert the Patents-in-Suit against AOptix,
and thereby cause AOptix irreparable harm.
FIRST CAUSE OF ACTION
(Declaratory Judgment of Non-Infringement of the '175 Patent)
19. Paragraphs 1-18 are incorporated by reference as if fully restated herein.
20. Blue Spike contends that AOptix has or is infringing one or more claims of the
, 175 patent.
21. AOptix has not and is not infringing any claims of the ' 175 patent and is not liable
for any infringement of the ' 175 patent.
JUDGMENT
4
I
2
3
4
5
6
7
8
9
10
11
12
"
..J
..J
13
~ <
~ -
w "
~ ~
14
"' ~
" ~
~ g
~ <
z
15
w
'"
16
17
18
19
20
21
22
23
24
25
26
27
28
22. An actual controversy thus exists between AOptix on the one hand, and Blue
Spike on the other, as to whether AOptix infringes the' 175 patent.
23. Accordingly, AOptix seeks a judgment declaring that it does not infringe and has
not infringed, directly or indirectly, contributorily or by inducement, any claim of the ' 175 patent.
SECOND CAUSE OF ACTION
(Declaratory Judgment of Invalidity of the '175 Patent)
25. Blue Spike asserts in this action that AOptix has or is infringing one or more
claims of the '175 patent.
26. One or more claims of the ' 175 patent are invalid for failure to meet one or more
of the conditions for patentability specified in Title 35, U.S. C., or the rules, regulations, and law
related thereto, including, without limitation, in 35 U.S.C. 101, 102, 103, 112, and/or the
judicial doctrine of double patenting.
Spike on the other, as to whether the ' 175 patent is valid.
28. Accordingly, AOptix seeks a judgment declaring that one or more claims of the
'175 patent are invalid forfailure to comply with 35 U.S.C. 101, 102, 103, 112, and/or the
TIDRD CAUSE OF ACTION
, 494 patent.
31. AOptix has not and is not infringing any claims of the '494 patent and is not liable
for any infringement of the ' 494 patent.
Spike on the other, as to whether AOptix infringes the '494 patent.
JUDGMENT
5
I
2
3
4
5
6
7
8
9
10
11
12
""
'"'
'"'
13
~
~
~
;:
14 ..
~
u
~
15
z
~
u.
16
17
18
19
20
21
22
23
24
25
26
27
28
not infringed, directly or indirectly, contributorily or by inducement, any claim of the '494 patent.
FOURTH CAUSE OF ACTION
claims of the' 494 patent.
36. One or more claims of the '494 patent are invalid for failure to meet one or more
of the conditions for patentability specified in Title 35, U.S.C., or the rules, regulations, and law
Spike on the other, as to whether the '494 patent is valid.
'494 patent are invalid for failure to comply with 35 U.S.C. 101, 102, 103, 112, and/or the
FIFTH CAUSE OF ACTION
(Declaratory Judgment of Non-Infringement ofthe '700 Patent
, 7 00 patent.
41. AOptix has not and is not infringing any claims of the '700 patent and is not liable
for any infringement of the '700 patent.
COMPLAJNTFORDECLARATORY
JUDGMENT
6
I
2
3
4
5
6
7
8
9
10
11
12
0.
,.,
,.,
\3
~
~

;:
14 ..
"
u
;;
15
z

"-
16
17
18
19
20
21
22
23
24
25
26
27
28
SIXTH CAUSE OF ACTION
claims of the ' 700 patent.
SEVENTH CAUSE OF ACTION
, 472 patent.
5!. AOptix has not and is not infringing any claims of the '472 patent and is not liable
for any infringement ofthe ' 472 patent.
EIGHTH CAUSE OF ACTION
JUDGMENT
7
I
2
3
4
5
6
7
8
9
10
11
12
..
-'
.....l ):
13
~ <
~ ~
" " ~ <
14
.. "
~ ~
!:! ~
~ <
z 15
"
'"
16
17
18
19
20
21
22
23
24
25
26
27
28
claims of the ' 472 patent.
PRAYER FOR RELIEF
WHEREFORE, Plaintiff prays for a declaratory judgment against Defendant as follows:
A. Judgment against Blue Spike declanng the '175 patent not infringed by AOptix;
B. Judgment against Blue Spike declaring one or more claims of the '175 patent
invalid;
C. Judgment against Blue Spike declaring the '494 patent not infringed by AOptix;
D. Judgment against Blue Spike declaring one or more claims of the '494 patent
invalid;
E. Judgment against Blue Spike declaring the '700 patent not infringed by AOptix;
F. Judgment against Blue Spike declaring one or more claims of the '700 patent
invalid;
G. Judgment against Blue Spike declaring the '472 patent not infringed by AOptix;
H. Judgment against Blue Spike declaring one or more claims of the '472 patent
invalid;
1. A declaration that AOptix's claims present an exceptional case entitling it to, and
therefore awarding, its reasonable attorneys' fees under 35 U.S.C. 285;
JUDGMENT
8
1
2
3
4
5
6
7
8
9
10
11
12
0-
..,
.., .
~ <
13
~ - w ~
:s: , ~
14 ~ (;;
,
" .
q
<
z 15
w
"-
16
17
18
19
20
21
22
23
24
25
26
27
28
J. Award of costs to AOptix; and
K. Award to AOptix such other relief as the Court deems just and reasonable.
Dated: March 11,2013
Attorneys for Plaintiff
AOptix Technologies, Inc.
DEMAND FOR JURY TRIAL'
Pursuant to Fed. R. Civ. P. 38, Plaintiff AOptix demands a jury trial as to all matters
triable of right by a jury.
Dated: March II, 2013
JUDGMENT
9
Attorneys for Plaintiff
AOptix Technologies, Inc.
EXHIBIT A
(12) United States Patent
Moskowitz et al.
(54) METHOD AND DEVICE FOR MONITORING
AND ANALYZING SIGNALS
(75) Inventors: Scott Moskowitz, Sunny Isles Beach, FL
(US); Mike W. Berry, Seattle, WA (US)
(73) Assignee: Blue Spike, Inc., Sunny Isles Beach, FL
(US)
( *) Notice: Subject to any disclaimer, the term of this
patent is extended or adjusted under 35
U.S.c. 154(b) by 0 days.
(21) Appl. No.: 13/035,964
(22) Filed: Feb. 26, 2011
(65) Prior Publication Data
US 201110179069 Al luI. 21, 2011
Related U.S. Application Data
(63) Continuation of application No. 12/655,357, filed on
Dec. 22, 2009, now Pat. No. 7,949,494, which is a
continuation of application No. 12/005,229, filed on
Sep. 7, 2000, now Pat. No. 7,346,472.
(51) Int. Cl.
G06F 11/30 (2006.01)
(52) U.S. Cl. ........ 7021182; 704/201; 704/219; 3411155;
341/76; 341161
(58) Field of Classification Search .................. 7021182;
(56)
704/201,204,211,270,219,500,503,504;
3411155, 76, 61
See application file for complete search history.
References Cited
U.S. PATENT DOCUMENTS
3,947,825 A 311976 Cassada
3,984,624 A 1011976 Waggener
3,986,624 A 1011976 Cates, Jr. et al.
4,038,596 A 711977 Lee
4,200,770 A 411980 Hellman etal.
4,218,582 A 811980 Hellman etal.
4,339,134 A 711982 Macheel
4,390,898 A 611983 Bondet al.
4,405,829 A 911983 Rivest et al.
4,424,414 A 111984 Hellman etal.
4,528,588 A 711985 Lofberg
4,672,605 A 611987 Hustig et al.
4,748,668 A 511988 Shamir et al.
4,789,928 A 1211988 Fujisaki
4,827,508 A 511989 Shear
4,876,617 A 1011989 Best et al.
4,896,275 A 111990 Jackson
4,908,873 A 311990 Philibert et al.
4,939,515 A 711990 Adelson
4,969,204 A 1111990 Jones et al.
4,972,471 A 1111990 Gross et al.
4,977,594 A 1211990 Shear
4,979,210 A 1211990 Nagata et al.
4,980,782 A 1211990 Ginkel
5,050,213 A 911991 Shear
5,073,925 A 1211991 Nagata et al.
5,077,665 A 1211991 Silverman et al.
111111 1111111111111111111111111111111111111111111111111111111111111
EP
US008214175B2
(10) Patent No.: US 8,214,175 B2
Jul. 3, 2012 (45) Date of Patent:
5,111,530 A *
5,113,437 A
5,136,581 A
5,136,646 A
5,136,647 A
5,142,576 A
5,161,210 A
5,210,820 A
5,243,423 A
5,243,515 A
5,287,407 A
5,319,735 A
5,327,520 A *
5,341,429 A
5,341,477 A
5,363,448 A
5,365,586 A
5,369,707 A
5,379,345 A
5,394,324 A
5/1992 Kutaragi et al. .............. 704/270
5/1992 Best et al.
8/1992 Muehrcke
8/1992 Haber et al.
8/1992 Haber et al.
8/1992 Nadan
1111992 Druyvesteyn et al.
5/1993 Kenyon
9/1993 Dejean et al.
9/1993 Lee
2/1994 Holmes
6/1994 Preuss et al.
7/1994 Chen ............................. 704/219
8/1994 Stringer et al.
8/1994 Pitkin et al.
1111994 Koopman et al.
1111994 Indeck et al.
1111994 Follendore, III
111995 Greenberg
2/1995 Clearwater
(Continued)
FOREIGN PATENT DOCUMENTS
0372601 6/1990
(Continued)
OTHER PUBLICATIONS
Jap. App. No. 2000-542907, entitled "Multiple Transform Utilization
and Application for Secure Digital Watermarking"; which is a JP
national stage of PCTIUSI9991007262, published as WO/19991
052271, Oct. 14, 1999.
PCT Application No. PCTIUSOOI21189, filed Aug. 4, 2000, entitled,
"A Secure Personal Content Server", Pub. No. WOl2001l018628 ;
Publication Date Mar. 15, 2001.
EPO Application No. 96919405.9, entitled "Steganographic Method
and Device"; published as EP0872073 (A2), Oct. 21, 1998.
Schneier, Bruce, Applied Cryptography, 2nd Ed., John Wiley & Sons,
pp. 9-10, 1996.
Menezes, Alfred J., Handbook of Applied Cryptography, CRC Press,
p.46, 1997.
1997, Merriam-Webster's Collegiate Dictionary, lOth Ed., Merriam
Webster, Inc., p. 207.
(Continued)
Primary Examiner - Carol Tsai
(74) Attorney, Agent, or Firm - Neifeld IP Law, PC
(57) ABSTRACT
A method and system for monitoring and analyzing at least
one signal are disclosed. An abstract of at least one reference
signal is generated and stored in a reference database. An
abstract of a query signal to be analyzed is then generated so
that the abstract of the query signal can be compared to the
abstracts stored in the reference database for a match. The
method and system may optionally be used to record infor-
mation about the query signals, the number of matches
recorded, and other useful information about the query sig-
nals. Moreover, the method by which abstracts are generated
can be programmable based upon selectable criteria. The
system can also be programmed with error control software
so as to avoid the re-occurrence of a query signal that matches
more than one signal stored in the reference database.
19 Claims, No Drawings
US 8,214,175 B2
Page 2
U.S. PATENT DOCUMENTS 5,862,260 A 111999 Rhoads
5,870,474 A 2/1999 Wasilewski et al.
5,398,285 A 311995 Borgelt et al.
5,884,033 A 3/1999 Duvall et al.
5,406,627 A 411995 Thompson et al.
5,889,868 A 3/1999 Moskowitz et al.
5,408,505 A 411995 Indeck et al.
5,893,067 A 4/1999 Bender et al.
5,410,598 A 411995 Shear
5,894,521 A 4/1999 Conley
5,412,718 A 511995 Narasirnhalv et al.
5,901,178 A * 5/1999 Lee et al. ...................... 375/240
5,418,713 A 511995 Allen
5,903,721 A 5/1999 Sixtus
5,428,606 A 611995 Moskowitz
5,450,490 A 911995 Jensen et al.
5,905,975 A 5/1999 Ausubel
5,469,536 A 1111995 Blank
5,912,972 A 6/1999 Barton
5,471,533 A 1111995 Wang et al.
5,915,027 A 6/1999 Cox et al.
5,478,990 A 1211995 Montanari et al.
5,917,915 A 6/1999 Hirose
5,479,210 A 1211995 Cawley et al.
5,918,223 A 6/1999 Blum
5,487,168 A 111996 Geiner et al.
5,920,900 A 7/1999 Poole et al.
5,493,677 A 211996 Balogh et al.
5,923,763 A 7/1999 Walker et al.
5,497,419 A 311996 Hill
5,930,369 A 7/1999 Cox et al.
5,506,795 A 411996 Yarnakawa
5,930,377 A 7/1999 Powell et al.
5,513,126 A 411996 Harkins et al.
5,940,134 A 8/1999 Wirtz
5,513,261 A 411996 Maher
5,943,422 A 8/1999 VanWie et al.
5,530,739 A 611996 Okada
5,949,055 A 9/1999 Fleet
5,530,751 A 611996 Morris
5,963,909 A 10/1999 Warren et al.
5,530,759 A 611996 Braudaway et al.
5,973,731 A 10/1999 Schwab
5,539,735 A 711996 Moskowitz
5,974,141 A 10/1999 Saito
5,548,579 A 811996 Lebrun et al.
5,991,426 A 1111999 Cox et al.
5,568,570 A 1011996 Rabbani
5,999,217 A 12/1999 Berners-Lee
5,579,124 A 1111996 Aijala et al.
6,009,176 A 12/1999 Gennaro et al.
5,581,703 A 1211996 Baugher et al.
6,029,126 A 212000 Malvar
5,583,488 A 1211996 Sala et al.
6,041,316 A 3/2000 Allen
5,598,470 A 111997 Cooper et al.
6,044,471 A 3/2000 Colvin
5,606,609 A 211997 Houser et al.
6,049,838 A 4/2000 Miller et al.
5,613,004 A 311997 Cooperman et al.
6,051,029 A 4/2000 Paterson et al.
5,617,119 A 411997 Briggs et al.
6,061,793 A 5/2000 Tewfik et al.
5,617,506 A * 411997 Burk et al. ................... 704/201
6,067,622 A 5/2000 Moore
5,625,690 A 411997 Michel et al.
6,069,914 A 5/2000 Cox
5,629,980 A 511997 Stefik et al.
5,633,932 A 511997 Davis et al.
6,081,251 A 6/2000 Sakai et al.
5,634,040 A 511997 Her et al.
6,081,587 A 6/2000 Reyes et al.
5,636,276 A 611997 Brugger
6,081,597 A 6/2000 Hoffstein
5,636,292 A 611997 Rhoads
6,088,455 A 7/2000 Logan et al.
5,640,569 A 611997 Miller et al.
6,131,162 A 1012000 Yoshiura et al.
5,646,997 A 711997 Barton
6,141,753 A 1012000 Zhao et al.
5,657,461 A 811997 Harkins et al.
6,141,754 A 1012000 Choy
5,659,726 A 811997 Sandford, II et al.
6,148,333 A 1112000 Guedalia
5,664,018 A 911997 Leighton
6,154,571 A 1112000 Cox et al.
5,673,316 A 911997 Auerbach et al.
6,178,405 Bl * 112001 Ouyang et al. ................ 704/500
5,677,952 A 1011997 Blakelyet al.
6,192,138 Bl 2/2001 Yamadaji
5,680,462 A 1011997 Miller et al.
6,199,058 Bl 3/2001 Wong etal.
5,687,236 A 1111997 Moskowitz et al.
6,205,249 Bl 3/2001 Moskowitz
5,689,587 A 1111997 Bender et al.
6,208,745 Bl 3/2001 Florenio et al.
5,696,828 A 1211997 Koopman, Jr.
6,226,618 Bl 5/2001 Downs
5,719,937 A 211998 Warren et al.
6,230,268 Bl 5/2001 Miwaetal.
5,721,788 A 211998 Powell et al.
6,233,347 Bl 5/2001 Chen et al.
5,734,752 A 311998 Knox
6,233,684 Bl 5/2001 Stefik et al.
5,737,416 A 411998 Cooper et al.
6,240,121 Bl 5/2001 Senoh
5,737,733 A 411998 Eller
6,263,313 Bl 7/2001 Milstead et al.
5,740,244 A 411998 Indeck et al.
6,272,634 Bl 8/2001 Tewfik et al.
5,745,569 A 411998 Moskowitz et al.
6,275,988 Bl 8/2001 N agashima et al.
5,748,783 A 511998 Rhoads
6,278,780 Bl 8/2001 Shimada
5,751,811 A 511998 Magnotti et al.
6,278,791 Bl 8/2001 Honsinger et al.
5,754,697 A 511998 Fu et al.
6,282,300 Bl 8/2001 Bloom et al.
5,757,923 A 511998 Koopman, Jr.
6,282,650 Bl 8/2001 Davis
5,765,152 A 611998 Erickson
6,285,775 Bl 9/2001 Wu et al.
5,768,396 A 611998 Sone
6,301,663 Bl 10/2001 Kato et al.
5,774,452 A 611998 Wolosewicz
6,310,962 Bl 10/2001 Chung et al.
5,781,184 A * 711998 Wasserman et al. .......... 348/571
6,330,335 Bl 1212001 Rhoads
5,790,677 A 811998 Fox et al.
6,330,672 Bl 1212001 Shur
5,799,083 A 811998 Brothers et al.
6,345,100 Bl 212002 Levine
5,809,139 A 911998 Grirod et al.
6,351,765 Bl 212002 Pietropaolo et al.
5,809,160 A 911998 Powell et al.
6,363,483 Bl 3/2002 Keshav
5,818,818 A 1011998 Soumiya
6,373,892 Bl 4/2002 !chien et al.
5,822,432 A 1011998 Moskowitz et al.
6,373,960 Bl 4/2002 Conover et al.
5,828,325 A 1011998 Wolosewicz et al.
6,374,036 Bl 4/2002 Ryanet al.
5,832,119 A 1111998 Rhoads
6,377,625 Bl 4/2002 Kim
5,839,100 A * 1111998 Wegener ....................... 704/220
6,381,618 Bl 4/2002 Jones et al.
5,842,213 A 1111998 Odom
5,848,155 A 1211998 Cox
6,381,747 Bl 4/2002 Wonforetal.
5,850,481 A 1211998 Rhoads 6,385,324 Bl 5/2002 Koppen
5,859,920 A 111999 Daly et al. 6,385,329 Bl 5/2002 Sharma et al.
5,860,099 A 111999 Milios et al. 6,385,596 Bl 5/2002 Wiser
US 8,214,175 B2
Page 3
6,389,538 Bl 5/2002 Gruse et al. 7,159,116 B2 112007 Moskowitz
6,405,203 Bl 6/2002 Collart 7,162,642 B2 112007 Schumann et al.
6,415,041 Bl 7/2002 Oami et al. 7,177,429 B2 212007 Moskowitz et al.
6,418,421 Bl 7/2002 Hurtado 7,177,430 B2 212007 Kim
6,425,081 Bl 7/2002 Iwamura 7,206,649 B2 4/2007 Kirovski et al.
6,430,301 Bl 8/2002 Petrovic 7,231,524 B2 6/2007 Bums
6,430,302 B2 8/2002 Rhoads 7,233,669 B2 6/2007 Candelore
6,442,283 Bl 8/2002 Tewfik et al. 7,240,210 B2 7/2007 Michaketal.
6,446,211 Bl 912002 Colvin 7,266,697 B2 912007 Kirovski et al.
6,453,252 Bl 912002 Laroche 7,286,451 B2 1012007 Wirtz
6,457,058 Bl 912002 Ullumetal. 7,287,275 B2 1012007 Moskowitz
6,463,468 Bl 1012002 Buch et al. 7,289,643 B2 1012007 Brunk et al.
6,484,264 Bl 1112002 Colvin 7,343,492 B2 3/2008 Moskowitz et al.
6,493,457 Bl 1212002 Quackenbush 7,346,472 Bl 3/2008 Moskowitz et al.
6,502,195 Bl 1212002 Colvin 7,362,775 Bl 4/2008 Moskowitz
6,522,767 Bl 212003 Moskowitz et al. 7,363,278 B2 4/2008 Schmelzer et al.
6,522,769 Bl 212003 Rhoads et al. 7,409,073 B2 8/2008 Moskowitz et al.
6,523,113 Bl 212003 Wehrenberg 7,4 57 ,962 B2 1112008 Moskowitz
6,530,021 Bl 3/2003 Epstein et al. 7,460,994 B2 1212008 Herre et al.
6,532,284 B2 3/2003 Walker et al. 7,475,246 Bl 112009 Moskowitz
6,539,475 Bl 3/2003 Cox et al. 7,530,102 B2 5/2009 Moskowitz
6,557,103 Bl 4/2003 Boncelet, Jr. et al. 7,532,725 B2 5/2009 Moskowitz et al.
6,584,125 Bl 6/2003 Katto 7,568,100 Bl 7/2009 Moskowitz et al.
6,587,837 Bl 7/2003 Spagna et al. 7,647,502 B2 112010 Moskowitz
6,590,996 Bl 7/2003 Reed 7,647,503 B2 112010 Moskowitz
6,598,162 Bl 7/2003 Moskowitz 7,664,263 B2 212010 Moskowitz
6,606,393 Bl 8/2003 Xie et al. 7,743,001 Bl 6/2010 Vermeulen
6,611,599 B2 8/2003 Natarajan 7,761,712 B2 712010 Moskowitz
6,647,424 Bl 1112003 Pearson et al. 7,779,261 B2 812010 Moskowitz
6,658,010 Bl 12/2003 Enns et al. 200110010078 Al 7/2001 Moskowitz
6,665,489 B2 1212003 Collart 200110029580 Al 10/2001 Moskowitz
6,668,246 Bl 1212003 Yeung etal. 200110043594 Al 1112001 Ogawaet al.
6,668,325 Bl 1212003 Collberg et al. 200210009208 Al 112002 Alattar
6,674,858 Bl 112004 Kimura 200210010684 Al 112002 Moskowitz
6,687,683 Bl 212004 Harada et al. 200210026343 Al 212002 Duenke
6,725,372 Bl 4/2004 Lewis et al. 200210047873 Al 4/2002 Imanaka et al.
6,754,822 Bl 6/2004 Zhao 200210056041 Al 5/2002 Moskowitz
6,775,772 Bl 8/2004 Binding et al. 200210071556 Al 6/2002 Moskowitz et al.
6,784,354 Bl 8/2004 Lu et al. 200210073043 Al 6/2002 Herman et al.
6,785,815 Bl 8/2004 Serret-Avila et al. 200210097873 Al 7/2002 Petrovic
6,785,825 B2 8/2004 Colvin 200210103883 Al 8/2002 Haverstock et al.
6,792,548 B2 912004 Colvin 200210161741 Al 1012002 Wang etal.
6,792,549 B2 912004 Colvin 2003/0002862 Al 112003 Rodriguez
6,795,925 B2 912004 Colvin 2003/0126445 Al 7/2003 Wehrenberg
6,799,277 B2 912004 Colvin 2003/0133702 Al 7/2003 Collart
6,804,453 Bl * 1012004 Sasamoto et al. ............. 386/258 2003/0200439 Al 1012003 Moskowitz
6,813,717 B2 1112004 Colvin 2003/0219143 Al 1112003 Moskowitz et al.
6,813,718 B2 1112004 Colvin 2004/0028222 Al 212004 Sewell et al.
6,823,455 Bl 1112004 Macyet al. 2004/0037449 Al 212004 Davis et al.
6,834,308 Bl 1212004 Ikezoye et al. 2004/0049695 Al 3/2004 Choi et al.
6,842,862 B2 112005 Chow et al. 2004/0059918 Al 3/2004 Xu
6,853,726 Bl 212005 Moskowitz et al. 2004/0083369 Al 4/2004 Erlingsson et al.
6,857,078 B2 212005 Colvin 2004/0086119 Al 5/2004 Moskowitz
6,865,747 Bl 3/2005 Mercier 2004/0093521 Al 5/2004 Hamadeh et al.
6,931,534 Bl 8/2005 Jandel et al. 2004/0117628 Al 6/2004 Colvin
6,957,330 Bl 1012005 Hughes 2004/0117664 Al 6/2004 Colvin
6,966,002 Bl 1112005 Torrubia-Saez 2004/0125983 Al 7/2004 Reed et al.
6,977,894 Bl 1212005 Achilles et al. 2004/0128514 Al 7/2004 Rhoads
6,978,370 Bl 1212005 Kocher 2004/0225894 Al 1112004 Colvin
6,983,337 B2 112006 Diamant 2004/0243540 Al 1212004 Moskowitz et al.
6,986,063 B2 112006 Colvin 2005/0135615 Al 6/2005 Moskowitz et al.
6,990,453 B2 112006 Wang 2005/0160271 A9 712005 Brundage et al.
7,007,166 Bl 212006 Moskowitz et al. 2005/0177727 Al 8/2005 Moskowitz et al.
7,020,285 Bl 3/2006 Kirovski et al. 2005/0246554 Al 1112005 Batson
7,035,049 B2 4/2006 Yamamoto 2006/0005029 Al 112006 Petrovic et al.
7,035,409 Bl 4/2006 Moskowitz 2006/0013395 Al 112006 Brundage et al.
7,043,050 B2 5/2006 Yuval 2006/0013451 Al 112006 Haitsma
7,046,808 Bl 5/2006 Metois et al. 2006/0041753 Al 212006 Haitsma
7,050,396 Bl 5/2006 Cohen et al. 2006/0101269 Al 5/2006 Moskowitz et al.
7,051,208 B2 5/2006 Venkatesan et al. 2006/0140403 Al 6/2006 Moskowitz
7,058,570 Bl 6/2006 Yu et al. 2006/0251291 Al 1112006 Rhoads
7,093,295 Bl 8/2006 Saito 2006/0285722 Al 12/2006 Moskowitz et al.
7,095,874 B2 8/2006 Moskowitz et al. 2007/0011458 Al 112007 Moskowitz
7,103,184 B2 912006 Jian 2007/0028113 Al 212007 Moskowitz
7,107,451 B2 912006 Moskowitz 2007/0064940 Al 3/2007 Moskowitz et al.
7,123,718 Bl 1012006 Moskowitz et al. 2007/0079131 Al 4/2007 Moskowitz et al.
7,127,615 B2 1012006 Moskowitz 2007/0083467 Al 4/2007 Lindahl et al.
7,150,003 B2 1212006 Naumovich et al. 2007/0110240 Al 5/2007 Moskowitz et al.
7,152,162 B2 1212006 Moskowitz et al. 2007/0113094 Al 5/2007 Moskowitz et al.
US 8,214,175 B2
Page 4
2007/0127717 Al 6/2007 Herre et al.
2007/0226506 Al 912007 Moskowitz
2007/0253594 Al 1112007 Lu et al.
2007/0294536 Al 1212007 Moskowitz et al.
2007/0300072 Al 1212007 Moskowitz
2007/0300073 Al 1212007 Moskowitz
2008/0005571 Al 112008 Moskowitz
2008/0005572 Al 112008 Moskowitz
2008/0016365 Al 112008 Moskowitz
2008/0022113 Al 112008 Moskowitz
2008/0022114 Al 112008 Moskowitz
2008/0028222 Al 112008 Moskowitz
2008/0046742 Al 212008 Moskowitz
2008/0075277 Al 3/2008 Moskowitz et al.
2008/0109417 Al 5/2008 Moskowitz
200910037740 Al 212009 Moskowitz
200910089427 Al 4/2009 Moskowitz et al.
200910190754 Al 7/2009 Moskowitz et al.
200910210711 Al 8/2009 Moskowitz
200910220074 Al 912009 Moskowitz et al.
201010002904 Al 112010 Moskowitz
201010005308 Al 112010 Moskowitz
201010064140 Al 3/2010 Moskowitz
201010077219 Al 3/2010 Moskowitz
201010077220 Al 3/2010 Moskowitz
201010098251 Al 4/2010 Moskowitz
201010106736 Al 4/2010 Moskowitz
201010153734 Al 6/2010 Moskowitz
201010182570 Al 7/2010 Chota
201010202607 Al 812010 Moskowitz
201010220861 Al 9/2010 Moskowitz
EP
EP
EP
EP
EP
EP
EP
EP
NL
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
WO
0565947
0581317
0581317 A2
0649261
0651554
0872073
1547337
1354276
1005523
WO 9514289
WO 9629795
WO 9642151
W09701892
W09726733
WO 9724833
W09726732
WO 9744736
W09802864
W09837513
WO 9952271
W09962044
WO 9963443
WO 0057643
WOO 118628
W00143026
W00203385
W002003385 Al
10/1993
2/1994
2/1994
4/1995
5/1995
7/1996
3/2006
1212007
911998
5/1995
9/1996
12/1996
111997
111997
7/1997
7/1997
1111997
111998
8/1998
10/1999
12/1999
12/1999
912000
3/2001
6/2001
112002
10/2002
OTHER PUBLICATIONS
Brealy, et aI., Principles of Corporate Finance, "Appendix A-Using
Option Valuation Models", 1984, pp. 448-449.
Copeland, et aI., Real Options: A Practitioner's Guide, 2001 pp.
106-107,201-202,204-208.
Sarkar, M. "An Assessment of Pricing Mechanisms for the
Internet-A Regulatory Imperative", presented MIT Workshop on
Internet Economics, Mar. 1995 http://www.press.vmich.eduliep/
works/SarkAsses.html on.
Crawford, D.W. "Pricing Network Usage: A Market for Bandwidth
of Market Communication?" presented MIT Workshop on Internet
Economics, Mar. 1995 http://www.press.vmich.eduliep/works/
CrawMarket.html on March.
Low, S.H., "Equilibrium Allocation and Pricing of Variable
Resources Among User-Suppliers", 1988. http://www.citesear.nj.
nec.com/366503.html.
Caronni, Germano, "Assuring Ownership Rights for Digital Images",
published proceeds of reliable IT systems, v15 '95, H.H.
Bruggemann and W. Gerhardt-Hackel (Ed) Viewing Publishing
Company Germany 1995.
Zhao, Jian. "A WWW Service to Embed and Prove Digital Copyright
Watermarks", Proc. of the European conf. on Multimedia Applica-
tions, Services & Techniques Louvain-La-Nevve Belgium May
1996.
Gruhl, Daniel et aI., Echo Hiding. In Proceeding of the Workshop on
Information Hiding. No. 1174 in Lecture Notes in Computer Science,
Cambridge, England (May/Jun. 1996).
Oomen, A.W.J. et al., A Variable Bit Rate Buried Data Channel for
Compact Disc, J.AudioEng. Sc., vol. 43, No. 112, pp. 23-28 (1995).
Ten Kate, W. et aI., A New Surround-Stereo-Surround Coding Tech-
niques, J. Audio Eng.Soc., vol. 40,No. 5,pp. 376-383 (1992).
Gerzon, Michael et aI., A High Rate Buried Data Channel for Audio
CD, presentation notes, Audio Engineering Soc. 94th Convention
(1993).
Sklar, Bernard, Digital Communications, pp. 601-603 (1988).
Jayant, N.S. et aI., Digital Coding of Waveforms, Prentice Hall Inc.,
Englewood Cliffs, NJ, pp. 486-509 (1984).
Bender, Walter R. et al., Techniques for Data Hiding, SPIE Int. Soc.
Opt. Eng., vol. 2420, pp. 164-173, 1995.
Zhao, Jian et al., Embedding Robust Labels into Images for Copy-
right Protection, (xp 000571976), pp. 242-251,1995.
p. 175, 1997.
Schneier, Bruce, Applied Cryptography, 1st Ed., pp. 67-68, 1994.
Ten Kate, W. et aI., "Digital Audio Carrying Extra Information",
IEEE, CH 2847-219010000-1097, (1990).
Van Schyndel, et aI., "A digital Watermark," IEEE Int'l Computer
Processing Conference, Austin,TX, Nov. 13-16, 1994, pp. 86-90.
Smith, et al. "Modulation and Information Hiding in Images",
Springer Verlag, 1 st Int'l Workshop, Cambridge, UK, May 30-Jun. 1,
1996, pp. 207-227.
1997, Kutter, Martin et aI., "Digital Signature of Color Images Using
Amplitude Modulation", SPIE-EI97, vol. 3022, pp. 518-527.
Puate, Joan et al., "Using Fractal Compression Scheme to Embed a
Digital Signature into an Image", SPIE-96 Proceedings, vol. 2915,
Mar. 1997, pp. 108-118.
Swanson, Mitchell D.,et aI., "Transparent Robust Image Watermark-
ing", Proc. of the 1996 IEEE Int'I Conf. on Image Processing, vol.
Ill, 1996, pp. 211-214.
Swanson, Mitchell D., et al. "Robust Data Hiding for Images", 7th
IEEE Digital Signal Processing Workshop, Leon, Norway. Sep. 1-4,
1996, pp. 37-40.
Zhao, Jian et aI., "Embedding Robust Labels into Images for Copy-
right Protection", Proceeding of the Know Right '95 Conference, pp.
242-251.
Koch, E., et aI., "Towards Robust and Hidden Image Copyright
Labeling", 1995 IEEE Workshop on Nonlinear Signal and Image
Processing, Jun. 1995 Neos Marmaras pp. 4.
Van Schyandel, et al., "Towards a Robust Digital Watermark", Sec-
ondAsain Image Processing Conference, Dec. 6-8, 1995, Singapore,
vol. 2, pp. 504-508.
Tirkel,A.Z., "A Two-Dimensional Digital Watermark", DICTA '95,
Univ. of Queensland, Brisbane, Dec. 5-8, 1995, pp. 7.
Tirkel,A.Z., "Image Watermarking-A Spread Spectrum Applica-
tion", ISSSTA '96, Sep. 1996, Mainz, German, pp. 6.
O'Ruanaidh, et al. "Watermarking Digital Images for Copyright Pro-
tection", IEEE Proceedings, vol. 143, No.4, Aug. 1996, pp. 250-256.
Cox, et aI., Secure Spread Spectrum Watermarking for Multimedia,
NEC Research Institude, Techinal Report 95-10, pp. 33.
Kalm, D., "The Code Breakers", The MacMillan Company, 1969, pp.
xIII, 81-83, 513, 515, 522-526, 863.
Boney, et aI., Digital Watermarks for Audio Signals, EVSIPCO, 96,
pp. 473-480 (Mar. 14, 1997).
Dept. of Electrical Engineering, Del Ft University ofTechnology, Del
ft The Netherlands, Cr.c. Langelaar et al.,"Copy Protection for Mul-
timedia Data based on Labeling Techniques", Jul. 19969 pp.
F. Hartung, et aI., "Digital Watermarking of Raw and Compressed
Video", SPIE vol. 2952, pp. 205-213.
US 8,214,175 B2
Page 5
Craver, et al., "Can Invisible Watermarks Resolve Rightful Owner-
ships?", IBM Research Report, RC 20509 (Jul. 25, 1996) 21 pp.
Press, et al., "Numerical Recipes in Coo, Cambridge Univ. Press, 1988,
pp.398-417.
Pohlmann, Ken c., "Principles of Digital Audio", 3rd Ed., 1995, pp.
32-37,40-48:138, 147-149,332,333,364,499-501,508-509,564-
571.
Pohlmann, Ken c., "Principles of Digital Audio", 2nd Ed., 1991, pp.
1-9, 19-25,30-33,41-48,54-57,86-107,375-387.
Schneier, Bruce, Applied Cryptography, John Wiley & Sons, Inc.,
New York, 1994, pp. 68, 69, 387-392,1-57,273-275,321-324.
Boney, et aI., Digital Watermarks for Audio Signals, Proceedings of
the International Conf. on Multimedia Computing and Systems, Jun.
17-23,1996 Hiroshima, Japan, 0-8186-7436-9196, pp. 473-480.
Johnson, et aI., "Transform Permuted Watermarking for Copyright
Protection of Digital Video", IEEE Globecom 1998, Nov. 8-12, 1998,
New York New York vol. 2 1998 pp. 684-689 (ISBN 0-7803-4985-7).
Rivest, et aI., "Pay Word and Micromint: Two Simple Micropayment
Schemes," MIT Laboratory for Computer Science, Cambridge, MA,
May 7, 1996 pp. 1-18.
Bender, et aI., "Techniques for Data Hiding", IBM Systems Journal,
(1996) vol. 35, Nos. 3 & 4,1996, pp. 313-336.
Moskowitz, "Bandwith as Currency", IEEE Multimedia, Jan.-Mar.
2003, pp. 14-21.
Moskowitz, Multimedia Security Technologies for Digital Rights
Management, 2006, Academic Press, "Introduction-Digital Rights
Management" pp. 3-22.
Rivest, et aI., "PayWord and Micromint: Two Simple Micropayment
Apr. 27, 2001, pp. 1-18.
Tomsich, et aI., "Towards a secure and de-centralized digital
watermarking infrastructure for the protection of Intellectual Prop-
erty", in Electronic Commerce and Web Technologies, Proceedings
(ECWEB)(2000).
Moskowitz, "What is Acceptable Quality in the Application of Dig i-
tal Watermarking: Trade-offs of Security; Robustness and Quality",
IEEE Computer Society Proceedings ofITCC 2002 Apr. 10,2002 pp.
80-84.
Lemma, et al. "Secure Watermark Embedding through Partial
Encryption", International Workshop on Digital Watermarking
("IWDW" 2006). Springer Lecture Notes in Computer Science 2006
(to appear) 13.
Kocher, et aI., "Self Protecting Digital Content", Technical Report
from the CRI Content Security Research Initiative, Cryptography
Research, Inc. 2002-2003 14 pages.
Sirbu, M. et aI., "Net Bill: An Internet Commerce System Optimized
for Network Delivered Services", Digest of Papers of the Computer
Society Computer Conference (Spring) Mar. 5, 1995 pp. 20-25 vol.
CONF40.
Schunter, M. et aI., "A Status Report on the SEMPER framework for
Secure Electronic Commerce", Computer Networks and ISDN Sys-
tems, Sep. 30, 1998, pp. 1501-1510 vol. 30 No. 16-18 NL North
Holland.
Konrad, K. et al., "Trust and Electronic Commerce-more than a
technical problem," Proceedings of the 18th IEEE Symposium on
Reliable Distributed Systems Oct. 19-22, 1999, pp. 360-365
Lausanne.
Kini, et al., "Trust in Electronic Commerce: Definition and Theoreti-
cal Considerations", Proceedings of the 31st Hawaii Int'I Conf on
System Sciences (Cat. No. 98TBI00216). Jan. 6-9,1998. pp. 51-61.
Los.
Steinauer D. D., et aI., "Trust and Traceability in Electronic Com-
merce", Standard View, Sep. 1997, pp. 118-124, vol. 5 No.3, ACM,
USA.
Hartung, et al. "Multimedia Watermarking Techniques", Proceedings
of the IEEE, Special Issue, Identification & Protection of Multimedia
Information, pp. 1079-1107 Jul. 1999 vol. 87 No.7 IEEE.
European Search Report & European Search Opinion in
EP07112420.
STAIND (The Singles 1996-2006), Warner Music-Atlantic, Pre-
Release CD image, 2006, 1 page.
Radiohead ("Hail to the Thief'), EMI Music Group-Capitol, Pre-
U.S. Appl. No. 60/169,274, filed Dec. 7, 1999, entitled "Systems,
Methods and Devices for Trusted Transactions".
U.S. Appl. No. 601234,199, filed Sep. 20, 2000, "Improved Security
Based on Subliminal and Supraliminal Channels for Data Objects".
U.S. Appl. No. 09/671,739, filedSep. 29, 2000, entitled "Method and
Device for Monitoring and Analyzing Signals".
Tirkel, A.Z., "A Two Dimensional Digital Watermark", Scientific
Technology, 686, 14, date unknown.
PCT International Search Report in PCT/US95/08159.
Supplementary European Search Report in EP 96919405.
PCT International Search Report in PCT/US99107262.
PCT International Search Report in PCT/USOOI06522.
Supplementary European Search Report in EP00919398.
PCT International Search Report in PCT/US00I18411.
PCT International Search Report in PCT/USOO/33126.
Delaigle, l-F., et al. "Digital Watermarking," Proceedings of the
SPIE, vol. 2659, Feb. 1, 1996, pp. 99-110.
Schneider, M., et al. "A Robust Content Based Digital Signature for
Image Authentication," Proceedings of the International Conference
on Image Processing (Ic. Lausanne) Sep. 16-19, 1996, pp. 227-230,
IEEE ISBN.
Cox, I. J., et al. "Secure Spread Spectrum Watermarking for Multi-
media," IEEE Transactions on Image Processing, vol. 6 No. 12, Dec.
1, 1997, pp. 1673-1686.
Wong, Ping Wah. "A Public Key Watermark for Image Verification
and Authentication," IEEE International Conference on Image Pro-
cessing, vol. 1 Oct. 4-7, 1998, pp. 455-459.
Fabien A.P. Petitcolas, Ross J. Anderson and Markkus G. Kuhn,
"Attacks on Copyright Marking Systems," LNCS, vol. 1525, Apr.
14-17, 1998, pp. 218-238 ISBN: 3-540-65386-4.
Ross Anderson, "Stretching the Limits of Steganography," LNCS,
vol. 1174, May/Jun. 1996, 10 pages, ISBN: 3-540-61996-8.
Joseph J.K. O'Ruanaidh and Thierry Pun, "Rotation, Scale and
Translation Invariant Digital Image Watermarking", pre-publication,
Summer 19974 pages.
Translation Invariant Digital Image Watermarking", Submitted to
Signal Processing Aug. 21, 1997, 19 pages.
Oasis (Dig Out Your Soul), Big Brother Recordings Ltd, Promotional
CD image, 2008, 1 page.
Rivest, R. "Chaffing and Winnowing: Confidentiality without
Encryption", MIT Lab for Computer Science, http://people.csail.mit.
edu/rivestiChaffmg.txt Apr. 24, 1998, 9 pp.
PortalPlayer, PP502 digital media management system-on-chip,
May 1, 2003, 4 pp.
VeriDisc, "The Search for a Rational Solution to Digital Rights
Management (DRM)", http://64.244.235.240/news/whitepaper,
Idocs/veridisc.sub.--white.sub.--paper.pdf, 2001, 15 pp.
Cayre, et al., "Kerckhoff's-Based Embedding Security Classes for
WOA Data Hiding", IEEE Transactions on Information Forensics
and Security, vol. 3 No.1, Mar. 2008, 15 pp.
Wayback Machine, dated Jan. 17, 1999, http://web.archive.org/web/
19990 117020420/http://www.netzero.comi, accessed on Feb. 19,
2008.
Namgoong, H., "An Integrated Approach to Legacy Data for Multi-
media Applications", Proceedings of the 23rd EUROMICRO Con-
ference, vol., Issue 1-4, Sep. 1997, pp. 387-391.
Wayback Machine, dated Aug. 26, 2007, http://web.archive,org/web/
20070826151732/http://www.screenplaysmag.comit -abid!961
articieTypel ArticieView/articleId!495IDefault.aspx/.
"YouTube Copyright Policy: Video Identification tool-YouTube
Help", accessed Jun. 4, 2009, http://www.google.comisupportl
youtube/bin/answer.py?hl 3 pp.
PCT Application No. PCTIUS95/08159, filed Jun. 26, 1995, entitled,
"Digital Information Commodities Exchange with Virtual Menu-
ing", published as W0/1997/001892; Publication Date: Jan. 16,
1997.
US 8,214,175 B2
Page 6
PCT Application No. PCTIUS96/10257, filed Jun. 7, 1996, entitled
"Steganographic Method and Device"---corresponding to-EPO
Application No. 96919405.9, entitled "Steganographic Method and
Device", published as WOI 1996/042151; Publication Date: Dec. 27,
1996.
PCT Application No. PCTIUS97/00651, filed Jan. 16, 1997, entitled,
"Method for Stega-Cipher Protection of Computer Code", published
as W0/1997/026732; Publication Date: Ju\. 24,1997.
"Method for an Encrypted Digital Watermark", published as
W0/1997/026733; Publication Date: Ju\. 24,1997.
PCT Application No. PCTIUS97/11455, filed Ju\. 2, 1997, entitled,
"Optimization Methods for the Insertion, Protection and Detection of
Digital Watermarks in Digitized Data", published as WO/19981
002864; Publication Date: Jan. 22, 1998.
PCT Application No. PCTIUS99107262, filed Apr. 2,1999, entitled,
"Multiple Transform Utilization and Applications for Secure Digital
Watermarking", published as WO/19991052271; Publication Date:
Oct. 14, 1999.
PCT Application No. PCTIUSOOI06522, filed Mar. 14,2000, entitled,
"Utilizing Data Reduction in Steganographic and Cryptographic
Systems", published as W0120001057643; Publication Date: Sep. 28,
2000.
PCT Application No. PCTIUS00I18411, filed Ju\. 5, 2000, entitled,
"Copy Protection of Digital Data Combining Steganographic and
Cryptographic Techniques".
PCT Application No. PCTIUSOO/33126, filed Dec. 7, 2000, entitled
"Systems, Methods and Devices for Trusted Transactions", pub-
lished as WOl200 11043026; Publication Date: Jun. 14, 2001.
EPO Divisional Patent Application No. 07112420.0, entitled
"Steganographic Method and Device" corresponding to PCT Appli-
cation No. PCTIUS96/10257, published as W0/1996/042151, Dec.
27, 1996.
U.S. App\. No. 601222,023, filed Ju\. 31, 2007 entitled "Method and
apparatus for recognizing sound and signals in high noise and distor-
tion".
"Techniques for Data Hiding in Audio Files," by Morimoto, 1995.
Howe, Dennis Ju\. 13, 1998 http://foldoc .. org//steganography.
CSG, Computer Support Group and CSGNetwork.com 1973 http://
www.csgnetwork.comlglossarys.html.
QuinStreet Inc. 2010 What is steganography?-A word definition
from the Webopedia Computer Dictionary http://www.webopedia.
comlterms/steganography.html.
Graham, Robert Aug. 21, 2000 "Hacking Lexicon" http://
robertgraham.comlpubs/hacking-dict.html.
Farkex, Inc 2010 "Steganography definition of steganography in the
Free Online Encyclopedia" http://encyclopedia2. Thefreedictionary.
comlsteganography.
Horowitz, et a\., The Art of Eletronics. 2
nd
Ed., 1989, pp7.
Jimmy eat world ("futures"), Interscope Records, Pre-Release CD
image, 2004, 1 page.
Aerosmith ("Just Push Play"), Pre-Release CD image, 2001, 1 page.
Phil Collins(TestifY) Atlantic, Pre-Release CD image, 2002, 1 page.
U.S. App\. No. 111599,838, filed Nov. 15,2006.
U.S. App\. No. 111899,662, filed Sep. 7, 2007.
U.S. App\. No. 10/369,344, filed Feb. 18,2003.
U.S. App\. No. 111482,654, filed Ju\. 7, 2006.
U.S. App\. No. 121215,812, filed Jun. 30, 2008.
U.S. App\. No. 121901,568, filed Oct. 10,2010.
U.S. App\. No. 111497,822, filed Aug. 2, 2006.
U.S. App\. No. 121217,834, filed Ju\. 9, 2008.
U.S. App\. No. 12/462,799, filed Aug. 10,2009.
U.S. App\. No. 111899,661, filed Sep. 7, 2007.
U.S. App\. No. 12/590,681, filed Nov. 19,2009.
U.S. App\. No. 12/590,553, filed Nov. 10,2009.
U.S. App\. No. 12/592,331, filed Nov. 23, 2009.
U.S. App\. No. 121009,914, filed Jan. 23, 2008.
U.S. App\. No. 121005,230, filed Dec. 26, 2007.
U.S. App\. No. 12/803,168, filed Jun. 21, 2010.
U.S. App\. No. 111649,026, filed Jan. 3, 2007.
U.S. App\. No. 12/892,900, filed Sep. 28, 2010.
U.S. App\. No. 08/999,766, filed Ju\. 23, 1997.
U.S. App\. No. 111050,779, filed Feb. 7, 2005.
U.S. App\. No. 12/383,916, filed Mar. 30, 2009.
U.S. App\. No. 121913,751, filed Oct. 27, 2010.
U.S. App\. No. 12/383,879, filed Mar. 30, 2009.
U.S. App\. No. 12/886,732, filed Sep. 21, 2010.
U.S. App\. No. 121287,443, filed Oct. 9, 2008.
U.S. App\. No. 12/655,357, filed Dec. 22, 2009.
U.S. App\. No. 13/035,964, filed Feb. 26, 2011.
U.S. App\. No. 111900,065, filed Sep. 10,2007.
U.S. App\. No. 121799,894, filed May 4,2010.
* cited by examiner
US 8,214,175 B2
1
METHOD AND DEVICE FOR MONITORING
CROSS-REFERENCE TO RELATED
APPLICATIONS
This application is a continuation of application Ser. No.
12/655,357, filed Dec. 22, 2009 now U.S. Pat. No. 7,949,494,
which is a continuation of application Ser. No. 12/005,229,
filed Dec. 26, 2007, now U.S. Pat. No. 7,660,700, which is a
continuation of application Ser. No. 09/657,181, filed Sep. 7,
2000, now U.S. Pat. No. 7,346,472. The previously identified
patents and/or patent applications are hereby incorporated by
reference, in their entireties, as if fully stated herein.
This application is related to U.S. patent application Ser.
No. 08/999,766, filedJul. 23,1997, entitled "Steganographic
Method and Device" (issued as U.S. Pat. No. 7,568,100); U.S.
patent application Ser. No. 081772,222, filed Dec. 20, 1996,
entitled "Z-Transfonn Implementation of Digital Water-
marks" (issued as U.S. Pat. No. 6,078,664); U.S. patent appli-
cation Ser. No. 09/456,319, filed Dec. 8, 1999, entitled
"Z-Transform Implementation of Digital Watennarks" (is-
sued as U.S. Pat. No. 6,853,726); U.S. patent application Ser.
No. 08/674,726, filed Jul. 2, 1996, entitled "Exchange
Mechanisms for Digital Information Packages with Band-
width Securitization, Multichannel Digital Watennarks, and
Key Management" (issued as U.S. Pat. No. 7,362,775); U.S.
patent application Ser. No. 09/545,589, filed Apr. 7, 2000,
entitled "Method and System for Digital Watennarking" (is-
sued as U.S. Pat. No. 7,007,166); U.S. patent application Ser.
No. 091046,627, filed Mar. 24, 1998, entitled "Method for
Combining Transfer Function with Predetennined Key Cre-
ation" (issued as U.S. Pat. No. 6,598,162); U.S. patent appli-
cation Ser. No. 091053,628, filed Apr. 2, 1998, entitled "Mul-
tiple Transfonn Utilization and Application for Secure
Digital Watennarking" (issued as U.S. Pat. No. 6,205,249);
U.S. patent application Ser. No. 09/281,279, filed Mar. 30,
1999, entitled "Optimization Methods for the Insertion, Pro-
tection, and Detection of Digital Watennarks in Digital Data
(issued as U.S. Pat. No. 6,522,767),,; U.S. patent application
Ser. No. 09,594,719, filed Jun. 16,2000, entitled "Utilizing
Data Reduction in Steganographic and Cryptographic Sys-
tems" (which is a continuation-in-part ofPCT application No.
PCTIUSOOI06522, filed Mar. 14, 2000, which PCT applica-
tion claimed priority to U.S. Provisional Application No.
601125,990, filed Mar. 24, 1999) (issued as U.S. Pat. No.
7,123,718); U.S. Application No. 601169,274, filed Dec. 7,
1999, entitled "Systems, Methods And Devices For Trusted
Transactions" (issued as U.S. Pat. No. 7,159,116); and PCT
Application No. PCT IUS00/21189, filed Aug. 4, 2000 (which
claims priority to U.S. patent application Ser. No. 601147,
134, filedAug. 4, 1999, and to U.S. patent application Ser. No.
60/213,489, filed Jnn. 23, 2000, both of which are entitled, "A
Secure Personal Content Server") (issued as U.S. Pat. No.
7,475,246). The previously identified patents and/or patent
applications are hereby incorporated by reference, in their
entireties, as if fully stated herein.
In addition, this application hereby incorporates by refer-
ence, as if fully stated herein, the total disclosures of U.S. Pat.
No. 5,613,004 "Steganographic Method and Device"; U.S.
Pat. No. 5,745,569 "Method for Stega-Cipher Protection of
Computer Code"; and U.S. Pat. No. 5,889,868 "Optimization
Methods for the Insertion, Protection, and Detection of Dig i-
tal Watennarks in Digitized Data."
2
BACKGROUND OF THE INVENTION
1. Field of the Invention
The invention relates to the monitoring and analysis of
5 digital infonnation. A method and device are described which
relate to signal recognition to enhance identification and
monitoring activities.
2. Description of the Related Art
Many methods and protocols are known for transmitting
10 data in digital fonn for multimedia applications (including
computer applications delivered over public networks such as
the internet or World Wide Web ("WWW"). These methods
may include protocols for the compression of data, such that
it may more readily and quickly be delivered over limited
15 bandwidth data lines. Among standard protocols for data
compression of digital files may be mentioned the MPEG
compression standards for audio and video digital compres-
sion, promulgated by the Moving Picture Experts Group.
Numerous standard reference works and patents discuss such
20 compression and transmission standards for digitized infor-
mation.
Digital watennarks help to authenticate the content of digi-
tized multimedia information, and can also discourage piracy.
Because piracy is clearly a disincentive to the digital distri-
25 bution of copyrighted content, establishment of responsibil-
ity for copies and derivative copies of such works is invalu-
able. In considering the various forms of multimedia content,
whether "master," stereo, NTSC video, audio tape or compact
disc, tolerance of quality will vary with individuals and affect
30 the underlying commercial and aesthetic value of the content.
It is desirable to tie copyrights, ownership rights, purchaser
information or some combination of these and related data
into the content in such a manner that the content must
undergo damage, and therefore reduction of its value, with
35 subsequent, nnauthorized distribution, commercial or other-
wise. Digital watermarks address many of these concerns. A
general discussion of digital watennarking as it has been
applied in the art may be found in U.S. Pat. No. 5,687,236
(whose specification is incorporated in whole herein by ref-
40 erence).
Further applications of basic digital watennarking fnnc-
tionality have also been developed. Examples of such appli-
cations are shown in U.S. Pat. No. 5,889,868 (whose speci-
fication is incorporated in whole herein by reference). Such
45 applications have been drawn, for instance, to implementa-
tions of digital watermarks that were deemed most suited to
particular transmissions, or particular distribution and stor-
age mediums, given the nature of digitally sampled audio,
video, and other multimedia works. There have also been
50 developed techniques for adapting watermark application
parameters to the individual characteristics of a given digital
sample stream, and for implementation of digital watermarks
that are feature-based-i.e., a system in which watennark
information is not carried in individual samples, but is carried
55 in the relationships between multiple samples, such as in a
waveform shape. For instance, natural extensions may be
added to digital watermarks that may also separate frequen-
cies (color or audio), channels in 3D while utilizing discrete-
ness in feature-based encoding only known to those with
60 pseudo-random keys (i.e., cryptographic keys) or possibly
tools to access such information, which may one day exist on
a quantum level.
A matter of general weakness in digital watermark tech-
nology relates directly to the manner of implementation of the
65 watermark. Many approaches to digital watennarking leave
detection and decode control with the implementing party of
the digital watennark, not the creator of the work to be pro-
US 8,214,175 B2
3
tected. This weakness removes proper economic incentives
for improvement of the technology. One specific fonn of
exploitation mostly regards efforts to obscure subsequent
watermark detection. Others regard successful over encoding
using the same watermarking process at a subsequent time.
Yet another way to perform secure digital watennark imple-
mentation is through "key-based" approaches.
SUMMARY OF THE INVENTION
A method for monitoring and analyzing at least one signal
is disclosed, which method comprises the steps of: receiving
at least one reference signal to be monitored; creating an
abstract of the at least one reference signal; storing the
abstract of the at least one reference signal in a reference
database; receiving at least one query signal to be analyzed;
creating an abstract of the at least one query signal; and
comparing the abstract of the at least one query signal to the
abstract of the at least one reference signal to detennine if the
abstract of the at least one query signal matches the abstract of
the at least one reference signal.
A method for monitoring a plurality of reference signals is
also disclosed, which method comprises the steps of: creating
an abstract for each one of a plurality of reference signals;
storing each of the abstracts in a reference database; receiving
at least one query signal to be analyzed; creating an abstract of
each at least one query signal; locating an abstract in the
reference database that matches the abstract of each at least
one query signal; and recording the identify of the reference
signal whose abstract matched the abstract of each at least one
query signal.
A computerized system for monitoring and analyzing at
least one signal is also disclosed, which system comprises: a
processor for creating an abstract of a signal using selectable
criteria; a first input for receiving at least one reference signal
to be monitored, the first input being coupled to the processor
such that the processor may generate an abstract for each
reference signal input to the processor; a reference database,
coupled to the processor, for storing abstracts of each at least
one reference signal; a second input for receiving at least one
query signal to be analyzed, the second input being coupled to
the processor such that the processor may generate an abstract
for each query signal; and a comparing device, coupled to the
reference database and to the second input, for comparing an
abstract of the at least one query signal to the abstracts stored
in the reference database to determine if the abstract of the at
least one query signal matches any of the stored abstracts.
Further, an electronic system for monitoring and analyzing
at least one signal is disclosed, which system comprises: a
first input for receiving at least one reference signal to be
monitored, a first processor for creating an abstract of each
reference signal input to the first processor through the first
input; a second input for receiving at least one query signal to
be analyzed, a second processor for creating an abstract of
each query signal; a reference database for storing abstracts of
each at least one reference signal; and a comparing device for
comparing an abstract of the at least one query signal to the
abstracts stored in the reference database to determine if the
abstract of the at least one query signal matches any of the
stored abstracts.
DETAILED DESCRIPTION OF THE INVENTION
While there are many approaches to data reduction that can
be utilized, a primary concern is the ability to reduce the
digital signal in such a manner as to retain a "perceptual
relationship" between the original signal and its data reduced
4
version. This relationship may either be mathematically dis-
cernible or a result of market-dictated needs. The purpose is to
afford a more consistent means for classifying signals than
proprietary, related text-based approaches. A simple analogy
is the way in which a forensic investigator uses a sketch artist
to assist in detennining the identity of a human.
In one embodiment of the invention, the abstract of a signal
may be generated by the following steps: I) analyze the
characteristics of each signal in a group of audible/percep-
10 tible variations for the same signal (e.g., analyze each of five
versions of the same song-which versions may have the
same lyrics and music but which are sung by different artists);
and 2) select those characteristics which achieve or remain
relatively constant (or in other words, which have minimum
15 variation) for each of the signals in the group. Optionally, the
null case may be defined using those characteristics which are
common to each member of the group of versions.
Lossless and lossy compression schemes are appropriate
candidates for data reduction technologies, as are those subset
20 of approaches that are based on perceptual models, such as
AAC, MP3, TwinVQ, JPEG, GIF, MPEG, etc. Where spectral
transfonns fail to assist in greater data reduction of the signal,
other signal characteristics can be identified as candidates for
further data reduction. Linear predictive coding (LPC) ,
25 z-transfonn analysis, root mean square (rms), signal to peak,
may be appropriate tools to measure signal characteristics,
but other approaches or combinations of signal characteristic
analysis are contemplated. While such signal characteristics
may assist in detennining particular applications of the
30 present invention, a generalized approach to signal recogni-
tion is necessary to optimize the deployment and use of the
present invention.
Increasingly, valuable information is being created and
stored in digital form. For example, music, photographs and
35 motion pictures can all be stored and transmitted as a series of
binary digits-I's and O's. Digital techniques pennit the
original infonnation to be duplicated repeatedly with perfect
or near perfect accuracy, and each copy is perceived by view-
ers or listeners as indistinguishable from the original signal.
40 Unfortunately, digital techniques also permit the infonnation
to be easily copied without the owner's pennission. While
digital representations of analog wavefonns may be analyzed
by perceptually-based or perceptually-limited analysis it is
usually costly and time-consuming to model the processes of
45 the highly effective ability of humans to identify and recog-
nize a signal. In those applications where analog signals
require analysis, the cost of digitizing the analog signal is
minimal when compared to the benefits of increased accuracy
and speed of signal analysis and monitoring when the pro-
50 cesses contemplated by this invention are utilized.
The present invention relates to identification of digitally-
sampled infonnation, such as images, audio and video. Tra-
ditional methods of identification and monitoring of those
signals do not rely on "perceptual quality," but rather upon a
55 separate and additional signal. Within this application, such
signals will be called "additive signals" as they provide infor-
mation about the original images, audio or video, but such
information is in addition to the original signal. One tradi-
tional' text-based additive signal is title and author infonna-
60 tion. The title and author, for example, is infonnation about a
book, but it is in addition to the text of the book. If a book is
being duplicated digitally, the title and author could provide
one means of monitoring the number of times the text is being
duplicated, for example, through an Internet download. The
65 present invention, however, is directed to the identification of
a digital signal-whether text, audio, or video-using only
the digital signal itself and then monitoring the number of
US 8,214,175 B2
5 6
the monitoring have to agree as to the nature of the separate
signal to be used for monitoring-otherwise, the entity doing
the monitoring would not know where to look, for what to
look, or how to interpret the monitoring signal once it was
identified and detected. On the other hand, if the original
signal is used itself as a monitoring signal, then no such
agreement is necessary. Moreover, a more logical and self-
sufficient relationship between the original and its data-re-
duced abstract enhances the transparency of any resulting
times the signal is duplicated. Reliance on an additive signal
has many shortcomings. For example, first, someone must
incorporate the additive signal within the digital data being
transmitted, for example, by concatenation or through an
embedding process. Such an additive signal, however, can be
easily identified and removed by one who wants to utilize the
original signal without paying for its usage. If the original
signal itself is used to identify the content, an unauthorized
user could not avoid payment of a royalty simply by removing
the additive signal-because there is no additive signal to
remove. Hence, the present invention avoids a major disad-
vantage of the prior art.
One such additive signal that may be utilized is a digital
watermark-which ideally cannot be removed without per-
ceptually altering the original signal. A watermark may also
be used as a monitoring signal (for example, by encoding an
identifier that nniquely identifies the original digital signal
into which the identifier is being embedded). A digital water-
mark used for monitoring is also an additive signal, and such
a signal may make it difficult for the user who wants to
duplicate a signal without paying a royalty-mainly by
degrading the perceptual quality of the original signal if the
watermark (and hence the additive monitoring signal) is
removed. This is, however, is a different solution to the prob-
lem.
10 monitoring efforts. The entity doing the monitoring is not
looking for a separate, additive monitoring system, and fur-
ther, need not have to interpret the content of the monitoring
signal.
Monitoring implementations can be handled by robust
15 watermark techniques (those techniques that are able to sur-
vive many signal manipulations but are not inherently
"secure" for verification of a carrier signal absent a logically-
related watermarking key) and forensic watennark tech-
niques (which enable embedding of watermarks that are not
20 able to survive perceptible alteration of the carrier signal and
thus enable detection of tampering with the originally water-
marked carrier signal). The techniques have obvious trade-
offs between speed, performance and security of the embed-
ded watennark data.
25 In other disclosures, we suggest improvements and imple-
mentations that relate to digital watennarks in particular and
embedded signaling in general. A digital watermark may be
used to "tag" content in a manner that is not humanly-percep-
tible, in order to ensure that the human perception of the
The present invention eliminates the need of any additive
monitoring signal because the present invention utilizes the
underlying content signal as the identifier itself. Nevertheless,
the watennark may increase the value of monitoring tech-
niques by increasing the integrity of the embedded data and
by indicating tampering of either the original content signal
30 signal quality is maintained. Watermarking, however, must
inherently alter at least one data bit of the original signal to
represent a minimal change from the original signal's "unwa-
tennarked state." The changes may affect only a bit, at the
very least, or be dependent on infonnation hiding relating to
or the monitoring signal. Moreover, the design of a water-
marking embedding algorithm is closely related to the per-
ceptibility of noise in any given signal and can represent an
ideal subset of the original signal: the watermark bits are an
inverse of the signal to the extent that lossy compression
schemes, which can be used, for instance, to optimize a water-
marking embedding scheme, can yield infonnation about the
extent to which a data signal can be compressed while holding
steadfast to the design requirement that the compressed signal
maintain its perceptual relationship with the original, uncom-
pressed signal. By describing those bits that are candidates for
imperceptible embedding of watennark bits, further data
reduction may be applied on the candidate watermarks as an
example of retaining a logical and perceptible relationship 45
with the original uncompressed signal.
35 signal characteristics, such as phase infonnation, differences
between digitized samples, root mean square (RMS) calcu-
lations, z-transform analysis, or similar signal characteristic
category.
There are weaknesses in using digital watennark technol-
40 ogy for monitoring purposes. One weakness relates directly
to the way in which watennarks are implemented. Often, the
persons responsible for encoding and decoding the digital
watermark are not the creator of the valuable work to be
Of course, the present invention may be used in conjnnc-
tion with watennarking technology (including the use of keys
to accomplish secure digital watennarking), but watennark-
ing is not necessary to practice the present invention. Keys for 50
watermarking may have many forms, including: descriptions
of the original carrier file fonnatting, mapping of embedded
data (actually imperceptible changes made to the carrier sig-
nal and referenced to the predetermined key or key pairs),
assisting in establishing the watermark message data integrity 55
(by incorporation of special one way functions in the water-
mark message data or key), etc. Discussions of these systems
in the patents and pending patent applications are incorpo-
rated by reference above. The "recognition" of a particular
signal or an instance of its transmission, and its monitoring 60
are operations that may be optimized through the use of
digital watermark analysis.
A practical difference between the two approaches of using
a separate, additive monitoring signal and using the original
signal itself as the monitoring signal is control. If a separate 65
signal is used for monitoring, then the originator of the text,
audio or video signal being transmitted and the entity doing
protected. As such, the creator has no input on the placement
of the monitoring signal within the valuable work being pro-
tected. Hence, if a user wishing to avoid payment of the
royalty can find a way to decode or remove the watennark, or
at least the monitoring signal embedded in the watermark,
then the nnauthorized user may successfully duplicate the
signal with impunity. This could occur, for example, if either
of the persons responsible for encoding or decoding were to
have their security compromised such that the encoding or
decoding algorithms were discovered by the unauthorized
user.
With the present invention, no such disadvantages exist
because the creator need not rely on anyone to insert a moni-
toring signal-as no such signal is necessary. Instead, the
creator's work itself is used as the monitoring signal. Accord-
ingly, the value in the signal will have a strong relationship
with its recognizability.
By way of improving methods for efficient monitoring as
well as effective confinnation of the identity of a digitally-
sampled signal, the present invention describes useful meth-
ods for using digital signal processing for benchmarking a
novel basis for differencing signals with binary data compari-
sons. These techniques may be complemented with percep-
tual techniques, but are intended to leverage the generally
US 8,214,175 B2
7
decreasing cost of bandwidth and signal processing power in
an age of increasing availability and exchange of digitized
binary data.
So long as there exist computationally inexpensive ways of
identifying an entire signal with some fractional representa-
tion or relationship with the original signal, or its perceptually
observable representation, we envision methods for faster and
more accurate auditing of signals as they are played, distrib-
uted or otherwise shared amongst providers (transmitters)
and consumers (receivers). The ability to massively compress
a signal to its essence-which is not strictly equivalent to
"lossy" or"lossless" compression schemes or perceptual cod-
ing techniques, but designed to preserve some underlying
"aesthetic quality" of the signal-represents a useful means
for signal analysis in a wide variety of applications. The
signal analysis, however, must maintain the ability to distin-
guish the perceptual quality of the signals being compared.
For example, a method which analyzed a portion of a song by
compressing it to a single line of lyrics fails to maintain the
ability to distinguish the perceptual quality of the songs being
compared. Specifically, for example, if the song "New York
State of Mind" were compressed to the lyrics ''I'm in a New
York State of Mind," such a compression fails to maintain the
ability to distinguish between the various recorded versions
of the song, say, for example between Billy Joel's recording
and Barbara Streisand's recording. Such a method is, there-
fore, incapable of providing accurate monitoring of the art-
ist's recordings because it could not determine which of the
two artists is deserving of a royalty-unless of course, there is
a separate monitoring signal to provide the name of the artist
or other information sufficient to distinguish the two versions.
The present invention, however, aims to maintain some level
of perceptual quality of the signals being compared and
would deem such a compression to be excessive.
This analogy can be made clearer if it is understood that
there are a large number of approaches to compressing a
signal to, say, l.!tO.oooth of its original size, not for maintaining
its signal quality to ensure computational ease for commer-
cial quality distribution, but to assist in identification, analysis
or monitoring of the signal. Most compression is either lossy
or lossless and is designed with psychoacoustic or psychovi-
sual parameters. That is to say, the signal is compressed to
retain what is "humanly-perceptible." As long as the com-
pression successfully mimics human perception, data space
may be saved when the compressed file is compared to the
uncompressed or original file. While psychoacoustic and psy-
chovisual compression has some relevance to the present
invention, additional data reduction or massive compression
is anticipated by the present invention. It is anticipated that
the original signal may be compressed to create a realistic or
self-similar representation of the original signal, so that the
compressed signal can be referenced at a subsequent time as
unique binary data that has computational relevance to the
original signal. Depending on the application, general data
reduction of the original signal can be as simple as massive
compression or may relate to the watermark encoding enve-
lope parameter (those bits which a watermarking encoding
algorithm deem as candidate bits for mapping independent
data or those bits deemed imperceptible to human senses but
detectable to a watermark detection algorithm). In this man-
ner, certain media which are commonly known by signal
characteristics, a painting, a song, a TV commercial, a dialect,
etc., may be analyzed more accurately, and perhaps, more
efficiently than a text-based descriptor of the signal. So long
as the sender and receiver agree that the data representation is
accurate, even insofar as the data-reduction technique has
logical relationships with the perceptibility of the original
8
signal, as they must with commonly agreed to text descrip-
tors, no independent cataloging is necessary.
The present invention generally contemplates a signal rec-
ognition system that has at least five elements. The actual
number of elements may vary depending on the number of
domains in which a signal resides (for example, audio is at
least one domain while visual carriers are at least two dimen-
sional). The present invention contemplates that the number
of elements will be sufficient to effectively and efficiently
10 meet the demands of various classes of signal recognition.
The design of the signal recognition that may be used with
data reduction is better understood in the context of the gen-
eral requirements of a pattern or signal recognition system.
The first element is the reference database, which contains
15 information about a plurality of potential signals that will be
monitored. In one form, the reference database would contain
digital copies of original works of art as they are recorded by
the various artists, for example, contain digital copies of all
songs that will be played by a particular radio station. In
20 another form, the reference database would contain not per-
fect digital copies of original works of art, but digital copies of
abstracted works of art, for example, contain digital copies of
all songs that have been preprocessed such that the copies
represent the perceptual characteristics of the original songs.
25 In another form, the reference database would contain digital
copies of processed data files, which files represent works of
art that have been preprocessed in such a fashion as to identifY
those perceptual differences that can differentiate one version
of a work of art from another version of the same work of art,
30 such as two or more versions of the same song, but by differ-
ent artists. These examples have obvious application to visu-
ally communicated works such as images, trademarks or pho-
tographs, and video as well.
The second element is the object locator, which is able to
35 segment a portion of a signal being monitored for analysis
(i.e., the "monitored signal"). The segmented portion is also
referred to as an "object." As such, the signal being monitored
may be thought of comprising a set of objects. A song record-
ing, for example, can be thought of as having a multitude of
40 objects. The objects need not be of uniform length, size, or
content, but merely be a sample of the signal being monitored.
Visually communicated informational signals have related
objects; color and size are examples.
The third element is the feature selector, which is able to
45 analyze a selected object and identifY perceptual features of
the object that can be used to uniquely describe the selected
object. Ideally, the feature selector can identifY all, or nearly
all, of the perceptual qualities of the object that differentiate it
from a similarly selected object of other signals. Simply, a
50 feature selector has a direct relationship with the perceptibil-
ity of features commonly observed. Counterfeiting is an
activity which specifically seeks out features to misrepresent
the authenticity of any given object. Highly granular, and
arguably successful, counterfeiting is typically sought for
55 objects that are easily recognizable and valuable, for
example, currency, stamps, and trademarked or copyrighted
works and objects that have value to a body politic.
The fourth element is the comparing device which is able to
compare the selected object using the features selected by the
60 feature selector to the plurality of signals in the reference
database to identifY which of the signals matches the moni-
tored signal. Depending upon how the information of the
plurality of signals is stored in the reference database and
depending upon the available computational capacity (e.g.,
65 speed and efficiency), the exact nature of the comparison will
vary. For example, the comparing device may compare the
selected object directly to the signal information stored in the
US 8,214,175 B2
9
database. Alternatively, the comparing device may need to
process the signal information stored in the database using
input from the feature selector and then compare the selected
object to the processed signal information. Alternatively, the
comparing device may need to process the selected object
using input from the feature selector and then compare the
processed selected object to the signal information. Alterna-
tively, the comparing device may need to process the signal
information stored in the database using input from the fea-
ture selector, process the selected object using input from the 10
feature selector, and then compare the processed selected
object to the processed signal information.
10
sampled signal can be cataloged and identified, though the
use of a means that is specifically selected based upon the
strengths of a general computing device and the economic
needs of a particular market for the digitized information data
being monitored. The additional benefit is a more open means
to uniformly catalog, analyze, and monitor signals. As well,
such benefits can exist for third parties, who have a significant
interest in the signal but are not the sender or receiver of said
information.
As a general improvement over the art, the present inven-
tion incorporates what could best be described as "computer-
acoustic" and "computer-visual" modeling, where the signal
abstracts are created using data reduction techniques to deter-
mine the smallest amount of data, at least a single bit, which
The fifth element is the recorder which records information
about the number of times a given signal is analyzed and
detected. The recorder may comprise a database which keeps
track of the number of times a song, image, or a movie has
been played, or may generate a serial output which can be
subsequently processed to determine the total number of
times various signals have been detected.
15 can represent and differentiate two digitized signal represen-
tations for a given predefined signal set. Each of such repre-
sentations must have at least a one bit difference with all other
members of the database to differentiate each such represen-
Other elements may be added to the system or incorporated 20
into the five elements identified above. For example, an error
handler may be incorporated into the comparing device. If the
comparing device identifies multiple signals which appear to
contain the object being sought for analysis or monitoring, the
error handler may offer further processing in order to identify 25
additional qualities or features in the selected object such that
only one of the set of captured signals is found to contain the
further analyzed selected object that actually conforms with
the object thought to have been transmitted or distributed.
tation from the others in the database. The predefined signal
set is the object being analyzed. The signal identifier/detector
should receive its parameters from a database engine. The
engine will identifY those characteristics (for example, the
differences) that can be used to distinguish one digital signal
from all other digital signals that are stored in its collection.
For those digital signals or objects which are seemingly iden-
tical, except[ing] that the signal may have different perfor-
mance or utilization in the newly created 0 bj ect, benefits over
additive or text-based identifiers are achieved. Additionally,
decisions regarding the success or failure of an accurate
detection of any given object may be flexibly implemented or
changed to reflect market-based demands of the engine.
Appropriate examples are songs or works or art which have
been sampled or reproduced by others who are not the origi-
nal creator.
In some cases, the engine will also consider the NULL case
for a generalized item not in its database, or perhaps in situ-
ations where data objects may have collisions. For some
applications, the NULL case is not necessary, thus making the
whole system faster. For instance, databases which have
Moreover, one or more of the five identified elements may 30
be implemented with software that runs on the same proces-
sor, or which uses multiple processors. In addition, the ele-
ments may incorporate dynamic approaches that utilize sto-
chastic, heuristic, or experience-based adjustments to refine
the signal analysis being conducted within the system, includ- 35
ing, for example, the signal analyses being performed within
the feature selector and the comparing device. This additional
analyses may be viewed as filters that are designed to meet the
expectations of accuracy or speed for any intended applica-
tion. 40 fewer repetitions of objects or those systems which are
intended to recognize signals with time constraints or capture
all data objects. Greater efficiency in processing a relational
database can be obtained because the rules for comparison are
Since maintenance of original signal quality is not required
by the present invention, increased efficiencies in processing
and identification of signals can be achieved. The present
invention concerns itself with perceptible relationships only
to the extent that efficiencies can be achieved both in accuracy 45
and speed with enabling logical relationships between an
original signal and its abstract.
The challenge is to maximize the ability to sufficiently
compress a signal to both retain its relationship with the
original signal while reducing the data overhead to enable 50
more efficient analysis, archiving and monitoring of these
signals. In some cases, data reduction alone will not suffice:
the sender and receiver must agree to the accuracy of the
recognition. In other cases, agreement will actually depend
on a third party who authored or created the signal in question. 55
A digitized signal may have parameters to assist in establish-
ing more accurate identification, for example, a "signal
abstract" which naturally, or by agreement with the creator,
the copyright owner or other interested parties, can be used to
describe the original signal. By utilizing less than the original 60
signal, a computationally inexpensive means of identification
can be used. As long as a realistic set of conditions can be
arrived at governing the relationship between a signal and its
data reduced abstract, increases in effective monitoring and
transparency of information data flow across communica- 65
tions channels is likely to result. This feature is significant in
that it represents an improvement over how a digitally-
selected for the maximum efficiency of the processing hard-
ware and/or software, whether or not the processing is based
on psychoacoustic or psychovisual models. The benefits of
massive data reduction, flexibility in constructing appropriate
signal recognition protocols and incorporation of crypto-
graphic techniques to further add accuracy and confidence in
the system are clearly improvements over the art. For
example, where the data reduced abstract needs to have fur-
ther uniqueness, a hash or signature may be required. And for
objects which have further uniqueness requirements, two
identical instances of the object could be made unique with
cryptographic techniques.
Accuracy in processing and identification may be
increased by using one or more of the following fidelity
evaluation functions:
1) RMS (root mean square). For example, a RMS function
may be used to assist in determining the distance between
data based on mathematically determinable Euclidean dis-
tance between the beginning and end data points (bits) of a
particular signal carrier.
2) Frequency weighted RMS. For example, different
weights may be applied to different frequency components of
the carrier signal before using RMS. This selective weighting
can assist in further distinguishing the distance between
US 8,214,175 B2
11
beginning and end points of the signal carrier (at a given point
in time, described as bandwidth, or the number of total bits
that can be transmitted per second) and may be considered to
be the mathematical equivalent of passing a carrier signal
difference through a data filter and figuring the average power
in the output carrier.
3) Absolute error criteria, including particularly the NULL
12
set (described above) The NULL may be utilized in two
significant cases: First, in instances where the recognized,
signal appears to be an identified object which is inaccurately
attributed or identified to an object not handled by the data-
base of objects; and second, where a collision of data occurs.
For instance, if an artist releases a second performance of a
previously recorded song, and the two performances are so
similar that their differences are almost imperceptible, then
the previously selected criteria may not be able to differenti-
ate the two recordings. Hence, the database must be "recali-
brated" to be able to differentiate these two versions. Simi-
larly, if the system identifies not one, but two or more,
matches for a particular search, then the database may need
"recalibration" to further differentiate the two objects stored
in the database.
monitored signal can be used to improve the performance of
the monitoring system envisioned herein. The issue of central
concern with cognitive identification is a greater understand-
ing of the parameters by which any given object is to be
analyzed. To the extent that a creator chooses varying and
separate application of his object, those applications having a
cognitive difference in a signal recognition sense (e.g., the
whole or an excerpt), the system contemplated herein
includes rules for governing the application of bit-address-
10 able information to increase the accuracy of the database.
5) Finally, the predetermined parameters that are associ-
ated with a discrete case for any given object will have a
significant impact upon the ability to accurately process and
15 identify the signals. For example, if a song is transmitted over
a FM carrier, then one skilled in the art will appreciate that the
FM signal has a predetermined bandwidth which is different
from the bandwidth of the original recording, and different
even from song when played on an AM carrier, and different
20 yet from a song played using an S-bit Internet broadcast.
Recognition of these differences, however, will permit the
selection of an identification means which can be optimized
for monitoring a FM broadcasted signal. In other words, the
discreteness intended by the sender is limited and directed by
4) Cognitive Identification. For example, the present inven-
tion may use an experience-based analysis within a recogni-
tion engine. Once such analysis may involve mathematically
determining a spectral transform or its equivalent of the car-
rier signal. A spectral transform enables signal processing and
should maintain, for certain applications, some cognitive or
perceptual relationship with the original analog waveform.
As a novel feature to the present invention, additional classes
may be subject to humanly-perceptible observation. For
instance, an experience-based criteria which relates particu-
larly to the envisioned or perceived accuracy of the data
information object as it is used or applied in a particular
market, product, or implementation. This may include a short
3 second segment of a commercially available and recogniz-
able song which is used for commercials to enable recogni-
tion of the good or service being marketed. The complete
song is marketed as a separately valued object from the use of
25 the fidelity of the transmission means. Objects may be cata-
loged and assessing with the understanding that all monitor-
ing will occur using a specific transmission fidelity. For
example, a database may be optimized with the understand-
ing that only AM broadcast signals will be monitored. For
30 maximum efficiency, different data bases may be created for
different transmission chaunels, e.g., AM broadcasts, FM
broadcasts, Internet broadcasts, etc.
For more information on increasing efficiencies for infor-
mation systems, see The Mathematical Theory of Communi-
35 cation (194S), by Shannon.
a discrete segment of the song (that may be used for promo- 40
tion or marketing-for the complete song or for an entirely
different good or service). To the extent that an owner of the
song in question is able to further enable value through the
licensing or agreement for use of a segment of the original
signal, cognitive identification is a form of filtering to enable 45
differentiations between different and intended uses of the
same or subset of the same signal (object). The implementa-
tion relating specifically, as disclosed herein, to the predeter-
mined identification or recognition means and/or any speci-
fied relationship with subsequent use of the identification 50
means can be used to create a history as to how often a
particular signal is misidentified, which history can then be
used to optimize identification of that signal in the future. The
difference between use of an excerpt of the song to promote a
separate and distinct good or service and use of the excerpt to 55
promote recognition of the song itself (for example, by the
artist to sell copies of the song) relates informationally to a
decision based on recognized and approved use of the song.
Both the song and applications of the song in its entirety or as
a subset are typically based on agreement by the creator and 60
the sender who seeks to utilize the work. Trust in the means
Because bandwidth (which in the digital domain is equated
to the total number of bits that can be transmitted in a fixed
period of time) is a limited resource which places limitations
upon transmission capacity and information coding schemes,
the importance of monitoring for information objects trans-
mitted over any given channel must take into consideration
the nature and utilization of a given channel. The supply and
demand of bandwidth will have a dramatic impact on the
transmission, and ultimately, upon the decision to monitor
and recognize signals. A discussion of this is found in a
application by the inventor under U.S. patent application Ser.
No. OS/674,726 (which issued Apr. 22, 200S as U.S. Pat. No.
7,362,775) "Exchange Mechanisms for Digital Information
Packages with Bandwidth Securitization, Multichannel Digi-
tal Watermarks, and Key Management" (which application is
incorporated herein by reference as if fully setforth herein).
If a filter is to be used in connection with the recognition or
monitoring engine, it may be desirable for the filter to antici-
pate and take into consideration the following factors, which
affect the economics of the transmission as they relate to
triggers for payment and/or relate to events requiring audits of
the objects which are being transmitted: 1) time of trans mis-
sion (i.e., the point in time when the transmission occurred),
including whether the transmission is of a live performance);
2) location of transmission (e.g., what channel was used for
transmission, which usually determines the associated cost
for usage of the transmission channel); 3) the point of origi-
nation of the transmission (which may be the same for a signal
carrier over many distinct channels); and 4) pre-existence of
for identification, which can be weighted in the present inven-
tion (for example, by adjusting bit-addressable information),
is an important factor in adjusting the monitoring or recogni-
tion features of the object or carrier signal, and by using any
misidentification information, (including any experience-
based or heuristic information), additional features of the
65 the information carrier signal (pre-recorded or newly created
information carrier signal, which may require differentiation
in certain markets or instances).
US 8,214,175 B2
13 14
analyzed may become computationally small such that com-
putational speed and efficiency are significantly improved.
With greater compression rates, it is anticipated that simi-
larity may exist between the data compressed abstractions of
different analog signals (e.g., recordings by two different
artists of the same song). The present invention contemplates
the use of bit-addressable differences to distinguish between
such cases. In applications where the data to be analyzed has
higher value in some predetennined sense, cryptographic
10 protocols, such as a hash or digital signature, can be used to
distinguish such close cases.
In the case of predetennined carrier signals (those which
have been recorded and stored for subsequent use), "posi-
tional infonnation carrier signals" are contemplated by this
invention, namely, perceptual differences between the seem-
ingly "same" infonnation carrier that can be recognized as
consumers of information seek different versions or quality
levels of the same carrier signal. Perceptual differences exist
between a song and its reproduction from a CD, an AM radio,
and an Internet broadcast. To the extent that the creator or
consumer of the signal can define a difference in any of the
four criteria above, means can be derived (and programmed
for selectability) to recognize and distinguish these differ-
ences. It is, however, quite possible that the ability to monitor
carrier signal transmission with these factors will increase the
variety and richness of available carrier signals to existing
communications channels. The differentiation between an
absolute case for transmission of an object, which is a time
dependent event, for instance a live or real time broadcast,
versus the relative case, which is prerecorded or stored for
transmission at a later point in time, creates recognizable 20
differences for signal monitoring.
In a preferred embodiment, the present invention may uti-
1ize a centralized database where copies of new recordings
may be deposited to ensure that copyright owners, who autho-
15 rize transmission or use of their recordings by others, can
independently verify that the object is correctly monitored.
The rules for the creator himself to enter his work would differ
from a universally recognized number assigned by an inde-
The monitoring and analysis contemplated by this inven-
tion may have a variety of purposes, including, for example,
the following: to detennine the number of times a song is
broadcast on a particular radio broadcast or Internet site; to 25
control security though a voice-activated security system; and
to identify associations between a beginner's drawing and
those of great artists (for example to draw comparisons
between technique, compositions, or color schemes). None of
these examples could be achieved with any significant degree 30
of accuracy using a text-based analysis. Additionally, strictly
text-based systems fail to fully capture the inherent value of
the data recognition or monitoring information itself.
pendent authority (say, ISRC, ISBN for recordings and books
respectively). Those skilled in the art of algorithmic infonna-
tion theory (AIT) can recognize that it is now possible to
describe optimized use of binary data for content and func-
tionality. The differences between objects must relate to deci-
sions made by the user of the data, introducing subjective or
cognitive decisions to the design of the contemplated inven-
tion as described above. To the extent that objects can have an
optimized data size when compared with other objects for any
given set of objects, the algorithms for data reduction would
have predetennined flexibility directly related to computa-
tional efficiency and the set of objects to be monitored. The
flexibility in having transparent detennination of unique sig-
nal abstracts, as opposed to independent third party assign-
ment, is likely to increase confidence in the monitoring effort
by the owners of the original signals themselves. The prior art
SAMPLE EMBODIMENTS 35 allows for no such transparency to the copyright creators.
Sample Embodiment 1 Sample Embodiment 2
Another embodiment of the invention relates to visual A database of audio signals (e.g., songs) is stored or main-
tained by a radio station or 40 images, which of course, involve at least two dimensions.
Internet streaming company, who may select a subset of the
songs are stored so that the subset may be later broadcast to
listeners. The subset, for example, may comprise a sufficient
number of songs to fill 24 hours of music programming (be-
tween 300 or 500 songs). Traditionally, monitoring is accom- 45
plished by embedding some identifier into the signal, or affix-
ing the identifier to the signal, for later analysis and
determination of royalty payments. Most of the traditional
analysis is performed by actual persons who use play lists and
other statistical approximations of audio play, including for 50
example, data obtained through the manual (i.e., by persons)
monitoring of a statistically significant sample of stations and
transmission times so that an extrapolation may be made to a
larger number of comparable markets.
The present invention creates a second database from the 55
first database, wherein each of the stored audio signals in the
first database is data reduced in a manner that is not likely to
reflect the human perceptual quality of the signal, meaning
that a significantly data-reduced signal is not likely to be
played back and recognized as the original signal. As a result 60
of the data reduction, the size of the second database (as
measured in digital tenns) is much smaller than the size of the
first database, and is detennined by the rate of compression.
If, for example, if 24 hours worth of audio signals are com-
pressed at a 10,000: 1 compression rate, the reduced data 65
could occupy a little more than 1 megabyte of data. With such
a large compression rate, the data to be compared and/or
Similar to the goals of a psychoacoustic model, a psycho-
visual model attempts to represent a visual image with less
data, and yet preserve those perceptual qualities that pennit a
human to recognize the original visual image. Using the very
same techniques described above in connection with an audio
signal, signal monitoring of visual images may be imple-
mented.
One such application for monitoring and analyzing visual
images involves a desire to find works of other artists that
relate to a particular theme. For example, finding paintings of
sunsets or sunrises. A traditional approach might involve a
textual search involving a database wherein the works of
other artists have been described in writing. The present
invention, however, involves the scanning of an image involv-
ing a sun, compressing the data to its essential characteristics
(i.e., those perceptual characteristics related to the sun) and
then finding matches in a database of other visual images
(stored as compressed or even uncompressed data). By study-
ing the work of other artists using such techniques, a novice,
for example, could learn much by comparing the presenta-
tions of a common theme by different artists.
Another useful application involving this type of monitor-
ing and analyzing is the identification of photographs of
potential suspects whose identity matches the sketch of a
police artist.
Note that combinations of the monitoring techniques dis-
cussed above can be used for audio-visual monitoring, such
US 8,214,175 B2
15
as video-transmission by a television station or cable station.
The techniques would have to compensate, for example, for a
cable station that is broadcasting a audio channel unaccom-
panied by video.
Other embodiments and uses of the invention will be appar-
ent to those skilled in the art from consideration of the speci-
fication and practice of the invention disclosed herein. The
specification and examples should be considered exemplary
only with the true scope and spirit of the invention indicated
by the following claims. As will be easily understood by those 10
of ordinary skill in the art, variations and modifications of
each of the disclosed embodiments can be easily made within
the scope of this invention as defined by the following claims.
The invention claimed is:
1. A system, comprising:
non transitory memory comprising a database for storing a
plurality of digital reference signal abstracts;
15
at least one processor; 20
wherein said at least one processor is programmed or struc-
tured to generate a digital reference signal abstract from
a digital reference signal such that said digital reference
signal abstract is similar to said digital reference signal
and reduced in size compared to said digital reference 25
signal; and
wherein said at least one processor is programmed to store
said digital reference signal abstract in said database as
one of said plurality of digital reference signal abstracts;
wherein said non transitory memory further comprises a 30
second database for storing a plurality of second data-
base digital reference signal abstracts;
tured to generate a second database digital reference
signal abstract from said digital reference signal such 35
that said second database digital reference signal
abstract is similar to said digital reference signal and
reduced in size compared to said digital reference signal,
and wherein said second database digital reference sig-
nal abstract is distinct from said digital reference signal 40
abstract; and
said second database digital reference signal abstract in
said second database as one of said plurality of second
database digital reference signal abstracts. 45
2. The system of claim 1, wherein said at least one proces-
sor is programmed or structured to generate said digital ref-
erence signal abstract from said digital reference signal by
using perceptual qualities of said digital reference signal in
generating said digital reference signal abstract such that the 50
abstract retains a perceptual relationship to said digital refer-
ence signal.
3. The system of claim 1 wherein said at least one processor
is programmed or structured to generate a digital reference
signal abstract from a digital reference signal such that said 55
digital reference signal abstract is self similar to said digital
reference signal.
sor is programmed or structured to select criteria to use for
generating said digital reference signal abstract from said 60
digital reference signal.
sor is programmed or structured to generate said digital query
signal abstract from a digital query signal such that said
digital query signal abstract is similar to said digital query 65
signal and reduced in size compared to said digital query
signal.
16
sor is programmed to generate said digital reference signal
abstract.
at least one processor;
and reduced in size compared to said digital reference
signal; and
tured to generate said digital reference signal abstract
from said digital reference signal and at least one of a
hash and a signature, so that each one of said plurality of
digital reference signal abstracts in said database is dis-
tinct from one another.
signal; and
wherein said digital reference signal is a digital represen-
tation of one of a plurality of different versions of a
visual work and a multimedia work, and wherein said at
least one processor is programmed or structured to gen-
erate said digital reference signal abstract from said
digital reference signal so that said digital reference
signal comprises signal characteristic parameters that
differentiate between said plurality of different versions
of said visual work and said multimedia work.
signal; and
tured to determine if said digital reference signal
abstract matches one of said plurality of digital reference
signal abstracts stored in said database; and
wherein said processor is programmed to recalibrate said
database in response to a determination that said digital
reference signal abstract matches one of said plurality of
digital reference signal abstracts stored in said database.
US 8,214,175 B2
17
wherein said at least one processor is progrannned or struc-
signal; and
wherein said at least one processor is programmed to store 10
wherein said processor is programmed or structured to
change selected criteria to use for generating said digital
reference signal abstract from said digital reference sig- 15
nal when said at least one processor determines that said
digital reference signal abstract matches one of said
plurality of digital reference signal abstracts stored in
said database.
11. A system, comprising: 20
tured to generate a digital reference signal abstract from 25
signal; and
said digital reference signal abstract in said database as 30
tured to compare a digital query signal abstract to said
plurality of digital reference signal abstracts stored in
said database to generate a compare result. 35
12. The system of claim 11, wherein said compare result
indicates no match between said digital query signal abstract
to said plurality of digital reference signal abstracts stored in
said database.
13. The system of claim 11, wherein said compare result 40
indicates a match between said digital query signal abstract
and a first digital reference signal abstracts of said plurality of
digital reference signal abstracts stored in said database.
14. The system of claim 11, wherein said memory further
defines a digital query signal abstract receipt recorder record-
ing a number times said at least one processor receives said 45
digital query signal abstract for comparison with said plural-
ity of digital reference signal abstracts stored in said database.
15. The system of claim 11, wherein said memory further
defines a first digital reference signal abstract match recorder
recording a number of times said at least one processor deter- 50
mines a match between a digital query signal abstract and first
digital reference signal abstract of said plurality of digital
reference signal abstracts stored in said database.
16. The system of claim 12, wherein said at least one
processor is programmed or structured to use an algorithm to 55
generate said digital reference signal abstract from said digi-
tal reference signal; and wherein said at least one processor is
programmed or structured to use said algorithm to generate
said digital query signal abstract from said digital query sig-
nal.
60
18
signal; and
wherein said wherein said at least one processor is pro-
grammed or structured to apply at least one of psycho-
acoustic model and a psycho-visual model to generate
said digital reference signal abstract from said digital
reference signal.
18. A method, comprising:
storing in non transitory memory a database for storing a
generating with at least one processor a digital reference
signal abstract from a digital reference signal such that
said digital reference signal abstract is similar to said
digital reference signal and reduced in size compared to
said digital reference signal; and
storing with said at least one processor said digital refer-
ence signal abstract in said database as one of said plu-
rality of digital reference signal abstracts;
wherein said non transitory memory further comprises a
signal abstract from said digital reference signal such
nal abstract is distinct from said digital reference signal
abstract; and
database digital reference signal abstracts.
19. A computer program product stored on non transitory
memory media, which, when installed on a computer system
having at least one processor and non transitory memory,
causes said computer system to perform the steps comprising:
storing in said non transitory memory a database for stor-
ing a plurality of digital reference signal abstracts;
generating with said at least one processor a digital refer-
ence signal abstract from a digital reference signal such
that said digital reference signal abstract is similar to
said digital reference signal and reduced in size com-
pared to said digital reference signal; and
storing with said at least one processor said digital refer-
ence signal abstract in said database as one of said plu-
rality of digital reference signal abstracts;
wherein said non transitory memory further comprises a
signal abstract from said digital reference signal such
nal abstract is distinct from said digital reference signal
abstract; and
database digital reference signal abstracts.
* * * * *
PATENT NO.
APPLICATION NO.
DATED
INVENTOR(S)
UNITED STATES PATENT AND TRADEMARK OFFICE
CERTIFICATE OF CORRECTION
: 8,214,175 B2
: 13/035964
: July 3,2012
: Moskowitz et al.
Page 1 of 1
It is certified that error appears in the above-identified patent and that said Letters Patent is hereby corrected as shown below:
Column 18 lines 7-11 change "wherein said wherein said at least one processor is programmed or
structured to apply at least one of psycho-acoustic model and a psycho-visual model to generate said
digital reference signal abstract from said digital reference signal." to
-- wherein said at least one processor is programmed or structured to apply at least one of
psycho-acoustic model and a psycho-visual model to generate said digital reference signal abstract
from said digital reference signal. --
Signed and Sealed this
Fourth Day of December, 2012
~ J 3 : . t : : ~
David J. Kappos
Director of the United States Patent and Trademark Office
EXHIBIT B
Moskowitz et al.
(75) Inventors: Scott A. Moskowitz, Sunny Isles Beach,
FL (US); Mike W. Berry, Seattle, WA
(US)
(US)
This patent is subject to a terminal dis-
claimer.
(21) Appl. No.: 12/655,357
(22) Filed: Dec. 22, 2009
US 201 0/0106736 Al Apr. 29, 2010
Sep. 7, 2000, now Pat. No. 7,346,472.
(51) Int. Cl.
G06F 19/00 (2006.01)
(52) U.S. Cl. ......... 702/182; 707/EI7.001; 707/EI7.002;
707/EI7.005; 707/EI7.006; 709/209; 705/51;
380/28
(58) Field of Classification Search .................. 7021182;
707/EI7.001, EI7.002, EI7.005, EI7.006;
709/209; 705/51,57; 380/28,248; 370/480;
348/E7.063,460; 375/E7.075, E7.089; 382/248,
3821162,232, 100
(56) References Cited
3,947,825 A 311976 Cassada
3,984,624 A 1011976 Waggener
3,986,624 A 1011976 Cates, Jr. et al.
4,038,596 A 711977 Lee
4,200,770 A 411980 Hellman etal.
4,218,582 A 811980 Hellman etal.
4,339,134 A 711982 Macheel
4,390,898 A 611983 Bondet al.
4,405,829 A 911983 Rivest et al.
4,424,414 A 111984 Hellman etal.
4,528,588 A 711985 Lofberg
4,672,605 A 611987 Hustig et al.
4,748,668 A 511988 Shamir et al.
4,789,928 A 1211988 Fujisaki
4,827,508 A 511989 Shear
4,876,617 A 1011989 Best et al.
4,896,275 A 111990 Jackson
4,939,515 A 711990 Adelson
4,969,204 A 1111990 Jones et aI.
4,972,471 A 1111990 Gross et al.
4,977,594 A 1211990 Shear
111111 1111111111111111111111111111111111111111111111111111111111111
EP
US007949494B2
(10) Patent No.: US 7,949,494 B2
*May 24, 2011 (45) Date of Patent:
4,979,210 A
4,980,782 A
5,050,213 A
5,073,925 A
5,077,665 A
5,113,437 A
5,136,581 A
5,136,646 A
5,136,647 A
5,142,576 A
5,161,210 A
5,210,820 A *
5,243,423 A
5,243,515 A
5,287,407 A
5,319,735 A
5,341,429 A
5,341,477 A
5,363,448 A
5,365,586 A
5,369,707 A
5,379,345 A
5,394,324 A
5,398,285 A
5,406,627 A
5,408,505 A
5,410,598 A
5,412,718 A
5,418,713 A
5,428,606 A
5,450,490 A
5,469,536 A
5,471,533 A
5,478,990 A
5,479,210 A
5,487,168 A
5,493,677 A
5,497,419 A
12/1990 Nagata et aI.
12/1990 Ginkel
9/1991 Shear
12/1991 Nagata et aI.
12/1991 Silverman et al.
5/1992 Best et aI.
8/1992 Muehrcke
8/1992 Haber et al.
8/1992 Haber et al.
8/1992 Nadan
1111992 Druyvesteyn et aI.
5/1993 Kenyon ........................ 704/200
9/1993 Dejean et al.
9/1993 Lee
2/1994 Holmes
6/1994 Preuss et al.
8/1994 Stringer et al.
8/1994 Pitkin et al.
1111994 Koopman et aI.
1111994 Indeck et al.
1111994 Follendore, III
111995 Greenberg
2/1995 Clearwater
3/1995 Borgelt et al.
4/1995 Thompson et al.
4/1995 Indeck et al.
4/1995 Shear
5/1995 Narasimhalv et aI.
5/1995 Allen
6/1995 Moskowitz
9/1995 Jensen et al.
1111995 Blank
1111995 Wang et al.
12/1995 Montanari et al.
12/1995 Cawley et al.
111996 Geiner et al.
2/1996 Balogh et aI.
3/1996 Hill
(Continued)
0372601 6/1990
(Continued)
OTHER PUBLICATIONS
pp. 9-10, 1996.
(Continued)
Primary Examiner - Carol S Tsai
(74) Attorney, Agent, or Firm - Neifeld IP Law, PC
(57) ABSTRACT
US 7,949,494 B2
Page 2
U.S. PATENT DOCUMENTS 5,943,422 A 8/1999 VanWie et al.
5,949,055 A * 9/1999 Fleet et al. .................... 235/469
5,506,795 A 411996 Yamakawa
5,963,909 A 10/1999 Warren et al.
5,513,126 A 411996 Harkins et al.
5,973,731 A 10/1999 Schwab
5,513,261 A 411996 Maher
5,974,141 A 10/1999 Saito
5,530,739 A 611996 Okada
5,991,426 A 1111999 Cox et al.
5,530,751 A 611996 Morris
5,999,217 A 12/1999 Berners-Lee
6,009,176 A 12/1999 Gennaro et al.
5,539,735 A 711996 Moskowitz
6,029,126 A 212000 Malvar
5,548,579 A 811996 Lebrun et al.
6,041,316 A 3/2000 Allen
5,568,570 A 1011996 Rabbani
6,044,471 A 3/2000 Colvin
5,579,124 A 1111996 Aijala et al.
6,049,838 A 4/2000 Miller et al.
5,581,703 A 1211996 Baugher et al.
6,051,029 A 4/2000 Paterson et al.
5,583,488 A 1211996 Sala et al.
6,061,793 A 5/2000 Tewfik et al.
5,598,470 A 111997 Cooper et al.
6,067,622 A 5/2000 Moore
5,606,609 A 211997 Houser et al.
6,069,914 A 5/2000 Cox
5,617,119 A 411997 Briggs et al.
6,081,251 A 6/2000 Sakai et al.
5,625,690 A 411997 Michel et al.
6,081,587 A 6/2000 Reyes et al.
5,629,980 A 511997 Stefik et al.
6,081,597 A 6/2000 Hoffstein et al.
5,633,932 A 511997 Davis et al.
6,088,455 A * 7/2000 Logan et al. .................. 3801200
5,634,040 A 511997 Her et al.
6,131,162 A 1012000 Yoshiura et al.
5,636,276 A 611997 Brugger
6,141,753 A 1012000 Zhao et al.
5,636,292 A 611997 Rhoads
6,141,754 A 1012000 Choy
5,640,569 A 611997 Miller et al.
6,148,333 A 1112000 Guedalia
5,646,997 A 711997 Barton
6,154,571 A 1112000 Cox et al.
5,657,461 A 811997 Harkins et al.
6,192,138 Bl 2/2001 Yarnadaji
6,199,058 Bl 3/2001 Wong etal.
5,664,018 A 911997 Leighton
6,205,249 Bl 3/2001 Moskowitz
5,673,316 A 911997 Auerbach et al.
6,208,745 Bl 3/2001 Florencio et al.
5,677,952 A 1011997 Blakley et al.
6,226,618 Bl 5/2001 Downs
5,680,462 A 1011997 Miller et al.
6,230,268 Bl 5/2001 Miwaetal.
5,687,236 A 1111997 Moskowitz et al.
6,233,347 Bl 5/2001 Chen et al.
5,689,587 A 1111997 Bender et al.
6,233,684 Bl 5/2001 Stefik et al.
5,696,828 A 1211997 Koopman, Jr.
6,240,121 Bl 5/2001 Senoh
5,719,937 A 211998 Warren et al.
6,263,313 Bl 7/2001 Milsted et al.
5,721,788 A 211998 Powell et al.
6,272,634 Bl 8/2001 Tewfik et al.
5,734,752 A 311998 Knox
5,737,416 A 411998 Cooper et al.
6,278,780 Bl 8/2001 Shimada
5,737,733 A 411998 Eller
5,740,244 A 411998 Indeck et al.
6,282,300 Bl 8/2001 Bloom et al.
6,282,650 Bl 8/2001 Davis
5,748,783 A 511998 Rhoads
6,285,775 Bl 9/2001 Wu et al.
5,751,811 A 511998 Magnotti et al.
6,301,663 Bl 10/2001 Kato et al.
5,754,697 A 511998 Fu et al.
6,310,962 Bl 10/2001 Chung et al.
5,757,923 A 511998 Koopman, Jr.
6,330,335 Bl 12/2001 Rhoads
5,765,152 A 611998 Erickson
6,330,672 Bl 12/2001 Shur
5,768,396 A 611998 Sone
6,345,100 Bl 212002 Levine
5,774,452 A 611998 Wolosewicz
5,790,677 A 811998 Fox et al.
6,363,483 Bl 3/2002 Keshav
5,799,083 A 811998 Brothers et al.
6,373,892 Bl 4/2002 !chien et al.
5,809,139 A 911998 Girod et al.
6,373,960 Bl 4/2002 Conover et al.
5,809,160 A 911998 Powell et al.
6,374,036 Bl 4/2002 Ryanet al.
5,818,818 A 1011998 Soumiya
6,377,625 Bl 4/2002 Kim
5,822,432 A 1011998 Moskowitz et al.
6,381,618 Bl 4/2002 Jones et al.
5,828,325 A 1011998 Wolose Wicz et al.
6,381,747 Bl 4/2002 Wonforetal.
5,832,119 A 1111998 Rhoads
6,385,324 Bl 5/2002 Koppen
5,842,213 A 1111998 Odom
6,385,329 Bl * 5/2002 Sharma et al. ................ 382/100
5,848,155 A 1211998 Cox
6,385,596 Bl 5/2002 Wiser
5,850,481 A 1211998 Rhoads
6,389,538 Bl 5/2002 Gruse et al.
5,859,920 A 111999 Daly et al.
6,405,203 Bl 6/2002 Collart
5,860,099 A 111999 Milios et al.
6,415,041 Bl 7/2002 Oarni et al.
5,862,260 A 111999 Rhoads
6,418,421 Bl 7/2002 Hurtado
5,870,474 A 211999 Wasilewski et al.
6,425,081 Bl 7/2002 Iwarnura
5,884,033 A 311999 Duvall et al.
6,430,301 Bl 8/2002 Petrovic
6,430,302 B2 8/2002 Rhoads
5,893,067 A 411999 Bender et al.
6,442,283 Bl 8/2002 Tewfik et al.
5,894,521 A 411999 Conley
6,446,211 Bl 912002 Colvin
5,903,721 A 511999 Sixtus
6,453,252 Bl 912002 Laroche
6,457,058 Bl 912002 Ullumet al.
5,905,975 A 511999 Ausubel
6,463,468 Bl 1012002 Buch et al.
5,912,972 A 611999 Barton
6,484,264 Bl 1112002 Colvin
5,915,027 A 611999 Cox et al.
6,493,457 Bl 1212002 Quackenbush
5,917,915 A 611999 Hirose
6,502,195 Bl 1212002 Colvin
5,918,223 A 611999 Blum
6,522,767 Bl 212003 Moskowitz et al.
5,920,900 A 711999 Poole et al.
5,923,763 A 711999 Walker et al.
6,522,769 Bl 212003 Rhoads et al.
5,930,369 A 711999 Cox et al. 6,523,113 Bl 212003 Wehrenberg
5,930,377 A 711999 Powell et al. 6,668,325 Bl 212003 Collberg et al.
5,940,134 A 811999 Wirtz 6,530,021 Bl 3/2003 Epstein et al.
US 7,949,494 B2
Page 3
6,532,284 B2 3/2003 Walker et al. 7,647,502 B2 112010 Moskowitz
6,539,475 Bl 3/2003 Cox et al. 7,647,503 B2 112010 Moskowitz
6,557,103 Bl 4/2003 Boncelet, Jr. et al. 7,664,263 B2 212010 Moskowitz
6,584,125 Bl 6/2003 Katto 7,743,001 Bl 6/2010 Vermeulen
6,587,837 Bl 7/2003 Spagna et al. 7,761,712 B2 6/2010 Moskowitz
6,590,996 Bl * 7/2003 Reed et al. .................... 382/100 7,779,261 B2 812010 Moskowitz
6,598,162 Bl 7/2003 Moskowitz 200110010078 Al 7/2001 Moskowitz
6,606,393 Bl 8/2003 Xie et al. 200110029580 Al 10/2001 Moskowitz
6,647,424 Bl 1112003 Pearson et al. 200110043594 Al * 1112001 Ogawaet al. ................. 370/356
6,658,010 Bl 12/2003 Enns et al. 200210009208 Al * 112002 Alattar et al. ................. 382/100
6,665,489 B2 12/2003 Collart 200210010684 Al 112002 Moskowitz
6,668,246 Bl 12/2003 Yeung etal. 200210026343 Al 212002 Duenke
6,674,858 Bl 112004 Kimura 200210056041 Al 5/2002 Moskowitz
6,687,683 Bl 212004 Harada et al. 200210047873 Al 6/2002 Petrovic
6,725,372 Bl 4/2004 Lewis et al. 200210071556 Al 6/2002 Moskowitz et al.
6,754,822 Bl 6/2004 Zhao 200210073043 Al 6/2002 Herman et al.
6,775,772 Bl 8/2004 Binding et al. 200210097873 Al 7/2002 Petrovic
6,784,354 Bl 8/2004 Lu et al. 200210103883 Al 8/2002 Haverstock et al.
6,785,815 Bl 8/2004 Serret-Avila et al. 200210161741 Al 10/2002 Wang etal.
6,785,825 B2 8/2004 Colvin 2003/0126445 Al 7/2003 Wehrenberg
6,792,548 B2 912004 Colvin 2003/0133702 Al 7/2003 Collart
6,792,549 B2 912004 Colvin 2003/0200439 Al 1012003 Moskowitz
6,795,925 B2 912004 Colvin 2003/0219143 Al 1112003 Moskowitz et al.
6,799,277 B2 912004 Colvin 2004/0028222 Al 212004 Sewell et al.
6,813,717 B2 1112004 Colvin 2004/0037449 Al 212004 Davis et al.
6,813,718 B2 1112004 Colvin 2004/0049695 Al 3/2004 Choi et al.
6,823,455 Bl 1112004 Macyet al. 2004/0059918 Al 3/2004 Xu
6,834,308 Bl 1212004 Ikezoye et al. 2004/0083369 Al 4/2004 Erlingsson et al.
6,842,862 B2 112005 Chow et al. 2004/0086119 Al 5/2004 Moskowitz
6,853,726 Bl 212005 Moskowitz et al. 2004/0093521 Al 5/2004 Hamadeh et al.
6,857,078 B2 212005 Colvin 2004/0117628 Al 6/2004 Colvin
6,931,534 Bl 8/2005 Jandel et al. 2004/0117664 Al 6/2004 Colvin
6,957,330 Bl 1012005 Hughes 2004/0125983 Al 7/2004 Reed et al.
6,966,002 Bl 1112005 Torrubia-Saez 2004/0128514 Al 7/2004 Rhoads
6,983,337 B2 1112005 Wold 2004/0225894 Al 1112004 Colvin
6,977,894 Bl 1212005 Achilles et al. 2004/0243540 Al 1212004 Moskowitz et al.
6,978,370 Bl 1212005 Kocher 2005/0135615 Al 6/2005 Moskowitz et al.
6,986,063 B2 112006 Colvin 2005/0160271 A9 712005 Brundage et al.
6,990,453 B2 112006 Wang 2005/0177727 Al 8/2005 Moskowitz et al.
7,007,166 Bl 212006 Moskowitz et al. 2005/0246554 Al 1112005 Batson
7,020,285 Bl 3/2006 Kirovski et al. 2006/0005029 Al 112006 Petrovic et al.
7,035,049 B2 4/2006 Yamamoto 2006/0013395 Al 112006 Brundage et al.
7,035,409 Bl 4/2006 Moskowitz 2006/0013451 Al 112006 Haitsma
7,043,050 B2 5/2006 Yuval 2006/0041753 Al 212006 Haitsma
7,046,808 Bl 5/2006 Metois et al. 2006/0101269 Al 5/2006 Moskowitz et al.
7,050,396 Bl 5/2006 Cohen et al. 2006/0140403 Al 6/2006 Moskowitz
7,051,208 B2 5/2006 Venkatesan et al. 2006/0251291 Al 1112006 Rhoads
7,058,570 Bl 6/2006 Yu et al. 2006/0285722 Al 1212006 Moskowitz et al.
7,093,295 Bl 8/2006 Saito 2007/0011458 Al 112007 Moskowitz
7,095,874 B2 8/2006 Moskowitz et al. 2007/0028113 Al 212007 Moskowitz
7,103,184 B2 912006 Jian 2007/0064940 Al 3/2007 Moskowitz et al.
7,123,718 Bl 1012006 Moskowitz et al. 2007/0083467 Al 4/2007 Lindahl et al.
7,150,003 B2 1212006 Naumovich et al. 2007/0113094 Al 5/2007 Moskowitz et al.
7,152,162 B2 1212006 Moskowitz et al. 2007/0127717 Al 6/2007 Herre et al.
7,159,116 B2 112007 Moskowitz 2007/0226506 Al 912007 Moskowitz
7,162,642 B2 112007 Schumann et al. 2007/0253594 Al 1112007 Lu et al.
7,177,429 B2 212007 Moskowitz et al. 2007/0294536 Al 1212007 Moskowitz et al.
7,177,430 B2 212007 Kim 2007/0300072 Al 1212007 Moskowitz
7,206,649 B2 4/2007 Kirovski et al. 2007/0300073 Al 1212007 Moskowitz
7,231,524 B2 6/2007 Burns 2008/0005571 Al 112008 Moskowitz
7,233,669 B2 6/2007 Candelore 2008/0005572 Al 112008 Moskowitz
7,240,210 B2 7/2007 Michaketal. 2008/0016365 Al 112008 Moskowitz
7,266,697 B2 912007 Kirovski et al. 2008/0022113 Al 112008 Moskowitz
7,286,451 B2 1012007 Wirtz et al. 2008/0022114 Al 112008 Moskowitz
7,287,275 B2 1012007 Moskowitz 2008/0028222 Al 112008 Moskowitz
7,289,643 B2 1012007 Brunk et al. 2008/0046742 Al 212008 Moskowitz
7,343,492 B2 3/2008 Moskowitz et al. 2008/0075277 Al 3/2008 Moskowitz et al.
7,346,472 Bl 3/2008 Moskowitz et al. 2008/0109417 Al 5/2008 Moskowitz
7,362,775 Bl 4/2008 Moskowitz 2008/0133927 Al 6/2008 Moskowitz et al.
7,363,278 B2 4/2008 Schmelzer et al. 2008/0151934 Al 6/2008 Moskowitz et al.
7,409,073 B2 8/2008 Moskowitz et al. 200910037740 Al 212009 Moskowitz
7,4 57 ,962 B2 1112008 Moskowitz 200910089427 Al 4/2009 Moskowitz et al.
7,460,994 B2 1212008 Herre et al. 200910190754 Al 7/2009 Moskowitz et al.
7,475,246 Bl 112009 Moskowitz 200910210711 Al 8/2009 Moskowitz
7,530,102 B2 5/2009 Moskowitz 200910220074 Al 912009 Moskowitz et al.
7,532,725 B2 5/2009 Moskowitz et al. 201010002904 Al 112010 Moskowitz
7,568,100 Bl 7/2009 Moskowitz et al. 201010005308 Al 112010 Moskowit
US 7,949,494 B2
Page 4
201010064140 Al 3/2010 Moskowitz
201010077219 Al 3/2010 Moskowitz
201010077220 Al 3/2010 Moskowitz
201010098251 Al 4/2010 Moskowitz
201010106736 Al 4/2010 Moskowitz
201010153734 Al 6/2010 Moskowitz
201010182570 Al 7/2010 Chota
201010202607 Al 812010 Moskowitz
201010220861 Al 912010 Moskowitz
EP 0372601 Al 6/1990
EP 0565947 10/1993
EP 0565947 Al 10/1993
EP 0581317 2/1994
EP 0581317 A2 2/1994
EP 0649261 4/1995
EP 0651554 5/1995
EP 0651554 A 5/1995
EP 0872073 7/1996
EP 1547337 3/2006
EP 1354276 1212007
EP 1354276 Bl 1212007
NL 100523 9/1998
NL 1005523 9/1998
WO WO 95114289 5/1995
WO WO 9514289 5/1995
WO W09701892 6/1995
WO WO 96/29795 911996
WO WO 9629795 9/1996
WO WO 9642151 12/1996
WO W09726733 111997
WO WO 97/24833 7/1997
WO WO 9724833 7/1997
WO W09726732 7/1997
WO WO 9744736 1111997
WO W09802864 111998
WO W098/37513 8/1998
WO W09837513 8/1998
WO WO 9952271 10/1999
WO WO 99/62044 12/1999
WO W09962044 12/1999
WO WO 9963443 12/1999
WO WO 0057643 912000
WO WOO 118628 3/2001
WO WOO143026 6/2001
WO W00203385 112002
WO W002003385 Al 10/2002
OTHER PUBLICATIONS
Menezes, Alfred J., Handbook of Applied Crypography, CRC Press,
p. 46, 1997.
Copeland, et aI., Real Options:A Practioner's Guide, 2001 pp. 106-
107,201-202,204-208.
Sarkar, M. "An Assessment of Pricing Mechanisms for the Internet-A
Regulatory Imperative", presented MIT Workshop on Internet Eco-
nomics, Mar. 1995 http://www.press.vmich.edulien/works/
SarkAsses.html on.
Crawford, D.W. "Pricing Network Usage: A Market for Bandwith of
Market Communication?" presented MIT Workshop on Internet Eco-
nomics, Mar. 1995 http://www.press.vmich.edulien/works/
CrawMarket.htrnl on March.
Bruggemann and W Gerhardt-Hackel (Ed.) Viewing Publishing
Watermarks", Proc. of the european conf. on Mulitmedia Applica-
tions, Services & Techinques Louvain-La-Nevve Belgium May
1996.
Gruhl,Daniei et al.,Echo Hiding. In Proceeding of the Workshop on
Information Hiding. No. 1174 in Lecture Notes in Computer Science,
Cambridge, England (May/Jun. 1996).
Oomen,A.W.J. et al., A Variable Bit Rate Buried Data Channel for
Compact Disc, J.Audio Eng.Sc.,vol. 43,No. 1I2,pp. 23-28 (1995).
Ten Kate,W: et aI., A New Surround-Stereo-Surround Coding Tech-
niques, J. Audio Eng.Soc.,vol. 40,No. 5,pp. 376-383 (1992).
(1993).
Sklar,Bernard, Digital Communications, pp. 601-603 (1988).
Englewood Cliffs,NJ, pp. 486-509 (1984).
Opt. Eng., vol. 2420, pp. 164-173, 1995.
p. 175, 1997.
ten Kate, W. et aI., "Digital Audio Carrying Extra Information",
IEEE, CH 2847-21901000-1097, (1990).
van Schyndel, et al. A digital Watermark, IEEE Int'I Computer Pro-
cessing Conference, Austin,TX, Nov. 13-16, 1994, pp. 86-90.
Smith, et al. Modulation and Information Hiding in Images, Springer
Verlag, 1 st Int'I Workshop, Cambridge, UK, May 30-Jun. 1, 1996, pp.
207-227.
Puate, Joan et aI., Using Fractal Compression Scheme to Embed a
Digital Signature into an Image, SPIE-96 Proceedings, vol. 2915,
Mar. 1997, pp. 108-118.
Swanson, Mitchell D.,et al., Transparent Robust Image Watermark-
ing, Proc. of the 1996 IEEE Int'I Conf. on Image Processing, vol. 111,
1996, pp. 211-214.
Swanson, Mitchell D. et al. Robust Data Hiding for Images, 7th IEEE
Digital Signal Processing Workshop, Leon, Norway. Sep. 1-4, 1996,
pp.37-40.
right Protection, Proceeding of the Know Right '95 Conference, pp.
242-251.
Koch, E., et aI., Towards Robust and Hidden Image Copyright Label-
ing, 1995 IEEE Workshop on Nonlinear Signal and Image Process-
ing, Jun. 1995 Neos Marmaras p. 4.
Van Schyandel, et al. Towards a Robust Digital Watermark, Second
Asain Image Processing Conference, Dec. 6-8, 1995,Singapore, vol.
2,pp. 504-508.
Tirkel,A.Z., A Two-Dimensional Digital Watermark, DICTA '95,
Tirkel,A.Z., Image Watermarking-A Spread Spectrum Application,
ISSSTA '96, Sep. 1996, Mainz, German, pp. 6.
O'Ruanaidh, et al. Watermarking Digital Images for Copyright Pro-
tection, IEEE Proceedings, vol. 143, No.4, Aug. 1996, pp. 250-256.
NEC Research Institude, Techinal Report 95-10, p. 33.
Kahn, D., The Code Breakers, The MacMillan Company, 1969, pp.
xIII, 81-83,513,515,522-526,873.
Boney, et aI., Digital Watermarks for Audio Signals, EVSIPCO, 96,
pp.473-480.
ft The Netherlands,Cr.C. Langelaar et al.,Copy Protection for
Mulitmedia Data based on Labeling Techniques Jul. 19969 pp.
Craver, et aI., Can Invisible Watermarks Resolve Rightful Owner-
ships? IBM Research Report, RC 20509 (Jul. 25, 1996) 21 pp.
Press, et aI., Numerical Recipes in C, Cambridge Univ. Press, 1988,
pp.398-417.
Pohlmann, Ken c., Principles of Digital Audio, 3rd Ed., 1995, pp.
32-37,40-48,138,147-149,332,333,364, 499-501,508-509,564-571.
Pohlmann, Ken C., Principles of Digital Audio, 2nd Ed., 1991, pp.
1-9,19-25,30-33,41-48,54-57,86-107,375-387.
Schneier, Bruce, Applied Cryptography, John Wiley & Sons, inc.,
New York, 1994, pp. 68,69,387-392,1-57,273-275,321-324.
Boney, et al., Digital Watermarks for Audio Signals, Proceedings of
17-23, 1996, Hiroshima, Japan, 0-8186-7436-9196, pp. 473-480.
US 7,949,494 B2
Page 5
Johnson, et al., Transform Permuted Watermarking for Copyright
Protection of Digital Video, IEEE Globecom 1998, Nov. 8-12,1998,
New York, New York, vol. 2,1998, pp. 684-689,(ISBNO-7803-4985-
7).
Rivest, et aI., "Pay Word and Micromint: Two Simple Micropayment
May 7, 1996, pp. 1-18.
Bender, et aI., Techniques for Data Hiding, IBM Systems Journal,
vol. 35, Nos. 3 & 4, 1996,pp. 313-336.
Moskowitz, Bandwith as Currency, IEEE Multimedia, Jan.-Mar.
2003, pp. 14-21.
tal Watermarking: Trade-offs of Security, Robustness and Quality",
IEEE Computer Society Proceedings ofITCC 2002 Apr. 10,2002 pp.
80-84.
("IWDW" 2006), Springer Lecture Notes in Computer Science,2006,
(to appear) 13.
from the CRI Content Security Research Initiative, Crytography
Research, Inc. 2002-2003, 14 pages.
Society Computer Conference (Spring), Mar. 5, 1995, pp. 20-25, vol.
CONF40.
tems, Sep. 30, 1998, pp. 1501-1510, vol. 30, No. 16-18, NI, North
Holland.
Konrad, K. et aI., "Trust and Elecronic Commerce-more than a
techinal problem," Proceedings of the 18th IEEE Symposium on
Reliable Distributed Systems Oct. 19-22, 1999 pp. 360-365
Lausanne.
Kini, A. et al., "Trust in Electronic Commerce: Definition and Theo-
retical Considerations", Proceedings of the 31 st Hawaii Int'I Conf on
System Sciences (Cat. No. 98TBI00216), Jan. 6-9,1998, pp. 51-61,
Los.
USA.
of the IEEE, Special Issue, Identification & Protection of Multimedia
Information, pp. 1079-1107 Jul. 1999 vol. 87 No.7 IEEE.
Rivest,et aI., PayWord and MicroMint: Two simple micropayment
schemes, MIT Laboratory for Computer Science, Cambridge, MA
02139, Apr. 27, 2001, pp. 1-18.
Horowitz, et aI., The Art of Electronics, 2nd Ed., 1989, pp. 7.
Delaigle, J.-F., et al. "Digital Watermarking," Proceedings of the
SPIE, vol. 2659, Feb 1, 1996, pp. 99-110 (Abstract).
Schneider, M., et al. "Robust Content Based Digital Signature for
on Image Processing (Ie. Lausanne), Sep. 16-19, 1996, pp. 227-230,
IEEE ISBN.
1, 1997,pp. 1673-1686.
cessing, vol. 1, Oct. 4-7, 1998, pp. 455-459.
14-17, 1998, pp. 218-238, ISBN: 3-540-65386-4.
Translation Invariant Digital Image Watermarking", pre-publication,
Summer 19974 pages.
Signal Processing Aug. 21, 1997 19 pages.
Rivest, R. "Chaffing and Winnowing: Confidentiality without
Encryption", MIT Lab for Computer Science, http://people.csail.mit.
edu/rivestl Chaffing.txt, Apr. 24, 1998, 9 pp.
PortalPlayer, PP502 digital media management system-on-chip,
May 1, 2003, 4 pp.
VeriDisc, "The search for a Rational Solution to Digital Rights Man-
agement (DRM)", http://64.244.235.240/news/whitepaper/docs/
veridisc_white_paper.pdf, 2001,15 pp.
Cayre, et al., "Kerckhoff's-Based Embedding Security Classes for
WOA Data Hiding". IEEE Transactions on Information Forensics
and Security, vol. 3 No.1, Mar. 2008, 15 pp.
Wayback Machine, dated Jan. 17, 1999, http://vveb.archive.org/web/
19990 117020420/http://www.netzero.comi, accessed on Feb. 19,
2008.
Namgoong, H., "An Integrated Approach to Legacy Data for Multi-
media Applications", Proceedings of the 23rd EUROMICRO Con-
ference, vol., Issue 1-4, Sep. 1997, pp. 387-391.
Wayback Machine, dated Aug. 26, 2007, http://web.archive.org/web/
20070826151732/http://www.screenplaysmag.comitabidl96/
articieTypel ArticieView/articieIdl495IDefault.aspx/.
"YouTube Copyright Policy: Video Identification tool-YouTube
Help", accessed Jun. 4, 2009, http://www.google.comisupportl
youtube/bin/answer.py?hl 3 pp.
PCT International Search Report, completed Sep. 13, 1995; autho-
rized officer Huy D. Vu (PCTIUS95/08159) (2 pages).
PCT International Search Report, completed Jun. 11, 1996; autho-
rized officer Salvatore Cangialosi (PCTIUS96/10257) (4 pages).
Supplementary European Search Report, completed Mar. 5, 2004;
authorized officer J. Hazel (EP 96 91 9405) ( 1 page).
PCT International Search Report, completed Apr. 4, 1997; authorized
officer Bernarr Earl Gregory (PCTIUS97/00651) (1 page).
PCT International Search Report, completed May 6, 1997; autho-
rized officer Salvatore Cangialosi (PCT IUS97 100652) (3 pages).
PCT International Search Report, completed Oct. 23, 1997; autho-
rized officer David Cain (PCTIUS97/11455) (1 page).
PCT International Search Report, completed Jul. 12, 1999; autho-
rized officer R. Hubeau (PCTIUS99107262) (3 pages).
PCT International Search Report, completed Jun. 30, 2000; autho-
rized officer Paul E. Callahan (PCTIUSOOI06522) (7 pages).
Supplementary European Search Report, completed Jun. 27, 2002;
authorized officer M. Schoeyer (EP 00 91 9398) (1 page).
PCT International Search Report, date of mailing Mar. 15, 2001;
authorized officer Marja Brouwers (PCTIUSOO/18411) (5 pages).
PCT International Search Report, completed Jul. 20, 2001; autho-
rized officer A. Sigolo (PCTIUSOO/18411) (5 pages).
PCT International Search Report, completed Mar. 20, 2001; autho-
rized officer P. Corcoran (PCTIUSOO/33126) (6 pages).
PCT International Search Report, completed Jan. 26, 2001; autho-
rized officer G. Barron (PCTIUSOOI21189) (3 pages).
European Search Report, completed Oct. 15,2007; authorized officer
James Hazel (EP 07 11 2420) (9 pages).
STAIND (The Singles 1996-2006), Warner Music-Atlantic, Pre-
Arctic Monkeys (Whatever People Say I Am, That's What I'm Not),
Domino Recording Co. Ltd., Pre-Release CD image, 2005, 1 page.
Radiohead ("Hail To The Thief'), EMT Music Group-Capitol,
Pre-Release CD image, 2003, 1 page.
OASIS (Dig OutYour Soul), Big Brother Recordings Ltd., Promotion
CD image, 2009, 1 page.
U.S. Appl. No. 08/999,766, filed Jul. 23, 1997, entitled
"Steganographic Method and Device", published as 7 568100 Jul. 28,
2009.
EPO Application No. 96919405.9, entitled "Steganographic Method
and Device"; published as EP0872073 (A2), Oct. 21, 1998.
U.S. Appl. No. 111050,779, filed Feb. 7, 2005, entitled
"Steganographic Method and Device", published as 20050177727
Al Aug. 11, 2005.
U.S. Appl. No. 08/674,726, filed Jul. 2, 1996, entitled "Exchange
Mechanisms for Digital Information Packages with Bandwidth
US 7,949,494 B2
Page 6
Securitization, Multichannel Digital Watermarks, and Key Manage-
ment", published as 7362775 Apr. 22, 2008.
U.S. App!. No. 09/545,589, filed Apr. 7, 2000, entitled "Method and
System for Digital Watermarking", published as 7007166 Feb. 28,
2006.
U.S. App!. No. 111244,213, filed Oct. 5, 2005, entitled "Method and
System for Digital Watermarking", published as 2006-0101269 Al
May 11, 2006, cited herein as P36.
U.S. App!. No. 111649,026, filed Jan. 3, 2007, entitled "Method and
System for Digital Watermarking", published as 2007-0113094 Al
May 17, 2007.
U.S. App!. No. 091046,627, filed Mar. 24, 1998, entitled "Method for
Combining Transfer Function with Predetermined Key Creation",
published as 6,598,162 Ju!. 22, 2003.
U.S. App!. No. 10/602,777, filed Jun. 25, 2003, entitled "Method for
published as 2004-0086119 Al May 6, 2004.
U.S. App!. No. 091053,628, filed Apr. 2, 1998, entitled "Multiple
Transform Utilization and Application for Secure Digital
Watermarking", 6,205,249 Mar. 20, 2001.
U.S. App!. No. 09/644,098, filed Aug. 23, 2000, entitled "Multiple
Watermarking", published as 7,035,409 Apr. 25, 2006.
Jap. App. No. 2000-542907, entitled "Multiple Transform Utilization
and Application for Secure Digital Watermarking"; which is a JP
national stage of PCTIUSI9991007262, published as WO/19991
052271, Oct. 14, 1999.
U.S. App!. No. 091767,733, filed Jan. 24, 2001 entitled "Multiple
Watermarking", published as 2001-0010078 Al Ju!. 26, 2001.
U.S. App!. No. 111358,874, filed Feb. 21, 2006, entitled "Multiple
Watermarking", published as 2006-0140403 Al Jun. 29, 2006.
U.S. App!. No. 10/417,231, filed Apr. 17,2003, entitled "Methods,
Systems And Devices For Packet Watermarking And Efficient Pro-
visioning Of Bandwidth", published as 2003-0200439 Al Oct. 23,
2003.
U.S. App!. No. 091789,711, filed Feb. 22, 2001, entitled "Optimiza-
tion Methods for the Insertion, Protection, and Detection of Digital
Watermarks in Digital Data", publishedas2001-0029580Al Oct. 11,
2001.
U.S. App!. No. 111497,822, filedAug. 2, 2006, entitled "Optimization
Methods for the Insertion, Protection, and Detection of Digital Water-
marks in Digital Data", published as 2007-0011458Al Jan. 11, 2007.
U.S. App!. No. 111599,964, filed Nov. 15,2006, entitled "Optimiza-
Watermarks in Digital Data", published as 2008-0046742 Al Feb. 21,
2008.
U.S. App!. No. 111599,838, filed Nov. 15,2006, entitled "Optimiza-
Watermarks in Digital Data", published as 2007-0226506 Al Sep.
27,2007.
U.S. App!. No. 10/369,344, filed Feb. 18,2003, entitled "Optimiza-
Watermarks in Digitized Data", published as 2003-0219143 Al Nov.
27,2003.
U.S. App!. No. 111482,654, filed Ju!. 7, 2006, entitled "Optimization
Methods for the Insertion, Protection, and Detection of Digital Water-
marks in Digitized Data", published as 2006-0285722 Al Dec. 21,
2006.
U.S. App!. No. 09/594,719, filed Jun. 16, 2000, entitled "Utilizing
Data Reduction in Steganographic and Cryptographic Systems",
published as 7,123,718 Oct. 17,2006.
U.S. App!. No. 111519,467, filed Sep. 12, 2006, entitled "Utilizing
published as 2007-0064940 Al Mar. 22, 2007.
U.S. App!. No. 091731,040, filed Dec. 7, 2000, entitled "Systems,
Methods And Devices For Trusted Transactions", 2002-0010684 Al
Jan. 24, 2002.
U.S. App!. No. 111512,701, filed Aug. 29, 2006, entitled "Systems,
Methods and Devices for Trusted Transactions", published as 2007-
0028113 Al Feb. 1,2007.
U.S. App!. No. 10/049,101, filed Feb. 8, 2002, entitled "A Secure
Personal Content Server", published as 7,475,246 Jan. 6, 2009.
PCT Application No. PCTIUSOOI21189, filed Aug. 4, 2000, entitled,
"A Secure Personal Content Server", Pub. No. WOl2001l018628 ;
Publication Date: Mar. 15,2001.
U.S. App!. No. 09/657,181, filed Sep. 7, 2000, entitled "Method and
Device For Monitoring And Analyzing Signals", published as
7,346,472 Mar. 18,2008.
U.S. App!. No. 10/805,484, filed Mar. 22, 2004, entitled "Method
And Device For Monitoring And Analyzing Signals", published as
2004-0243540 Al Dec. 2, 2004.
U.S. App!. No. 091956,262, filed Sep. 20, 2001, entitled "Improved
Security Based on Subliminal and Supraliminal Channels For Data
Objects", published as 2002-0056041 Al May 9,2002.
U.S. App!. No. 111518,806, filed Sep. 11,2006, entitled "Improved
Security Based on Subliminal and Supraliminal Channels For Data
Objects", 2008-0028222 Al Jan. 31, 2008.
U.S. App!. No. 111026,234, filed Dec. 30, 2004, entitled "Z-Trans-
form Implementation of Digital Watermarks", published as 2005-
0135615 Al Jun. 23, 2005.
U.S. App!. No. 111592,079, filed Nov. 2, 2006, entitled "Linear Pre-
dictive Coding Implementation of Digital Watermarks", published as
2007-0079131 Al Apr. 5,2007.
U.S. App!. No. 091731,039, filed Dec. 7, 2000, entitled "System and
Methods for Permitting Open Access to Data Objects and for Secur-
ing Data within the Data Objects", published as 2002-0071556 Al
Jun. 13, 2002.
U.S. App!. No. 111647,861, filed Dec. 29, 2006, entitled "System and
Methods for Permitting Open Access to Data Objects and for Secur-
ing Data within the Data Objects", published as 2007-0110240 Al
May 17, 2007.
Merriam-Webster's Collegiate Dictionary, 10th Ed., Merriam
Van Schyndel, et a!., "A digital Watermark," IEEE Int'l Computer
Kutter, Martin et a!., "Digital Signature of Color Images Using
Amplitude Modulation", SPIE-EI97, vo!' 3022, pp. 518-527.
Tomsich, et a!., "Towards a secure and de-centralized digital
(ECWEB)(2000).
Kini, et a!., "Trust in Electronic Commerce: Definition and Theoreti-
cal Considerations", Proceedings of the 31st Hawaii Int'l Conf on
System Sciences (Cat. No. 98TBI00216). Jan. 6-9,1998. pp. 51-61.
Los.
U.S. App!. No. 60/169,274, filed Dec. 7, 1999, entitled "Systems,
Methods And Devices For Trusted Transactions".
U.S. App!. No. 60/234,199, filed Sep. 20, 2000, "Improved Security
Based on Subliminal and Supraliminal Channels for Data Objects".
U.S. App!. No. 09/671,739, filedSep. 29, 2000, entitled "Method And
Device For Monitoring And Analyzing Signals".
Tirkel, A.Z., "A Two-Dimensional Digital Watermark", Scientific
Technology, 686, 14, date unknown.
PCT International Search Report in PCT/US99107262.
PCT International Search Report in PCT/US00I18411.
PCT International Search Report in PCT/USOO/33126.
Delaigle, l-F., et a!. "Digital Watermarking," Proceedings of the
SPIE, vo!' 2659, Feb 1, 1996, pp. 99-110.
U.S. App!. No. 12/665,002, filed Dec. 22, 2009, entitled "Method for
published as 20100182570 Al Ju!. 22, 2010, P76.
U.S. App!. No. 12/592,331, filed Nov. 23, 2009, entitled "Optimiza-
Watermarks in Digital Data", published as 20100077220 Al Mar. 25,
2010, P77.
US 7,949,494 B2
Page 7
U.S. Appi. No. 12/590,553, filed Nov. 10,2009, entitled "Optimiza-
Watermarks in Digital Data", published as 20100077219 Al Mar. 25,
2010, P78.
U.S. Appi. No. 12/590,681, filed Nov. 12,2009, entitled "Optimiza-
Watermarks in Digital Data", published as 20100064140Al Mar. 11,
2010, P79.
U.S. Appi. No. 12/655,036, filed Dec. 22, 2009, entitled "Utilizing
published as 20100153734 Al Jun. 17, 2010, P80.
U.S. Appi. No. 12/655,357, filed Dec. 22, 2009, entitled "Method
And Device For Monitoring And Analyzing Signals", published as
20100106736 Al Apr. 29, 2010, P81.
PCT Application No. PCT IUS9 5/08159, filed Jun. 26, 1995, entitled,
"Digital Information Commodities Exchange with Virtual Menu-
ing", published as W0/1997/001892; Publication Date: Jan, 16,
1997, F24.
PCT Application No. PCTIUS96/10257, filed Jun. 7, 1996, entitled
"Steganographic Method and Device"---corresponding to-EPO
Application No. 96919405.9, entitled "Steganographic Method and
Device", published as WOI 1996/042151; Publication Date: Dec. 27,
1996; F19.
"Method for Stega-Cipher Protection of Computer Code", published
as W0/1997/026732; Publication Date: Jui. 24,1997.
"Method for an Encrypted Digital Watermark", published as
W0/1997/026733; Publication Date: Jui. 24,1997.
PCT Application No. PCTIUS97/11455, filed Jui. 2, 1997, entitled,
"Optimization Methods for the Insertion, Protection and Detection of
Digital Watermarks in Digitized Data", published as WO/19981
002864; Publication Date: Jan. 22, 1998.
PCT Application No. PCTIUS99107262, filed Apr. 2,1999, entitled,
"Multiple Transform Utilization and Applications for Secure Digital
Watermarking", published as WO/19991052271; Publication Date:
Oct. 14, 1999.
PCT Application No. PCTIUSOOI06522, filed Mar. 14, 2000, entitled,
Systems", published as W0120001057643; Publication Date: Sep. 28,
2000.
PCT Application No. PCTIUSOO/18411, filed Jui. 5, 2000, entitled,
"Copy Protection of Digital Data Combining Steganographic and
Cryptographic Techniques". .
PCT Application No. PCTIUSOO/33126, filed Dec. 7, 2000, entitled
"Systems, Methods and Devices for Trusted Transactions", pub-
lished as WOl200 11043026; Publication Date: Jun. 14, 2001.
EPO Divisional Patent Application No. 07112420.0, entitled
"Steganographic Method and Device" corresponding to PCT Appli-
cation No. PCTIUS96/10257, published as W0/1996/042151, Dec.
27, 1996.
U.S. Appi. No. 601222,023, filed Jui. 31, 2007 entitled "Method and
apparatus for recognizing sound and signals in high noise and distor-
tion".
U.S. Appi. No. 111458,639, filed Jui. 19,2006 entitled "Methods and
Systems for Inserting Watermarks in Digital Signals", published as
20060251291 Al Nov. 9, 2006, P82.
"Techniques for Data Hiding in Audio Files," by Morimoto, 1995.
Howe, Dennis Jui. 13, 1998 http://foldoc .. org//steganography.
CSG, Computer Support Group and CSGNetwork.com 1973 http://
www.csgnetwork.comlglossarys.htlnl.
QuinStreet Inc. 2010 What is steganography?-A word definition
from the Webopedia Computer Dictionary http://www.webopedia.
cornltermsl stegano graphy.htlnl.
Graham, Robert Aug. 21, 2000 "Hacking Lexicon" http://
robertgraham.comlpubs/hacking-diet.htlnl.
Farkex, Inc 2010 "Steganography definition of steganography in the
Free Online Encyclopedia" http://encyclopedia2. Thefreedictionary.
cornlsteganography.
Horowitz, et ai., The Art of Eletronics. 2
nd
Ed., 1989, pp. 7.
Jimmy eat world ("futures"), Interscope Records, Pre-Release CD
image, 2004, 1 page.
Aerosmith ("Just Push Play"), Pre-Release CD image, 2001, 1 page.
Phil Collins(TestifY) Atlantic, Pre-Release CD image, 2002, 1 page.
* cited by examiner
US 7,949,494 B2
1
CROSS-REFERENCE TO RELATED
APPLICATIONS
This application is a continuation of pending U.S. applica-
tion Ser. No. 12/005,229, which is a continuation of U.S.
patent application Ser. No. 09/657,181, now U.S. Pat. No.
7,346,472. The previously identified patents and/or patent
entireties, as if fully stated herein.
This application claims the benefit of pending U.S. patent
application Ser. No. 08/999,766, filed Jul. 23, 1997, entitled
"Steganographic Method and Device" (issued as U.S. Pat.
No. 7,568,100); pending U.S. patent application Ser. No.
081772,222, filed Dec. 20, 1996, entitled "Z-Transform
Implementation of Digital Watermarks" (issued as U.S. Pat.
09/456,319, filed Dec. 8, 1999, entitled "Z-Transform Imple-
mentation of Digital Watermarks" (issued as U.S. Pat. No.
6,853,726); pending U.S. patent application. Ser. No. 08/674,
726, filed Jul. 2, 1996, entitled "Exchange Mechanisms for
Digital Information Packages with Bandwidth Securitization,
Multichannel Digital Watermarks, and Key Management"
(issued as U.S. Pat. No. 7,362,775); pending U.S. patent
application Ser. No. 09/545,589, filed Apr. 7, 2000, entitled
"Method and System for Digital. Watermarking" (issued as
U.S. Pat. No.7 ,007,166); pending U.S. patent application Ser.
No. 091046,627, filed Mar. 24, 1998, entitled "Method for
Combining Transfer Function with Predetermined Key Cre-
ation" (issued as U.S. Pat. No. 6,598,162); pending U.S.
patent application Ser. No. 091053,628, filed Apr. 2, 1998,
entitled "Multiple Transform Utilization and Application for
Secure Digital Watermarking" (issued as U.S. Pat. No. 6,205,
249); pending U.S. patent application Ser. No. 09/281,279,
filed Mar. 30, 1999, entitled "Optimization Methods for the
Insertion, Protection, and Detection of Digital Watermarks in
Digital Data (issued as U.S. Pat. No. 6,522,767)"; U.S. patent
application Ser. No. 09,594,719, filed Jun. 16,2000, entitled
"Utilizing Data Reduction in Steganographic and Crypto-
graphic Systems" (which is a continuation-in-part of PCT
application No. PCTIUSOOI06522, filed Mar. 14, 2000, which
PCT application claimed priority to U.S. Provisional Appli-
cation No. 601125,990, filed Mar. 24, 1999) (issued as U.S.
Pat. No. 7,123,718); pending U.S. Application No. 601169,
274, filed Dec. 7, 1999, entitled "Systems, Methods And
Devices For Trusted Transactions" (issued as U.S. Pat. No.
7,159,116); and PCT Application No. PCT/USOO/21189,
filedAug. 4, 2000 (which claims priority to U.S. patent appli-
cation Ser. No. 601147,134, filed Aug. 4,1999, and to U.S.
patent application No. 60/213,489, filed. Jun. 23, 2000, both
of which are entitled, "A Secure Personal Content Server")
(issued as U.S. Pat. No. 7,475,246). The previously identified
patents and/or patent applications are hereby incorporated by
reference, in their entireties, as if fully stated herein.
ence, as if fully stated herein, the total disclosures of U.S . Pat.
No. 5,613,004 "Steganographic Method and Device"; U.S.
tal Watermarks in Digitized Data."
2
5 digital information. A method and device are described which
10 data in digital form for multimedia applications (including
computer applications delivered over public networks such as
the internet or World Wide Web ("WWW"). These methods
15 bandwidth data lines. Among standard protocols for data
compression standards for audio and video digital compres-
20 compression and transmission standards for digitized infor-
mation.
Digital watermarks help to authenticate the content of digi-
25 bution of copyrighted content, establishment of responsibil-
able. In considering the various forms of multimedia content,
30 the underlying commercial and aesthetic value of the content.
information or some combination of these and related data
into the content in such a mauner that the content must
35 subsequent, unauthorized distribution, commercial or other-
general discussion of digital watermarking as it has been
40 erence).
Further applications of basic digital watermarking func-
45 applications have been drawn, for instance, to implementa-
50 developed techniques for adapting watermark application
that are feature-based-i.e., a system in which watermark
55 in the relationships between multiple samples, such as in a
cies (color or audio), chaunels in 3D while utilizing discrete-
60 pseudo-random keys (i.e., cryptographic keys) or possibly
a quantum level.
nology relates directly to the manner of implementation of the
65 watermark. Many approaches to digital watermarking leave
the digital watermark, not the creator of the work to be pro-
US 7,949,494 B2
3
for improvement of the technology. One specific fonn of
Yet another way to perform secure digital watennark imple-
abstract of the at least one reference signal to detennine if the
A method for monitoring a plurality of reference signals is
query signal.
least one signal is also disclosed, which system comprises: a
reference signal input to the processor; a reference database,
for each query signal; and a comparing device, coupled to the
at least one signal is disclosed, which system comprises: a
first input for receiving at least one reference signal to be
input; a second input for receiving at least one query signal to
be analyzed, a second processor for creating an abstract of
each query signal; a reference database for storing abstracts of
each at least one reference signal; and a comparing device for
stored abstracts.
4
to assist in detennining the identity of a human.
may be generated by the following steps: I) analyze the
10 tible variations for the same signal (e.g., analyze each of five
versions of the same song-which versions may have the
same lyrics and music but which are sung by different artists);
and 2) select those characteristics which achieve or remain
relatively constant (or in other words, which have minimum
15 variation) for each of the signals in the group. Optionally, the
20 of approaches that are based on perceptual models, such as
transfonns fail to assist in greater data reduction of the signal,
other signal characteristics can be identified as candidates for
25 z-transfonn analysis, root mean square (rms), signal to peak,
analysis are contemplated. While such signal characteristics
may assist in detennining particular applications of the
30 present invention, a generalized approach to signal recogni-
present invention.
35 motion pictures can all be stored and transmitted as a series of
binary digits-I's and O's. Digital techniques pennit the
40 Unfortunately, digital techniques also permit the infonnation
to be easily copied without the owner's pennission. While
digital representations of analog wavefonns may be analyzed
45 the highly effective ability of humans to identify and recog-
minimal when compared to the benefits of increased accuracy
50 cesses contemplated by this invention are utilized.
sampled infonnation, such as images, audio and video. Tra-
ditional methods of identification and monitoring of those
55 separate and additional signal. Within this application, such
information is in addition to the original signal. One tradi-
tional' text-based additive signal is title and author infonna-
60 tion. The title and author, for example, is infonnation about a
one means of monitoring the number of times the text is being
65 present invention, however, is directed to the identification of
US 7,949,494 B2
5 6
the monitoring have to agree as to the nature of the separate
signal is used itself as a monitoring signal, then no such
times the signal is duplicated. Reliance on an additive signal
easily identified and removed by one who wants to utilize the
ceptually altering the original signal. A watermark may also
lem.
10 monitoring efforts. The entity doing the monitoring is not
signal.
15 watermark techniques (those techniques that are able to sur-
related watermarking key) and forensic watennark tech-
20 able to survive perceptible alteration of the carrier signal and
offs between speed, performance and security of the embed-
ded watennark data.
25 In other disclosures, we suggest improvements and imple-
used to "tag" content in a manner that is not humanly-percep-
30 signal quality is maintained. Watermarking, however, must
tennarked state." The changes may affect only a bit, at the
example of retaining a logical and perceptible relationship 45
35 signal characteristics, such as phase infonnation, differences
category.
40 ogy for monitoring purposes. One weakness relates directly
watermark are not the creator of the valuable work to be
tion with watennarking technology (including the use of keys
ing is not necessary to practice the present invention. Keys for 50
data (actually imperceptible changes made to the carrier sig-
assisting in establishing the watermark message data integrity 55
in the patents and pending patent applications are incorpo-
signal or an instance of its transmission, and its monitoring 60
A practical difference between the two approaches of using
signal itself as the monitoring signal is control. If a separate 65
user.
US 7,949,494 B2
7
binary data.
signal to, say, 1I1O,OOOth of its original size, not for maintain-
ing its signal quality to ensure computational ease for com-
mercial quality distribution, but to assist in identification,
analysis or monitoring of the signal. Most compression is
either lossy or lossless and is designed with psychoacoustic or
psychovisual parameters. That is to say, the signal is com-
pressed to retain what is "humanly-perceptible." As long as
the compression successfully mimics human perception, data
space may be saved when the compressed file is compared to
the uncompressed or original file. While psychoacoustic and
psychovisual compression has some relevance to the present
algorithm deem as candidate bits for mapping independent
8
10 meet the demands of various classes of signal recognition.
15 information about a plurality of potential signals that will be
the various artists, for example, contain digital copies of all
20 another form, the reference database would contain not per-
all songs that have been preprocessed such that the copies
25 In another form, the reference database would contain digital
those perceptual differences that can differentiate one version
30 such as two or more versions of the same song, but by differ-
tographs, and video as well.
35 segment a portion of a signal being monitored for analysis
may be thought of comprising a set of objects. A song record-
40 objects. The objects need not be of uniform length, size, or
objects; color and size are examples.
45 analyze a selected object and identifY perceptual features of
all, of the perceptual qualities of the object that differentiate it
50 feature selector has a direct relationship with the perceptibil-
55 objects that are easily recognizable and valuable, for
60 feature selector to the plurality of signals in the reference
65 speed and efficiency), the exact nature of the comparison will
US 7,949,494 B2
9
database. Alternatively, the comparing device may need to
ture selector, process the selected object using input from the 10
10
needs of a particular market for the digitized information data
information.
The fifth element is the recorder which records information
15 can represent and differentiate two digitized signal represen-
tations for a given predefined signal set. Each of such repre-
Other elements may be added to the system or incorporated 20
error handler may offer further processing in order to identify 25
further analyzed selected object that actually conforms with
should receive its parameters from a database engine. The
tical, except[ing] that the signal may have different perfor-
mance or utilization in the newly created 0 bj ect, benefits over
additive or text-based identifiers are achieved. Additionally,
decisions regarding the success or failure of an accurate
detection of any given object may be flexibly implemented or
changed to reflect market-based demands of the engine.
Appropriate examples are songs or works or art which have
been sampled or reproduced by others who are not the origi-
nal creator.
Moreover, one or more of the five identified elements may 30
the signal analysis being conducted within the system, includ- 35
ing, for example, the signal analyses being performed within
tion. 40 fewer repetitions of objects or those systems which are
Since maintenance of original signal quality is not required
to the extent that efficiencies can be achieved both in accuracy 45
and speed with enabling logical relationships between an
original signal while reducing the data overhead to enable 50
more efficient analysis, archiving and monitoring of these
on a third party who authored or created the signal in question. 55
describe the original signal. By utilizing less than the original 60
signal, a computationally inexpensive means of identification
transparency of information data flow across communica- 65
tions channels is likely to result. This feature is significant in
may be used to assist in determining the distance between
US 7,949,494 B2
11
12
significant cases: First, in instances where the recognized,
the previously selected criteria may not be able to differenti-
"recalibration" to further differentiate the two objects stored
in the database.
10 able information to increase the accuracy of the database.
5) Finally, the predetermined parameters that are associ-
15 identify the signals. For example, if a song is transmitted over
20 yet from a song played using an S-bit Internet broadcast.
selection of an identification means which can be optimized
25 the fidelity of the transmission means. Objects may be cata-
ing will occur using a specific transmission fidelity. For
30 maximum efficiency, different data bases may be created for
broadcasts, Internet broadcasts, etc.
mation systems, see The Mathematical Theory of Communi-
35 cation (194S), by Shannon.
a discrete segment of the song (that may be used for promo- 40
tion or marketing-for the complete song or for an entirely
signal, cognitive identification is a form of filtering to enable 45
differentiations between different and intended uses of the
fied relationship with subsequent use of the identification 50
means can be used to create a history as to how often a
separate and distinct good or service and use of the excerpt to 55
promote recognition of the song itself (for example, by the
a subset are typically based on agreement by the creator and 60
the sender who seeks to utilize the work. Trust in the means
to the total number of bits that can be transmitted in a fixed
mitted over any given chaunel must take into consideration
and recognize signals. A discussion of this is found in an
application by the inventor under U.S. patent application Ser.
No. OS/674,726 (which issued Apr. 22, 200S as U.S. Pat. No.
7,362,775) "Exchange Mechanisms for Digital Information
Packages with Bandwidth Securitization, Multichannel Digi-
tal Watermarks, and Key Management" (which application is
incorporated herein by reference as if fully setforth herein).
65 the information carrier signal (pre-recorded or newly created
in certain markets or instances).
US 7,949,494 B2
13 14
With greater compression rates, it is anticipated that simi-
different analog signals (e.g., recordings by two different
the use of bit-addressable differences to distinguish between
higher value in some predetennined sense, cryptographic
10 protocols, such as a hash or digital signature, can be used to
In the case of predetennined carrier signals (those which
tional infonnation carrier signals" are contemplated by this
ingly "same" infonnation carrier that can be recognized as
transmission at a later point in time, creates recognizable 20
15 rize transmission or use of their recordings by others, can
The rules for the creator himself to enter his work would differ
the following: to detennine the number of times a song is
broadcast on a particular radio broadcast or Internet site; to 25
to identify associations between a beginner's drawing and
these examples could be achieved with any significant degree 30
text-based systems fail to fully capture the inherent value of
respectively). Those skilled in the art of algorithmic infonna-
have predetennined flexibility directly related to computa-
flexibility in having transparent detennination of unique sig-
SAMPLE EMBODIMENTS 35 allows for no such transparency to the copyright creators.
Sample Embodiment 1
A database of audio signals (e.g., songs) is stored or main-
tained by a radio station or Internet streaming company, who 40
may select a subset of the songs are stored so that the subset
may be later broadcast to listeners. The subset, for example,
may comprise a sufficient number of songs to fill 24 hours of
music programming (between 300 or 500 songs). Tradition-
ally, monitoring is accomplished by embedding some identi- 45
fier into the signal, or affixing the identifier to the signal, for
later analysis and detennination of royalty payments. Most of
the traditional analysis is perfonned by actual persons who
use play lists and other statistical approximations of audio
play, including for example, data obtained through the 50
manual (i.e., by persons) monitoring of a statistically signifi-
cant sample of stations and transmission times so that an
extrapolation may be made to a larger number of comparable
markets.
Sample Embodiment 2
Another embodiment of the invention relates to visual
images, which of course, involve at least two dimensions.
data, and yet preserve those perceptual qualities that pennit a
mented.
The present invention creates a second database from the
played back and recognized as the original signal. As a result
measured in digital tenns) is much smaller than the size of the
first database, and is detennined by the rate of compression.
55 ing a sun, compressing the data to its essential characteristics
then finding matches in a database of other visual images
pressed at a 10,000: 1 compression rate, the reduced data
60 for example, could learn much by comparing the presenta-
65 police artist.
cussed above can be used for audio-visual monitoring, such
US 7,949,494 B2
15
cable station that is broadcasting a audio channel unaccom-
panied by video.
16
efficiency adjustment of the database, an adjustment for data-
base collisions and/or null cases, a change to the recognition
or use parameters governing the database and combinations
thereof.
10. The system of claim 1, further comprising applying one
of a relatedness index or measure of similarity to generate
uniquely identifiable information to determine authorization
by the comparing device.
by the following claims. As will be easily understood by those 10
11. A system for analyzing and identifYing at least one
reference signal, comprising: a first input for receiving at least
one reference signal to be identified, a first processor for
creating an abstract of each reference signal received based
on perceptual characteristics representative of parameters to
differentiate between versions of the reference signal; a ref- What is claimed:
1. A system for identifYing at least one reference signal 15 erence database for storing abstracts of each reference signal
received in a database; a second input for receiving at least comprising:
a first input that receives at least one reference signal to be
identified;
a first processor that creates an abstract of each reference
signal input to said first processor through said first input
wherein the abstract comprises signal characteristic
parameters configured to differentiate between versions
of said reference signal;
at least one reference database for storing at least one
abstract;
a receiver that receives at least one query signal;
a second processor that creates an abstract of said query
signal received by said receiver, based on the param-
eters; and
one query signal to be identified, a second processor for
creating an abstract of the received query signal based on the
parameters; and a comparing device for comparing an
20 abstract of said received query signal to the abstracts stored in
the database to determine if the abstract of said received query
signal is related to any of the stored abstracts.
25
12. The system of claim 11, wherein said database is inde-
pendently accessible.
13. The system of claim 11, wherein said received query
signal is independently stored.
14. The system of claim 11, wherein the parameters used
by the comparing device to compare a received query signal
abstract with a stored reference signal abstract are adjustable.
15. The system of claim 11, wherein the stored abstracts
comprise a self-similar representation of at least one refer-
ence signal.
a comparing device that compares the created query signal 30
abstract to the reference signal abstracts in the at least
one database, each abstract in the at least one reference
database corresponding to a version of a reference sig-
nal, to determine whether the query signal abstract
matches any of the stored at least one abstract in the at
least one reference database.
16. The system of claim 11, wherein at least two of the
stored abstracts comprise information corresponding to two
35 versions of at least one reference signal.
17. The system of claim 11, wherein at least one abstract
comprises data describing a portion of the characteristics of
its associated reference signal.
2. The system of claim 1, further comprising: a controller
that enables authorized transmission or use of the correspond-
ing version of the reference signal based on whether a match
was determined by the comparing device.
3. The system of claim 1, wherein the reference database is
created by at least one of a music company, a movie studio, an
image archive, an owner of a general computing device, a user
of the reference signal, an interne service provider, an infor-
mation technology company, a body politic, a telecommuni-
cations company and combinations thereof.
4. The system of claim 1, wherein the reference signals
comprise at least one of images, audio, video, and combina-
tions thereof.
5. The system of claim 1, wherein the stored abstracts are
derived from one of a cognitive feature or a perceptible char-
acteristic of the associated reference signals.
18. The system of claim 17, wherein the characteristics of
40 the reference signal being described comprise at least one of
a perceptible characteristic, a cognitive characteristic, a sub-
jective characteristic, a perceptual quality, a recognizable
characteristic or combinations thereof.
19. The system of claim 11, wherein a stored abstract
45 comprises data unique to a variation of its corresponding
reference signal.
20. The system of claim 11, wherein the system further
comprises a security controller for applying a cryptographic
protocol to the abstract of said reference signal, said query
50 signal, or both said reference signal and said query signal.
6. The system of claim 1, furthering comprising a security
controller to apply a cryptographic protocol to at least one
created abstract, at least one database abstract or both at least 55
one created abstract and at least one database abstract.
21. The system of claim 20, wherein the cryptographic
protocol is one of at least a hash or digital signature and
further comprising storing the hashed abstract and/or digi-
tally signed abstract in the reference database.
22. The system of claim 11, further comprising a transmit-
ter for distributing at least one signal based on the comparison
step. 7. The system of claim 1, wherein each of the stored
abstracts comprise information configured to differentiate
variations of each referenced corresponding signal.
8. The system of claim 1, further comprising a storage
medium for storing information associated with the compar-
ing device to store information to enable at least one of a
re-calibration of the database and a heuristic-based adjust-
ment of the database.
23. The system of claim 22, further comprising a processor
for applying a watermarking technique to the at least one
60 signal to be distributed.
9. The system of claim 1, further comprising a storage 65
medium for storing information associated with the compar-
ing device to store information to enable a computational
24. A system for identifying a plurality of reference signals
comprising:
a first input that receives a plurality of reference signals to
be identified;
a first processor that creates an abstract for each of the
plurality of reference signals input to said first processor
through said first input wherein the abstract comprises
US 7,949,494 B2
17
signal characteristic parameters configured to differen-
tiate between versions of at least one reference signal; at
least one reference database for storing the plurality of
created abstracts; a receiver for receiving a query signal;
a second processor that creates an abstract of said query
signal received by said receiver, based on the param-
eters; and a comparing device that compares the created
query signal abstract to the abstracts stored in the at least
one database, to determine whether the query signal
abstract matches any of the stored abstracts in the at least 10
one reference database.
25. The system of claim 24, wherein the first and second
processors are the same processor.
26. The system of claim 24, wherein the first and second
processors are different processors.
27. A system for determining whether a query signal
matches a reference signal, comprising:
a first processor configured to create a first version abstract
15
18
said reference signal based upon perceptual characteris-
tics of said first version of said reference signal, such that
said first version abstract retains a perceptual relation-
ship to said first version of said reference signal;
a reference database storing said first version abstract;
a second processor configured to create a query signal
abstract from a query signal, wherein said second pro-
cessor is configured to generate said query signal
abstract from said query signal based upon perceptual
characteristics of said query signal, such that said query
signal abstract retains a perceptual relationship to said
query signal; and
a device configured to determine whether a query signal
matches said first version of said reference signal, by
comparing, a query signal abstract that was generated
based upon perceptual characteristics of said query sig-
nal, with said first version abstract stored in said refer-
ence database.
of a first version of a reference signal input to said first
processor;
29. A system for determining whether a query signal
20 matches any of a plurality of reference signal, comprising:
wherein said first version abstract comprises signal char-
acteristic parameters configured to differentiate said first
version of said reference signal from a second version of
said reference signal;
a reference database storing said first version abstract;
a device configured to determine whether said first version
of said reference signal matches a query signal, by com-
paring a query signal abstract of said query signal to said
first version abstract stored in said reference database.
25
28. A system for determining whether a query signal 30
matches a reference signal, comprising:
a first processor configured to create a first version abstract
of a first version of a reference signal input to said first
processor, wherein said first processor is configured to
create said first version abstract from said first version of
a first processor configured to create a plurality of refer-
ence signal abstracts for each one of a plurality of refer-
ence signals, wherein each one of said plurality of ref-
erence signal abstracts comprises signal characteristic
parameters configured to differentiate between other
versions of that one of said plurality of reference signals;
a reference database storing said plurality of reference
signal abstracts;
a device configured to determine if a query signal matches
anyone plurality of reference signals by comparing a
query signal abstract of said query signal with at least
one abstract of said plurality of reference signal
abstracts stored in said reference database.
* * * * *
PATENT NO.
APPLICATION NO.
DATED
INVENTOR(S)
: 7,949,494 B2
: 12/655357
: May 24,2011
: Moskowitz
Page 1 of 1
Column 1 line 14 reading:
should read:
This application is related to pending U.S. patent
ofthe reference signal, an interne service provider, an infor-
should read:
ofthe reference signal, an internet service provider, an infor-
Thirtieth Day of August, 2011
~ J 3 : . t : : ~
David J. Kappos
EXHIBIT C
Moskowitz et al.
(75) Inventors: Scott A. Moskowitz, Sunny Isles Beach,
FL (US); Michael Berry, Virginia
Beach, VA (US)
(US)
This patent is subject to a terminal dis-
claimer.
(21) Appl. No.: 12/005,229
(22) Filed: Dec. 26, 2007
US 2008/0109417 Al May 8, 2008
Sep. 7, 2000, now Pat. No. 7,346,472.
(51) Int. Cl.
G06F 19/00 (2006.01)
(52) U.S. Cl. ............................... 702/182; 70711; 707/2;
707/3; 707/10; 709/209; 705/51; 380/28
(58) Field of Classification Search ................. 7021182;
70711,2,3, 10; 709/209; 705/51; 380/28
3,947,825 A 311976 Cassada
3,984,624 A 1011976 Waggener
3,986,624 A 1011976 Cates, Jr. et al.
4,038,596 A 711977 Lee
4,200,770 A 411980 Hellman etal.
4,218,582 A 811980 Hellman etal.
4,339,134 A 711982 Macheel
4,390,898 A 611983 Bondet al.
4,405,829 A 911983 Rivest et al.
4,424,414 A 111984 Hellman etal.
4,528,588 A 711985 Lofberg
4,672,605 A 611987 Hustig et al.
4,748,668 A 511988 Shamir et al.
4,789,928 A 1211988 Fujisaki
4,827,508 A 511989 Shear
4,876,617 A 1011989 Best et al.
4,896,275 A 111990 Jackson
4,939,515 A 711990 Adelson
4,969,204 A 1111990 Jones et al.
4,972,471 A 1111990 Gross et al.
4,977,594 A 1211990 Shear
4,979,210 A 1211990 Nagata et al.
4,980,782 A 1211990 Ginkel
5,050,213 A 911991 Shear
5,073,925 A 1211991 Nagata et al.
111111 1111111111111111111111111111111111111111111111111111111111111
EP
US007660700B2
(10) Patent No.:
(45) Date of Patent:
5,077,665 A 12/1991
5,113,437 A 5/1992
5,136,581 A 8/1992
5,136,646 A 8/1992
5,136,647 A 8/1992
5,142,576 A 8/1992
5,161,210 A 1111992
5,210,820 A * 5/1993
5,243,423 A 9/1993
5,243,515 A 9/1993
5,287,407 A 2/1994
5,319,735 A 6/1994
5,341,429 A 8/1994
5,341,477 A 8/1994
5,363,448 A 1111994
5,365,586 A 1111994
5,369,707 A 1111994
5,379,345 A 111995
5,394,324 A 2/1995
5,398,285 A 3/1995
US 7,660,700 B2
*Feb.9,2010
Silverman et al.
Best et al.
Muehrcke
Haber et al.
Haber et al.
Nadan
Druyvesteyn et al.
Kenyon ...................... 704/200
Dejean et al.
Lee
Holmes
Preuss et al.
Stringer et al.
Pitkin et al.
Koopman et al.
Indeck et al.
Follendore, III
Greenberg
Clearwater
Borgelt et al.
(Continued)
0372601 Al 6/1990
(Continued)
OTHER PUBLICATIONS
pp. 9-10, 1996.
Menezes, Alfred J., Handbook of Applied Crypography, CRC Press,
p.46, 1997.
Option Valuation Models", 1984, pp. 448-449 .
Copeland, et aI., Real Options:A Practioner's Guide, 2001 pp. 106-
107,201-202,204-208.
Crawford, D.W. "Pricing Network Usage:A Market for Bandwith of
Market Communication?" presented MIT Workshop on Internet Eco-
nomics, Mar. 1995 http://www.press.umich.edu/jep/works/
CrawMarket.html on March.
(Continued)
Primary Examiner-Carol S Tsai
(57) ABSTRACT
US 7,660,700 B2
Page 2
U.S. PATENT DOCUMENTS 5,870,474 A 2/1999 Wasilewski et al.
5,884,033 A 3/1999 Duvall et al.
5,406,627 A 411995 Thompson et al.
5,408,505 A 411995 Indeck et al.
5,893,067 A 4/1999 Bender et al.
5,410,598 A 411995 Shear
5,894,521 A 4/1999 Conley
5,412,718 A 511995 Narasirnhalu et al.
5,903,721 A 5/1999 Sixtus
5,418,713 A 511995 Allen
5,428,606 A 611995 Moskowitz
5,905,975 A 5/1999 Ausubel
5,450,490 A 911995 Jensen et al.
5,912,972 A 6/1999 Barton
5,469,536 A 1111995 Blank
5,915,027 A 6/1999 Cox et al.
5,471,533 A 1111995 Wang et al.
5,917,915 A 6/1999 Hirose
5,478,990 A 1211995 Montanari et al.
5,918,223 A 6/1999 Blum
5,479,210 A 1211995 Cawley et al.
5,920,900 A 7/1999 Poole et al.
5,487,168 A 111996 Geiner et al.
5,923,763 A 7/1999 Walker et al.
5,493,677 A 211996 Balogh et al.
5,930,369 A 7/1999 Cox et al.
5,497,419 A 311996 Hill
5,930,377 A 7/1999 Powell et al.
5,506,795 A 411996 Yarnakawa
5,940,134 A 8/1999 Wirtz
5,513,126 A 411996 Harkins et al.
5,943,422 A 8/1999 VanWie et al.
5,513,261 A 411996 Maher
5,963,909 A 10/1999 Warren et al.
5,530,739 A 611996 Okada
5,973,731 A 10/1999 Schwab
5,530,751 A 611996 Morris
5,974,141 A 10/1999 Saito
5,991,426 A 1111999 Cox et al.
5,548,579 A 811996 Lebrun et al.
5,999,217 A 12/1999 Berners-Lee
5,568,570 A 1011996 Rabbani
6,009,176 A 12/1999 Gennaro et al.
5,579,124 A 1111996 Aijala et al.
6,029,126 A 212000 Malvar
5,581,703 A 1211996 Baugher et al.
6,041,316 A 3/2000 Allen
5,583,488 A 1211996 Sala et al.
6,049,838 A 4/2000 Miller et al.
5,598,470 A 111997 Cooper et al.
6,051,029 A 4/2000 Paterson et al.
5,606,609 A 211997 Houser et al.
6,061,793 A 5/2000 Tewfik et al.
6,069,914 A 5/2000 Cox
5,617,119 A 411997 Briggs et al.
5,625,690 A 411997 Michel et al.
6,081,251 A 6/2000 Sakai et al.
5,629,980 A 511997 Stefik et al.
5,633,932 A 511997 Davis et al.
6,088,455 A * 7/2000 Logan et al. ................ 3801200
5,634,040 A 511997 Her et al.
6,131,162 A 1012000 Yoshiura et al.
5,636,276 A 611997 Brugger
6,141,753 A 1012000 Zhao et al.
5,636,292 A 611997 Rhoads
6,141,754 A 1012000 Choy
5,640,569 A 611997 Miller et al.
6,154,571 A 1112000 Cox et al.
5,646,997 A 711997 Barton
6,199,058 Bl 3/2001 Wong etal.
5,657,461 A 811997 Harkins et al.
6,205,249 Bl 3/2001 Moskowitz
6,208,745 Bl 3/2001 Florencio et al.
5,664,018 A 911997 Leighton
6,230,268 Bl 5/2001 Miwaetal.
5,673,316 A 911997 Auerbach et al.
6,233,347 Bl 5/2001 Chen et al.
5,677,952 A 1011997 Blakley et al.
6,233,684 Bl 5/2001 Stefik et al.
5,680,462 A 1011997 Miller et al.
6,240,121 Bl 5/2001 Senoh
5,687,236 A 1111997 Moskowitz et al.
6,263,313 Bl 7/2001 Milsted et al.
5,689,587 A 1111997 Bender et al.
6,272,634 Bl 8/2001 Tewfik et al.
5,696,828 A 1211997 Koopman, Jr.
5,719,937 A 211998 Warren et al.
6,278,780 Bl 8/2001 Shimada
5,721,788 A 211998 Powell et al.
5,734,752 A 311998 Knox
6,282,300 Bl 8/2001 Bloom et al.
5,737,416 A 411998 Cooper et al.
6,282,650 Bl 8/2001 Davis
5,737,733 A 411998 Eller
6,285,775 Bl 9/2001 Wu et al.
5,740,244 A 411998 Indeck et al.
6,301,663 Bl 10/2001 Kato et al.
6,310,962 Bl 10/2001 chung et al.
5,748,783 A 511998 Rhoads
6,330,335 Bl 12/2001 Rhoads
5,751,811 A 511998 Magnotti et al.
6,330,672 Bl 12/2001 Shur
5,754,697 A 511998 Fu et al.
6,345,100 Bl 212002 Levine
5,757,923 A 511998 Koopman, Jr.
5,765,152 A 611998 Erickson
6,363,483 Bl 3/2002 Keshav
5,768,396 A 611998 Sone
6,373,892 Bl 4/2002 !chien et al.
5,774,452 A 611998 Wolosewicz
6,373,960 Bl 4/2002 Conover et al.
5,790,677 A 811998 Fox et al.
6,377,625 Bl 4/2002 Kim
5,799,083 A 811998 Brothers et al.
6,381,618 Bl 4/2002 Jones et al.
5,809,139 A 911998 Girod et al.
6,381,747 Bl 4/2002 Wonforetal.
5,809,160 A 911998 Powell et al.
6,385,329 Bl 5/2002 Sharma et al.
5,828,325 A 1011998 Wolose Wicz et al.
6,389,538 Bl 5/2002 Gruse et al.
5,832,119 A 1111998 Rhoads
6,405,203 Bl 6/2002 Collart
5,848,155 A 1211998 Cox
6,415,041 Bl 7/2002 Oami etal.
5,850,481 A 1211998 Rhoads 6,425,081 Bl 7/2002 Iwamura
5,859,920 A 111999 Daly et al. 6,430,301 Bl 8/2002 Petrovic
5,860,099 A 111999 Milios et al. 6,430,302 B2 8/2002 Rhoads
5,862,260 A 111999 Rhoads 6,442,283 Bl 8/2002 Tewfik et al.
6,453,252 Bl
6,457,058 Bl
6,463,468 Bl
6,493,457 Bl
6,522,769 Bl
6,523,113 Bl
6,530,021 Bl
6,532,284 B2
6,539,475 Bl
6,557,103 Bl
6,584,125 Bl
6,587,837 Bl
6,598,162 Bl
6,606,393 Bl
6,647,424 Bl
6,658,010 Bl
6,665,489 B2
6,668,246 Bl
6,668,325 Bl
6,687,683 Bl
6,725,372 Bl
6,754,822 Bl
6,775,772 Bl
6,784,354 Bl
6,785,815 Bl
6,823,455 Bl
6,834,308 Bl
6,842,862 B2
6,931,534 Bl
6,966,002 Bl
6,983,337 B2
6,977,894 Bl
6,978,370 Bl
7,020,285 Bl
7,043,050 B2
7,046,808 Bl
7,050,396 Bl
7,051,208 B2
7,058,570 Bl
7,093,295 Bl
7,107,451 B2
7,150,003 B2
7,162,642 B2
7,177,430 B2
7,206,649 B2
7,231,524 B2
7,240,210 B2
7,266,697 B2
7,286,451 B2
7,289,643 B2
7,363,278 B2
7,460,994 B2
200110043594 Al *
200210026343 Al
200210073043 Al
200210097873 Al
200210103883 Al
200210161741 Al
2003/0126445 Al
2003/0133702 Al
2004/0028222 Al
2004/0037449 Al
2004/0049695 Al
2004/0059918 Al
2004/0083369 Al
2004/0093521 Al
2004/0125983 Al
2004/0128514 Al
2005/0160271 A9
2005/0246554 Al
2006/0005029 Al
2006/0013395 Al
2006/0013451 Al
912002 Laroche
912002 Ullum et al.
1012002 Buch et al.
1212002 Quackenbush
212003 Rhoads et al.
212003 Wehrenberg
3/2003 Epstein et al.
3/2003 Walker et al.
3/2003 Cox et al.
4/2003 Boncelet, Jr. et al.
6/2003 Katto
7/2003 Spagna et al.
7/2003 Moskowitz
8/2003 Xie et al.
1112003 Pearson et al.
12/2003 Enns et al.
12/2003 Collart
12/2003 Yeung et al.
12/2003 Collberg et al.
212004 Harada et al.
4/2004 Lewis et al.
6/2004 Zhao
8/2004 Binding et al.
8/2004 Lu et al.
8/2004 Serret-Avila et al.
1112004 Macyet al.
12/2004 Ikezoye et al.
112005 Chow et al.
8/2005 Jandel et al.
1112005 Torrubia-Saez
1112005 Wold
12/2005 Achilles et al.
12/2005 Kocher
312006 Kirovski et al.
5/2006 Yuval
5/2006 Metois et al.
5/2006 Cohen et al.
5/2006 Venkatesan et al.
6/2006 Yu et al.
8/2006 Saito
912006 Moskowitz
1212006 Naumovich et al.
112007 Schumann et al.
212007 Kim
4/2007 Kirovski et al.
6/2007 Bums
7/2007 Mihcak et al.
912007 Kirovski et al.
1012007 Wirtz et al.
1012007 Brunk et al.
4/2008 Schmelzer et al.
1212008 Herre et al.
US 7,660,700 B2
Page 3
2006/0041753 Al
2007/0083467 Al
2007/0127717 Al
2007/0253594 Al
212006 Haitsma
4/2007 Lindahl et al.
6/2007 Herre et al.
1112007 Lu et al.
EP
EP
EP
EP
EP
NL
WO
WO
WO
WO
WO
WO
WO
WO
0565947 Al
0581317 A2
0649261
0651554 A
1354276 Bl
100523
WO 95114289
96/29795
97/24833
WO 9744736
W098/37513
WO 9952271
WO 99/62044
WO 9963443
10/1993
2/1994
4/1995
5/1995
1212007
9/1998
5/1995
9/1996
7/1997
1111997
8/1998
10/1999
12/1999
12/1999
OTHER PUBLICATIONS
Bruggemann and W Gerhardt-Hackel (Ed.) Viewing Publishing
Watermarks", Proc. of the european conf. on Mulitmedia Applica-
tions, Services & Techinques Louvain-I a-Nevve Belgium, May
1996.
Information Hiding. No. 1174 in Lecture Notes in Computer
Science,Cambridge,England (May/Jun. 1996).
Oomen,A.W.J. et al., A Variable Bit Rate Buried Data Channel for
Ten Kate,W. et aI., A New Surround-Stereo-Surround Coding Tech-
(1993).
Sklar, Bernard, Digital Communications, pp. 601-603 (1988).
Opt. Eng., vol. 2420, pp. 164-173, 1995.
p. 175, 1997.
1112001 Ogawa et al. ............... 370/356
ten Kate, W. et aI., "Digital Audio Carrying Extra Information",
IEEE, CH 2847-219010000-1097, (1990).
212002 Duenke
6/2002 Herman et al.
7/2002 Petrovic
8/2002 Haverstock et al.
10/2002 Wang et al.
712003 Wehrenberg
7/2003 Collart
212004 Sewell et al.
212004 Davis et al.
3/2004 Choi et al.
3/2004 Xu
4/2004 Erlingsson et al.
5/2004 Hamadeh et al.
7/2004 Reed et al.
7/2004 Rhoads
7/2005 Brundage et al.
1112005 Batson
112006 Petrovic et al.
112006 Brundage et al.
112006 Haitsma
van Schyndel, et al. A digital Watermark, IEEE Int'I Computer Pro-
cessing Conference, Austin,TX, Nov. 13-16, 1994, pp. 86-90.
Smith, et al. Modulation and Information Hiding in Images, Springer
Verlag, 1 st Int'I Workshop, Cambridge, UK, May 30-Jun. 1, 1996, pp.
207-227.
Mar. 1997, pp. 108-118.
Swanson, Mitchell D.,et al.; Transparent Robust Image Watermark-
ing, Proc. of the 1996 IEEE Int'I Conf. on Image Processing, vol. 111,
1996, pp. 211-214.
Swanson, Mitchell D., et al. Robust Data Hiding for Images, 7th
1996, pp. 37-40.
Koch, E., et aI., Towards Robust and Hidden Image Copyright Label-
ing, 1995 IEEE Workshop on Nonlinear Signal and Image Process-
ing, Jun. 1995 Neos Marmaras pp. 4.
Van Schyandel, et aI., Towards a Robust Digital Watermark, Second
2,pp. 504-508.
US 7,660,700 B2
Page 4
O'Ruanaidh, et al. Watermarking Digital Images for Copyright Pro-
tection, IEEE Proceedings, vol. 143, No.4, Aug. 1996, pp. 250-256.
xIII, 81-83,513,515,522-526,863.
ft The Netherlands,Cr.e. Langelaar et al.,Copy Protection for
Mulitrnedia Data based on Labeling Techniques, Jul. 1996, 9 pp.
Craver, et aI., Can Invisible Watermarks Resolve Rightful Owner-
Press, et aI., Numerical Recipes In C, Cambridge Univ. Press, 1988,
pp.398-417.
Pohlmann, Ken e., Principles of Digital Audio, 3rd Ed., 1995, pp.
32-37,40-48,138,147-149,332,333,364, 499-501,508-509,564-571.
Pohlmann, Ken e., Principles of Digital Audio, 2nd Ed., 1991, pp.
1-9,19-25,30-33,41-48,54-57,86-107,375-387.
Schneier, Bruce, Applied Cryptography, John Wiley & Sons, inc. ,
New York, 1994, pp. 68,69,387-392,1-57,273-275,321-324.
17-23,1996 Hiroshima. Japan. 0-8186-7436-9196. pp. 473-480.
Johnson, et al., Transform Permuted Watermarking for Copyright
New York, New York, vol. 2.1998. pp. 684-689 (ISBN 0-7803-4985-
7).
Rivest, et al. "Pay Word and Micromint: Two Simple Micropayment
Schemes,"MIT Laboratory for Computer Science, Cambridge, MA,
May 7, 1996, pp. 1-18.
vol. 35, Nos. 3 & 4, 1996,pp. 313-336.
2003, pp. 14-21.
tal Watermarking: Trade-offs of Security, Robustness and Quality",
IEEE Computer Society Proceedings of ITCC 2002, Apr. 10, 2002,
pp.80-84.
("IWDW" 2006), Springer Lecture Notes in Computer Science,2006,
(to appear) 13.
Research, Inc. 2002-2003. 14 pages.
Society Computer Conference (Spring), Mar. 5, 1995, pp. 20-25, vol.
CONF40.
tems, Sep. 30, 1998. pp. 1501-1510 vol. 30 No. 16-18 NI North
Holland.
Reliable Distributed System Oct. 19-22, 1999, pp. 360-365
Lausanne.
Kini, a. et aI., "Trust in Electronic Commerce: Definition and Theo-
retical Considerations", Proceedings of the 31 st Hawaii Int'I Conf on
System Sciences (Cat. No. 98TBI00216) Jan. 6-9,1998, pp. 51-61.
Los.
USA.
ofthe IEEE, Special Issue, Identification & Protection of Multimedia
Information, pp. 1079-1107, Jul. 1999, vol. 87 No.7, IEEE.
Rivest,et aI., PayWord and MicroMint: Two simple micropayment
schemes, MIT Laboratory for Computer Science, Cambridge, MA
02139, Apr. 27, 2001, pp. 1-18.
Horowitz, et al., The Art of Electronics, 2nd Ed., 1989, pp. 7.
Delaigle, l-F., et al. "Digital Watermarking," Proceedings of the
SPIE, vol. 2659, Feb. 1, 1996, pp. 99-110 (Abstract).
Schneider, M., et al. "Robust Content Based Digital Signature for
on Image Processing (Ie. Lausanne). Sep. 16-19, 1996, pp. 227-230,
IEEE ISBN.
1, 1997, pp. 1673-1686.
cessing, vol. 1, Oct. 4-7, 1998, pp. 455-459.
14-17, 1998, pp. 218-238 ISBN 3-540-65386-4.
Translation Invariant Digital Watermarking", pre-publication, Sum-
mer 19974 pages.
Signal Processing, Aug. 21, 1997, 19 pages.
PCT International Search Report, completed Sep. 13, 1995; (PCT/
US95/08159) (2 pages).
PCT International Search Report, completed Jun. 11, 1996; (PCT/
US96/10257) (4 pages).
Supplementary European Search Report, Mar. 5, 2004; (EP 96 91
9405) (1 page).
PCT International Search Report, completed Apr. 4, 1997; (PCT/
US97 /00651) (1 page).
PCT International Search Report, completed May 6, 1997; (PCT/
US97/00652) (3 pages).
PCT International Search Report, completed Oct. 23, 1997; (PCT/
US97/11455) (1 page).
PCT International Search Report, completed Jul. 12, 1999; (PCT/
US99/07262) (3 pages).
PCT International Search Report, completed Jun. 30, 2000; (PCT/
USOO/06522) (7 pages).
Supplementary European Search Report, completed Jun. 27, 2002;
(EP 00 91 9398) (1 page).
PCT International Search Report, date of mailing Mar. 15, 2001;
(PCTIUSOO/18411) (5 pages).
PCT International Search Report, completed Jul. 20, 2001; (PCT /
PCT International Search Report, completed Mar. 20, 2001; (PCT/
PCT International Search Report, completed Jan. 26, 2001; (PCT/
European Search Report, completed Oct. 15,2007; (EP 0711 2420)
(9 pages).
Staind (The Singles 1996-2006), Warner Music-Atlantic, Pre-Re-
lease CD image, 2006, 1 page.
Arctic Monkeys (Whatever People Say I Am, That's What I'm Not),
Domino Recording Co. Ltd., Pre-Release CD image, 2005, 1 page.
Radiohead ("Hail To The Thief'), EMI Music Group-Capitol; Pre-
* cited by examiner
US 7,660,700 B2
1
2
data in digital form for multimedia applications (including
computer applications delivered over public networks such as CROSS-REFERENCE TO RELATED
APPLICATIONS
This application is a continuation of U.S. patent applica-
tion Ser. No. 09/657,181, filed Sep. 7, 2000, entitled,
"Method and Device for Monitoring and Analyzing Signals."
5 the internet or World Wide Web ("WWW"). These methods
bandwidth data lines. Among standard protocols for data
10 compression standards for audio and video digital compres-
compression and transmission standards for digitized infor-
mation.
"Steganographic Method and Device"; pending U.S. patent
application Ser. No. 081772,222, filed Dec. 20, 1996, entitled
"Z-Transform Implementation of Digital Watermarks" (is-
sued as U.S. Pat. No. 6,078,664); pending U.S. patent appli- 15
cation Ser. No. 09/456,319, filed Dec. 8, 1999, entitled
"Z-Transform Implementation of Digital Watermarks" (is-
sued as U.S. Pat. No. 6,853,726); pending U.S. patent appli-
cation. Ser. No. 08/674,726, filed Jul. 2, 1996, entitled
"Exchange Mechanisms for Digital Information Packages
with Bandwidth Securitization, Multichannel Digital Water-
marks, and Key Management"; pending U.S. patent applica-
tion Ser. No. 09/545,589, filedApr. 7, 2000, entitled "Method
and System for Digital. Watermarking" (issued as U.S. Pat.
091046,627, filed Mar. 24, 1998, entitled "Method for Com-
bining Transfer Function with Predetermined Key Creation"
(issued as U.S. Pat. No. 6,598,162); pending U.S. patent
application Ser. No. 091053,628, filed Apr. 2, 1998, entitled
"Multiple Transform Utilization and Application for Secure 30
Digital Watermarking" (issued as U.S. Pat. No. 6,205,249);
pending U.S. patent application Ser. No. 09/281,279, filed
Mar. 30, 1999, entitled "Optimization Methods for the Inser-
tion, Protection, and Detection of Digital Watermarks in Digi-
Digital watermarks help to authenticate the content of digi-
bution of copyrighted content, establishment of responsibil-
20 able. In considering the various forms of multimedia content,
the underlying commercial and aesthetic value of the content.
25 information or some combination of these and related data
tal Data (issued as U.S. Pat. No. 6,522,767)"; U.S. patent 35
application Ser. No. 09,594,719, filed Jun. 16,2000, entitled
"Utilizing Data Reduction in Steganographic and Crypto-
application No. PCTIUSOOI06522, filed Mar. 14, 2000, which
PCT application claimed priority to U.S. Provisional Appli- 40
cation No. 601125,990, filed Mar. 24, 1999) (issued as U.S.
Pat. No. 7,123,718); pending U.S. Application No. 601169,
274, filed Dec. 7, 1999, entitled "Systems, Methods And
Devices For Trusted Transactions" (issued as U.S. Pat. No.
7,159,116); and PCT Application No. PCT/USOO/21189, 45
filedAug. 4, 2000 (which claims priority to U.S. Patent Appli-
cation Ser. No. 601147,134, filed Aug. 4,1999, and to U.S.
Patent Application No. 60/213,489, filed. Jun. 23, 2000, both
of which are entitled, "A Secure Personal Content Server").
The previously identified patents and/or patent applications 50
are hereby incorporated by reference, in their entireties, as if
fully stated herein.
ence, as if fully stated herein, the total disclosures of U.S. Pat.
No. 5,613,004 "Steganographic Method and Device"; U.S. 55
tal Watermarks in Digitized Data."
into the content in such a manner that the content must
subsequent, unauthorized distribution, commercial or other-
general discussion of digital watermarking as it has been
erence).
applications have been drawn, for instance, to implementa-
developed techniques for adapting watermark application
that are feature-based-i.e., a system in which watermark
in the relationships between multiple samples, such as in a
cies (color or audio), channels in 3D while utilizing discrete-
pseudo-random keys (i.e., cryptographic keys) or possibly
a quantum level.
nology relates directly to the marmer of implementation of the
watermark. Many approaches to digital watermarking leave
60 the digital watermark, not the creator of the work to be pro-
for improvement of the technology. One specific form of
digital information. A method and device are described which 65
Yet another way to perform secure digital watermark imple-
US 7,660,700 B2
3 4
comparing the abstract of the at least one query signal to the 10
abstract of the at least one reference signal to determine if the
tible variations for the same signal (e.g., analyze each of five
versions of the same song-which versions may have the same
lyrics and music but which are sung by different artists); and
2) select those characteristics which achieve or remain rela-
tively constant (or in other words, which have minimum
variation) for each of the signals in the group. Optionally, the
of approaches that are based on perceptual models, such as
transforms fail to assist in greater data reduction of the signal, A method for monitoring a plurality of reference signals is
query signal.
15 other signal characteristics can be identified as candidates for
z-transform analysis, root mean square (rms), signal to peak,
20 analysis are contemplated. While such signal characteristics
may assist in determining particular applications of the
present invention, a generalized approach to signal recogni-
least one signal is also disclosed, which system comprises: a 25
present invention.
motion pictures can all be stored and transmitted as a series of
binary digits-l's and O's. Digital techniques permit the
original information to be duplicated repeatedly with perfect
reference signal input to the processor; a reference database, 30
for each query signal; and a comparing device, coupled to the 35
Unfortunately, digital techniques also permit the information
to be easily copied without the owner's permission. While
digital representations of analog waveforms may be analyzed
the highly effective ability of humans to identify and recog-
at least one signal is disclosed which system comprises: a first
input for receiving at least one reference signal to be moni-
tored, a first processor for creating an abstract of each refer-
ence signal input to the first processor through the first input;
a second input for receiving at least one query signal to be
analyzed, a second processor for creating an abstract of each
query signal; a reference database for storing abstracts of each
at least one reference signal; and a comparing device for
stored abstracts.
to assist in determining the identity of a human.
may be generated by the following steps: 1) analyze the
40 minimal when compared to the benefits of increased accuracy
cesses contemplated by this invention are utilized.
sampled information, such as images, audio and video. Tra-
45 ditional methods of identification and monitoring of those
separate and additional signal. Within this application, such
50 information is in addition to the original signal. One tradi-
tional, text-based additive signal is title and author informa-
tion. The title and author, for example, is information about a
55 one means of monitoring the number of times the text is being
present invention, however, is directed to the identification of
60 times the signal is duplicated. Reliance on an additive signal
65 easily identified and removed by one who wants to utilize the
US 7,660,700 B2
5
ceptually altering the original signal.A watennark may also
6
monitoring efforts. The entity doing the monitoring is not
signal.
watermark techniques (those techniques that are able to sur-
lem.
10 related watermarking key) and forensic watennark tech-
able to survive perceptible alteration of the carrier signal and
15 offs between speed, performance and security of the embed-
ded watennark data.
In other disclosures, we suggest improvements and imple-
example of retaining a logical and perceptible relationship
20 used to "tag" content in a manner that is not humanly-percep-
signal quality is maintained. Watermarking, however, must
25 tennarked state." The changes may affect only a bit, at the
signal characteristics, such as phase infonnation, differences
30 category.
ogy for monitoring purposes. One weakness relates directly
35 watermark are not the creator of the valuable work to be
tion with watennarking technology (including the use of keys 40
ing is not necessary to practice the present invention. Keys for
data (actually imperceptible changes made to the carrier sig- 45
assisting in establishing the watermark message data integrity
in the patents and pending patent applications are incorpo- 50
signal or an instance of its transmission, and its monitoring
A practical difference between the two approaches of using 55
signal itself as the monitoring signal is control. If a separate
the monitoring have to agree as to the nature of the separate 60
signal is used itself as a monitoring signal, then no such 65
user.
binary data.
US 7,660,700 B2
7
cial quality distribution, but to assist in identification, analysis
or monitoring of the signal. Most compression is either lossy
or lossless and is designed with psychoacoustic or psychovi-
sual parameters. That is to say, the signal is compressed to
retain what is "humanly-perceptible." As long as the com-
pression successfully mimics human perception, data space
may be saved when the compressed file is compared to the
uncompressed or original file. While psychoacoustic and psy-
chovisual compression has some relevance to the present
8
meet the demands of various classes of signal recognition.
information about a plurality of potential signals that will be
10 the various artists, for example, contain digital copies of all
another form, the reference database would contain not per-
15 all songs that have been preprocessed such that the copies
In another form, the reference database would contain digital
20 those perceptual differences that can differentiate one version
such as two or more versions of the same song, but by differ-
25 tographs, and video as well.
segment a portion of a signal being monitored for analysis
30 may be thought of comprising a set of objects. A song record-
objects. The objects need not be of uniform length, size, or
35 objects; color and size are examples.
analyze a selected object and identifY perceptual features of
40 all, of the perceptual qualities of the object that differentiate it
feature selector has a direct relationship with the perceptibil-
algorithm deem as candidate bits for mapping independent 50
45 the authenticity of any given object. Highly granular, and
objects that are easily recognizable and valuable, for
feature selector to the plurality of signals in the reference
55 plurality of signals is stored in the reference database and
speed and efficiency), the exact nature of the comparison will
60 database. Alternatively, the comparing device may need to
65 using input from the feature selector and then compare the
US 7,660,700 B2
9
ture selector, process the selected object using input from the
10
information.
can represent and differentiate two digitized signal represen-
The fifth element is the recorder which records infonnation
10 tations for a given predefined signal set. Each of such repre-
Other elements may be added to the system or incorporated
error handler may offer further processing in order to identify
further analyzed selected object that actually confonns with
15 should receive its parameters from a database engine. The
Moreover, one or more of the five identified elements may
20 tical, except that the signal may have different perfonnance or
utilization in the newly created object, benefits over additive
or text-based identifiers are achieved. Additionally, decisions
regarding the success or failure of an accurate detection of any
given object may be flexibly implemented or changed to
the signal analysis being conducted within the system, includ-
ing, for example, the signal analyses being perfonned within 30
tion.
25 reflect market-based demands of the engine. Appropriate
examples are songs or works or art which have been sampled
or re-produced by others who are not the original creator.
Since maintenance of original signal quality is not required 35
to the extent that efficiencies can be achieved both in accuracy
and speed with enabling logical relationships between an 40
original signal while reducing the data overhead to enable
more efficient analysis, archiving and monitoring of these 45
fewer repetitions of objects or those systems which are
on a third party who authored or created the signal in question.
describe the original signal. By utilizing less than the original
signal, a computationally inexpensive means of identification 55
transparency of infonnation data flow across communica-
tions channels is likely to result. This feature is significant in 60
needs of a particular market for the digitized infonnation data 65
50 Accuracy in processing and identification may be
may be used to assist in detennining the distance between
US 7,660,700 B2
11
12
able information to increase the accuracy of the database.
S) Finally, the predetermined parameters that are associ-
identify the signals. For example, if a song is transmitted over
yet from a song played using an 8-bit Internet broadcast.
significant cases: First, in instances where the recognized
the previously selected criteria may not be able to differenti- 10
"recalibration" to further differentiate the two objects stored 15 selection of an identification means which can be optimized
the fidelity of the transmission means. Objects may be cata-
in the database.
20 ing will occur using a specific transmission fidelity. For
maximum efficiency, different data bases may be created for
25 broadcasts, Internet broadcasts, etc.
mation systems, see The Mathematical Theory o/Communi-
cation (1948), by Shannon.
30 to the total number of bits that can be transmitted in a fixed
a discrete segment of the song (that may be used for promo-
tion or marketing-for the complete song or for an entirely 35
signal, cognitive identification is a form of filtering to enable
differentiations between different and intended uses of the 40
fied relationship with subsequent use of the identification
means can be used to create a history as to how often a 45
separate and distinct good or service and use of the excerpt to
promote recognition of the song itself (for example, by the 50
a subset are typically based on agreement by the creator and
the sender who seeks to utilize the work. Trust in the means 55
mitted over any given chaunel must take into consideration
and recognize signals. A discussion of this is found in a
co-pending application by the inventor under U.S. patent
application Ser. No. 08/674,726 "Exchange Mechanisms for
Digital Information Packages with Bandwidth Securitization,
Multichannel Digital Watermarks, and Key Management"
(which application is incorporated herein by reference as if
fully setforth herein).
the information carrier signal (pre-recorded or newly created
60 in certain markets or instances).
In the case of predetermined carrier signals (those which
tional information carrier signals" are contemplated by this
65 ingly "same" information carrier that can be recognized as
US 7,660,700 B2
13 14
higher value in some predetermined sense, cryptographic
protocols, such as a hash or digital signature, can be used to
rize transmission or use of their recordings by others, can
transmission at a later point in time, creates recognizable
10 The rules for the creator himself to enter his work would differ
The monitoring and analysis contemplated by this inven- 15
the following: to determine the number of times a song is
broadcast on a particular radio broadcast or Internet site; to
to identify associations between a beginner's drawing and 20
these examples could be achieved with any significant degree
text-based systems fail to fully capture the inherent value of 25
SAMPLE EMBODIMENTS
Sample Embodiment 1 30
A database of audio signals (e.g., songs) is stored or main-
tained by a radio station or Internet streaming company, who
may select a subset of the songs are stored so that the subset
may be later broadcast to listeners. The subset, for example, 35
may comprise a sufficient number of songs to fill 24 hours of
music programming (between 300 or 500 songs). Tradition-
ally, monitoring is accomplished by embedding some identi-
fier into the signal, or affixing the identifier to the signal, for
later analysis and determination of royalty payments. Most of 40
the traditional analysis is performed by actual persons who
use play lists and other statistical approximations of audio
play, including for example, data obtained through the
manual (i.e., by persons) monitoring of a statistically signifi-
cant sample of stations and transmission times so that an 45
extrapolation may be made to a larger number of comparable
markets.
respectively). Those skilled in the art of algorithmic informa-
have predetermined flexibility directly related to computa-
flexibility in having transparent determination of unique sig-
allows for no such transparency to the copyright creators.
Sample Embodiment 2
data, and yet preserve those perceptual qualities that permit a
mented.
ing a sun, compressing the data to its essential characteristics
50 then finding matches in a database of other visual images
for example, could learn much by comparing the presenta-
measured in digital terms) is much smaller than the size of the 55
first database, and is determined by the rate of compression.
police artist.
pressed at a 10,000: 1 compression rate, the reduced data
60 cussed above can be used for audio-visual monitoring, such
cable station that is broadcasting a audio channel unaccom- With greater compression rates, it is anticipated that simi-
different analog signals (e.g., recordings by two different 65
the use of bit-addres sable differences to distinguish between
panied by video.
US 7,660,700 B2
15
by the following claims. As will be easily understood by those
What is claimed:
16
13. The system of claim 1, wherein the match indicates that
the abstract of the query signal comprises the same perceptual
characteristics as the abstract of the matched one of the ref-
erence signals.
14. The system of claim 1, wherein the parameters com-
prise commonly perceptible features.
15. The system of claim 14, wherein the commonly per-
ceptible features are selected.
1. An electronic system for monitoring and analyzing at
least one signal, comprising:
16. The system of claim 1, wherein said first and said
10 second processors are the same processor.
a first input that receives at least one reference signal to be
monitored,
signal input to said first processor through said first input
wherein the abstract comprises signal characteristic 15
parameters configured to differentiate between a plural-
ity of versions of the reference signal;
a second input that receives at least one query signal to be
analyzed,
a second processor that creates an abstract of each query 20
signal wherein the abstract comprises signal character-
istic parameters of the query signal;
a reference database that stores abstracts of each at least
one reference signal;
a comparing device that compares an abstract of said at 25
least one query signal to the abstracts stored in the ref-
erence database to determine if the abstract of said at
least one query signal matches any of the stored abstracts
wherein a match indicates the query signal is a version of
at least one of the reference signals.
2. The system of claim 1, wherein said second input is
remotely coupled to the system.
3. The system of claim 1, wherein said second processor is
30
4. The system of claim 1, wherein the system transmits the 35
parameters that are being used by the first processor to the
second processor.
5. The system of claim 1, wherein the stored abstracts
ence signal. 40
6. The system of claim 1, wherein at least two of the stored
abstracts comprise information corresponding to two ver-
sions of at least one reference signal.
7. The system of claim 1, wherein the stored abstracts 45
comprise data describing a portion of the characteristics of its
associated reference signal.
8. The system of claim 7, wherein the characteristics of the
reference signal being described comprise at least one of a
perceptible characteristic, a cognitive characteristic, a subjec- 50
tive characteristic, a perceptual quality, a recognizable char-
acteristic or combinations thereof.
9. The system of claim 1, wherein each stored abstract
comprises data unique to each variation of its corresponding
reference signal.
10. The system of claim 1, wherein the system applies a
cryptographic protocol to the abstract of said reference signal,
said query signal, or both said reference signal and said query
signal.
55
11. The system of claim 10, wherein the cryptographic 60
further comprising storing the hashed abstract and/or digi-
tally signed abstract.
12. The system of claim 1, further comprising an embedder
to embed uniquely identifiable data into at least one of the 65
received reference signal, the received query signal or both
the received reference signal and the received query signal.
17. The system of claim 1, wherein the first processor and
the second processor are different processors.
18. A method for monitoring the distribution of data sig-
nals, comprising:
creating an abstract for a data signal wherein the data signal
abstract comprises signal characteristic parameters con-
figured to differentiate between a plurality of versions of
the data signal;
storing the data signal abstract in at least one reference
database;
receiving a query signal;
creating an abstract for the query signal based on the
parameters;
comparing the created query signal abstract to the at least
one database of data signal abstracts, each abstract in the
at least one database corresponding to a version of the
data signal; and
determining whether the query signal abstract matches any
of the stored data signal abstracts in the at least one
database to enable authorized transmission or use of the
query signal for the query signal abstract based on
whether a match was determined.
19. The method of claim 18, wherein the database is cre-
ated by at least one of a music company, a movie studio, an
image archive, an owner of a general computing device, a user
of the data signal, an internet service provider, an information
technology company, a body politic, a telecommunications
company and combinations thereof.
20. The method of claim 18, wherein the data signals
comprise at least one of images, audio, video, and combina-
tions thereof.
21. The method of claim 18, wherein the stored data signal
abstracts are derived from one of a cognitive feature or a
perceptible characteristic of the associated data signals.
22. The method of claim 18, furthering comprising apply-
ing a cryptographic protocol to at least one created signal
abstract, at least one database signal abstract or both at least
one created signal abstract and at least one database signal
abstract.
23. The method of claim 22, wherein the cryptographic
protocol comprises one of a hash or digital signature.
24. The method of claim 18, wherein the stored signal
abstracts comprise data to differentiate versions of the corre-
sponding data signals.
25. The method of claim 18, wherein each of the stored data
signal abstracts comprise information configured to differen-
tiate variations of each referenced corresponding data signal.
26. The method of claim 18, further comprising storing
information associated with the comparison step to enable at
least one of a re-calibration of the database, a heuristic-based
adjustment of the database, a computational efficiency adjust-
ment of the database, an adjustment for database collisions
and/or null cases, changes to the recognition or use param-
eters governing the database and combinations thereof.
27. The method of claim 18, further comprising applying
one of a relatedness index or measure of similarity to generate
uniquely identifiable information to determine authorization.
US 7,660,700 B2
17
28. The method of claim 18, further comprising encoding
information into the data signal with a watermarking tech-
nique.
29. The process of claim 18, wherein the data signal is
received by one of a creator or owner of said data signal.
30. A system for identifYing and distributing signals, com-
prising:
a first input that receives a query abstract of a signal to
identify;
a database containing a plurality of signal abstracts, the 10
plurality of signal abstracts each associated with a cor-
responding signal wherein each of the plurality of the
signal abstracts retains a perceptual relationship with the
corresponding signal;
a comparing device that compares the query abstract to the 15
plurality of abstracts stored in the reference database to
identify a matching signal abstract; and
a device for retrieving the signal corresponding to the
matching signal abstract; and
a device for conducting a transaction, the transaction 20
selected from the group consisting of a download and a
subscription.
31. The system of claim 30, wherein each signal abstract
comprises a link to its corresponding signal.
32. The system of claim 30, wherein the comparing device 25
determines if the signal abstracts stored in the database are
authorized.
18
receiving at least one reference signal to be identified,
creating an abstract of each reference signal received based
on perceptual characteristics representative of param-
eters to differentiate between versions of the reference
signal;
storing abstracts of each reference signal received in a
database;
receiving at least one query signal to be identified,
creating an abstract of the received query signal based on
the parameters; and
comparing an abstract of said received query signal to the
abstracts stored in the database to determine if the
abstract of said received query signal is related to any of
the stored abstracts.
41. The process of claim 40, wherein said database is
independently accessible.
42. The process of claim 40, wherein said received query
signal is independently stored.
43. The process of claim 40, wherein the criteria used to
compare a received query signal abstract with a stored refer-
ence signal abstract are adjustable.
44. The process of claim 40, wherein the stored abstracts
ence signal.
45. The process of claim 40, wherein at least two of the
stored abstracts comprise information corresponding to two
versions of at least one reference signal.
33. The system of claim 30, wherein the comparing device
determines if the link is an authorized link.
34. The system of claim 30, wherein the reference database
is governed by heuristics or experience-based parameters.
46. The process of claim 40, wherein at least one abstract
comprises data describing a portion of the characteristics of
30 its associated reference signal.
35. The system of claim 30, wherein the plurality of
abstracts stored in the reference database are derived from
one of data reduced versions of said corresponding signals,
compressed variations of said corresponding signals, bit-ad-
dressable relationships between said corresponding signals,
and a least amount of data required to uniquely identify each
corresponding signal, and combinations thereof.
36. The system of claim 30, wherein the device for con-
ducting transactions or the device for retrieving the signal is
37. The system of claim 30, wherein the device for con-
ducting transactions or the device for retrieving the signal is
controlled by the database.
38. The system of claim 30, wherein the device for retriev-
ing the signal and the device for conducting transactions
comprise the same device.
39. The system of claim 30, further comprising an embed-
der to watermark signals with uniquely identifiable informa-
tion.
40. A process for analyzing and identifYing at least one
signal, comprising:
47. The process of claim 46, wherein the characteristics of
the reference signal being described comprise at least one of
a perceptible characteristic, a cognitive characteristic, a sub-
jective characteristic, a perceptual quality, a recognizable
35 characteristic or combinations thereof.
48. The process of claim 40, wherein a stored abstract
comprises data unique to a variation of its corresponding
reference signal.
49. The process of claim 40, wherein the process further
40 comprises applying a cryptographic protocol to the abstract
of said reference signal, said query signal, or both said refer-
ence signal and said query signal.
50. The process of claim 49, wherein the cryptographic
45 further comprising storing the hashed abstract and/or digi-
tally signed abstract.
51. The process of claim 40, further comprising distribut-
ing at least one signal based on the comparison step.
52. The process of claim 51, further comprising water-
50 marking the at least one signal to be distributed.
* * * * *
PATENT NO.
APPLICATION NO.
DATED
INVENTOR(S)
: 7,660,700 B2
: 12/005229
: February 9,2010
: Scott Moskowitz
Page 1 of 1
-- This application claims the benefit of pending U.S. patent--
should read:
-- This application is related to pending U.S. patent --
Thirteenth Day of September, 2011
~ J 3 : . t : : ~
David J. Kappos
EXHIBIT D
Moskowitz et al.
(75) Inventors: Scott A. Moskowitz, Miami, FL (US);
Michael W. Berry, Albuquerque, NM
(US)
(73) Assignee: Blue Spike, Inc., Sunny Isles Beach,
FL (US)
U.S.c. 154(b) by 722 days.
(21) Appl. No.: 09/657,181
(22) Filed: Sep. 7, 2000
(51) Int. Cl.
G06F 19/00 (2006.01)
(52) U.S. Cl. .............................. 702/182; 70711; 707/2;
707/3; 707/10; 709/209; 705/51; 380/28
(58) Field of Classification Search ................ 7021182;
707/3, 1,2, 10; 382/100,232,282; 380/200,
380/201,202,203,217,28; 7131176; 709/209;
705/51
3,947,825 A * 311976 Cassada ......................... 707/3
3,984,624 A 1011976 Waggener
3,986,624 A 1011976 Cates, Jr. et al.
4,038,596 A 711977 Lee
4,200,770 A 411980 Hellman et al.
4,218,582 A 811980 Hellman et al.
4,339,134 A 711982 Macheel
4,405,829 A 911983 Rivest et al.
4,424,414 A 111984 Hellman et al.
4,528,588 A 711985 Lofberg
4,672,605 A 611987 Hustig et al.
4,748,668 A 511988 Shamir et al.
4,789,928 A 1211988 Fujisaki
4,827,508 A 511989 Shear
4,876,617 A 1011989 Best et al.
4,896,275 A 111990 Jackson
4,939,515 A 711990 Adelson
4,969,204 A 1111990 Jones et al.
4,972,471 A 1111990 Gross et al.
4,977,594 A 1211990 Shear
4,979,210 A 1211990 Nagata et al.
4,980,782 A 1211990 Ginkel
5,050,213 A 911991 Shear
5,073,925 A 1211991 Nagata et al.
5,077,665 A 1211991 Silverman et al.
5,113,437 A 511992 Best et al.
5,136,581 A 811992 Muehrcke
5,161,210 A 1111992 Druyvesteyn et al.
5,243,423 A 911993 Dejean et al.
5,243,515 A 911993 Lee
5,287,407 A 211994 Holmes
5,319,735 A 611994 Preuss et al.
5,341,429 A 811994 Stringer et al.
5,341,477 A 811994 Pitkin et al.
5,363,448 A 1111994 Koopman et al.
111111 1111111111111111111111111111111111111111111111111111111111111
EP
EP
EP
EP
EP
US0073464 72B 1
(10) Patent No.:
(45) Date of Patent:
US 7,346,472 Bl
Mar. 18,2008
5,365,586 A 1111994 Indeck et aI.
5,369,707 A 1111994 Follendore, III
5,379,345 A 111995 Greenberg
5,394,324 A 2/1995 Clearwater
5,398,285 A 3/1995 Borgelt et al.
5,406,627 A 4/1995 Thompson et al.
5,408,505 A 4/1995 Indeck et aI.
5,410,598 A 4/1995 Shear
5,412,718 A 5/1995 Narasimhalv et al.
5,418,713 A 5/1995 Allen
5,428,606 A 6/1995 Moskowitz
5,450,490 A 9/1995 Jensen et al.
5,469,536 A 1111995 Blank
5,478,990 A 12/1995 Montanari et aI.
5,479,210 A * 12/1995 Cawleyet aI.
5,487,168 A 111996 Geiner et aI.
5,493,677 A 2/1996 Balogh et al.
5,497,419 A 3/1996 Hill
5,506,795 A 4/1996 Yamakawa
(Continued)
0372601 Al 6/1990
0565947 Al 10/1993
0581317 A2 2/1994
0649261 4/1995
0651554 A 5/1995
(Continued)
OTHER PUBLICATIONS
348/390.1
Sirbu, M. et al: "Netbill: An Internet Commerce System Optimized
for Network Delivered Services," Digest of Papers of the Computer
Society Computer Conference (Spring), Mar. 5, 1995, pp. 20-25,
vol. CONF. 40, COMPCON, US, Los Alamitos, IEEE Compo Soc.
Press.
Schunter M. et aI., "A status report on the SEMPER framework for
secure electronic commerce," Computer Networks and ISDN Sys-
tems, Sep. 30,1998, pp. 1501-1510, vol. 30, No. 16-18, NL, North
Holland Publishing, Amsterdam.
(Continued)
Primary Examiner---Carol S. W. Tsai
(57) ABSTRACT
recorded, and other useful information about the query
signals. Moreover, the method by which abstracts are gen-
erated can be programmable based upon selectable criteria.
The system can also be progrannned with error control
software so as to avoid the re-occurrence of a query signal
that matches more than one signal stored in the reference
database.
US 7,346,472 Bl
Page 2
U.S. PATENT DOCUMENTS 5,999,217 A 12/1999 Berners-Lee
6,009,176 A 12/1999 Gennaro et al.
5,513,261 A 411996 Maher
6,029,126 A * 212000 Malvar ....................... 704/204
5,530,739 A 611996 Okada
6,041,316 A 3/2000 Allen
5,530,751 A 611996 Morris
6,049,838 A 4/2000 Miller et al.
5,530,759 A 611996 Braudawayet al.
6,051,029 A 4/2000 Paterson et al.
5,539,735 A 711996 Moskowitz
6,061,793 A 5/2000 Tewfik et al.
5,548,579 A 811996 Lebrun et al.
6,069,914 A 5/2000 Cox
5,568,570 A 1011996 Rabbani
5,579,124 A 1111996 Aijala et al.
6,081,251 A 6/2000 Sakai et al.
5,581,703 A 1211996 Baugher et al.
5,583,488 A 1211996 Sala et al.
6,088,455 A * 7/2000 Logan et al. ............... 3801200
5,598,470 A 111997 Cooper et al.
6,131,162 A 1012000 Yoshiura et al.
5,606,609 A 211997 Houser et al.
6,141,753 A 1012000 Zhao et al.
6,141,754 A 1012000 Choy
5,617,119 A 411997 Briggs et al.
6,154,571 A 1112000 Cox et al.
5,625,690 A 411997 Michel et al.
6,199,058 Bl 3/2001 Wong et al.
5,629,980 A 511997 Stefik et al.
6,205,249 Bl * 3/2001 Moskowitz ................. 3821232
5,633,932 A 511997 Davis et al.
6,208,745 Bl 3/2001 Florenio et al.
5,634,040 A 511997 Her et al.
6,230,268 Bl 5/2001 Miwa et al.
5,636,276 A 611997 Brugger
6,233,347 Bl 5/2001 Chen et al.
5,636,292 A 611997 Rhoads
6,233,684 Bl 5/2001 Stefik et al.
5,640,569 A 611997 Miller et al.
6,240,121 Bl 5/2001 Senoh
5,646,997 A 711997 Barton
6,272,634 Bl 8/2001 Tewfik et al.
5,664,018 A 911997 Leighton
6,278,780 Bl 8/2001 Shimada
5,673,316 A 911997 Auerbach et al.
5,680,462 A 1011997 Miller et al.
6,282,300 Bl * 8/2001 Bloom et al. ............... 382/100
5,687,236 A 1111997 Moskowitz et al.
6,282,650 Bl 8/2001 Davis
5,689,587 A 1111997 Bender et al.
6,285,775 Bl 9/2001 Wu et al.
5,696,828 A 1211997 Koopman, Jr.
6,301,663 Bl 10/2001 Kato et al.
5,719,937 A 211998 Warren et al.
6,310,962 Bl 10/2001 Chung et al.
5,721,788 A 211998 Powell et al.
6,330,335 Bl 12/2001 Rhoads
5,734,752 A 311998 Knox
6,330,672 Bl 12/2001 Shur
5,737,416 A 411998 Cooper et al.
5,737,733 A 411998 Eller
6,373,892 Bl 4/2002 !chien et al.
5,740,244 A 411998 Indeck et al.
6,377,625 Bl * 4/2002 Kim ...................... 375/240.08
6,381,618 Bl 4/2002 Jones et al.
5,748,783 A 511998 Rhoads
6,381,747 Bl 4/2002 Wonfor et al.
5,751,811 A 511998 Magnotti et al.
6,385,329 Bl 5/2002 Sharma et al.
5,754,697 A * 511998 Fu et al. ..................... 3821232
6,405,203 Bl 6/2002 Collart
5,757,923 A 511998 Koopman, Jr.
6,415,041 Bl 7/2002 Oami et al.
5,765,152 A 611998 Erickson
6,425,081 Bl 7/2002 Iwamura
5,774,452 A 611998 Wolosewicz
6,430,302 B2 * 8/2002 Rhoads ....................... 382/100
5,790,677 A 811998 Fox et al.
6,442,283 Bl * 8/2002 Tewfik et al. ............... 382/100
5,799,083 A 811998 Brothers et al.
6,453,252 Bl 912002 Laroche
5,809,139 A 911998 Girod et al.
6,457,058 Bl 912002 Ullum et al.
5,809,160 A 911998 Powell et al.
6,493,457 Bl 1212002 Quackenbush
5,822,432 A 1011998 Moskowitz et al.
6,522,767 Bl 212003 Moskowitz et al.
5,828,325 A 1011998 Wolosewicz et al.
6,522,769 Bl 212003 Rhoads et al.
5,832,119 A 1111998 Rhoads
6,523,113 Bl 212003 Wehrenberg
5,848,155 A 1211998 Cox
6,530,021 Bl 3/2003 Epstein et al.
5,859,920 A 111999 Daly et al.
6,539,475 Bl 3/2003 Cox et al.
5,870,474 A 211999 Wasilewski et al.
6,557,103 Bl 4/2003 Boncelet, Jr. et al.
5,884,033 A 311999 Duvall et al.
6,584,125 Bl * 6/2003 Katto ......................... 370/537
6,598,162 Bl 7/2003 Moskowitz
5,893,067 A 411999 Bender et al.
6,606,393 Bl * 8/2003 Xie et al. ................... 382/100
5,894,521 A 411999 Conley
6,647,424 Bl 1112003 Pearson et al.
5,903,721 A 511999 Sixtus
6,665,489 B2 12/2003 Collart
6,668,246 Bl 12/2003 Yeung et al.
5,905,975 A 511999 Ausubel
6,687,683 Bl 212004 Harada et al.
5,912,972 A 611999 Barton
6,725,372 Bl * 4/2004 Lewis et al. ................ 713/176
5,915,027 A 611999 Cox et al.
6,754,822 Bl 6/2004 Zhao
5,917,915 A 611999 Hirose
6,775,772 Bl 8/2004 Binding et al.
5,920,900 A 711999 Poole et al.
6,785,815 Bl 8/2004 Serret-Avila et al.
5,930,369 A 711999 Cox et al.
6,823,455 Bl 1112004 Macy et al.
5,930,377 A 711999 Powell et al.
6,977,894 Bl 12/2005 Achilles et al.
5,940,134 A 811999 Wirtz
6,978,370 Bl 12/2005 Kocher
5,943,422 A 811999 Van Wie et al.
7,043,050 B2 5/2006 Yuval
5,963,909 A 1011999 Warren et al. 7,058,570 Bl 6/2006 Yu et al.
5,973,731 A 1011999 Schwab 200210026343 Al 212002 Duenke
5,974,141 A 1011999 Saito 200210097873 Al 7/2002 Petrovic
5,991,426 A 1111999 Cox et al. 200210103883 Al 8/2002 Haverstock et al.
US 7,346,472 Bl
Page 3
2003/0126445 Al
2003/0133702 Al
2004/0037449 Al
2004/0128514 Al
2005/0160271 A9
2006/0005029 Al
2006/0013395 Al
7/2003 Wehrenberg
7/2003 Collart
212004 Davis et al.
7/2004 Rhoads
7/2005 Brundage et al.
112006 Petrovic et al.
112006 Brundage et al.
NL
WO
WO
WO
WO
WO
WO
WO
WO
100523
WO 95114289
96/29795
97/24833
WO 9744736
W098/37513
WO 9952271
WO 99/62044
WO 9963443
9/1998
5/1995
9/1996
7/1997
1111997
8/1998
10/1999
12/1999
12/1999
OTHER PUBLICATIONS
Konrad, K. et aI., "Trust and electronic connnerce-more than a
technical problem," Proceedings of the 18
th
IEEE Symposium on
Reliable Distributed Systems, Proceedings 18
th
IEEE Symposium
on Reliable Distributed Systems, Oct. 19-22, 1999, pp. 360-365,
Lausanne, Switzerland.
Kini, A. et aI., "Trust in electronic connnerce: definition and
theoretical considerations," Proceedings of Thirty-first Hawaii
International Conference on System Sciences (Cat. No.
98TB100216), Jan. 6-9, 1998, pp. 51-61, Los Alamitos, CA, USA,
IEEE Comput. Soc.
Steinauer D.D. et aI., "Trust and traceability in electronic com-
merce," Standard View, Sep. 1997, pp. 118-124, vol. 5, No.3, ACM,
USA.
Moskowitz, Scott, "Bandwidth as Currency," IEEE MultiMedia,
Jan.-Mar. 2003, pp. 14-21.
Pending U.S. Appl. No. 08/999,766, filed Jul. 23, 1997, titled
"Steganographic Method and Device," assignee Wistaria Trading,
Inc.
Pending U.S. Appl. No. 09/456,319, filed Dec. 8, 1999, titled
"Transform Implementation of Digital Watermarks," assignee
Wistaria Trading, Inc.
Pending U.S. Appl. No. 08/674,726, filed Jul. 2, 1996, titled
"Exchange Mechanisms for Digital Information Packages with
Bandwidth Securitization, Multichannel Digital Watermarks, and
Key Management," assignee Wistaria Trading, Inc.
Pending U.S. Appl. No. 09/545,589, filed Apr. 7, 2000, titled
"Method and System for Digital Watermarking," assignee Wistaria
Trading, Inc.
Pending U.S. Appl. No. 091046,627, filed Mar. 24, 1998, titled
"Method for Combining Transfer Function with Predetermined Key
Creation," inventor: Moskowitz et al.
Pending U.S. Appl. No. 09/594,719, filed Jun. 16, 2000, titled
Systems," inventor: Moskowitz et al.
Pending U.S. Appl. No. 091731,040, filed Dec. 7, 2000, titled
"Systems, Methods and Devices for Trusted Transactions," assignee
Blue Spike.
Pending U.S. Appl. No. 10/049,101, filed Feb. 8, 2002, titled "A
Secure Personal Content Server," assignee Blue Spike.
Pending U.S. Appl. No. 09/657,181, filed Sep. 7, 2000, titled
"Method and Device for Monitoring and Analyzing Signals,"
assignee Blue Spike.
Pending U.S. Appl. No. 09/671,739, filed Sep. 29, 2000, titled
"Method and Device for Monitoring and Analyzing Signals,"
assignee Blue Spike.
Pending U.S. Appl. No. 091956,262, filed Sep. 20, 2001, titled
"Improved Security Based on Subliminal and Supraliminal Chan-
nels for Data Objects," assignee Blue Spike.
Pending U.S. Appl. No. 091731,039, filed Dec. 7, 2000, titled
"System and Method for Permitting Open Access to Data Objects
and For Securing Data within the Data Objects," assignee Blue
Spike.
Pending U.S. Appl. No. 10/369,344, filed Feb. 18, 2003, titled
"Optimization Methods for the Insertion, Protection, and Detection
of Digital Watermarks in Digital Data," assignee Wistaria Trading.
Pending U.S. Appl. No. 091789,711, filed Feb. 22, 2001, titled
"Optimization Methods for the Insertion, Protection and Detection
of Digital Watermarks," assignee Wistaria Trading.
Pending U.S. Appl. No. 09/644,098, filed Aug. 23, 2000, titled
"Multiple Transform Utilization and Application for Secure Digital
Watermarking," inventor S. Moskowitz.
Pending U.S. Appl. No. 091767,733, filed Jan. 24, 2001, titled
"Multiple Transform Utilization and Application for Secure Digital
Watermarking," inventor S. Moskowitz.
Pending U.S. Appl. No. 10/417,231, filed Apr. 17, 2003, titled
"Method, System and Devices for Packet Watermarking and Effi-
cient Provisioning of Bandwidth," inventor S. Moskowitz.
Pending U.S. Appl. No. 091281,279, filed Mar. 30, 1999, titled
"Optimization Methods for the Insertion, Protection, and Detection
of Digital Watermarks in Digital Data," inventor S. Moskowitz.
Schneier, Bruce, Applied Cryptography, 2nd Ed., John Wiley &
Sons, pp. 9-10, 1996.
Menezes, Alfred J., Handbook of Applied Cryptography, CRC
Press, p. 46, 1997.
Merriam-Webster's Collegiate Dictionary, lOth Ed., Merriam
Copeland, et aI., Real Options:A Practioner's Guide, 2001 pp.
106-107, 201-202, 204-208.
Sarkar, M. "An Assessment of Pricing Mechanisms for the
Internet-A Regulatory Imperative", presented MIT Workshop on
Internet Economics, Mar. 1995 http://www.press.vmich.edu/jep/
works/SarkAsses.htrnl on March.
Crawford, D.W. "Pricing Network Usage: A Market for Bandwith of
Market Connnunication?" presented MIT Workshop on Internet
Economics, Mar. 1995 http://www.press.vmich.eduljep/works/
CrawMarket.htrnl on March.
nec .com/366503 .htrnl.
Caronni, Germano, "Assuring Ownership Rights for Digital
Images", published proceeds of reliable IT systems, v15 '95, H.H.
Bruggemann and W Gerhardt-Hackel (Ed.), Viewing Publishing
Company, Germany, 1995.
Zhao, Jian. "A WWW Service to Embed and Prove Digital Copy-
right Watermarks", Proc. of the european conf. on Multimedia
Applications, Services & Techinques, Louvain-La-Neuve, Belgium,
May 1996.
Information Hiding. No. 1174 in Lecture Notes in Computer Sci-
ence.Cambridge.England (May/Jun. 1996).
Oomen,A.W.J. et aI., A Variable Bit Rate Buried Data Channel for
Ten Kate,W. et al., A New Surround-Stereo-Surround Coding Tech-
Gerzon, Michael et al., A High Rate Buried Data Channel for Audio
(1993).
Sklar,Bernard, Digital Connnunications, pp. 601-603 (1988).
Jayant, N.S. et al., Digital Coding of Waveforms, Prentice Hall Inc.,
Bender, Walter R. et aI., Techniques for Data Hiding, SPIE Int. Soc.
Opt. Eng., vol. 2420, pp. 164-173, 1995.
Zhao, Jian et aI., Embedding Robust Labels into Images for Copy-
right Protection, (xp 000571976), pp. 242-251, 1995.
Menezes, Alfred J., Handbook of Applied Cryptography, CRC
Press, p. 175, 1997.
Ten Kate, W. et aI., "Digital Audio Carrying Extra Information",
IEEE, CH 2847-219010000-1097, (1990).
van Schyndel, et al. A digital Watermark, IEEE Int'I Computer
US 7,346,472 Bl
Page 4
Smith, et al. Modulation and Information Hiding in Images,
Springer Verlag, 1st Int'I Workshop, Cambridge, UK, May 30-Jun.
1, 1996, pp. 207-227.
Kutter, Martin et aI., Digital Signature of Color Images Using
Amplitude Modulation, SPIE-EI97, vol. 3022, pp. 518-527.
Mar. 1997, pp. 108-118.
Swanson, Mitchell D.,et aI., Transparent Robust Image Watermark-
ing, Proc. of the 1996 IEEE Int'I Conf. on Image Processing, vol.
111, 1996, pp. 211-214.
Swanson, Mitchell D., et al. Robust Data Hiding for Images, 7th
1996, pp. 37-40.
Zhao, Jian et aI., Embedding Robust Labels into Images for Copy-
right Protection, Proceeding of the Know Right '95 Conference, pp.
242-251.
Koch, E., et al., Towards Robust and Hidden Image Copyright
Labeling, 1995 IEEE Workshop on Nonlinear Signal and Image
Processing, Jun. 1995 Neos Marmaras pp. 4.
Van Schyandel, et aI., Towards a Robust Digital Watermark, Second
2,pp. 504-508.
O'Ruanaidh, et al. Watermarking Digital Images for Copyright
Protection, IEEE Proceedings, vol. 143, No.4, Aug. 96, pp. 250-
256.
NEC Research Institude, Techinal Report 95-10, pp. 33.
xIII, 81-83,513,515,522-526,863.
Boney, et al., Digital Watermarks for Audio Signals, EVSIPCO, 96,
pp. 473-480.
Dept. of Electrical Engineering, Del Ft University of Technology,
Del ft The Netherlands,Cr.C. Langelaar et al.,Copy Protection for
Mulitrnedia Data based on Labeling Techniques, Jul. 1996 9 pp.
F. Hartung, et aI., Digital Watermarking of Raw and Compressed
Video, SPIE vol. 2952, pp. 205-213.
Craver, et al., Can Invisible Watermarks Resolve Rightful Owner-
Press, et aI., Numerical Recipes In C, Cambridge Univ. Press, 1988,
pp. 398-417.
Pohlmann, Ken C., Principles of Digital Audio, 3rd Ed., 1995, pp.
32-37, 40-48, 138, 147-149,332,333,364, 499-501,508-509,564-
571.
Pohlmann, Ken c., Principles of Digital Audio, 2nd Ed., 1991, pp.
1-9,19-25,30-33,41-48,54-57,86-107,375-387.
Schneier, Bruce, Applied Cryptography, John Wiley & Sons, inc.,
New York, 1994, pp. 68,69,387-392,1-57,273-275,321-324.
the International Conf. on Multimedia Computing and Systems,
Jun. 17-23, 1996,Hiroshima Japan 0-8186-7436-9196, pp. 473-480.
Johnson, et aI., Transform Permuted Watermarking for Copyright
New York New York vol. 2 1998 pp. 684-689 (ISBN 0-7803-4985-
7).
Rivest, et aI., "Pay Word and Micromint: Two Simple Micropay-
ment Schemes," MIT Laboratory for Computer Science, Cam-
bridge, MA, May 7, 1996 pp. 1-18.
vol. 35, Nos. 3 & 4,1996,pp. 313-336.
2003, pp. 14-21.
Rivest, et aI., "Pay Word and MicroMint: Two Simple Micropayment
Schemes" Mir Laboratory for Computer Science, Cambridge, MA,
Apr. 27, 2001, pp. 1-18.
Tomsich, et al., "Towards a secure and de-centralized digital
(ECWEB.
Moskowitz, "What is Acceptable Quality in the Application of
Digital Watermarking: Trade-offs of Security, Robustness and Qual-
ity", IEEE Computer Society Proceedings of ITCC 2002 Apr. 10,
2002 pp. 80-84.
("IWDW" 2006), Springer Lecture Notes in Computer Science
2006, (to appear) 13.
Research, Inc. 2002-2003 14 pages.
Society Computer Conference (Spring) Mar. 5, 1995 pp. 20-25 vol.
CONF40.
Secure Electronic Commerce", Computer Networks and ISDN
Systems, Sep. 30,1998 pp. 1501-1510 vol. 30, No. 16-18 NL North
Holland.
Reliable Distributed Systems Oct. 19-22, 1999 pp. 360-365
Lausanne.
Kini, a. et aI., "Trust in Electronic Commerce: Definition and
Theoretical Considerations", Proceedings of the 31st Hawaii Int'I
Conf. on System Sciences (Cat. No. 98TBI00216), Jan. 6-9, 1998,
pp. 51-61, Los.
USA.
Hartung, et al. "Multimedia Watermarking Techniques", Proceed-
ings of the IEEE, Special Issue, Identification & Protection of
Multimedia Information, pp. 1079-1107 Jul. 1999 vol. 87 No.7
IEEE.
* cited by examiner
US 7,346,472 Bl
1
2
data compression of digital files may be mentioned the
MPEG compression standards for audio and video digital
compression, promulgated by the Moving Picture Experts
Group. Numerous standard reference works and patents CROSS-REFERENCE TO RELATED
APPLICATIONS 5 discuss such compression and transmission standards for
digitized information.
Digital watermarks help to authenticate the content of
digitized multimedia information, and can also discourage
piracy. Because piracy is clearly a disincentive to the digital
10 distribution of copyrighted content, establishment of respon-
sibility for copies and derivative copies of such works is
invaluable. In considering the various forms of multimedia
content, whether "master," stereo, NTSC video, audio tape
or compact disc, tolerance of quality will vary with indi-
"Steganographic Method and Device"; pending U.S. patent
application Ser. No. 081772,222, filed Dec. 20, 1996, entitled
"Z-Transform Implementation of Digital Watermarks";
Dec. 8, 1999, entitled "Transform Implementation of Digital
Watermarks"; pending U.S. patent application Ser. No.
08/674,726, filed Jul. 2, 1996, entitled "Exchange Mecha-
nisms for Digital Information Packages with Bandwidth
Securitization, Multichannel Digital Watermarks, and Key
Management"; pending U.S. patent application Ser. No.
09/545,589, filed Apr. 7, 2000, entitled "Method and System
for Digital Watermarking"; pending U.S. patent application 20
Ser. No. 091046,627, filed Mar. 24, 1998, entitled "Method
for Combining Transfer Function with Predetermined Key
Creation"; pending U.S. patent application Ser. No. 091053,
628, filed Apr. 2, 1998, entitled "Multiple Transform Utili-
zation and Application for Secure Digital Watermarking"; 25
Mar. 30, 1999, entitled "Optimization Methods for the
Insertion, Protection, and Detection . . . "; U.S. patent
application Ser. No. 09/594,719, filed Jun. 16,2000, entitled
"Utilizing Data Reduction in Steganographic and Crypto- 30
application No. PCT/USOOI06522, filed Mar. 14, 2000,
which PCT application claimed priority to U.S. Provisional
Application No. 601125,990, filed Mar. 24, 1999); now
abandoned U.S. Application No. 601169,274, filed Dec. 7, 35
1999, entitled "Systems, Methods And Devices For Trusted
Transactions"; and PCT Application No. PCTIUSOO/21189,
filed Aug. 4, 2000 (which claims priority to U.S. Patent
Application Ser. No. 601147,134, filed Aug. 4,1999, and to
U.S. Patent Application No. 60/213,489, filed Jun. 23, 2000, 40
both of which are entitled, "A Secure Personal Content
Server"). The previously identified patents and/or patent
entireties.
In addition, this application hereby incorporates by ref-
erence, as if fully stated herein, the total disclosures of U.S.
Pat. No. 5,613,004 "Steganographic Method and Device";
U.S. Pat. No. 5,745,569 "Method for Stega-Cipher Protec-
tion of Computer Code"; and U.S. Pat. No. 5,889,868
"Optimization Methods for the Insertion, Protection, and
Detection of Digital Watermarks in Digitized Data."
digital information. A method and device are described
which relate to signal recognition to enhance identification
and monitoring activities.
data in digital form for multimedia applications (including
computer applications delivered over public networks such
15 viduals and affect the underlying commercial and aesthetic
value of the content. It is desirable to tie copyrights, own-
ership rights, purchaser information or some combination of
these and related data into the content in such a manner that
the content must undergo damage, and therefore reduction of
its value, with subsequent, unauthorized distribution, com-
mercial or otherwise. Digital watermarks address many of
these concerns. A general discussion of digital watermarking
as it has been applied in the art may be found in U.S. Pat.
No. 5,687,236 (whose specification is incorporated in whole
herein by reference).
applications have been drawn, for instance, to implementa-
developed techniques for adapting watermark application
sample stream, and for implementation of digital water-
marks that are feature-based-i.e., a system in which water-
mark information is not carried in individual samples, but is
carried in the relationships between multiple samples, such
as in a waveform shape. For instance, natural extensions
may be added to digital watermarks that may also separate
frequencies (color or audio), charmels in 3D while utilizing
discreteness in feature-based encoding only known to those
45 with pseudo-random keys (i.e., cryptographic keys) or pos-
sibly tools to access such information, which may one day
exist on a quantum level.
nology relates directly to the manner of implementation of
50 the watermark. Many approaches to digital watermarking
leave detection and decode control with the implementing
party of the digital watermark, not the creator of the work to
be protected. This weakness removes proper economic
incentives for improvement of the technology. One specific
55 form of exploitation mostly regards efforts to obscure sub-
sequent watermark detection. Others regard successful over
encoding using the same watermarking process at a subse-
quent time. Yet another way to perform secure digital
watermark implementation IS through "key-based"
60 approaches.
as the internet or World Wide Web ("WWW"). These
methods may include protocols for the compression of data, 65
such that it may more readily and quickly be delivered over
limited bandwidth data lines. Among standard protocols for
US 7,346,472 Bl
3
abstract of the at least one reference signal to detennine if
the abstract of the at least one query signal matches the
abstract of the at least one reference signal.
A method for monitoring a plurality of reference signals
is also disclosed, which method comprises the steps of:
creating an abstract for each one of a plurality of reference
signals; storing each of the abstracts in a reference database;
receiving at least one query signal to be analyzed; creating
an abstract of each at least one query signal; locating an
abstract in the reference database that matches the abstract
of each at least one query signal; and recording the identify
of the reference signal whose abstract matched the abstract
of each at least one query signal.
least one signal is also disclosed, which system comprises:
a processor for creating an abstract of a signal using select-
able criteria; a first input for receiving at least one reference
signal to be monitored, the first input being coupled to the
processor such that the processor may generate an abstract
for each reference signal input to the processor; a reference
database, coupled to the processor, for storing abstracts of
each at least one reference signal; a second input for
receiving at least one query signal to be analyzed, the second
input being coupled to the processor such that the processor
may generate an abstract for each query signal; and a
comparing device, coupled to the reference database and to
the second input, for comparing an abstract of the at least
one query signal to the abstracts stored in the reference
database to determine if the abstract of the at least one query
signal matches any of the stored abstracts.
Further, an electronic system for monitoring and analyz-
ing at least one signal is disclosed, which system comprises:
a first input for receiving at least one reference signal to be
input; a second input for receiving at least one query signal
to be analyzed, a second processor for creating an abstract
4
the same lyrics and music but which are sung by different
artists); and 2) select those characteristics which achieve
remain relatively constant (or in other words, which have
minimum variation) for each of the signals in the group.
Optionally, the null case may be defined using those char-
acteristics which are common to each member of the group
of versions.
candidates for data reduction technologies, as are those
10 subset of approaches that are based on perceptual models,
such as AAC, MP3, TwinVQ, JPEG, GIF, MPEG, etc.
Where spectral transfonns fail to assist in greater data
reduction of the signal, other signal characteristics can be
identified as candidates for further data reduction. Linear
15 predictive coding (LPC) , z-transform analysis, root mean
square (nns), signal to peak, may be appropriate tools to
measure signal characteristics, but other approaches or com-
binations of signal characteristic analysis are contemplated.
While such signal characteristics may assist in detennining
20 particular applications of the present invention, a general-
ized approach to signal recognition is necessary to optimize
the deployment and use of the present invention.
25 motion pictures can all be stored and transmitted as a series
of binary digits-l 's and O's. Digital techniques pennit the
or near perfect accuracy, and each copy is perceived by
viewers or listeners as indistinguishable from the original
30 signal. Unfortunately, digital techniques also pennit the
information to be easily copied without the owner's permis-
sion. While digital representations of analog waveforms
may be analyzed by perceptually-based or perceptually-
limited analysis it is usually costly and time-consuming to
35 model the processes of the highly effective ability of humans
to identifY and recognize a signal. In those applications
where analog signals require analysis, the cost of digitizing
the analog signal is minimal when compared to the benefits
of increased accuracy and speed of signal analysis and
40 monitoring when the processes contemplated by this inven-
tion are utilized.
of each query signal; a reference database for storing
abstracts of each at least one reference signal; and a com-
paring device for comparing an abstract of the at least one
query signal to the abstracts stored in the reference database 45
to detennine if the abstract of the at least one query signal
matches any of the stored abstracts.
sampled information, such as images, audio and video.
Traditional methods of identification and monitoring of
those signals do not rely on "perceptual quality," but rather
upon a separate and additional signal. Within this applica-
tion, such signals will be called "additive signals" as they
provide information about the original images, audio or
video, but such information is in addition to the original DETAILED DESCRIPTION OF THE
INVENTION
While there are many approaches to data reduction that
can be utilized, a primary concern is the ability to reduce the
relationship" between the original signal and its data
reduced version. This relationship may either be mathemati-
cally discernible or a result of market-dictated needs. The
purpose is to afford a more consistent means for classifying
signals than proprietary, related text-based approaches. A
simple analogy is the way in which a forensic investigator
uses a sketch artist to assist in detennining the identity of a
human.
In one embodiment of the invention, the abstract of a
signal may be generated by the following steps: 1) analyze
the characteristics of each signal in a group of audible/
perceptible variations for the same signal (e.g., analyze each
of five versions of the same song-which versions may have
50 signal. One traditional, text-based additive signal is title and
author information. The title and author, for example, is
information about a book, but it is in addition to the text of
the book. If a book is being duplicated digitally, the title and
author could provide one means of monitoring the number
55 of times the text is being duplicated, for example, through an
Internet download. The present invention, however, is
directed to the identification of a digital signal-whether
text, audio, or video-using only the digital signal itself and
then monitoring the number of times the signal is duplicated.
60 Reliance on an additive signal has many shortcomings. For
example, first, someone must incorporate the additive signal
within the digital data being transmitted, for example, by
concatenation or through an embedding process. Such an
additive signal, however, can be easily identified and
65 removed by one who wants to utilize the original signal
without paying for its usage. If the original signal itself is
used to identifY the content, an unauthorized user could not
US 7,346,472 Bl
5
avoid payment of a royalty simply by removing the additive
signal-because there is no additive signal to remove.
Hence, the present invention avoids a major disadvantage of
the prior art.
watennark-which ideally cannot be removed without per-
ceptually altering the original signal. A watennark may also
into which the identifier is being embedded). A digital 10
watennark used for monitoring is also an additive signal,
and such a signal may make it difficult for the user who
wants to duplicate a signal without paying a royalty-
mainly by degrading the perceptual quality of the original
signal if the watennark (and hence the additive monitoring 15
signal) is removed. This is, however, is a different solution
to the problem.
underlying content signal as the identifier itself. Neverthe- 20
less, the watennark may increase the value of monitoring
techniques by increasing the integrity of the embedded data
and by indicating tampering of either the original content
signal or the monitoring signal. Moreover, the design of a
watennarking embedding algorithm is closely related to the 25
perceptibility of noise in any given signal and can represent
an ideal subset of the original signal: the watennark bits are
an inverse of the signal to the extent that lossy compression
schemes, which can be used, for instance, to optimize a
watennarking embedding scheme, can yield infonnation 30
about the extent to which a data signal can be compressed
while holding steadfast to the design requirement that the
compressed signal maintain its perceptual relationship with
the original, uncompressed signal. By describing those bits
that are candidates for imperceptible embedding of water- 35
mark bits, further data reduction may be applied on the
candidate watermarks as an example of retaining a logical
and perceptible relationship with the original uncompressed
signal.
Of course, the present invention may be used in conjunc- 40
tion with watermarking technology (including the use of
keys to accomplish secure digital watennarking), but water-
marking is not necessary to practice the present invention.
Keys for watennarking may have many forms, including:
descriptions of the original carrier file fonnatting, mapping 45
of embedded data (actually imperceptible changes made to
the carrier signal and referenced to the predetennined key or
key pairs), assisting in establishing the watennark message
data integrity (by incorporation of special one way fnnctions
6
logical and self-sufficient relationship between the original
and its data-reduced abstract enhances the transparency of
any resulting monitoring efforts. The entity doing the moni-
toring is not looking for a separate, additive monitoring
system, and further, need not have to interpret the content of
the monitoring signal.
watennark techniques (those techniques that are able to
survive many signal manipulations but are not inherently
"secure" for verification of a carrier signal absent a logi-
cally-related watermarking key) and forensic watennark
techniques (which enable embedding ofwatennarks that are
not able to survive perceptible alteration of the carrier signal
and thus enable detection of tampering with the originally
watennarked carrier signal). The techniques have obvious
trade-offs between speed, perfonnance and security of the
embedded watennark data.
In other disclosures, we suggest improvements and imple-
embedded signaling in general. A digital watennark may be
used to "tag" content in a manner that is not humanly-
perceptible, in order to ensure that the human perception of
the signal quality is maintained. Watermarking, however,
must inherently alter at least one data bit of the original
signal to represent a minimal change from the original
signal's "nnwatennarked state." The changes may affect
only a bit, at the very least, or be dependent on infonnation
hiding relating to signal characteristics, such as phase infor-
mation, differences between digitized samples, root mean
square (RMS) calculations, z-transform analysis, or similar
signal characteristic category.
ogy for monitoring purposes. One weakness relates directly
to the way in which watermarks are implemented. Often, the
watennark are not the creator of the valuable work to be
of the monitoring signal within the valuable work being
protected. Hence, if a user wishing to avoid payment of the
royalty can find a way to decode or remove the watermark,
or at least the monitoring signal embedded in the watermark,
decoding algorithms were discovered by the nnauthorized
user.
because the creator need not rely on anyone to insert a
monitoring signal-as no such signal is necessary. Instead,
the creator's work itself is used as the monitoring signal.
Accordingly, the value in the signal will have a strong
relationship with its recognizability.
in the watennark message data or key), etc. Discussions of 50
these systems in the patents and pending patent applications
are incorporated by reference above. The "recognition" of a
particular signal or an instance of its transmission, and its
monitoring are operations that may be optimized through the
use of digital watennark analysis.
A practical difference between the two approaches of
using a separate, additive monitoring signal and using the
original signal itself as the monitoring signal is control. If a
separate signal is used for monitoring, then the originator of
the text, audio or video signal being transmitted and the 60
entity doing the monitoring have to agree as to the nature of
the separate signal to be used for monitoring-otherwise,
the entity doing the monitoring would not know where to
look, for what to look, or how to interpret the monitoring
signal once it was identified and detected. On the other hand, 65
if the original signal is used itself as a monitoring signal,
then no such agreement is necessary. Moreover, a more
55 well as effective confirmation of the identity of a digitally-
novel basis for differencing signals with binary data com-
parisons. These techniques may be complemented with
perceptual techniques, but are intended to leverage the
generally decreasing cost of bandwidth and signal process-
ing power in an age of increasing availability and exchange
of digitized binary data.
So long as there exist computationally inexpensive ways
of identifYing an entire signal with some fractional repre-
sentation or relationship with the original signal, or its
perceptually observable representation, we envision meth-
US 7,346,472 Bl
7
ods for faster and more accurate auditing of signals as they
are played, distributed or otherwise shared amongst provid-
ers (transmitters) and consumers (receivers). The ability to
massively compress a signal to its essence-which is not
strictly equivalent to "lossy" or "lossless" compression
schemes or perceptual coding techniques, but designed to
preserve some underlying "aesthetic quality" of the signal-
represents a useful means for signal analysis in a wide
variety of applications. The signal analysis, however, must
maintain the ability to distinguish the perceptual quality of 10
the signals being compared. For example, a method which
analyzed a portion of a song by compressing it to a single
line of lyrics fails to maintain the ability to distinguish the
perceptual quality of the songs being compared. Specifically,
for example, if the song "New York State of Mind" were 15
compressed to the lyrics ''I'm in a New York State of Mind,"
such a compression fails to maintain the ability to distin-
guish between the various recorded versions of the song, say,
8
least one domain while visual carriers are at least two
dimensional). The present invention contemplates that the
number of elements will be sufficient to effectively and
efficiently meet the demands of various classes of signal
recognition. The design of the signal recognition that may be
used with data reduction is better understood in the context
of the general requirements of a pattern or signal recognition
system.
information about a plurality of potential signals that will be
monitored. In one form, the reference database would con-
tain digital copies of original works of art as they are
recorded by the various artists, for example, contain digital
copies of all songs that will be played by a particular radio
station. In another form, the reference database would
contain not perfect digital copies of original works of art, but
digital copies of abstracted works of art, for example,
contain digital copies of all songs that have been prepro-
cessed such that the copies represent the perceptual charac-
teristics of the original songs. In another form, the reference
database would contain digital copies of processed data files,
which files represent works of art that have been prepro-
cessed in such a fashion as to identifY those perceptual
for example between Billy Joel's recording and Barbara
Streisand's recording. Such a method is, therefore, incapable 20
of providing accurate monitoring of the artist's recordings
because it could not determine which of the two artists is
deserving of a royalty-unless of course, there is a separate
monitoring signal to provide the name of the artist or other
information sufficient to distinguish the two versions. The
present invention, however, aims to maintain some level of
perceptual quality of the signals being compared and would
deem such a compression to be excessive.
25 differences that can differentiate one version of a work of art
there are a large number of approaches to compressing a 30
cial quality distribution, but to assist in identification, analy-
sis or monitoring of the signal. Most compression is either
lossy or lossless and is designed with psychoacoustic or 35
psychovisual parameters. That is to say, the signal is com-
pressed to retain what is "humanly-perceptible." As long as
the compression successfully mimics human perception,
data space may be saved when the compressed file is
compared to the uncompressed or original file. While psy- 40
choacoustic and psychovisual compression has some rel-
evance to the present invention, additional data reduction or
massive compression is anticipated by the present invention.
It is anticipated that the original signal may be compressed
to create a realistic or self-similar representation of the 45
original signal, so that the compressed signal can be refer-
enced at a subsequent time as unique binary data that has
computational relevance to the original signal. Depending
on the application, general data reduction of the original
signal can be as simple as massive compression or may 50
relate to the watermark encoding envelope parameter (those
bits which a watermarking encoding algorithm deem as
candidate bits for mapping independent data or those bits
deemed imperceptible to human senses but detectable to a
watermark detection algorithm). In this manner, certain 55
media which are commonly known by signal characteristics,
a painting, a song, a TV commercial, a dialect, etc., may be
analyzed more accurately, and perhaps, more efficiently than
a text-based descriptor of the signal. So long as the sender
and receiver agree that the data representation is accurate, 60
even insofar as the data-reduction technique has logical
relationships with the perceptibility of the original signal, as
they must with commonly agreed to text descriptors, no
independent cataloging is necessary.
The present invention generally contemplates a signal 65
recognition system that has at least five elements. The actual
from another version of the same work of art, such as two
or more versions of the same song, but by different artists.
These examples have obvious application to visually com-
municated works such as images, trademarks or photo-
graphs, and video as well.
segment a portion of a signal being monitored for analysis
referred to as an "object." As such, the signal being moni-
tored may be thought of comprising a set of objects. A song
recording, for example, can be thought of as having a
multitude of objects. The objects need not be of uniform
length, size, or content, but merely be a sample of the signal
being monitored. Visually communicated informational sig-
nals have related objects; color and size are examples.
analyze a selected object and identifY perceptual features of
all, of the perceptual qualities of the object that differentiate
it from a similarly selected object of other signals. Simply,
a feature selector has a direct relationship with the percep-
tibility of features commonly observed. Counterfeiting is an
objects that are easily recognizable and valuable, for
The fourth element is the comparing device which is able
to compare the selected object using the features selected by
the feature selector to the plurality of signals in the reference
speed and efficiency), the exact nature of the comparison
will vary. For example, the comparing device may compare
the selected object directly to the signal information stored
in the database. Alternatively, the comparing device may
need to process the signal information stored in the database
US 7,346,472 Bl
9 10
identified, though the use of a means that is specifically
selected based upon the strengths of a general computing
device and the economic needs of a particular market for the
digitized infonnation data being monitored. The additional
benefit is a more open means to uniformly catalog, analyze,
and monitor signals. As well, such benefits can exist for third
parties, who have a significant interest in the signal but are
not the sender or receiver of said infonnation.
As a general improvement over the art, the present
selected object to the processed signal infonnation. Alter-
natively, the comparing device may need to process the
selected object using input from the feature selector and then
compare the processed selected object to the signal infor-
mation. Alternatively, the comparing device may need to
input from the feature selector, process the selected object
using input from the feature selector, and then compare the
processed selected object to the processed signal infonna-
tion.
The fifth element is the recorder which records infonna-
tion about the number of times a given signal is analyzed and
detected. The recorder may comprise a database which
keeps track of the number of times a song, image, or a movie
has been played, or may generate a serial output which can
be subsequently processed to detennine the total number of
10 invention incorporates what could best be described as
"computer-acoustic" and "computer-visual" modeling,
where the signal abstracts are created using data reduction
techniques to determine the smallest amount of data, at least
a single bit, which can represent and differentiate two
Other elements may be added to the system or incorpo-
rated into the five elements identified above. For example,
15 digitized signal representations for a given predefined signal
set. Each of such representations must have at least a one bit
difference with all other members of the database to differ-
entiate each such representation from the others in the
an error handler may be incorporated into the comparing 20
device. If the comparing device identifies multiple signals
which appear to contain the object being sought for analysis
or monitoring, the error handler may offer further processing
in order to identify additional qualities or features in the
selected object such that only one of the set of captured 25
signals is found to contain the further analyzed selected
object that actually confonns with the object thought to have
been transmitted or distributed.
database. The predefined signal set is the object being
analyzed. The signal identifier/detector should receive its
parameters from a database engine. The engine will identifY
those characteristics (for example, the differences) that can
be used to distinguish one digital signal from all other digital
signals that are stored in its collection. For those digital
signals or objects which are seemingly identical, excepting
that the signal may have different perfonnance or utilization
in the newly created object, benefits over additive or text-
based identifiers are achieved. Additionally, decisions
regarding the success or failure of an accurate detection of Moreover, one or more of the five identified elements may
be implemented with software that runs on the same pro-
cessor, or which uses multiple processors. In addition, the
elements may incorporate dynamic approaches that utilize
stochastic, heuristic, or experience-based adjustments to
refine the signal analysis being conducted within the system,
including, for example, the signal analyses being performed
within the feature selector and the comparing device. This
additional analyses may be viewed as filters that are
designed to meet the expectations of accuracy or speed for
any intended application.
30 any given object may be flexibly implemented or changed to
reflect market-based demands of the engine. Appropriate
examples are songs or works or art which have been sampled
or re-produced by others who are not the original creator.
In some cases, the engine will also consider the NULL
35 case for a generalized item not in its database, or perhaps in
situations where data objects may have collisions. For some
applications, the NULL case is not necessary, thus making
the whole system faster. For instance, databases which have
fewer repetitions of objects or those systems which are
Since maintenance of original signal quality is not
required by the present invention, increased efficiencies in
processing and identification of signals can be achieved. The
present invention concerns itself with perceptible relation-
ships only to the extent that efficiencies can be achieved both
40 intended to recognize signals with time constraints or cap-
ture all data objects. Greater efficiency in processing a
relational database can be obtained because the rules for
comparison are selected for the maximum efficiency of the
in accuracy and speed with enabling logical relationships 45
between an original signal and its abstract.
original signal while reducing the data overhead to enable
more efficient analysis, archiving and monitoring of these 50
on a third party who authored or created the signal in
question. A digitized signal may have parameters to assist in 55
establishing more accurate identification, for example, a
"signal abstract" which naturally, or by agreement with the
creator, the copyright owner or other interested parties, can
be used to describe the original signal. By utilizing less than
the original signal, a computationally inexpensive means of 60
identification can be used. As long as a realistic set of
conditions can be arrived at governing the relationship
between a signal and its data reduced abstract, increases in
effective monitoring and transparency of infonnation data
flow across communications chaunels is likely to result. This 65
feature is significant in that it represents an improvement
over how a digitally-sampled signal can be cataloged and
processing hardware and/or software, whether or not the
processing is based on psychoacoustic or psychovisual mod-
els. The benefits of massive data reduction, flexibility in
constructing appropriate signal recognition protocols and
incorporation of cryptographic techniques to further add
accuracy and confidence in the system are clearly improve-
ments over the art. For example, where the data reduced
abstract needs to have further uniqueness, a hash or signa-
ture may be required. And for objects which have further
uniqueness requirements, two identical instances of the
object could be made unique with cryptographic techniques.
may be used to assist in detennining the distance
between data based on mathematically determinable
Euclidean distance between the beginning and end data
points (bits) of a particular signal carrier.
weights may be applied to different frequency compo-
nents of the carrier signal before using RMS. This
selective weighting can assist in further distinguishing
the distance between beginning and end points of the
US 7,346,472 Bl
11
signal carrier (at a given point in time, described as
bandwidth, or the number of total bits that can be
transmitted per second) and may be considered to be
the mathematical equivalent of passing a carrier signal
difference through a data filter and figuring the average
power in the output carrier.
3) Absolute error criteria, including particularly the
NULL set (described above) The NULL may be uti-
lized in two significant cases: First, in instances where
the recognized signal appears to be an identified object 10
which is inaccurately attributed or identified to an
object not handled by the database of objects; and
second, where a collision of data occurs. For instance,
if an artist releases a second performance of a previ-
ously recorded song, and the two performances are so 15
similar that their differences are almost imperceptible,
then the previously selected criteria may not be able to
differentiate the two recordings. Hence, the database
must be "recalibrated" to be able to differentiate these
two versions. Similarly, if the system identifies not one, 20
but two or more, matches for a particular search, then
the database may need "recalibration" to further dif-
ferentiate the two objects stored in the database.
4) Cognitive Identification. For example, the present
invention may use an experience-based analysis within 25
a recognition engine. Once such analysis may involve
mathematically determining a spectral transform or its
equivalent of the carrier signal. A spectral transform
enables signal processing and should maintain, for
certain applications, some cognitive or perceptual rela- 30
tionship with the original analog waveform. As a novel
feature to the present invention, additional classes may
be subject to humanly-perceptible observation. For
instance, an experience-based criteria which relates
particularly to the envisioned or perceived accuracy of 35
the data information object as it is used or applied in a
particular market, product, or implementation. This
may include a short 3 second segment of a commer-
cially available and recognizable song which is used for
commercials to enable recognition of the good or 40
service being marketed. The complete song is marketed
as a separately valued object from the use of a discrete
segment of the song (that may be used for promotion or
marketing-for the complete song or for an entirely
different good or service). To the extent that an owner 45
of the song in question is able to further enable value
through the licensing or agreement for use of a segment
of the original signal, cognitive identification is a form
of filtering to enable differentiations between different
and intended uses of the same or subset of the same 50
signal (object). The implementation relating specifi-
cally, as disclosed herein, to the predetermined identi-
fication or recognition means and/or any specified
relationship with subsequent use of the identification
means can be used to create a history as to how often 55
a particular signal is misidentified, which history can
then be used to optimize identification of that signal in
the future. The difference between use of an excerpt of
the song to promote a separate and distinct good or
service and use of the excerpt to promote recognition of 60
the song itself (for example, by the artist to sell copies
of the song) relates informationally to a decision based
on recognized and approved use of the song. Both the
song and applications of the song in its entirety or as a
subset are typically based on agreement by the creator 65
and the sender who seeks to utilize the work. Trust in
the means for identification, which can be weighted in
12
the present invention (for example, by adjusting bit-
addressable information), is an important factor in
adjusting the monitoring or recognition features of the
object or carrier signal, and by using any misidentifi-
cation information, (including any experience-based or
heuristic information), additional features of the moni-
tored signal can be used to improve the performance of
the monitoring system envisioned herein. The issue of
central concern with cognitive identification is a greater
understanding of the parameters by which any given
object is to be analyzed. To the extent that a creator
chooses varying and separate application of his object,
those applications having a cognitive difference in a
signal recognition sense (e.g., the whole or an excerpt),
the system contemplated herein includes rules for gov-
erning the application of bit-addressable information to
increase the accuracy of the database.
S) Finally, the predetermined parameters that are associ-
ated with a discrete case for any given object will have
a significant impact upon the ability to accurately
process and identifY the signals. For example, if a song
is transmitted over a FM carrier, then one skilled in the
art will appreciate that the FM signal has a predeter-
mined bandwidth which is different from the bandwidth
of the original recording, and different even from song
when played on an AM carrier, and different yet from
a song played using an 8-bit Internet broadcast. Rec-
ognition of these differences, however, will permit the
selection of an identification means which can be
optimized for monitoring a FM broadcasted signal. In
other words, the discreteness intended by the sender is
limited and directed by the fidelity of the transmission
means. Objects may be cataloged and assessing with
the understanding that all monitoring will occur using
a specific transmission fidelity. For example, a database
may be optimized with the understanding that only AM
broadcast signals will be monitored. For maximum
efficiency, different data bases may be created for
different transmission chaunels, e.g., AM broadcasts,
FM broadcasts, Internet broadcasts, etc.
mation systems, see The Mathematical Theory of Commu-
nication (1948), by Shaunon.
Because bandwidth (which in the digital domain is
equated to the total number of bits that can be transmitted in
a fixed period of time) is a limited resource which places
limitations upon transmission capacity and information cod-
ing schemes, the importance of monitoring for information
objects transmitted over any given channel must take into
consideration the nature and utilization of a given channel.
The supply and demand of bandwidth will have a dramatic
impact on the transmission, and ultimately, upon the deci-
sion to monitor and recognize signals. A discussion of this
is found in a co-pending application by the inventor under
U.S. patent application Ser. No. 08/674,726 "Exchange
Mechanisms for Digital Information Packages with Band-
width Securitization, Multichannel Digital Watermarks, and
Key Management" (which application is incorporated herein
by reference as if fully setforth herein).
If a filter is to be used in connection with the recognition
or monitoring engine, it may be desirable for the filter to
anticipate and take into consideration the following factors,
which affect the economics of the transmission as they relate
to triggers for payment and/or relate to events requiring
audits of the objects which are being transmitted: 1) time of
transmission (i.e., the point in time when the transmission
US 7,346,472 Bl
13
occurred), including whether the transmission is of a live
performance); 2) location of transmission (e.g., what chan-
nel was used for transmission, which usually determines the
associated cost for usage of the transmission channel); 3) the
point of origination of the transmission (which may be the
same for a signal carrier over many distinct channels); and
4) pre-existence of the information carrier signal (pre-
recorded or newly created information carrier signal, which
may require differentiation in certain markets or instances).
In the case of predetermined carrier signals (those which
tional information carrier signals" are contemplated by this
ingly "same" information carrier that can be recognized as
between a song and its reproduction from a CD, an AM
radio, and an Internet broadcast. To the extent that the
creator or consumer of the signal can define a difference in
any of the four criteria above, means can be derived (and
programmed for selectability) to recognize and distinguish
these differences. It is, however, quite possible that the
ability to monitor carrier signal transmission with these
factors will increase the variety and richness of available
carrier signals to existing communications channels. The
differentiation between an absolute case for transmission of
an object, which is a time dependent event, for instance a
live or real time broadcast, versus the relative case, which is
prerecorded or stored for transmission at a later point in
time, creates recognizable differences for signal monitoring.
14
and transmission times so that an extrapolation may be made
to a larger number of comparable markets.
first database is data reduced in a manner that is not likely
to reflect the human perceptual quality of the signal, mean-
ing that a significantly data-reduced signal is not likely to be
10 measured in digital terms) is much smaller than the size of
the first database, and is determined by the rate of compres-
sion. If, for example, if 24 hours worth of audio signals are
compressed at a 10,000: 1 compression rate, the reduced data
could occupy a little more than 1 megabyte of data. With
15 such a large compression rate, the data to be compared
and/or analyzed may become computationally small such
that computational speed and efficiency are significantly
improved.
With greater compression rates, it is anticipated that
20 similarity may exist between the data compressed abstrac-
tions of different analog signals (e.g., recordings by two
different artists of the same song). The present invention
contemplates the use of bit-addressable differences to dis-
tinguish between such cases. In applications where the data
25 to be analyzed has higher value in some predetermined
sense, cryptographic protocols, such as a hash or digital
signature, can be used to distinguish such close cases.
In a preferred embodiment, the present invention may
utilize a centralized database where copies of new record-
30 ings may be deposited to ensure that copyright owners, who
authorize transmission or use of their recordings by others,
can independently verify that the object is correctly moni-
tored. The rules for the creator himself to enter his work
the following: to determine the number of times a song is
broadcast on a particular radio broadcast or Internet site; to
control security though a voice-activated security system; 35
and to identifY associations between a beginner's drawing
and those of great artists (for example to draw comparisons
between technique, compositions, or color schemes). None
would differ from a universally recognized number assigned
by an independent authority (say, ISRC, ISBN for record-
ings and books respectively). Those skilled in the art of
algorithmic information theory (AIT) can recognize that it is
now possible to describe optimized use of binary data for
content and functionality. The differences between objects
must relate to decisions made by the user of the data,
introducing subjective or cognitive decisions to the design of
of these examples could be achieved with any significant
degree of accuracy using a text-based analysis. Additionally, 40
strictly text-based systems fail to fully capture the inherent
value of the data recognition or monitoring information
itself.
the contemplated invention as described above. To the extent
that objects can have an optimized data size when compared
with other objects for any given set of objects, the algo-
SAMPLE EMBODIMENTS
In order to better appreciate and understand the present
invention, the following sample embodiments are provided.
These sample embodiments are provided for exemplary
purposes only, and in no way limit the present invention.
45 rithms for data reduction would have predetermined flex-
ibility directly related to computational efficiency and the set
of objects to be monitored. The flexibility in having trans-
parent determination of unique signal abstracts, as opposed
to independent third party assignment, is likely to increase
Sample Embodiment 1
50 confidence in the monitoring effort by the owners of the
original signals themselves. The prior art allows for no such
transparency to the copyright creators.
A database of audio signals (e.g., songs) is stored or
maintained by a radio station or Internet streaming company, 55
who may select a subset of the songs are stored so that the
subset may be later broadcast to listeners. The subset, for
example, may comprise a sufficient number of songs to fill
24 hours of music programming (between 300 or 500
songs). Traditionally, monitoring is accomplished by 60
embedding some identifier into the signal, or affixing the
identifier to the signal, for later analysis and determination
of royalty payments. Most of the traditional analysis is
performed by actual persons who use play lists and other
statistical approximations of audio play, including for 65
example, data obtained through the manual (i.e., by persons)
monitoring of a statistically significant sample of stations
Sample Embodiment 2
Similar to the goals of a psychoacoustic model, a psy-
chovisual model attempts to represent a visual image with
less data, and yet preserve those perceptual qualities that
permit a human to recognize the original visual image.
Using the very same techniques described above in connec-
tion with an audio signal, signal monitoring of visual images
may be implemented.
relate to a particular theme. For example, finding paintings
US 7,346,472 Bl
15
of sunsets or sunrises. A traditional approach might involve
a textual search involving a database wherein the works of
invention, however, involves the scanning of an image
involving a sun, compressing the data to its essential char-
acteristics (i.e., those perceptual characteristics related to the
sun) and then finding matches in a database of other visual
images (stored as compressed or even uncompressed data).
By studying the work of other artists using such techniques,
a novice, for example, could leam much by comparing the 10
presentations of a common theme by different artists.
Another useful application involving this type of moni-
toring and analyzing is the identification of photographs of
police artist. 15
Note that combinations of the monitoring techniques
discussed above can be used for audio-visual monitoring,
such as video-transmission by a television station or cable
station. The techniques would have to compensate, for
example, for a cable station that is broadcasting a audio 20
channel unaccompanied by video.
Other embodiments and uses of the invention will be
apparent to those skilled in the art from consideration of the
specification and practice of the invention disclosed herein.
The specification and examples should be considered exem- 25
plary only with the true scope and spirit of the invention
indicated by the following claims. As will be easily under-
stood by those of ordinary skill in the art, variations and
modifications of each of the disclosed embodiments can be
easily made within the scope of this invention as defined by 30
the following claims.
What is claimed is:
1. A method for monitoring and analyzing at least one
signal comprising:
receiving at least one reference signal to be monitored; 35
creating an abstract of said at least one reference signal
wherein the step of creating an abstract of said at least
one reference signal comprises:
inputting the reference signal to a processor;
creating an abstract of the reference signal using per- 40
ceptual qualities of the reference signal such that the
abstract retains a perceptual relationship to the ref-
erence signal from which it is derived;
storing the abstract of said at least one reference signal in
a reference database; 45
receiving at least one query signal to be analyzed;
creating an abstract of said at least one query signal
wherein the step of creating an abstract of said at least
one query signal comprises:
inputting the at least one query signal to the processor; 50
creating an abstract of the at least one query signal
using perceptual qualities of the at least one query
signal such that the abstract retains a perceptual
relationship to the at least one query signal from
which it is derived; and 55
comparing the abstract of said at least one query signal to
the abstract of said at least one reference signal to
determine if the abstract of said at least one query
signal matches the abstract of said at feast one refer-
ence signal. 60
2. The method of claim 1, wherein the step of creating an
abstract of said at least one reference signal comprises:
using a portion of said at least one reference signal to
create an abstract of said at least one reference signal;
and 65
the step of creating an abstract of said at least one query
signal comprises:
16
using a portion of said at least one query signal to create
an abstract of said at least one query signal.
3. A method for monitoring and analyzing at least one
signal comprising:
receiving at least one reference signal to be monitored;
creating an abstract of said at least one reference signal;
storing the abstract of said at least one reference signal in
a reference database;
creating an abstract of said at least one query signal;
comparing the abstract of said at least one query signal to
the abstract of said at least one reference signal to
determine if the abstract of said at least one query
signal matches the abstract of said at least one reference
signal;
creating at least one counter corresponding to one of said
at least one reference signals, said at least one counter
being representative of the number of times a match is
found between the abstract of said at least one query
signal and the abstract of said at least one reference
signal; and
incrementing the counter corresponding to a particular
reference signal when a match is found between an
abstract of said at least one query signal and the abstract
of the particular reference signal.
4. The method of claim 3 further comprising:
recording an occurrence of a match between the abstract
of said at least one query signal and the abstract of said
at least one reference signal; and
generating a report that identifies the reference signal
whose abstract matched the abstract of said at least one
query signal.
5. The method of claim 4, further comprising:
recording an occurrence of a match between the abstract
of said at least one query signal and the abstract of said
at least one reference signal.
6. A method for monitoring a plurality of reference
signals, comprising:
creating an abstract for each of the plurality of reference
signals wherein the step of creating an abstract for each
of a plurality of reference signals comprises:
inputting each of the plurality of reference signals to a
processor;
creating an abstract of each one of the plurality of
reference signals using perceptual qualities of each
one of a plurality of reference signals such that the
storing each of said abstracts in a reference database;
creating an abstract of each of the at least one query
signals wherein the step of creating an abstract of each
of the at least one query signals comprises:
inputting each of the at least one query signals to a
processor;
creating an abstract of each one of a plurality of
reference signals using perceptual qualities of each
one of a plurality of reference signals such that the
locating an abstract in the reference database that matches
the abstract of each at least one query signal; and
recording the identifY of the reference signal whose
abstract matched the abstract of each at least one query
signal.
US 7,346,472 Bl
17
7. The method of claim 6, wherein
the step of creating an abstract of said at least one
reference signal comprises:
using a portion of said at least one reference signal to
create an abstract of said at least one reference
signal;
and the step of creating an abstract of said at least one
query signal comprises:
using a portion of said at least one query signal to create
an abstract of said at least one query signal. 10
8. A method for monitoring a plurality of reference
signals, comprising:
creating an abstract for each of the plurality of reference
signals;
storing each of said abstracts in a reference database; 15
creating an abstract of each of the at least one query
signals;
locating an abstract in the reference database that matches
the abstract of each at least one query signal; 20
recording the identifY of the reference signal whose
abstract matched the abstract of each at least one query
signal;
creating at least one counter corresponding to one of said
plurality of reference signals, said at least one counter 25
being representative of the number of times a match is
found between the abstract of said at least one query
signal and an abstract of one of said plurality of
reference signals; and
incrementing the counter corresponding to a particular 30
reference signal when a match is found between an
abstract of said at least one query signal and the abstract
of the particular reference signal.
9. A computerized system for monitoring and analyzing at
least one signal: 35
a processor that creates an abstract of a signal using
selectable criteria;
a first input that receives at least one reference signal to
be monitored, said first input being coupled to said
processor such that said processor may generate an 40
abstract for each reference signal input to said proces-
sor;
a reference database, coupled to said processor, that stores
abstracts of each at least one reference signal;
a second input that receives at least one query signal to be 45
analyzed, said second input being coupled to said
processor such that said processor may generate an
abstract for each query signal;
a comparing device, coupled to said reference database
and to said second input, that compares an abstract of 50
said at least one query signal to the abstracts stored in
the reference database to determine if the abstract of
said at least one query signal matches any of the stored
abstracts;
a storage medium coupled to said first input, that stores 55
each of said at least one reference signals to be moni-
tored; and
a controller coupled to the first input, the processor, the
comparing device, the reference database and the stor-
age medium, said controller causing an abstract for 60
each reference signal being input for the first time to be
compared to all previously stored abstracts in the
reference database, such that in the event that the
comparing device determines that it cannot distinguish
between the abstract of a reference signal being input 65
for the first time from a previously stored abstract in the
reference database, the controller adjusts the criteria
18
being used by the processor and re-generates the ref-
erence database, by re-processing each reference signal
stored on the storage medium to create new abstracts
and storing said new abstracts in the reference database.
10. The system of claim 9, wherein the controller includes
a means to adjust compression rates at which the processor
processes a signal to create an abstract.
11. A computerized system for monitoring and analyzing
at least one signal:
a processor that creates an abstract of a signal using
selectable criteria;
be monitored, said first input being coupled to said
abstract for each reference signal input to said proces-
sor;
a reference database, coupled to said processor, that stores
abstracts of each at least one reference signal;
analyzed, said second input being coupled to said
abstract for each query signal;
a comparing device, coupled to said reference database
and to said second input, that compares an abstract of
said at least one query signal to the abstracts stored in
the reference database to determine if the abstract of
said at least one query signal matches any of the stored
abstracts, wherein the comparing device identifies at
least two abstracts in the reference database that match
the abstract of said at least one query signal and an
index of relatedness to said at least one query signal for
each of said at least two matching abstracts.
12. The system of claim 11, further comprising:
a security controller that controls access to a secured area,
such that access is granted only if the comparing device
confirms that an abstract of said at least one query
signal matches an abstract of said at least one reference
signal.
13. The system of claim 11, further comprising:
a recorder that records the identify of the reference signal
whose abstract matched the abstract of said at least one
query signal; and
a report generator that generates a report that identifies the
reference signals whose abstracts matched the abstract
of said at least one query signal.
14. A electronic system for monitoring and analyzing at
least one signal, comprising:
be monitored,
signal input to said first processor through said first
input;
analyzed,
a second processor that creates an abstract of each query
signal;
a reference database that stores abstracts of each at least
one reference signal;
a comparing device that compares an abstract of said at
least one query signal to the abstracts stored in the
reference database to determine if the abstract of said at
least one query signal matches any of the stored
abstracts;
a storage medium coupled to said first input, that stores
each of said at least one reference signals to be moni-
tored; and
US 7,346,472 Bl
19
a controller that compares an abstract for each reference
signal being input for the first time to be compared to
all previously stored abstracts in the reference database,
such that in the event that the comparing device deter-
mines that it cannot distinguish between the abstract of
a reference signal being input for the first time from a
previously stored abstract in the reference database, the
20
controller adjusts the criteria being used by the proces-
sor and re-generates the reference database, by re-
processing each reference signal stored on the storage
medium to create new abstracts and storing said new
abstracts in the reference database.
* * * * *
PATENT NO.
APPLICATION NO.
DATED
INVENTOR(S)
: 7,346,472 Bl
: 09/657181
: March 18, 2008
: Scott Moskowitz
Page 1 of 1
-- This application claims the benefit of pending U.S. patent--
should read:
-- This application is related to pending U.S. patent --
Thirteenth Day of September, 2011
~ J 3 : . t : : ~
David J. Kappos

AOptix Technologies v. Blue Spike

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

AOptix Technologies v. Blue Spike

Hochgeladen von

Copyright:

Verfügbare Formate

c:...

Das könnte Ihnen auch gefallen