Paper-based control of computer systems

Information

  • Patent Grant
  • 6681028
  • Patent Number
    6,681,028
  • Date Filed
    Wednesday, May 19, 1999
    25 years ago
  • Date Issued
    Tuesday, January 20, 2004
    20 years ago
Abstract
Digital data is steganographically encoded in printed materials, and—when sensed by an appropriately-equipped webcam or other imaging device—can be used to link to associated electronic resources. Data hidden in a business card, for example, may enable linking to a person's electronic calendar—showing the person's schedule availability. Likewise, data hidden in a corporate ID badge may serve to unlock doors at a corporate office, or to enable access to corporate computers. Many other such applications are detailed.
Description




FIELD OF THE INVENTION




The present invention relates to use of printed documents to control computer systems. Exemplary documents include business cards, advertisements, and identification badges, but the invention is not so limited.




BACKGROUND AND SUMMARY OF THE INVENTION




Over the past century, business cards have formed part of business ritual. Functionally, they serve as a record of an encounter, and detail means by which the giver may be contacted (address, phone, etc.).




Business cards have changed, essentially, not at all in response to the advent of computers. Some accommodation has been made for business cards on the computer side, in the form of specialized scanner and optical character recognition tools by which textual data printed on cards can be read and entered into personal productivity software tools (e.g. contact managers, address books, datebooks, personal information managers, etc.). However, the data transferred into the personal productivity software is static and unchanging.




In accordance with one embodiment of the present invention, the textual information on a business card is supplemented with steganographically-encoded, multi-bit binary data. This latter data does not significantly distract from the visual aesthetics of the card (as would a bar code or the like), yet can be used by an associated computer to initiate a link to an internet site corresponding to the business card giver. At the site, the recipient of the card may gain access to the giver's schedule, and other information that changes over time. (Such information may not generally be available over the internet to persons without the card data.)




The foregoing and additional features and advantages of the present invention will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.











BRIEF DESCRIPTION OF THE DRAWINGS





FIG. 1

shows a flow chart of a process according to one embodiment of the present invention.











DETAILED DESCRIPTION




Digital watermarking is a quickly-growing field of endeavor, and many techniques are known. Generally, all seek to steganographically convey multi-bit data ancillary to some other signal or medium.




The present assignee's prior application Ser. No. 09/127,502, filed Jul. 31, 1998, shows techniques by which very fine lines can be printed on a medium to slightly change the medium's apparent tint, while also conveying digital data. Commonly-owned application Ser. No. 09/074,034, filed May 6, 1998, details how the contours of printed imagery can be adjusted to convey digital data. (That technique can be applied to printed text characters, as well as the line art imagery particularly considered.) Applicant's U.S. Pat. No. 5,850,481 details how the surface of paper or other media can be textured to convey optically-detectable binary data. Applicant's U.S. Pat. Nos. 5,841,886, 5,809,160, and the priority applications detailed above, detail various techniques for steganographically encoding photographs and other imagery.




Three papers by Brassil et al show other techniques for conveying watermark data by slight changes to printed text, “Electronic Marking and Identification Techniques to Discourage Document Copying,” Proceedings of INFOCOM '94 Conference on Computer, IEEE Comm. Soc Conference, Jun. 12-16, 1994, pp. 1278-1287; “Hiding Information in Document Images,” November, 1995, 7 pages, AT&T Bell Laboratories Technical Report (available at ciss95_ps.z from ftp://ftp.research.att.com/dist/brassil/1995/ciss95.ps.Z.; and “Document Marking and Identification using Both Line and Word Shifting,” INFOCOM '95 (available at ftp://ftp.research.att.com/dist/brassil/1995/infocom95.ps.Z).




The foregoing is just a sampling of the large literature on watermarking. The artisan is presumed to be familiar with such art, all of which is generally suitable for use with the novel concepts detailed below.




In accordance with any of the known watermarking techniques, a business card is steganographically encoded with plural bit data. At least part of this data identifies an internet address or web site at which data about the giver of the card is stored. If sufficient bits can be encoded into the business card, the address can be encoded literally, e.g., by ASCII or binary numeric encoding. Alternatively, to reduce the data payload, an abbreviated form of address. One example of such an abbreviated form is a Unique Identifier (UID) which can be, e.g., a 24-bit value.




Desirably, the steganographic encoding is tailored to facilitate decoding in the presence of arbitrary rotation or scale distortion of the card introduced during scanning. (Some such techniques are shown, e.g., in applicant's related patents identified above. Others are known to artisans.)




As shown in

FIG. 1

, the card is scanned (e.g., by use of conventional opto-electronic devices, such as a scanner or a digital camera). The output data is then optionally processed to account for any skew or scale factor. The plural-bit digital data is then decoded and stored, e.g., in personal productivity software.




(Although not particularly shown in

FIG. 1

, it is expected that the detailed process will often be supplemental to known OCR-reading of business cards, and entry of the textual data into personal productivity software. That is, the scan data is processed both by OCR techniques, and by steganographic decoding techniques, and the results of both operations stored in a data structure or other memory for later reference.)




The steganographically-decoded plural-bit data is provided to a web browser or other internet appliance and used to initiate a link to a remote computer over the internet's network of computers. If the remote address was literally encoded in the business card, that address is used directly. If an abbreviated form of address was encoded, an additional step may be required.




If a UID was encoded in the card, rather than a literal address, the web browser might consult an index to correlate the UID to an address. The index could be a table or other data structure stored on the user's local computer, but more commonly is a remote name server database to which the browser links as a default when processing business card UIDs. Data obtained from the index is then used to complete the linking to the ultimate destination. (In addition to reducing the business card payload, such linking through an index, e.g., by a UID, offers flexibility in that the ultimate destination can be moved to other server sites as needed, with just a simple update to the index. Alternatively, all business cards encoded with the former address would be rendered obsolete if the site were relocated.)




At the ultimate site, the user is presented with whatever information the business card giver chooses to provide, including biographical information, photos, promotional offers or advertisements relating to the card-giver's business (or relating to enterprises to whom the card-giver has rented screen space), etc., etc. In one embodiment, the giver's site is linked to the giver's personal productivity tool(s) and permits viewing, e.g., of calendar information (showing where the business card giver is scheduled to be today, or for the rest of the week, month, etc.)




Typically, this calendar information is not available to casual web browsers; the steganographically decoded data from the business card includes some authentication data (akin to a password) that permits access to otherwise restricted data. This authentication data can take the form of a web page address to which no publicly-accessible link points, a password that is separately presented to the web server by the user's browser after a link is established, or other known technique.




In one form of the invention, the giver of business cards may have several differently-encoded cards, each with a different level of access authorization. Thus, some cards may access a biographical page without any calendar information, other cards may access the same or different page with access enabled to today's calendar, and still other cards may access the same or different page with access enabled for the card-giver's complete calendar.




The reference to business cards and personal calendars is illustrative only. The invention is more widely applicable. Going back a century, “calling cards” were used by persons whose interests were strictly social, rather than business. The principles of the present invention can similarly be applied. Teenagers can carry small cards that can be exchanged with new acquaintances to grant access to private dossiers of personal information, favorite music, artwork, video clips, etc. The cards can be decorated with art or other indicia that can serve purposes wholly unrelated to the linking data steganographically encoded therein.




Even the “card” paradigm is too restrictive. The same techniques can be applied to any object. A music CD cover can be encoded to point to a promotional site associated with the music artist. A book jacket can link to a similar site. Printed advertising distributed through the US mail (cards, magazines, etc.) can be encoded to point to related web-based promotional sites. (Sponsors of such advertising or other sites can reward visits to their internet site by issuing visitors digital tokens or coupons that can be redeemed for premiums, cash-back, etc., either for any such visit, or only if the visit was effected through the portal of a steganographically-encoded printed medium.)




Many contexts arise in which data to be presented to a consumer is valuable only if timely. The postal service mail is ill-suited for some such information due to the latency between printing a document, and its ultimate delivery to a recipient. The principles of the present invention allow the recipient to take a steganographically-encoded data object (card, etc.) that was printed well before delivery, and use it on receipt to receive up-to-the-minute information. (In this and other embodiments, the steganographically-encoded data can also include data uniquely identifying the recipient/user, so the web site can present data customized to that user.)




The present technology also has application in access control systems. An identification badge (either with photo or graphics, or with text alone) can be encoded with steganographically access control data (e.g., access codes or digital keys) that is recognized by optical-scanner-equipped locks and the like, permitting access by authorized persons to restricted areas or restricted services (e.g., computer privileges). Given the low cost of media and printing (as compared with other access control technologies), the cards can be issued on a daily, weekly, or other frequent interval, and the access control system can be programmed to permit access in response to such cards only for the pre-set limited period. Lost cards soon lose their threat.




Tickets to sporting events, concerts, and other events can be steganographically encoded to permit the bearer to access premium web content available only to those who have purchased tickets (e.g., an on-line text-, audio-, or video-chat session with the featured performer or sports star the day before the event). Alternatively, the encoded data may link to a transactional site. In some such embodiments, the ticket is printed with a nominal show data and seat assignment, but also includes a UID in addition to the encoded address of an associated transactional ticket site. The user then can visit the transactional web site to change seating (or date). On attending the event, the consumer presents the ticket to a steganographic decoder apparatus that discerns the UID and looks up the seat assignment most-recently picked by the consumer. It then prints a chit entitling the consumer to take the seat earlier selected on-line.




The reference to “scanning” of objects naturally brings to mind images of desktop flatbed scanners, or multi-function hydra devices. While such devices can be used—together with convention digital cameras (including video cameras)—the inventors foresee that image input devices will soon be much more commonplace. The provision of digital cameras as built-in components of certain computers (e.g., the Sony Vaio laptops) is just one manifestation of this trend. Another is camera-on-a-chip systems, as typified by U.S. Pat. No. 5,841,126 and detailed in Nixon et al., “256×256 CMOS Active Pixel Sensor Camera-on-a-Chip,” IEEE J. Solid-State Circuits, Vol. 31(12), pp. 2046-2051 (1996), and Fossum, “CMOS Image Sensors: Electronic Camera-on-a-Chip,” IEEE Transactions of Electron Devices, vol. 44, No. 10, October 1997. Still another is head-mounted cameras (as are presently used in some computer-augmented vision systems). These and other image input devices can all be used in connection with the present invention.




To facilitate embodiments of the present invention, a prior art camera-on-a-chip system can be modified to also include a steganographic watermark detector on the same semiconductor substrate. Such a chip—in addition to providing image output data—can also analyze the image data to discern any steganographically encoded data, and produce corresponding output data. (Again, such analysis desirably includes correction for scale and rotation factors, so precise positioning of the object being “read” is not essential for correct decoding.)




To provide a comprehensive disclosure without unduly lengthening this specification, applicants incorporate by reference the patents, applications, and publications identified above, except Ser. Nos. 09/186,962; 08/649,419 (now U.S. Pat. No. 5,862,260): and Ser. No. 08/637,531 (now U.S. Pat. No. 5,822,436).




Having described an illustrated the principles of our invention with reference to illustrative embodiments, it should be recognized that the invention is not so limited.




For example, while certain of the embodiments were illustrated with reference to an internet-based embodiment, the same techniques are similarly applicable to any other computer-based system. Likewise, for internet-based embodiments, the use of web browsers and web pages is not essential; other digital navigation devices and other on-line data repositories can be similarly accessed.




In view of the many embodiments to which the principles of our invention may be applied, it should be recognized that the detailed embodiments are illustrative only and should not be taken as limiting the scope of our invention. Rather, we claim as our invention all such embodiments as fall within the scope and spirit of the following claims, and equivalents thereto.



Claims
  • 1. A method comprising:presenting a business card of an individual to an optical sensor, the optical sensor producing output data; decoding steganographically-encoded plural-bit data from the sensor output data; and using said plural-bit data to establish a link to an internet address having data relating to the proprietor of said business card.
  • 2. The method of claim 1 which includes obtaining from said internet site calendar data detailing certain activities of the individual.
  • 3. The method of claim 2 in which the amount of calendar data obtained depends on an authorization level.
  • 4. The method of claim 3 in which the authorization level is reflected in the plural-bit data encoded in the individual's business card, wherein an individual can distribute differently-encoded cards to different recipients, to grant the recipients different access rights to said calendar data.
  • 5. The method of claim 1 in which the optical sensor is a business card reader that also serves to input textual information from business cards into a personal information manager.
  • 6. The method of claim 5 which includes storing an internet address discerned from the steganographically-encoded plural-bit data into said personal information manager.
  • 7. The method of claim 1 in which the optical sensor is a digital camera.
  • 8. The method of claim 7 in which the digital camera is mounted to a computer display device.
  • 9. The method of claim 7 in which the digital camera is head-mounted on a user thereof.
  • 10. The method of claim 1 in which the decoding includes sensing a subliminal graticule signal.
  • 11. The method of claim 1 wherein the decoding includes discerning an apparent rotation of the sensor output data from an original orientation of the encoding, and compensating therefor.
  • 12. The method of claim 11 wherein the decoding includes discerning an apparent scaling of the sensor output data from an original scale of the encoding, and compensating therefor.
  • 13. The method of claim 1 wherein the decoding includes discerning an apparent scaling of the sensor output data from an original scale of the encoding, and compensating therefor.
  • 14. A method comprising:presenting a printed promotion to an optical sensor at a first site, the optical sensor producing output data; decoding steganographically-encoded plural-bit data from the sensor output data; using said data to establish a link to an internet site relating to a company, product, or service promoted by said printed promotion; and transferring to from the internet site to the first site additional information relating to said company, product, or service.
  • 15. The method of claim 14 in which the decoding includes sensing a subliminal graticule signal.
  • 16. The method of claim 14 wherein the decoding includes discerning an apparent rotation of the sensor output data from an original orientation of the encoding, and compensating therefor.
  • 17. The method of claim 16 wherein the decoding includes discerning an apparent scaling of the sensor output data from an original scale of the encoding, and compensating therefor.
  • 18. The method of claim 14 wherein the decoding includes discerning an apparent scaling of the sensor output data from an original scale of the encoding, and compensating therefor.
  • 19. A method comprising:presenting a printed identification badge to an optical sensor, the optical sensor producing output data corresponding to optical characteristics of the face of said badge; decoding steganographically-encoded plural-bit data from the sensor output data; checking the plural-bit data to determine whether it corresponds to a valid access card; and unlocking a lock depending on the outcome of the foregoing checking operation.
  • 20. The method of claim 19 in which the decoding includes sensing a subliminal graticule signal.
  • 21. The method of claim 19 wherein the decoding includes discerning an apparent rotation of the sensor output data from an original orientation of the encoding, and compensating therefor.
  • 22. The method of claim 21 wherein the decoding includes discerning an apparent scaling of the sensor output data from an original scale of the encoding, and compensating therefor.
  • 23. The method of claim 19 wherein the decoding includes discerning an apparent scaling of the sensor output data from an original scale of the encoding, and compensating therefor.
  • 24. A business card comprising a substrate with printing thereon, characterized in that the printing includes a steganographic pattern encoding plural-bit auxiliary data, said pattern not being evident upon human inspection but being discernable by visible light scanning of the card and processing the scan data produced thereby.
  • 25. The card of claim 24 wherein the same printing that conveys the steganographic pattern also conveys information evident upon human inspection.
  • 26. The card of claim 25 wherein the steganographic pattern has a strength that varies across the business card in accordance with local characteristics thereof, so as to aid concealment of the encoding.
  • 27. The card of claim 26 wherein the steganographic pattern has a strength that varies across the business card in accordance with local characteristics thereof, so as to aid concealment of the encoding.
  • 28. The card of claim 20 wherein the steganographic pattern substantially spans the business card rather than being localized in one excerpt thereof.
RELATED APPLICATION DATA

This application is a continuation-in-part of co-pending application Ser. No. 09/130,624, filed Aug. 6, 1998, which is a continuation of application Ser. No. 08/508,083 filed Jul. 27, 1995 (now U.S. Pat. No. 5,841,978). This application is also a continuation-in-part of copending application Ser. No. 09/186,962, filed Nov. 5, 1998, which is a continuation of application Ser. No. 08/649,419, filed May 16, 1996 (now U.S. Pat. No. 5,862,260), which is a continuation-in-part of application Ser. No. 08/637,531, filed Apr. 25, 1996 (now U.S. Pat. No.5,822,436). The subject matter of this application is generally related to that in all of the assignee's other patents and applications, e.g., U.S. Pat. Nos. 5,841,886, 5,832,119, 5,822,446 and 5,841,978, and the application entitled Methods and Systems Employing Digital Watermarking, filed on even date herewith.

US Referenced Citations (198)
Number Name Date Kind
3569619 Simjian Mar 1971 A
3845391 Crosby Oct 1974 A
3984624 Waggener Oct 1976 A
4230990 Lert, Jr. et al. Oct 1980 A
4238849 Gassmann Dec 1980 A
4296326 Haslop et al. Oct 1981 A
4297729 Steynor et al. Oct 1981 A
4313197 Maxemchuk Jan 1982 A
4367488 Leventer et al. Jan 1983 A
4379947 Warner Apr 1983 A
4380027 Leventer et al. Apr 1983 A
4395600 Lundy et al. Jul 1983 A
4425642 Moses et al. Jan 1984 A
4528588 Lofberg Jul 1985 A
4547804 Greenberg Oct 1985 A
4618257 Bayne et al. Oct 1986 A
4672605 Hustig et al. Jun 1987 A
4675746 Tetrick et al. Jun 1987 A
4739377 Allen Apr 1988 A
4750173 Blüthgen Jun 1988 A
4807031 Broughton et al. Feb 1989 A
4855827 Best Aug 1989 A
4879747 Leighton et al. Nov 1989 A
4888798 Earnest Dec 1989 A
4908836 Rushforth et al. Mar 1990 A
4908873 Philibert et al. Mar 1990 A
4944036 Hyatt Jul 1990 A
4947028 Gorog Aug 1990 A
4969041 O'Grady et al. Nov 1990 A
4972476 Nathans Nov 1990 A
4977594 Shear Dec 1990 A
5023907 Johnson et al. Jun 1991 A
5027401 Soltesz Jun 1991 A
5040059 Leberl Aug 1991 A
5053956 Donald et al. Oct 1991 A
5062666 Mowry et al. Nov 1991 A
5095196 Miyata Mar 1992 A
5103459 Gilhousen et al. Apr 1992 A
5113445 Wang May 1992 A
5113518 Durst, Jr. et al. May 1992 A
5138712 Corbin Aug 1992 A
5146457 Veldhuis et al. Sep 1992 A
5181786 Hujink Jan 1993 A
5200822 Bronfin et al. Apr 1993 A
5213337 Sherman May 1993 A
5216724 Suzuki et al. Jun 1993 A
5243423 DeJean et al. Sep 1993 A
5259025 Monroe et al. Nov 1993 A
5262860 Fitzpatrick et al. Nov 1993 A
5280537 Sugiyama et al. Jan 1994 A
5288976 Citron et al. Feb 1994 A
5291243 Heckman et al. Mar 1994 A
5295203 Krause et al. Mar 1994 A
5315098 Tow May 1994 A
5319735 Preuss et al. Jun 1994 A
5321470 Hasuo et al. Jun 1994 A
5337361 Wang et al. Aug 1994 A
5374976 Spannenburg Dec 1994 A
5379345 Greenberg Jan 1995 A
5385371 Izawa Jan 1995 A
5416307 Danek et al. May 1995 A
5428607 Hiller et al. Jun 1995 A
5428731 Powers, III Jun 1995 A
5463209 Figh et al. Oct 1995 A
5469222 Sprague Nov 1995 A
5469506 Berson et al. Nov 1995 A
5493105 Desai Feb 1996 A
5493677 Balogh et al. Feb 1996 A
5495411 Ananda Feb 1996 A
5495581 Tsai Feb 1996 A
5496071 Walsh Mar 1996 A
5502576 Ramsay et al. Mar 1996 A
5521722 Colvill et al. May 1996 A
5524933 Kunt et al. Jun 1996 A
5530759 Braudaway et al. Jun 1996 A
5530852 Meske, Jr. et al. Jun 1996 A
5548645 Ananda Aug 1996 A
5553143 Ross et al. Sep 1996 A
5559868 Blonder Sep 1996 A
5568550 Ur Oct 1996 A
5579479 Plum Nov 1996 A
5594226 Steger Jan 1997 A
5598526 Daniel et al. Jan 1997 A
5613004 Cooperman et al. Mar 1997 A
5617119 Briggs et al. Apr 1997 A
5629980 Stefik et al. May 1997 A
5634012 Stefik et al. May 1997 A
5636276 Brugger Jun 1997 A
5636292 Rhoads Jun 1997 A
5638443 Stefik et al. Jun 1997 A
5640193 Wellner Jun 1997 A
5646997 Barton Jul 1997 A
5646999 Saito Jul 1997 A
5652626 Kawakami et al. Jul 1997 A
5652714 Peterson et al. Jul 1997 A
5657462 Brouwer et al. Aug 1997 A
5659164 Schmid et al. Aug 1997 A
5663766 Sizer, II Sep 1997 A
5664018 Leighton Sep 1997 A
5665951 Newman et al. Sep 1997 A
5668636 Beach et al. Sep 1997 A
5671282 Wolff et al. Sep 1997 A
5673316 Auerbach et al. Sep 1997 A
5687236 Moskowitz et al. Nov 1997 A
5710636 Curry Jan 1998 A
5715403 Stefik Feb 1998 A
5719939 Tel Feb 1998 A
5721788 Powell et al. Feb 1998 A
5727092 Sandford, II et al. Mar 1998 A
5734119 France et al. Mar 1998 A
5735547 Morelle et al. Apr 1998 A
5740244 Indeck et al. Apr 1998 A
5742845 Wagner Apr 1998 A
5745604 Rhoads Apr 1998 A
5761686 Bloomberg Jun 1998 A
5765152 Erickson Jun 1998 A
5768426 Rhoads Jun 1998 A
5774452 Wolosewicz Jun 1998 A
5778102 Sandford, II et al. Jul 1998 A
5790693 Graves et al. Aug 1998 A
5790697 Munro et al. Aug 1998 A
5801687 Peterson et al. Sep 1998 A
5804803 Cragun et al. Sep 1998 A
5809160 Powell et al. Sep 1998 A
5809317 Kogan et al. Sep 1998 A
5817205 Kaule Oct 1998 A
5818441 Throckmorton et al. Oct 1998 A
5819289 Sanford, II et al. Oct 1998 A
5822436 Rhoads Oct 1998 A
5825871 Mark Oct 1998 A
5825892 Braudaway et al. Oct 1998 A
5828325 Wolosewicz et al. Oct 1998 A
5832119 Rhoads Nov 1998 A
5838458 Tsai Nov 1998 A
5841978 Rhoads Nov 1998 A
5845281 Benson et al. Dec 1998 A
5848144 Ahrens Dec 1998 A
5848413 Wolff Dec 1998 A
5848424 Scheinkman et al. Dec 1998 A
5852673 Young Dec 1998 A
5857038 Owada et al. Jan 1999 A
5862218 Steinberg Jan 1999 A
5862260 Rhoads Jan 1999 A
5869819 Knowles et al. Feb 1999 A
5871615 Harris Feb 1999 A
5872589 Morales Feb 1999 A
5875249 Mintzer et al. Feb 1999 A
5892900 Ginter et al. Apr 1999 A
5893101 Balogh et al. Apr 1999 A
5893910 Martineau et al. Apr 1999 A
5898779 Squilla et al. Apr 1999 A
5900608 Iida May 1999 A
5902353 Reber et al. May 1999 A
5903729 Reber et al. May 1999 A
5905248 Russell et al. May 1999 A
5905251 Knowles May 1999 A
5905810 Jones et al. May 1999 A
5913210 Call Jun 1999 A
5915027 Cox et al. Jun 1999 A
5920861 Hall et al. Jul 1999 A
5920878 DeMont Jul 1999 A
5926822 Garman Jul 1999 A
5930767 Reber et al. Jul 1999 A
5932863 Rathus et al. Aug 1999 A
5933798 Linnartz Aug 1999 A
5933829 Durst et al. Aug 1999 A
5938726 Reber et al. Aug 1999 A
5938727 Ikeda Aug 1999 A
5939695 Nelson Aug 1999 A
5940595 Reber et al. Aug 1999 A
5949055 Fleet et al. Sep 1999 A
5950173 Perkowski Sep 1999 A
5959055 Le Blevec et al. Sep 1999 A
5963916 Kaplan Oct 1999 A
5971277 Cragun et al. Oct 1999 A
5974141 Saito Oct 1999 A
5974548 Adams Oct 1999 A
5978773 Hudetz et al. Nov 1999 A
5979757 Tracy et al. Nov 1999 A
5983218 Syeda-Mahmoo Nov 1999 A
5991426 Cox et al. Nov 1999 A
5991876 Johnson et al. Nov 1999 A
6005501 Wolosewicz Dec 1999 A
6012102 Shachar Jan 2000 A
6035177 Moses et al. Mar 2000 A
6052486 Knowlton et al. Apr 2000 A
6122403 Rhoads Sep 2000 A
6138151 Reber et al. Oct 2000 A
6166750 Negishi Dec 2000 A
6266430 Rhoads Jul 2001 B1
6286036 Rhoads Sep 2001 B1
6311214 Rhoads Oct 2001 B1
6314457 Schena et al. Nov 2001 B1
6324574 Gong Nov 2001 B1
6345104 Rhoads Feb 2002 B1
6408331 Rhoads Jun 2002 B1
20010001854 Schena et al. May 2001 A1
20020009208 Alattar et al. Jan 2002 A1
Foreign Referenced Citations (24)
Number Date Country
2235002 Dec 1998 CA
493091 Jan 1992 EP
493 091 Jul 1992 EP
0789480 Aug 1997 EP
872995 Oct 1998 EP
0642060 Apr 1999 EP
9427228 Nov 1994 WO
WO9427228 Nov 1994 WO
WO9504665 Feb 1995 WO
WO9510813 Apr 1995 WO
9514289 May 1995 WO
9520291 Jul 1995 WO
9627259 Sep 1996 WO
9636163 Nov 1996 WO
WO9743736 Nov 1997 WO
WO 9743736 Nov 1997 WO
WO9814887 Apr 1998 WO
WO9820642 May 1998 WO
WO9824050 Jun 1998 WO
WO9840823 Sep 1998 WO
WO9849813 Nov 1998 WO
WO9934277 Jul 1999 WO
WO9936876 Jul 1999 WO
WO 0180169 Oct 2001 WO
Non-Patent Literature Citations (80)
Entry
U.S. patent application Ser. No. 60/112,955, filed Dec. 18, 1998, Rhoads.
U.S. patent application Ser. No. 09/074,034, filed May 6, 1998, Rhoads.
U.S. patent application Ser. No. 09/185,380, filed Nov. 3, 1998, Davis et al.
U.S. patent application Ser. No. 09/302,663, filed Apr. 30, 1999, Gustafson et al.
U.S. patent application Ser. No. 09/465,418, filed Dec. 16, 1999, Rhoads et al.
Dautzenberg, “Watermarking Images,” Department of Microelectronics and Electrical Engineering, Trinity College Dublin, 47 pages, Oct. 1994.
Bruckstein, A.M.; Richardson, T.J., A holographic transform domain image watermarking method, Circuits, Systems, and Signal Processing vol. 17, No. 3 p. 361-89, 1998. This paper includes an appendix containing an internal memo of Bell Labs. which according to the authors of the paper, was dated Sep. 1994.
Szepanski, “A Signal Theoretic Method for Creating Forgery-Proof Documents for Automatic Verification,” Proceedings 1979 Carnahan Conference on Crime Countermeasures, May 16, 1979, pp. 101-109.
Szepanski, “Additive Binary Data Transmission for Video Signals,” Papers Presented at Conf. Of Comm. Engineering Soc. Sep. 30-Oct. 3, 1980, Technical Reports vol. 74, pp. 342-352.
Tirkel et al, “Electronic Water Mark,”DICTA-93, Macquarie University, Sydney, Australia, Dec., 1993, pp. 666-673.
Kurak et al., “A Cautionary Note On Image Downgrading,” 1992 IEEE, pp. 153-159.
“Multimedia Mixed Object Envelopes Supporting a Graduated Fee Scheme via Encryption,” IBM Technical Disclosure Bulletin: vol. 37, No. 03, Mar. 1994, p. 413.
Mintzer et al., “Safeguarding Digital library Contents and Users” Digital Watermarking, D-Lib Magazine, Dec. 1997: ISSN 1082-9873.
“Copyright Protection for Digital Images, Digital Fingerprinting from FBI,” Highwater FBI brochure, 1995, 4 pages.
“High Water FBI Limited Presentation Image Copyright Protection Software,” FBI Ltd brochure, Jul. 1995, 17 pages.
Hudetz U.S. Provisional patent application Ser. No. 60/000,442, filed Jun. 20, 1995, Method and Apparatus for Interfacing with Remote Computers.
Sheng et al., Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptor, vol. 3, No. 6, Jun. 1986, J. Opt. Soc. Am., pp. 771-776.
U.S. patent application Ser. No. 60/000,442, Hudetz, filed Jun. 20, 1995.
U.S. patent application Ser. No. 60/082,228, Rhoads, filed Apr. 16, 1998.
U.S. patent application Ser. No. 60/141,763, Davis, filed Jun. 30, 1999.
U.S. patent application Ser. No. 60/158,015, Davis et al., filed Oct. 6, 1999.
U.S. patent application Ser. No. 09/314,648, Rodriguez et al., filed May 19, 1999.
U.S. patent application Ser. No. 09/342,688, Rodriguez et al., filed Jun. 29, 1999.
U.S. patent application Ser. No. 09/342,971, Rodriguez et al., filed Jun. 29, 1999.
U.S. patent application Ser. No. 09/679,261, Davis et al., filed Oct. 4, 2000.
U.S. patent application Ser. No. 09/562,517, Davis et al., filed May 1, 2000.
U.S. patent application Ser. No. 09/547,664, Rhoads et al., filed Apr. 12, 2000.
U.S. patent application Ser. No. 09/571,442, Rhoads et al., filed May 15, 2000.
U.S. patent application Ser. No. 09/858,189, Rhoads et al., filed May 14, 2001.
U.S. patent application Ser. No. 09/631,409, Brundage et al., filed Aug. 3, 2000.
U.S. patent application Ser. No. 09/452,021, Davis et al., filed Nov. 30, 1999.
U.S. patent application Ser. No. 09/629,401, Seder et al., filed Aug. 1, 2000.
U.S. patent application Ser. No. 09/473,396, Evans et al., filed Dec. 28, 1999.
U.S. patent application Ser. No. 09/563,664, Levy et al., filed May 2, 2000.
U.S. patent application Ser. No. 09/670,115, Rhoads et al., filed Sep. 26, 2000.
Brassil et al., Electronic Marking and Identification Techniques to Discourage Document Copying, Proceedings of INFOCOM '94 Conference on Computer, IEEE Commun. Soc Conference, Jun. 12-16, 1994, 1278-1287.
Bruckstein, A.M.; Richardson, T. J., A holographic transform domain image watermarking method, Circuits, Systems, and Signal Processing vol. 17, No. 3 p. 361-89, 1998. This paper includes an appendix containing an internal memo of Bell Labs, which according to the authors of the paper, was dated Sep. 1994.
Koch et al., “Copyright Protection for Multimedia Data,” Fraunhofer Institute for Computer Graphics, Dec. 16, 1994, 15 pages.
Koch et al., “Towards Robust and Hidden Image Copyright Labeling,” Proc. of 1995 IEEE Workshop on Nonlinear Signal and Image Processing, Jun. 20-22, 1995, 4 pages.
Rindfrey, “Towards an Equitable System for Access Control and Copyright Protection in Broadcast Image Services: The Equicrypt Approach,” Intellectual Property Rights and New Technologies, Proc. of the Conference, R. Oldenbourg Verlag Wien Munchen 1995, 12 pages.
Schreiber et al., “A Compatible High-Definition Television System Using the Noise-Margin Method of Hiding Enhancement Information,” SMPTE Journal, Dec. 1989, pp. 873-879.
SDMI Example Use Scenarios (Non-Exhaustive), Version 1.2, Jun. 16, 1999.
Tanaka et al., “A Visual Retrieval System with Private Information for Image Database,” Proceeding International Conference on DSP Applications and Technology, Oct. 1991, pp. 415-421.
Tanaka et al., “New Integrated Coding Schemes for Computer-Aided Facsimile,” Proc. IEEE Int'l Conf. on Sys. Integration, Apr. 1990, pp. 275-281.
Tirkel et al, “Electronic Water Mark,” DICTA-93, Macquarie University, Sydney, Australia, Dec., 1993, pp. 666-673.
Weber et al., “Correlative Image Registration,” Seminars in Nuclear Medicine, vol XXIV, No. 4, Oct., 1994, pp. 311-323.
Szepanski, “Additive Binary Data Transmission for Video Signals,” Conference of the Communications Engineering Society, 1980, NTG Technical Reports, vol. 74, pp. 343-351. (German text and English translation enclosed).
U.S. patent application Ser. No. 09/765,102, filed Jan. 17, 2001, Shaw.
U.S. patent application Ser. No. 09/761,349, filed Jan. 16, 2001, Rhoads.
U.S. patent application Ser. No. 09/761,280, filed Jan. 16, 2001, Rhoads.
U.S. patent application Ser. No. 09/645,779, Aug. 24, 2000, Tian et al.
U.S. patent application Ser. No. 09/689,226, filed Oct. 11, 2000, Brunk.
U.S. patent application Ser. No. 09/689,250, filed Oct. 11, 2000, Ahmed.
U.S. patent application Ser. No. 09/689,293, filed Oct. 11, 2000, Tian et al.
U.S. patent application Ser. No. 09/625,577, filed Jul. 25, 2000, Carr et al.
U.S. patent application Ser. No. 09/574,726, filed May 18, 2000, Rhoads et al.
U.S. patent application Ser. No. 09/562,524, filed May 1, 2000, Carr et al.
U.S. patent application Ser. No. 09/498,223, filed Feb. 3, 2000, Rhoads et al.
U.S. patent application Ser. No. 09/431,990, filed Nov. 3, 1999, Rhoads et al.
U.S. patent application Ser. No. 09/428,359, filed Oct. 28, 2000, Davis et al.
U.S. patent application Ser. No. 09/342,972, filed Jun. 29, 1999, Rhoads.
U.S. patent application Ser. No. 09/293,602, filed Apr. 15, 1999, Rhoads.
U.S. patent application Ser. No. 09/293,601, filed Apr. 15, 1999, Rhoads.
U.S. patent application Ser. No. 09/287,940, filed Apr. 7, 1999, Rhoads.
U.S. patent application Ser. No. 09/074,034, filed May 6, 1998, Rhoads et al.
U.S. patent application Ser. No. 09/127,502, filed Jul. 31, 1998, Rhoads.
U.S. patent application Ser. No. 60/082,228, filed Apr. 16, 1998, Rhoads.
U.S. patent application Ser. No. 60/198,138, filed Apr. 17, 2000, Alattar.
Audio Watermarking Architectures for Secure Digital Music Distribution, A Proposal to the SDMI Portable Devices Working Group by ARIS Technologies, Inc, Mar. 26, 1999, pp. 1-11.
Audio Watermarking Architectures for Persistent Protection, Presentation to SDMI PDWG, Mar. 29, 1999, J. Winograd, Aris Technologies, pp. 1-16.
Audio Watermarking System to Screen Digital Audio Content for LCM Acceptance, A Proposal Submitted in Response to PDWG99050504-Transition CfP by ARIS Technologies, Inc., May 23, 1999, Document Version 1.0, 15 pages.
Boland et al., “Watermarking Digital Images for Copyright Protection”, Fifth Int'l Conference on Image Processing and it's Application, Jul. 1995, pp. 326-330.
Levy, “AIPL's Proposal for SDMI: An Underlying Security System” (slide presentation), Mar. 29, 1999, 23 slides.
Microsoft Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, SDMI, PDWG Tokyo, May 23, 1999, 9 pages.
Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, NTT Waveless Radio Consotium, May 23, 1999, 9 pages.
Sandford II et al., “The Data Embedding Method”, Proceedings of the SPIE vol. 2615, pp. 226-259, 1996.
Thomas, Keith, Screening Technology for Content from Compact Discs, May 24, 1999, 11 pages.
Tirkel et al., “Electronic Water Mark,” Dicta-93, Marquarie University, Sydney, Australia, Dec., 1993, pp. 666-672.
Vidal et al., “Non-Noticeable Information Embedding in Color Images: Marking and Detection”, IEEE 1999, pp. 293-297.
Wolfgang et al., “A Watermark for Digital Images,” Computer Vision and Image Processing Laboratory, Purdue University, Sep. 1996, pp. 219-222.
Continuations (2)
Number Date Country
Parent 08/649419 May 1996 US
Child 09/186962 US
Parent 08/508083 Jul 1995 US
Child 08/637531 US
Continuation in Parts (3)
Number Date Country
Parent 09/130624 Aug 1998 US
Child 09/314648 US
Parent 09/186962 Nov 1998 US
Child 09/130624 US
Parent 08/637531 Apr 1996 US
Child 08/649419 US