US 6,829,368 B2Grant

Establishing and interacting with on-line media collections using identifiers in media signals

Issue Date:2004-12-07

•29 Claims

•3 Drawing Sheets

Abstract

Media objects are transformed into active, connected objects via identifiers embedded into them or their containers. In the context of a user's playback experience, a decoding process extracts the identifier from a media object and possibly additional context information and forwards it to a server. The server, in turn, maps the identifier to an action, such as returning metadata, re-directing the request to one or more other servers, requesting information from another server to identify the media object, etc. The linking process applies to broadcast objects as well as objects transmitted over networks in streaming and compressed file formats.

Metadata

Assignee

Digimarc Corporation

Inventors

Joel R. Meyer
Geoffrey B. Rhoads

Application Information

Application Number:US 09/769,017

Filing Date:2001-01-24

Priority Date:2000-01-26

Art Unit:7

Classifications

IPC:

G06K 900H04N 7167H04L 900

Field of Search:

382100382232382305382112382115345744345765380 54380201380210380240386 46386 52386 69704 237042707042737071041707200713153713176713168725 37

Patent Drawings (3 sheets)

Description

[0002] This patent application claims the benefit of U.S. Provisional Application No. 60/178,028, filed Jan. 26, 2000. This patent application is also a continuation-in-part of U.S. patent application Ser. No. 09/563,664, filed May 2, 2000 (Now U.S. Pat. No. 6,505,160). These applications are hereby incorporated by reference.

[0003] The subject matter of the present application is related to that disclosed in U.S. Pat. Nos. 5,862,260 and 6,122,403; PCT Applications Nos. WO 01/01331 A1, published Jan. 4, 2001, and WO 00/70585, published Nov. 23, 2000; and in co-pending U.S. Pat. application Ser. Nos. 09/292,569, filed Apr. 15, 1999; Ser. No. 09/343,104, filed Jun. 29, 1999; Ser. No. 09/473,396, filed Dec. 28, 1999 (Now U.S. Pat. No. 6,577,746); Ser. No. 09/476,686, filed Dec. 30, 1999; Ser. No. 09/503,881, filed Feb. 14, 2000 (Now U.S. Pat. No. 6,614,914); Ser. No. 09/525,865, filed Mar. 15, 2000 (Now U.S. Pat. No. 6,611,607); Ser. No. 09/547,664, filed Apr. 12, 2000; Ser. No. 09/574,726, filed May 18, 2000; and Provisional Application No. 60/191,778, filed Mar. 24, 2000. Each of these documents is hereby incorporated by reference.

Technical Field

[0004] The invention relates to linking audio and other multimedia data objects with metadata and actions via a communication network, e.g., computer, broadcast, wireless, etc.

Background and Summary

[0005] Developments in network technology and media content (e.g., images, video, and audio) storage, delivery, and playback are re-shaping the entertainment, information technology, and consumer electronics industries. With these developments, there are an increasing number of applications for associating media content with auxiliary data. The auxiliary data may provide information describing the content, copy control information or instructions, links to related content, machine instructions, etc. This auxiliary data is sometimes referred to as metadata. In many applications, metadata suffers from the drawback that it is vulnerable to becoming separated from an associated media signal.

[0006] Steganography provides a way to embed data in the media signal. As such, it offers an advantage over conventional ways to associate metadata with media signals. Examples of steganography include digital watermarking and data glyphs. Exemplary watermarking techniques suitable for still image and video content are shown in U.S. Pat. No. 5,862,260 to Rhoads and U.S. Pat. No. 5,915,027 to Cox. Exemplary watermarking techniques suitable for use with audio content are shown in the just-cited Rhoads patent, as well as U.S. Pat. No. 5,945,932 to Smith and U.S. Pat. No. 5,940,135 to Petrovic.

[0007] Advances in computer and wireless networking, multimedia coding, and higher bandwidth communication links are creating many new ways to distribute and enjoy multimedia content, such as music and movies. Coding formats for audio like MPEG 1 Layer 3 (MP3) have already caused significant changes in music delivery to consumers. Despite the advances in technology, content distributors and broadcasters still need to address how to effectively promote and sell content.

[0008] This document describes systems and processes for linking audio and other multimedia data objects with metadata and actions via a communication network, e.g., computer, broadcast, wireless, etc. Media objects are transformed into active, connected objects via identifiers embedded into them or their containers. These identifiers can be embedded by the owner or distributor of the media object, or automatically created from the media object. In the context of a user's playback experience, a decoding process extracts the identifier from a media object and possibly additional context information and forwards it to a server. The server, in turn, maps the identifier to an action, such as returning metadata, re-directing the request to one or more other servers, requesting information from another server to identify the media object, etc. If the identifier has no defined action, the server can respond with an option for the user to buy the link and control the resulting action for all objects with the current identifier. The linking process applies to broadcast objects as well as objects transmitted over networks in streaming and compressed file formats.

[0009] Further features will become apparent with reference to the following detailed description and accompanying drawings.

Brief Description of the Drawings

[0010] FIG. 1 is a diagram illustrating examples of media object linking processes and systems.

[0011] FIG. 2 is a diagram illustrating media object linking applications.

[0012] FIG. 3 is a diagram illustrating an operating environment for multimedia content management and delivery applications.

Detailed Description

[0013] Linking Audio and other Media Objects via Identifiers

[0014] The following sections describe systems and processes for linking audio and other media objects to metadata and actions via an identifier. For the sake of illustration, the disclosure focuses on a specific media type, namely audio signals (e.g., music, sound tracks of audio visual works, voice recordings, etc.). However, these systems, their components and processes apply to other types of media signals as well, including video, still images, graphical models, etc. As described further below, an identifier attached to an audio signal is used to connect that signal with metadata and/or programmatic or device actions. In the context of this document, the terms “media object” and “audio object” refer to an electronic form of a media signal and audio signal, respectively. The linking of media signals applies to objects that are transmitted over wire networks (such as a computer network), wireless networks (such as a wireless telephone network), and broadcast (AM, FM, digital broadcast, etc.).

[0015] There are a number of ways to associate an identifier with an audio object. One way to associate the identifier is to insert it in the form of a numeric or alphanumeric code (e.g., binary or M-ary code) in the electronic file in which the audio is stored. Another way to associate the identifier is to embed it as auxiliary data in the audio signal using steganographic methods, such as digital watermarking or other data hiding techniques. Yet another way is to derive the identifier from the audio signal, the table of contents, the file system structure, or its container (e.g., an electronic file or physical package for data like flash memory, Digital Versatile Disk (DVD), minidisk, or compact disk (CD). The physical media may have identifying characteristics, such as a unique identifier or encoded metadata, or other attributes from which an identifier can be derived (e.g., CD disk wobble).

[0016] When the identifier is associated with metadata or actions, it transforms the media object into a “linked” object. The identifier travels with the object through distribution, including in some cases, through physical distribution in packaged media and through electronic distribution (broadcast or network communication). The identifier may travel within the same band as the audio object, such as a watermark, or via a separate band, such as a file header or footer or separate broadcast band. A decoding device or programmatic process extracts the identifier from the object and uses it to retrieve related data or actions (“metadata”). In the case of an audio object, like a song, the metadata typically includes the title, artist, lyrics, copyright owner, sound recording owner, information about buying or sampling opportunities and URLs to this type of data as well as web sites and other programs and devices. Linked actions include device or programmatic processes for electronically establishing a license, transferring content (either streaming or download), sending an email, recording marketing data about a transaction, etc. The identifier allows a fan of a particular type of music or artist to get more information about the music and to buy more music. From the perspective of the artists and record labels, the identifier provides an additional opportunity to promote their music and sell content, concert tickets, etc.

[0017] In addition, in some implementations where identifier linking transactions are monitored, it enables the vendors of music to gather data about electronic transactions triggered by the link. For example, users of information may choose to provide information about themselves when they register their decoding device or software with the system. A user ID or other context information may then be recorded when the identifier is extracted and used to trigger a transaction. Many entities involved in the distribution of media signals can benefit from the linking capability. Artists can link their music to information about themselves and provide electronic buying opportunities for music, concert tickets, clothing, etc. Rights holding organizations can use the link to inform users about itself and licensing opportunities. In some cases, the link may also be used to monitor playing and distribution of copies of the music. Record labels can link their music to information about the artist, the label, electronic buying opportunities, etc. Electronic retailers can increase sales by linking users to opportunities to sample and buy additional music (via download or streaming delivery over a wire or wireless network). Conventional brick and mortar retailers can use linking to provide information about the music and to provide buying opportunities. Radio stations and other broadcasters can use the linking capability to bring users to their web sites, creating advertising revenue, to provide electronic buying opportunities for music, concert tickets, clothing items, etc. These and other forms of linked metadata and actions may be implemented in various combinations in different application scenarios.

[0018] Depending on the application, the identifier may identify the media object in which it is embedded, or entities, things or actions other than that particular media object. One type of identifier is an object ID that identifies an audio object. This identifier may be a number associated with the object, such as its International Standard Recording Code (ISRC). Another type of identifier is distributor ID that identifies the distributor of the audio object. Another type of identifier is a broadcaster ID that identifiers the broadcaster of the audio object. Of course, more than one identifier may be encoded into an audio object or its container. In the event that an object ID is not encoded with an audio object, but instead, a distributor or broadcaster identifier is encoded with the object, other context information, such as the time of play back or distribution, location of distribution, etc. may be used to identify the audio object as part of the linking process. An example is a radio station that marks its broadcasts with a station ID and maintains a playlist database with the air times of each audio object. At decoding time, the station ID is extracted and used along with context information such as the air time of the audio object to look up the audio object or its corresponding metadata and actions. This approach enables the linking system to provide audio object specific metadata or actions even without requiring a unique object identifier in every audio object.

[0019] System Implementation

[0020] FIG. 1 is a diagram of a system configuration of linked media objects. In this configuration, an identifier links audio objects to metadata via an electronic network, such as the Internet, a wireless network, or a broadcast network. As depicted in FIG. 1, an embedding process may be used to encode an identifier in an audio object or its container. In some cases, an embedding process encodes the identifier in the audio file (e.g., a tag in a file header or footer), in the audio signal (a digital watermark), or in the physical packaging. The identifier may also be derived as a function of the audio signal or other information in the file or physical packaging (e.g., track information on a CD). In the case of dynamically derived identifiers, an embedding process is not necessary because the identifier can be derived from the content at decoding time.

[0021] In some application scenarios, the embedding process interacts with a registration process to get an identifier. The embedding process provides information about the object (e.g., a title and artist name, an ISRC, name of distributor, etc.). In response, the registration process provides an identifier and stores a database record of the association between identifier and the object or other information used in decoding to identify the object, such as its distributor or broadcaster. The registration process may be used to assign an identifier to an audio object and to distributors or broadcasters of audio objects. The embedding and registration processes may occur before the audio object is distributed to consumers, or sometime thereafter, such as when a user transfers (e.g., “rips”) a media object from one format to another (e.g., a packaged format to an electronic file format such as a compressed file format).

[0022] Once registered, an interactive or automated mapping process associates the identifier with data or actions. The registration process creates a database of identifiers and associates the identifiers with corresponding media objects, distributors, broadcasters, etc. The mapping process associates the identifiers with corresponding metadata or actions.

[0023] Once associated with an audio object and metadata, the identifier transforms the audio object into a linked object. The identifier remains with the object through distribution, although some embedding processes are more robust than others to intentional or unintentional distortion/removal of the identifier. There are a variety of different distribution scenarios. Some examples depicted in FIG. 1 include transferring an audio object over a computer network, streaming the object over a computer network, or broadcasting it (e.g., AM/FM broadcasting, digital broadcasting, broadcasting over wireless carriers, etc.). Whatever the distribution process, a user ultimately receives the linked object in a player, tuner, or capture device.

[0024] To activate the linked object, a decoding process extracts the identifier and uses it to access associated data or actions. The decoding process may be implemented as a separate program or device, or integrated into a player, tuner, or some other capture device, such as a listening devices that converts ambient audio waves to an electronic signal and then extracts the identifier from the signal.

[0025] In the configuration shown in FIG. 1, the decoding process forwards the extracted identifier to a communication application, which in turn, forwards it in a message to a server. The decoding process or the communication application may add additional context information to the message sent to the to a server. The context information may relate to the user, the user's device, the attributes of the session (time of playback, format of playback, type of distribution (e.g., broadcast or transmitted audio file), etc.) Based on identifier and optional context information, the server determines an associated action to perform, such as re-directing an identifier or context data to another server, returning metadata (including programs, content, etc.), downloading content, logging a transaction record. To find the associated action or actions, the server maps the identifier to actions based on the information established in the mapping process. The server may: 1) look up the data and actions in a local database stored in its memory subsystem; 2) route the identifier to one or more other servers via the network, which in turn look up related actions and data associated with the identifier; or 3) perform some combination of actions 1 and 2.

[0026] In the first case, server 1 returns data or actions associated with the identifier. The server may look up related data based on the identifier alone, or based on the identifier and other context information. Context information may be information provided by the user, by the user's computer or device, or by some other process or device. In the second case, the server looks up one or more addresses associated with the identifier and forwards the identifier and/or possibly other context data to secondary servers at these addresses via conventional networking protocols. Again, this context data may include data from the user, the user's computer, some other device or database. For example, server 1 might query a remote database for instructions about how to process an identifier. These instructions may specify data to return to the communication application or to forward to another server, which in turn, looks up associated data and returns it to the communication application. A server may return data that an audio player displays to the user or uses to control rendering of the content. For example, the server can tell the player that the object contains inappropriate content for children. The player or user can make decisions about whether or how to play the material based on this information.

[0027] Both the server and the player can adopt a set of rules. The server rules may be used to control what the server returns in response to an identifier and context data. The player rules may be used to control what the player displays to the user or how it renders the content based on data returned from a server.

[0028] Either the first server, or a server one or more levels of indirection from the identifier may return data and programmatic actions to a player via the communication application. Each server in these levels of indirection receives a database key, such as an identifier or context information, from the previous server, and uses it to look up corresponding actions. These actions may include returning data or programs to the communication application or to previous servers in the routing path of the message from the communication application. Also, the servers may route requests for information or actions to other servers. The server or servers may return data or perform actions in response to the identifier (or other context data) that do not directly impact the decoding process, or the device in which it operates.

[0029] The system depicted in FIG. 1 allows several different interested parties to establish services linked via the identifier. For example, server 1 can be configured to provide generic promotional and/or licensing information associated with an identifier. If the content owner, distributor, retailer, artist or other related party wishes to provide information or services for a connected object, then server 1 may also route the identifier for that object, and possibly context information, the address of the communication application, and instructions, to servers maintained by these entities. These servers, in turn, provide promotional, sales, or licensing information, and electronic buying or licensing opportunities specific to that entity back to the consumer over the network via the communication application.

[0030] In the context of a network configuration, Internet protocols may be used to return data to the communication application or to the device or system in which it operates. The communication application may be implemented in a web browser, such as Internet Explorer or Netscape Navigator. Examples of ways of exchanging information between a client player and a server include returning a web page with metadata and program scripts designed to run on the end user's system. The metadata itself may include active links, such as URLs to other network resources, such as a web site or some other network service. The path of the identifier from the decoding process, and the return path from a server to the communication application may include one or more hops through a wire or wireless connection using standard wire and wireless communication protocols like TCP/IP, HTTP, XML, WAP, Bluetooth, etc. In addition, data returned to the user may be routed through one or more servers that may forward the data, and in some cases, augment the data or modify it in some fashion.

[0031] FIG. 2 is a diagram illustrating applications of the system depicted in FIG. 1. In the application scenarios depicted in FIG. 2, an embedding process encodes an object identifier (OID) into an audio file, such as an ID3 tag in the header of an MP3 file or audio frame headers in the MP3 file. FIG. 2 shows two embedding scenarios. The first is an MP3 distributor that embeds OIDs in MP3 files before transmitting them over a network, such as the Internet, typically via a web site interface. The second is a file ripping process where a programmed computer or other device extracts an audio object from packaged media such as a CD and converts it into a coded file format like MP3. In the latter case, the ripping process may extract metadata from the CD, such as the table of contents, and use this metadata as a key to a database (CDDB) to get information about the songs on the CD, such as title, artists, etc. The table of contents or other metadata from a package medium, such as optical or magnetic storage or flash memory, may be hashed into an index to a database entry that stores information about the media signal stored on the medium. The ripping process uses the information returned from the database to identify the audio objects on the packaged media so that they can be associated with an OID. This is an example of identifying information used to associate an OID with an audio object. As part of the coding process, the ripping process inserts the OID in the file header of the MP3 file.

[0032] Later, when a user opens or plays the marked MP3 in a player, such as a software player like the real player, Liquid Audio player, Windows Media Player (WMP), WinAmp, MusicMatch, etc., a plug-in software module in the player extracts the OID and forwards it to a server via an Internet connection. The plug-in may establish its own Internet connection, or pass the OID to an Internet Browser, which in turn, establishes a connection (if one is not already present) with the server. As an intermediate step, the plug-in may display a window with user options, such as “learn more about the song”, “play the song”, or both. The user can then choose to get more information by actuating the first or third options in the user interface window, which cause the plug-in to forward the OID to the server.

[0033] The server then returns a web page associated with the OID, or re-directs the OID to another server (e.g., one maintained by the content distributor or owner), which in turn, returns a web page of information about the object and links to related actions (e.g., a link to a licensing server, a link to a server for buying and downloading related music etc.). The licensing server may be programmed to download software players and new music offerings compatible with those players. For instance, the licensing server may provide software for decrypting, decoding, and playing electronically distributed music according to usage rules packaged with the electronically distributed music. In this application scenario, the linking of the MP3 file enables the content owner to market music and products that promote the sale of audio objects in other formats, included formats protected with encryption, watermark copy managements schemes, etc.

[0034] In the event that a media object is not linked, the decoding and server processes can be programmed to enable the user to purchase a link for the object. For example in one scenario, the player plug-in displays a graphic for a link information indicating that the link is available after determining that an OID is not in the file. If the user clicks on the graphic, the plug-in displays more information about the procedure for purchasing or renting a link. This information may be provided in conjunction with querying the server and displaying information returned from the server, or alternatively, providing pre-programmed information incorporated into the plug-in. If the user is interested in purchasing the link, he or she can then enter input (e.g., click on a button such as “Get Link”) that initiates the process of registering an OID with the object and associating metadata or actions with the OID. The process of registering the OID and associating the OID with metadata or actions may be performed as described in this document. This scenario provides yet another mechanism for transforming content into connected content.

[0035] There are many possible variations to the applications scenarios illustrated in FIG. 2. During the file ripping process (or some other embedding process), the embedder may generate a unique ID from the metadata read from the packaged media on which the media object resides. One example of such an ID is the number derived from CD metadata currently used to index information in the CDDB database. This ID may then be embedded in the audio object or its file header/footer. During OID registration, the registration process may inform the embedding process that the OID (and thus, the object for which it was derived) has not been associated with metadata or actions. In this case, the user may be given an opportunity to purchase the link, either at the time of ripping, or in the future, wherever the object travels. In the latter case, the OID in the object is associated with an option to buy the link and customize the data and/or actions associated with that link. Rather than link to promotional information, the OID gives users an option to buy or rent the link and provides them with an opportunity to customize it (e.g., linking it to a custom web site). Once customized, other users that open or play the file will then be able to link to the customized information or actions.

[0036] To assert control over the type of customization that users may perform, the registration and mapping processes can place constraints on the types of metadata and actions that users can link to a media object.

[0037] In the multimedia content industry, there are typically many rights holders and entities involved in the distribution process. This may present a conflict when linking a media object to one entity. One way to address this problem is have an object link to many different entities. For example, the server could map an OID to many entities and return links to retailers, distributors, record labels and artists. Another way to address it is to encode additional information about the distributor in the OID. For example, the OID includes fields that identify the object and its distributor. If a user activates the link to purchase products, including media objects, then the distributor name is logged with the purchase and that distributor is credited with royalties associated with the transaction. The distributor field may also be used as a key to look up the appropriate action for the OID, such as re-directing the OID to the web server of the entity associated with that OID. In this approach, even if the OID directs a user to a record label's website, the distributor field can be used to credit the distributor with a royalty for the linking transaction.

[0038] The entity responsible for maintaining a web site linked via on identifier can make deals with online resources for providing data about a media object such as lyrics, song titles, radio station play lists. The website may link to this information, access it via a database manager, etc.

[0039] File Identifiers

[0040] One form of identifier is an identifier that is inserted in an audio object file, but in a distinct field from the audio signal itself. Some examples are file headers and footers. This file identifier may be assigned before or after distribution of the audio object to consumers. In addition, it may be derived from the audio signal or other information in the file. For example, an identifier generator may derive a unique or sufficiently unique identifier from a portion of a music signal. A variety of methods for generating a unique numbers based on a unique collection of numbers may be used.

[0041] The process of embedding a file identifier may be done at the time of encoding or transcoding a file. For example, the file identifier may be inserted during a ripping process, such as when a device or programmatic process converts a song from a format stored on packaged media, like a CD or DVD, to an electronic, and compressed form, such as MP3 or some other audio codec. As another example, the file identifier may be inserted when a device or programmatic process transcodes an electronic music file from one codec format to another. Yet another example is where a file is taken from a digital or analog uncompressed format, and placed in another format for distribution.

[0042] Identifiers Embedded in Audio Signal

[0043] Another way to associate an identifier with an audio signal is to embed the identifier in the audio signal using steganographic methods, such as digital watermarking or other data hiding techniques. Many of such techniques have been developed and are described in published articles and patents. Watermarking methods are described in U.S. Pat. No. 6,614,914. Other examples of methods for encoding and decoding auxiliary signals into audio signals include U.S. Pat. Nos. 5,862,260, 5,940,135 and 5,945,932. For more information on steganographic applications, see the patent applications and patents incorporated by reference.

[0044] The steganographic embedding method may be performed in a batch process. Consider a distributor of electronic music via the Internet or some other network, or a broadcaster of music such as a radio station. In each case, the distributor and broadcaster have a collection of audio objects. The embedding process may operate on this collection of objects in a batch process by retrieving an electronic version, encoding an identifier obtained from the registration process, and returning the marked version for later distribution or broadcasting. In some cases, it is desirable to do watermark embedding in an iterative process in a studio environment to encode the watermark with an intensity that achieves desired perceptibility and robustness requirements.

[0045] The steganographic embedding method may also be performed at the time of transmission of an electronic file or broadcast of the audio object. In the case of distribution via a network such as the Internet (e.g., streaming or file download), real time embedding enables the embedding process to also embed context information that is specific to the consumer (or the consumer's computer) that has electronically ordered the object. For example, when the user requests a file in a streaming or a compressed file format via the Internet using her browser, the distributor's server can request information (perhaps voluntary) about the user to be associated with the transmitted object. Later, the decoding process or the servers that map the identifier to actions or metadata can use this information to determine the types of information to provide or responsive action to perform.

[0046] In the case of broadcasting, real time embedding enables the identifier to be steganographically embedded throughout an electronic version of the audio signal just before, or as part of the broadcasting process.

[0047] An object or distributor ID (as well as other identifiers or context information) can be embedded in the payload of a watermark that is also used for copy control. Portion of the watermark can be used to control whether the object can be played, transferred, recorded, etc., while another part can be used to carry identifiers and other metadata for linking functions described in this document. Alternatively, entirely separate watermark encoding and decoding methods may be used for copy control and linking functions.

[0048] A watermarking process may be used to encode different watermarks in the various channels of an audio signal. Message information may be embedded in one or more channels, while synchronization or orientation signals used to detect and decode the message information may be encoded in other channels. Also, different messages (e.g., different identifiers) may be encoded in different channels. At decoding time, the different identifiers can trigger different actions or link to different data.

[0049] In broadcasting applications, an identifier may be encoded along with the broadcast of the associated media signal by modulating a subcarrier of the main carrier frequency used to transmit the media signal. The subcarrier conveys auxiliary data such as the identifier, while the main carrier conveys the associated media signal. To reduce audibility of the auxiliary data (e.g., the identifier(s)) encoded in the sub-carrier, the data can be randomized by applying it to a pseudorandom or random number by some function that may be inverted in the decoding process, e.g., multiplication or exclusive OR functions. One example of sub-carrier encoding and decoding is Active HSDS 97 developed by Seiko Corporation.

[0050] Identifiers in Digital Radio Broadcasts

[0051] Some forms of digital radio broadcasts support transmission of metadata along with media signals. This metadata can also be used to carry one or more identifiers that are mapped to metadata or actions. The metadata can be encoded at the time of broadcast or prior to broadcasting. Decoding of the identifier may be performed at the digital receiver. In particular, the digital receiver receives the broadcast data, extracts the identifier, and either automatically, or at the user's direction, forwards the identifier to a server to look up the associated metadata or action.

[0052] Dynamic Identifier Extraction from Audio Content or Related Data

[0053] As noted above, another way to associate an identifier with a corresponding audio signal is to derive the identifier from the signal. This approach has the advantage that the embedding process is unnecessary. Instead, the decoding process can generate the identifier from the audio object. In this case, the decoder computes a fingerprint of the audio signal based on a specified fingerprinting algorithm. The fingerprint is a number derived from a digital audio signal that serves as a statistically unique identifier of that signal, meaning that there is a high probability that the fingerprint was derived from the audio signal in question. One component of fingerprint algorithm is a hash algorithm. The hash algorithm may be applied to a selected portion of a music file (e.g., the first 10 seconds) to create a fingerprint. It may be applied to discrete samples in this portion, or to attributes that are less sensitive to typical audio processing. Examples of less sensitive attributes include most significant bits of audio samples or a low pass filtered version of the portion. Examples of hashing algorithms include MD5, MD2, SHA, and SHA1.

[0054] As an aside, fingerprinting may also be used to determine whether an audio signal has been watermarked. The fingerprinting application can evaluate a fingerprint for a received object and compare it with one for a watermarked object (or unmarked object) to determine whether the object is likely to be watermarked. Certain fingerprints can be associated with certain types of watermark methods. Using the fingerprint, a decoding device can select an appropriate watermark decoding system for the object.

[0055] While specifically discussed in the context of audio objects, the fingerprinting process applies to other types of multimedia content as well, including still images, video, graphics models, etc. For still images and video, the identifier can be derived dynamically from a compressed or uncompressed version of the image or video signal. The fingerprinting process may be tuned to generate a specific identifier based on the type of file format. For example, the process extracts the file format from the file (e.g., from a header or footer), then uses a fingerprinting process tailored for that type of file (e.g., a hash of a compressed image or video frame). The dynamic identifier computed by this process may be associated with metadata and/or actions using the processes and systems described in this document.

[0056] Registration Process

[0057] One way to implement the registration process is to build client and server application programs that communicate over a computer network using standard network communication protocols. The client may be implemented as a software program that provides identifying information about an audio object. It can obtain the information by prompting the user for the identifying information, or from extracting it from the audio object or its container. The server may be implemented as a database management program that manages identifiers and corresponding audio objects. When queried to provide an identifier for particular identifying information, the program checks whether it has already assigned an identifier to an object based on the identifying information. If so, it returns that identifier that has already been assigned. If not, it assigns a new identifier number, creates a new entry in the database for that number and its associated identifying information.

[0058] The type of identifier used to link audio objects varies with the application. As such, the registration process may vary as well. One type of identifier is a unique identifier for an audio object. Another type of identifier is one that identifies some attribute of the audio object, but does not uniquely identify it, such as a distributor or broadcaster identifier. This type of identifier requires additional context information to uniquely identify the audio object at the time of linking it to actions or metadata. For these types of identifiers, the registration process provides information identifying the attribute of the audio object, such as its distributor or broadcaster. In response, the server provides an identifier that may be embedded in several audio objects that share that attribute.

[0059] One example is a broadcaster ID, such as a radio station ID. Audio broadcast by the radio station is embedded with this radio station ID. To identify the object, context information such as the play time captured at the tuner is used along with the radio station ID extracted from the received audio signal to identify the audio object. The decoding process forwards this information to a server. Using the radio station ID and context information, the server maps the ID to an appropriate action. This may include querying a radio station's playlist database for an object identifier based on the station ID and context information. The server can then map the object identifier to an action or metadata based on the object ID returned from the playlist database. Other scenarios are possible. For example, the server could forward the station ID, context data and decoder address to a radio station server, which in turn, looks up the appropriate action or metadata (e.g., web page) and sends it to the device that decoded the station ID.

[0060] Broadcast content can also be associated with object identifiers. One way to implement the identifier assignment process is to allocate a unique set of identifiers with each broadcaster/distributor. Those broadcasters or distributors are then free to assign the identifiers to media objects as they wish. Once they complete the identifier assignment process, they may then associate the identifiers with the metadata or actions in a mapping process.

[0061] Embedding Process

[0062] The embedding process may be integrated into a software program along with the client of the registration process described in the previous section. This integration of registration and embedding functions is particularly suited to a batch embedder, where processing time required to request an identifier is less of a concern.

[0063] In real time embedding, the identifier or identifiers are preferably available for associated audio objects before embedding begins. For example, the identifiers can be maintained in a local database on the embedding computer or device and indexed by object title. Distributor and broadcast identifiers are more straightforward because they may be applied to several different audio objects.

[0064] The embedding process may also be implemented in an embedding clearinghouse system. The embedding clearinghouse is a computer or other electronic system that analyzes media objects and embeds one or more links in the media objects. The clearinghouse may be implemented in a server on a network, such as the Internet and operate on content in a “push,” “pull,” or some combination of push and pull models. In the push model, users and other systems send media objects to the embedding clearinghouse for analysis and embedding. The pull model, the clearinghouse has the capability to search for and gather media objects for embedding and analysis. One example of this pull model is an Internet search process called a spider that crawls the Internet, searching for media objects to analyze and embed with one or more identifying links.

[0065] The embedding clearinghouse analyzes a media object (perhaps based on out of band data like a file header or footer) and inserts an identifier. This identifier may link to a metadata and actions, such as re-direction to a web site offering products, services, and information related to the content. The embedding clearinghouse may incorporate search engine technology to execute a key word search based on information from the media object and then associate the media object with a series of related URLs returned from the Internet search. The process may be automatic, or with some user input to select which sub-set of links should be inserted.

[0066] The embedding clearinghouse may also offer an identifier embedding services for those wanting to link their media objects with metadata, actions, etc. In this application scenario, the embedding clearinghouse may be implemented as an Internet server that is accessible via a web page using conventional network communication and web protocols. To access the server, users visit a web page using an Internet browser. In exchange for a fee, which may be tendered electronically over the Internet from the user's computer to the server, the server provides an embedding service to embed an identifier into a media object uploaded from the user via the user's computer and Internet connection. The user can select the information to associate with a media object, such as generic identifying information (e.g., title, author, owner), generic licensing information, or special information or actions. The provider of the embedding clearinghouse server hosts the generic information, while the special purpose information and actions are accessed through re-direction. In particular, the provider of the clearinghouse server links the embedded identifier to an address or set of addresses of servers that provide the special information or actions. Then at decoding time, the decoding process sends the identifier to the provider's server, which in turn, redirects the identifier to a secondary server or servers that provide special purpose information or actions (e.g., redirect to a web page of the content owner, download related content, provide electronic licensing services, etc.).

[0067] Decoding the ID and Embedded Context Data

[0068] The implementation details of the decoding process depend on how the identifier is encoded into an audio object or its container. In the case where the identifier is encoded in a file header or footer, the decoder may be a software program or digital hardware that parses the header/footer and forwards it to the communication application. One way to implement this type of decoder is to integrate it into a media player as a plug in program. Examples of media players include Windows Media Player from Microsoft, Liquid Audio player from Liquid Audio, Winamp, Real Player from Real Networks. Preferably, the plug-in gives the user visual feedback that the identifier has been detected and displays a window with options to access more information or actions available via the link. For example, the user can be presented with a user interfaces prompting the user to click for more information or buying opportunities. If the user selects these options, the plug-in forwards the user selections and identifier to the communication application, which forwards them to the server (e.g., server 1, FIG. 1).

[0069] In the case where the identifier is steganographically encoded in the audio object, a corresponding decoder extracts the identifier. This type of decoder may be implemented as a plug in to a software player as described in the previous paragraph. It may also be implemented in a tuner for broadcast content, or in a listening device that captures audio from the ambient environment.

[0070] In the case where the identifier is derived from the content or container metadata, the decoder captures the pertinent portion of the audio object, and generates the identifier as described above. This type of decoder can be implemented in a software or hardware player, a tuner, etc.

[0071] The decoder may collect identifiers in response to a user request while objects containing these identifiers are being played. For example, when the user is playing music, he may like a song and want to buy it or get more information. This feature may be implemented by building an interface that has a button or voice recognition that enables the user to request information or a buy/license opportunity. Once captured, identifiers can be forwarded along with user instructions to the appropriate server.

[0072] However, one particularly useful feature is to enable the user to fetch information and make orders from music as the music is playing. The system described previously supports this feature because the decoding process can forward the identifier or identifiers, embedded context information, or additional context information (user information, play time, broadcast type, file type, player type, operating system type) to the communication application as the music is playing. The user can trigger the linking action by pressing a “fetch” button, or saying fetch to a voice activated input device that causes the decoding device to package a message and invoke the communication application (e.g., Internet browser). In turn, the communication application forwards the message to a server that parses the message and determines the associated action.

[0073] The activation of the “fetch it” feature may be made on a handheld device that communicates with a decoding device in a tuner via a wireless connection. For example, a user may press a button on a remote control device, like a key chain, which sends a wireless signal to a receiver in the tuner. The receiver invokes the decoding process. The tuner may also send metadata from the server to the remote control device for display using a similar wireless connection. Infrared or RF transceivers, for example, may be used to communicate the data back and forth.

[0074] The decoding device may also provide continuous decoding of identifiers. When the user requests a “fetch,” the identifier and context information for the current song may be forwarded to the server. Also, the decoding device may automatically fetch generic information such as song title and artist so that this information is immediately available to the user.

[0075] Another possible implementation is to temporarily buffer identifiers extracted from some predetermined number of the most recent songs, titles, etc. These identifiers can be stored along with other metadata, such as a time stamp, to inform the user when they were captured. The user can then select one or more of the items to send to the server for more information or related actions.

[0076] These features may be implemented in one or more devices. While the example above discusses a remote control device and a separate tuner with a decoder, these functions may be integrated into a single device, such as a car stereo, phone handset, personal digital assistant, and a variety of other types of players or tuners.

[0077] The identifier enables dynamic linking. Dynamic linking enables the identifier encoded with a media object to remain fixed, while the metadata or actions associated with that identifier can be changed. To change the associated metadata, the mapping process edits the identifier database to associate new metadata or actions with an identifier. The mapping process can be automated to change metadata or actions associated with an identifier at periodic intervals or in response to system events. In addition, a user may change the associated metadata or actions interactively at any time. To facilitate access to the database, a web-based interface can be added to the database.

[0078] Dynamically linked data returned from a server to a player environment can be displayed to the user in a variety of ways. One way is to display it in a web page or user interface window of a player. The data can be animated by scrolling it across the visual display. The data can also be displayed in the form of HTML links, which, when activated, cause the download of other data or initiate actions, such as playing streaming content from a server.

[0079] Server Types

[0080] As discussed elsewhere, the servers used to link identifiers to actions may be programmed to provide a variety of actions including:

[0081] returning data and HTML links (e.g., in the form of an HTML document, scripts, etc.)

[0082] downloading media signals in streaming or file format

[0083] performing an electronic transaction (selling products like CDs, DVDs, concert tickets, etc. via computer transaction using credit cards, digital money, etc.)

[0084] establishing a license to use a linked media object

[0085] re-directing to another server

[0086] performing database look up operations for related information, links, actions

[0087] performing database look up to uniquely identify a media object based on distributor/broadcaster ID and other context information

[0088] creating a transaction log

[0089] This is by no means in exhaustive list. Another type of server action is to initiate a process of searching a database, a collection of databases or the Internet for additional information related to a linked media object. This type of search service may be performed continuously and the results associated with the identifier. Then, in response to a request from a decoding process, the server can return a digest of the results with links to web pages for additional information.

[0090] Communication Application

[0091] The implementation details of the communication application are highly dependent on the type of communication link and protocols used to connect the decoding process to a server. Above, an Internet browser is provided as an example. A browser may be implemented in conventional PCs, handheld devices, wireless phones, stereo systems, set top boxes, etc. However, the communication application need not be based on computer network protocols. For wireless devices, where the marked content is played on wireless carrier frequencies, the communication application can employ wireless communication technology to forward identifiers and context information to servers that map this information to actions or metadata and return it via a wireless carrier frequency to user's handset.

[0092] Tracking Transactions and Report Generation

[0093] As depicted in FIG. 1 and described above, the servers for mapping identifiers to actions may be programmed to dispense a transaction log into a log file. A report generation process can then enable users to define and request queries of data from the log file based on a particular identifier, a particular type of context information (time frame, geographic location, user demographics, etc.), a particular action, etc.

[0094] Capture Devices

[0095] As noted above, the decoding process may be implemented in a variety of devices or software that process media objects. These devices and software include programmable devices such as personal computers, personal digital assistants, telephone handsets, set-top boxes, personal stereos, hi-fi components, tuners, receivers, televisions, etc. as well as hardwired devices that may be incorporated into these systems and devices.

[0096] In some contexts, it is useful to implement a recording function. This is particularly true in devices that receive a broadcast or stream of media content and need to capture at least a portion of it to decode an identifier. Examples of these devices are radio receivers, and wireless telephone handsets. The record function may be automatic or user activated. In the latter case, the user actuates an input device to control the record process and optionally the record duration. For example, the user may hear a song that she likes and press record. The device, in turn, records at least a part of the object that is currently being received (an audio, visual or audio visual signal). The user can then decide contemporaneously or at a later time to execute the identifier decoding process on the recorded signal. The recording function can be designed to execute for a pre-determined or user specified duration.

[0097] In the case of radio and television tuners/receivers, the record function can be used to capture a media signal as it is received. In the case of a telephone handset, the record function can be used for a variety of functions, such as recording part of a telephone conversation, recording speech or other ambient audio through a microphone, or recording a media signal received by the handset via a wireless communication channel. The recordings can be compressed and stored in local memory on the device. In addition, they may be annotated with metadata about the media signal, such as a time stamp to show time of capture, a location stamp to show location of capture, metadata extracted from the object (in band or out of band data), etc. A global positioning device may provide the location stamp. Some wireless phone systems are capable of computing location of a telephone handset via triangulation. This location data may be used to provide geographic location coordinates or the name of nearby landmark, city name, etc.

[0098] The metadata may be displayed on a display device to help the user remember the context of a particular recording. In addition, it may be provided as context information along with an identifier to a server that links the identifier and context information to metadata or actions.

[0099] Transmarking

[0100] In some applications, it may be useful to convert auxiliary information embedded in a media signal from one format to another. This converting process is referred to as transmarking. Transmarking may include converting an out of band identifier like a tag in a header/footer to a watermark or vice versa. It may also involve converting a message in one watermark format to another. The process involves a decoding operating on an input media object, and an encoding of the decoded information into the media object. It may also involve a process for removing the mark originally in the input object to avoid interference with the newly inserted mark.

[0101] There are a variety of reasons to perform transmarking. One is to make the embedded information more robust to the types of processing that the media object is likely to encounter, such as converting from one watermark used in packaged media to another watermark used in compressed, and electronically distributed media, or a watermark used in radio or wireless phone broadcast transmission applications.

[0102] This type of transmarking process may be performed at various stages of a media object's distribution path. As suggest previously, an identifier in a watermark or file header/footer may be encoded at the time of packaging the content for distribution, either in an electronic distribution format or a physical packaged medium, such as an optical disk or magnetic memory device. At some point, the media signal may be converted from one format to another. This format conversion stage is an opportunity to perform transmarking that is tailored for the new format in terms of robustness and perceptibility concerns. The new format may be a broadcast format such as digital radio broadcast, or AM or FM radio broadcast. In this case, the identifier may be transmarked into a watermark or other metadata format that is robust for broadcast applications. The new format may be a compressed file format (e.g., ripping from an optical disk to an MP3 format). In this case, the identifier may be transmarked into a file header/footer or watermark format that is robust and compatible with the compressed file format.

[0103] The transmarking process may leave an existing embedded identifier in tact and layer an additional identifier into the media object. This may include encoding a new watermark that does not interfere with an existing watermark (e.g., insert the new watermark in unmarked portions of the media object or in a non-interfering transform domain). It may also include adding additional or new identifier tags to headers or footers in the file format.

[0104] Amplifying an Embedded Identifier

[0105] Rather than converting embedded data to another format, an amplifying process may be used to renew an identifier that has become weakened or separated due to processing of the media object in which it is embedded. In this case, a decoder and encoder pair may be used to determine the current identifier and re-encode it. Of course, the encoder can also choose to embed a new or additional identifiers as well.

[0106] If the previous identifier is lost, the encoder can query an identifier database established in the registration process, passing identifying information about the media object. The database uses the identifying information to find an associated identifier and returns it to the encoder for embedding in the media object.

[0107] Managing On-Line Media Library Through Links in Media Signals

[0108] The forms in which digital media content can be distributed continue to evolve rapidly. Video and audio signals can be stored in a digital content package and distributed in physical form, such as an optical or magnetic storage medium, or in an electronic form (e.g., transferred over a network in a compressed or uncompressed form). In this document, a content package refers to a format in which a title, e.g., a film, song, musical album, multimedia collection etc., is played from a complete representation of that title.

[0109] In contrast, media content may also be delivered over a wire or wireless communication link in a streaming format. Obviating the need to have a complete copy of the title, a streaming format enables the receiver to play the title as it receives portions of it in a data “stream” from an external source. The following sections describe applications for linking media signals to other content and data using metadata and/or steganography.

[0110] Linking Packaged Digital Media to On-line Library of Media Titles

[0111] In this application, a local application (e.g., a device or software process) extracts an identifier from a media signal stored in a content package, and communicates the identifier to a database application to create and manage a library of media titles. Examples of a content package include optical media such as CDs and DVDs, magnetic media such as floppy disks and tapes, flash memory, compressed media files, etc. The user places the package into a media reader, such as a disk drive, player, etc. Operating in conjunction with the media reader, the local application extracts information (e.g., a portion of the media signal) from the package, extracts the identifier, and sends it to a database system (e.g., a server on the Internet). In response, the database system determines the corresponding title and adds the title to an on-line library (e.g., external storage accessible via the Internet). The library may be set up as a personal collection, or a collection for a group of users.

[0112] To identify the user(s)' library, the local application provides a user identifier. This user identifier may be authentication information entered by a user (such as a user name and password), or alternatively, may be an identifier (such a device ID) sent automatically by the local application.

[0113] The title (i.e. content) is added to the on-line library, by transferring a copy of the selection (e.g., music track, video, etc.) from a master database (e.g., a library of MP3 files, or some other streaming or downloadable content format) to the user's on-line library collection. This arrangement avoids the need to upload content from the user's application. Also, it is a much more secure approach than techniques that simply read title data from a CD and relay same to the on-line library. (It is a simple task for an unscrupulous user to fake the presence of a CD by determining how the client CD software specifies the title to the on-line library, and then mimic same even without possession of a bona fide CD.) The in-band encoding presented by watermarks offers innately better security, and provides opportunities for enhanced security by encryption, etc.

[0114] In other arrangements, a copy of the selection, per se, is not transferred from the master database to the user's library, but rather a reference (e.g., a link or pointer) to the master library is added to the user's library. Efficiencies in storage can thereby be achieved (i.e., a copy of each selection is stored only once, from which an unlimited number of users' on-line libraries can link to it).

[0115] The identifier may be placed in the content package by steganographically encoding it in the media signal. For example, the identifier may be a reference number (e.g., of 24-256 bits) or the text name of the title embedded in a digital watermark. In a digital watermark implementation, a watermark embedder encodes the identifier in video, audio and/or images. The local application includes a watermark detector that reads at least a portion of the media signal from the package, detects the watermark, and reads the identifier embedded in the watermark. The detector may be implemented in a computer program (e.g., driver application, browser plug-in, etc.). A communication application, such as an Internet browser, then communicates the identifier to the database system, which may be implemented using conventional database management and Internet server software.

[0116] One advantage of this application is that it allows a user to create an on-line library of titles, and then playback those titles from the library on demand. For example, the user may organize a large collection of titles, view titles in a variety of formats, and playback individual songs or videos, in any order and at any time. The user can request playback anywhere by connecting to the on-line database and requesting a streaming delivery or file down load.

[0117] For playback, a player application (e.g., device or application program on a computer) sends a request to a content delivery system via a wire or wireless connection. The content delivery system first checks to make sure that the user has the title in her on-line library. In addition, it may authenticate the user and determine usage rights before returning any content. If it determines playback to be authorized, the content delivery system sends the titles by streaming the content to the player application, on demand, in the order requested.

[0118] Linking Streaming Media to On-line Library of Media Titles

[0119] A similar scheme to the one described in the previous section may be implemented for streaming media. In this case, the local application need not have a packaged version of the content to add a title to a user's library. Instead, the local application extracts an identifier from a portion of the streaming content. The identifier may be embedded in a watermark that is replicated throughout the media signal. In the event that the portion of the streaming media does not contain an identifier, the local application continues to execute a detection process on the media signal as it arrives until it has extracted the identifier.

[0120] In either of the above applications, the user can initiate a process of extracting the watermark by an explicit request, such as by clicking on the visual UI of the local application, entering a voice command, etc. Alternatively, the local application may initiate the detection process automatically whenever the user starts playback from packaged or streaming content.

[0121] The identifier may also include usage rights that dictate how the user (as identified by a user ID) may retrieve a copy from the library for playback. For example, the watermark may include a number that represents the number of times the user can access the content for playback.

[0122] Linking Packaged or Streaming Media to Database of Auxiliary Information Related to the Media

[0123] In addition to linking to a title database, the identifier may also link to other information or machine instructions relating to the media. For example, the database may send a set of options back to the user (e.g., in the form of a HTML page) that allow the user to select and download additional information related to the media signal in which the identifier is embedded.

[0124] Operating Environment for Computer Implementations

[0125] FIG. 3 illustrates an example of a computer system that serves as an operating environment for software implementations of the systems described above. The software applications may be implemented in C/C++ and are portable to many different computer systems. FIG. 3 generally depicts one such system.

[0126] The computer system shown in FIG. 3 includes a computer 1220, including a processing unit 1221, a system memory 1222, and a system bus 1223 that interconnects various system components including the system memory to the processing unit 1221.

[0127] The system bus may comprise any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using a bus architecture such as PCI, ISA and EISA, to name a few.

[0128] The system memory includes read only memory (ROM) 1224 and random access memory (RAM) 1225. A basic input/output system 1226 (BIOS), containing the basic routines that help to transfer information between elements within the computer 1220, such as during start-up, is stored in ROM 1224.

[0129] The computer 1220 further includes a hard disk drive 1227, a magnetic disk drive 1228, e.g., to read from or write to a removable disk 1229, and an optical disk drive 1230, e.g., for reading a CD-ROM or DVD disk 1231 or to read from or write to other optical media. The hard disk drive 1227, magnetic disk drive 1228, and optical disk drive 1230 are connected to the system bus 1223 by a hard disk drive interface 1232, a magnetic disk drive interface 1233, and an optical drive interface 1234, respectively. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions (program code such as dynamic link libraries, and executable files), etc. for the computer 1220.

[0130] Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and an optical disk, it can also include other types of media that are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, and the like.

[0131] A number of program modules may be stored in the drives and RAM 1225, including an operating system 1235, one or more application programs 1236, other program modules 1237, and program data 1238.

[0132] A user may enter commands and information into the personal computer 1220 through a keyboard 1240 and pointing device, such as a mouse 1242. Other input devices may include a microphone, joystick, game pad, satellite dish, digital camera, scanner, or the like. The microphone may be used to capture audio signals. Similarly, a digital camera or scanner 43 may be used to capture video and images. The camera and scanner are each connected to the computer via a standard interface 44. Currently, there are digital cameras designed to interface with a Universal Serial Bus (USB), Peripheral Component Interconnect (PCI), and parallel port interface. Two emerging standard peripheral interfaces for cameras include USB2 and 1394 (also known as firewire and iLink).

[0133] These and other input devices are often connected to the processing unit 1221 through a serial port interface 1246 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB).

[0134] A monitor 1247 or other type of display device is also connected to the system bus 1223 via an interface, such as a video adapter 1248. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers and printers.

[0135] The computer 1220 operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 1249. The remote computer 1249 may be a server, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 1220, although only a memory storage device 1250 has been illustrated in FIG. 3. The logical connections depicted in FIG. 3 include a local area network (LAN) 1251 and a wide area network (WAN) 1252. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.

[0136] When used in a LAN networking environment, the computer 1220 is connected to the local network 1251 through a network interface or adapter 1253. When used in a WAN networking environment, the personal computer 1220 typically includes a modem 1254 or other means for establishing communications over the wide area network 1252, such as the Internet. The modem 1254, which may be internal or external, is connected to the system bus 1223 via the serial port interface 1246.

[0137] In a networked environment, program modules depicted relative to the personal computer 1220, or portions of them, may be stored in the remote memory storage device. The processes detailed above can be implemented in a distributed fashion, and as parallel processes. It will be appreciated that the network connections shown are exemplary and that other means of establishing a communications link between the computers may be used.

[0138] The computer may establish a wireless connection with external devices through a variety of peripherals such as a cellular modem, radio transceiver, infrared transceiver, etc.

[0139] While a computer system is offered as example operating environment, the applications may be implemented in a variety of devices and systems, including servers, workstations, hand-held devices (e.g., hand held audio or video players, Personal Digital Assistants such as Palm Pilot, etc.), network appliances, distributed network systems, etc.

[0140] Concluding Remarks

[0141] Having described and illustrated the principles of the technology with reference to specific implementations, it will be recognized that the technology can be implemented in many other, different, forms. To provide a comprehensive disclosure without unduly lengthening the specification, applicants incorporate by reference the patents and patent applications referenced above. These patents and patent applications provide additional implementation details. They describe ways to implement processes and components of the systems described above. Processes and components described in these applications may be used in various combinations, and in some cases, interchangeably with processes and components described above.

[0142] The particular combinations of elements and features in the above-detailed embodiments are exemplary only; the interchanging and substitution of these teachings with other teachings in this and the incorporated-by-reference patents/applications are also contemplated.

Claims

We claim:

1. A method of establishing an on-line collection of media titles, comprising the steps of:

extracting an identifier steganographically encoded in a media signal;

sending the identifier to a database; and

requesting the database to add a title associated with the media signal to an on-line collection.

2. The method according to claim 1, further comprising the step of:

requesting playback of a title from the on-line collection.

3. A system to interact with an on-line collection of media titles stored in a database, said system comprising:

a detector to extract an embedded watermark from a media signal, the watermark including identifying information for the media signal;

a module to send the identifying information to the database; and

a module to receive data from the database in response to the identifying information.

4. The system according to claim 3, wherein the identifying information includes a title of the media signal to be added to the on-line collection.

5. The system according to claim 3, wherein the identifying information includes usage rights.

6. The system according to claim 3, wherein the media signal is stored in a content package.

7. An apparatus to interact with a media signal, said apparatus comprising:

a storage device;

a processing unit; and

a local application stored in said storage device and processed by said processing unit, said local application operating to: i) extract an identifier from the media signal, the identifier being steganographically encoded into the media signal, and to ii) send the identifier to a database to associate the media signal with an on-line collection maintained by the database.

8. The apparatus according to claim 7, wherein the identifier comprises a watermark.

9. The apparatus according to claim 7, wherein the identifier comprises a reference number.

10. The apparatus according to claim 7, wherein the identifier comprises data embedded within a watermark.

11. The apparatus according to claim 10, wherein the data comprises a title name.

12. The apparatus according to claim 7, wherein said local application provides a user identifier to the database.

13. The apparatus according to claim 12, wherein said user identifier comprises a device identifier.

14. The apparatus according to claim 7, wherein the media signal is stored in a content package.

15. A method of operating a system to create and manage a library of on-line media titles, said method comprising the steps of:

receiving a media identifier from a user that has been extracted from steganographically encoded information in a media signal;

determining a title that corresponds to the media identifier;

identifying the user; and

adding the media title to an on-line library of media titles associated with the user.

16. The method according to claim 15, further comprising the step of:

in response to a user's request for a media title, verifying that the media title is in the user's on-line library.

17. The method according to claim 16, further comprising the steps of:

authenticating the user in response to the user's request for a media title; and

allowing the user to access the on-line library when the user is authenticated.

18. The method according to claim 17, further comprising the steps of:

determining usage rights associated with a requested media title, and controlling access to the media title based on the usage rights.

19. The method according to claim 15, wherein said adding step comprises the step of transferring a copy of the media title to the on-line library.

20. The method according to claim 15, wherein said adding step comprises the step of adding a pointer to the on-line library to point to a copy of the media title.

21. The method according to claim 15, wherein the user is identified by identifying a user device in communication with the system.

22. An apparatus to interact with a streaming media signal, said apparatus comprising:

a storage device;

a processing unit; and

a local application stored in said storage device and processed by said processing unit, said local application operating to: i) extract an identifier from the streaming media signal, and to ii) send the identifier to a database to associate the streaming media signal with an on-line library collection maintained by the database.

23. The apparatus according to claim 22, wherein the identifier is embedded in a watermark in the streaming media signal.

24. The apparatus according to claim 23, wherein the watermark is replicated throughout the streaming media signal.

25. The apparatus according to claim 23, wherein the local application extracts the identifier upon a request by a user.

26. The apparatus according to claim 25, wherein the request comprises a voice command.

27. The apparatus according to claim 23, wherein the identifier comprises usage rights which dictate how the user may retrieve a copy of the streaming media signal from the library for playback.

28. The apparatus according to claim 23, wherein the on-line library is a personal library associated with a predetermined user.

29. The apparatus according to claim 23, wherein the on-line library is associated with a predetermined group of users.

Patent Citations (400)

Patent	Date	Inventor	Cited By
US3493674(A)	1970-02-01	Houghton	Applicant
US3569619(A)	1971-03-01	Simjian	Applicant
US3576369(A)	1971-04-01	Wick et al.	Applicant
US3585290(A)	1971-06-01	Sanford	Applicant
US3655162(A)	1972-04-01	Yamamoto et al.	Applicant
US3703628(A)	1972-11-01	Philipson, Jr.	Applicant
US3809806(A)	1974-05-01	Walker et al.	Applicant
US3838444(A)	1974-09-01	Loughlin et al.	Applicant
US3914877(A)	1975-10-01	Hines	Applicant
US3922074(A)	1975-11-01	Ikegami et al.	Applicant
US3971917(A)	1976-07-01	Maddox et al.	Applicant
US3977785(A)	1976-08-01	Harris	Applicant
US3982064(A)	1976-09-01	Barnaby	Applicant
US3984624(A)	1976-10-01	Waggener	Applicant
US4025851(A)	1977-05-01	Haselwood et al.	Applicant
US4184700(A)	1980-01-01	Greenaway	Applicant
US4225967(A)	1980-09-01	Miwa et al.	Applicant
US4230990(A)	1980-10-01	Lert, Jr. et al.	Applicant
US4231113(A)	1980-10-01	Blasbalg	Applicant
US4238849(A)	1980-12-01	Gassmann	Applicant
US4252995(A)	1981-02-01	Schmidt et al.	Applicant
US4262329(A)	1981-04-01	Bright et al.	Applicant
US4296326(A)	1981-10-01	Haslop et al.	Applicant
US4297729(A)	1981-10-01	Steynor et al.	Applicant
US4313197(A)	1982-01-01	Maxemchuk	Applicant
US4367488(A)	1983-01-01	Leventer et al.	Applicant
US4379947(A)	1983-04-01	Warner	Applicant
US4380027(A)	1983-04-01	Leventer et al.	Applicant
US4389671(A)	1983-06-01	Posner et al.	Applicant
US4395600(A)	1983-07-01	Lundy et al.	Applicant
US4416001(A)	1983-11-01	Ackerman	Applicant
US4423415(A)	1983-12-01	Goldman	Applicant
US4425642(A)	1984-01-01	Moses et al.	Applicant
US4476468(A)	1984-10-01	Goldman	Applicant
US4523508(A)	1985-06-01	Mayer et al.	Applicant
US4528588(A)	1985-07-01	Löfberg	Applicant
US4547804(A)	1985-10-01	Greenberg	Applicant
US4553261(A)	1985-11-01	Froessl	Applicant
US4590366(A)	1986-05-01	Rothfjell	Applicant
US4595950(A)	1986-06-01	Lofberg	Applicant
US4618257(A)	1986-10-01	Bayne et al.	Applicant
US4637051(A)	1987-01-01	Clark	Applicant
US4639779(A)	1987-01-01	Greenberg	Applicant
US4647974(A)	1987-03-01	Butler et al.	Applicant
US4654867(A)	1987-03-01	Labedz et al.	Applicant
US4660221(A)	1987-04-01	Dlugos	Applicant
US4663518(A)	1987-05-01	Borror et al.	Applicant
US4665431(A)	1987-05-01	Cooper	Applicant
US4672605(A)	1987-06-01	Hustig et al.	Applicant
US4675746(A)	1987-06-01	Tetrick et al.	Applicant
US4677435(A)	1987-06-01	Cause D'Agraives et al.	Applicant
US4682794(A)	1987-07-01	Margolin	Applicant
US4703476(A)	1987-10-01	Howard	Applicant
US4712103(A)	1987-12-01	Gotanda	Applicant
US4718106(A)	1988-01-01	Weinblatt	Applicant
US4723149(A)	1988-02-01	Harada	Applicant
US4739377(A)	1988-04-01	Allen	Applicant
US4750173(A)	1988-06-01	Bluthgen	Applicant
US4765656(A)	1988-08-01	Becker et al.	Applicant
US4775901(A)	1988-10-01	Nakano	Applicant
US4776013(A)	1988-10-01	Kafri et al.	Applicant
US4805020(A)	1989-02-01	Greenberg	Applicant
US4807031(A)	1989-02-01	Broughton et al.	Applicant
US4811357(A)	1989-03-01	Betts et al.	Applicant
US4811408(A)	1989-03-01	Goldman	Applicant
US4820912(A)	1989-04-01	Samyn	Applicant
US4835517(A)	1989-05-01	van der Gracht et al.	Applicant
US4855827(A)	1989-08-01	Best	Applicant
US4864618(A)	1989-09-01	Wright et al.	Applicant
US4866771(A)	1989-09-01	Bain	Applicant
US4874936(A)	1989-10-01	Chandler et al.	Applicant
US4876617(A)	1989-10-01	Best et al.	Applicant
US4879747(A)	1989-11-01	Leighton et al.	Applicant
US4884139(A)	1989-11-01	Pommier	Applicant
US4885632(A)	1989-12-01	Mabey et al.	Applicant
US4888798(A)	1989-12-01	Earnest	Applicant
US4903301(A)	1990-02-01	Kondo et al.	Applicant
US4908836(A)	1990-03-01	Rushforth et al.	Applicant
US4908873(A)	1990-03-01	Philibert et al.	Applicant
US4918484(A)	1990-04-01	Ujiie et al.	Applicant
US4920503(A)	1990-04-01	Cook	Applicant
US4921278(A)	1990-05-01	Shiang et al.	Applicant
US4939515(A)	1990-07-01	Adelson	Applicant
US4941150(A)	1990-07-01	Iwasaki	Applicant
US4943973(A)	1990-07-01	Werner	Applicant
US4943976(A)	1990-07-01	Ishigaki	Applicant
US4944036(A)	1990-07-01	Hyatt	Applicant
US4947028(A)	1990-08-01	Gorog	Applicant
US4963998(A)	1990-10-01	Maufe	Applicant
US4965827(A)	1990-10-01	McDonald	Applicant
US4967273(A)	1990-10-01	Greenberg	Applicant
US4969041(A)	1990-11-01	O'Grady et al.	Applicant
US4972471(A)	1990-11-01	Gross et al.	Applicant
US4972475(A)	1990-11-01	Sant'Anselmo	Applicant
US4972476(A)	1990-11-01	Nathans	Applicant
US4977594(A)	1990-12-01	Shear	Applicant
US4979210(A)	1990-12-01	Nagata et al.	Applicant
US4996530(A)	1991-02-01	Hilton	Applicant
US5003590(A)	1991-03-01	Lechner et al.	Applicant
US5010405(A)	1991-04-01	Schreiber et al.	Applicant
US5023907(A)	1991-06-01	Johnson	Applicant
US5027401(A)	1991-06-01	Soltesz	Applicant
US5034982(A)	1991-07-01	Heninger et al.	Applicant
US5036513(A)	1991-07-01	Greenblatt	Applicant
US5040059(A)	1991-08-01	Leberl	Applicant
US5053956(A)	1991-10-01	Donald	Applicant
US5062666(A)	1991-11-01	Mowry et al.	Applicant
US5063446(A)	1991-11-01	Gibson	Applicant
US5073899(A)	1991-12-01	Collier et al.	Applicant
US5073925(A)	1991-12-01	Nagata et al.	Applicant
US5075773(A)	1991-12-01	Pullen et al.	Applicant
US5077608(A)	1991-12-01	Dubner	Applicant
US5077795(A)	1991-12-01	Rourke et al.	Applicant
US5079648(A)	1992-01-01	Maufe	Applicant
US5091966(A)	1992-02-01	Bloomberg et al.	Applicant
US5095196(A)	1992-03-01	Miyata	Applicant
US5103459(A)	1992-04-01	Gilhousen et al.	Applicant
US5113437(A)	1992-05-01	Best	Applicant
US5113445(A)	1992-05-01	Wang	Applicant
US5128525(A)	1992-07-01	Stearns et al.	Applicant
US5144660(A)	1992-09-01	Rose	Applicant
US5146457(A)	1992-09-01	Veldhuis et al.	Applicant
US5148498(A)	1992-09-01	Resnikoff et al.	Applicant
US5150409(A)	1992-09-01	Elsner	Applicant
US5161210(A)	1992-11-01	Druyvesteyn et al.	Applicant
US5166676(A)	1992-11-01	Milheiser	Applicant
US5168146(A)	1992-12-01	Marshall et al.	Applicant
US5181786(A)	1993-01-01	Hujink	Applicant
US5185736(A)	1993-02-01	Tyrrell et al.	Applicant
US5199081(A)	1993-03-01	Saito et al.	Applicant
US5200822(A)	1993-04-01	Bronfin et al.	Applicant
US5212551(A)	1993-05-01	Conanan	Applicant
US5213337(A)	1993-05-01	Sherman	Applicant
US5216724(A)	1993-06-01	Suzuki et al.	Applicant
US5228056(A)	1993-07-01	Schilling	Applicant
US5243411(A)	1993-09-01	Shirochi et al.	Applicant
US5243423(A)	1993-09-01	DeJean et al.	Applicant
US5245165(A)	1993-09-01	Zhang	Applicant
US5245329(A)	1993-09-01	Gokcebay	Applicant
US5247364(A)	1993-09-01	Banker et al.	Applicant
US5253078(A)	1993-10-01	Balkanski et al.	Applicant
US5257119(A)	1993-10-01	Funada et al.	Applicant
US5259025(A)	1993-11-01	Monroe	Applicant
US5267334(A)	1993-11-01	Normille et al.	Applicant
US5280537(A)	1994-01-01	Sugiyama et al.	Applicant
US5288976(A)	1994-02-01	Citron	Applicant
US5291243(A)	1994-03-01	Heckman et al.	Applicant
US5293399(A)	1994-03-01	Hefti	Applicant
US5295203(A)	1994-03-01	Krause et al.	Applicant
US5299019(A)	1994-03-01	Pack et al.	Applicant
US5305400(A)	1994-04-01	Butera	Applicant
US5315098(A)	1994-05-01	Tow	Applicant
US5319453(A)	1994-06-01	Copriviza et al.	Applicant
US5319724(A)	1994-06-01	Blonstein et al.	Applicant
US5319735(A)	1994-06-01	Preuss et al.	Applicant
US5321470(A)	1994-06-01	Hasuo et al.	Applicant
US5325167(A)	1994-06-01	Melen	Applicant
US5327237(A)	1994-07-01	Gerdes et al.	Applicant
US5337362(A)	1994-08-01	Gormish et al.	Applicant
US5349655(A)	1994-09-01	Mann	Applicant
US5351302(A)	1994-09-01	Leighton et al.	Applicant
US5371792(A)	1994-12-01	Asai et al.	Applicant
US5374976(A)	1994-12-01	Spannenburg	Applicant
US5379345(A)	1995-01-01	Greenberg	Applicant
US5387941(A)	1995-02-01	Montgomery et al.	Applicant
US5394274(A)	1995-02-01	Kahn	Applicant
US5396559(A)	1995-03-01	McGrew	Applicant
US5398283(A)	1995-03-01	Virga	Applicant
US5404160(A)	1995-04-01	Schober et al.	Applicant
US5404377(A)	1995-04-01	Moses	Applicant
US5408542(A)	1995-04-01	Callahan	Applicant
US5416307(A)	1995-05-01	Danek et al.	Applicant
US5418853(A)	1995-05-01	Kanota et al.	Applicant
US5422963(A)	1995-06-01	Chen et al.	Applicant
US5422995(A)	1995-06-01	Aoki et al.	Applicant
US5425100(A)	1995-06-01	Thomas et al.	Applicant
US5428606(A)	1995-06-01	Moskowitz	Applicant
US5428607(A)	1995-06-01	Hiller et al.	Applicant
US5428731(A)	1995-06-01	Powers	Applicant
US5432542(A)	1995-07-01	Thibadeau et al.	Applicant
US5432870(A)	1995-07-01	Schwartz	Applicant
US5446488(A)	1995-08-01	Vogel	Applicant
US5450122(A)	1995-09-01	Keene	Applicant
US5450490(A)	1995-09-01	Jensen et al.	Applicant
US5461426(A)	1995-10-01	Limberg et al.	Applicant
US5463209(A)	1995-10-01	Figh	Applicant
US5469222(A)	1995-11-01	Sprague	Applicant
US5469506(A)	1995-11-01	Berson et al.	Applicant
US5473631(A)	1995-12-01	Moses	Applicant
US5479168(A)	1995-12-01	Johnson et al.	Applicant
US5481294(A)	1996-01-01	Thomas et al.	Applicant
US5488664(A)	1996-01-01	Shamir	Applicant
US5493677(A)	1996-02-01	Bfalogh	Applicant
US5495581(A)	1996-02-01	Tsai	Applicant
US5496071(A)	1996-03-01	Walsh	Applicant
US5499294(A)	1996-03-01	Friedman	Applicant
US5502576(A)	1996-03-01	Ramsay et al.	Applicant
US5515081(A)	1996-05-01	Vasilik	Applicant
US5521722(A)	1996-05-01	Colvill et al.	Applicant
US5524933(A)	1996-06-01	Kunt et al.	Applicant
US5530751(A)	1996-06-01	Morris	Applicant
US5530759(A)	1996-06-01	Braudaway et al.	Applicant
US5530852(A)	1996-06-01	Meske, Jr. et al.	Applicant
US5532920(A)	1996-07-01	Hartrick et al.	Applicant
US5537223(A)	1996-07-01	Curry	Applicant
US5539471(A)	1996-07-01	Myhrvold et al.	Applicant
US5539735(A)	1996-07-01	Moskowitz	Applicant
US5541662(A)	1996-07-01	Adams et al.	Applicant
US5544255(A)	1996-08-01	Smithies et al.	Applicant
US5548646(A)	1996-08-01	Aziz et al.	Applicant
US5557333(A)	1996-09-01	Jungo et al.	Applicant
US5559559(A)	1996-09-01	Jungo et al.	Applicant
US5568179(A)	1996-10-01	Diehl et al.	Applicant
US5568550(A)	1996-10-01	Ur	Applicant
US5568570(A)	1996-10-01	Rabbani	Applicant
US5572010(A)	1996-11-01	Petrie	Applicant
US5572247(A)	1996-11-01	Montgomery	Applicant
US5576532(A)	1996-11-01	Hecht	Applicant
US5579124(A)	1996-11-01	Aijala et al.	Applicant
US5582103(A)	1996-12-01	Tanaka et al.	Applicant
US5587743(A)	1996-12-01	Montgomery	Applicant
US5590197(A)	1996-12-01	Chen et al.	Applicant
US5594226(A)	1997-01-01	Steger	Applicant
US5598526(A)	1997-01-01	Daniel et al.	Applicant
US5602920(A)	1997-02-01	Bestler et al.	Applicant
US5606609(A)	1997-02-01	Houser et al.	Applicant
US5611575(A)	1997-03-01	Petrie	Applicant
US5613004(A)	1997-03-01	Cooperman et al.	Applicant
US5613012(A)	1997-03-01	Hoffman et al.	Applicant
US5614940(A)	1997-03-01	Cobbley et al.	Applicant
US5617119(A)	1997-04-01	Briggs et al.	Applicant
US5617148(A)	1997-04-01	Montgomery	Applicant
US5629770(A)	1997-05-01	Brassil	Applicant
US5629980(A)	1997-05-01	Stefik et al.	Applicant
US5636292(A)	1997-06-01	Rhoads	Applicant
US5638443(A)	1997-06-01	Stefik	Applicant
US5638446(A)	1997-06-01	Rubin	Applicant
US5640193(A)	1997-06-01	Wellner	Applicant
US5646999(A)	1997-07-01	Saito	Applicant
US5652626(A)	1997-07-01	Kawakami et al.	Applicant
US5659164(A)	1997-08-01	Schmid	Applicant
US5661574(A)	1997-08-01	Kawana	Applicant
US5663766(A)	1997-09-01	Sizer, II	Applicant
US5664018(A)	1997-09-01	Leighton	Applicant
US5665951(A)	1997-09-01	Newman et al.	Applicant
US5666487(A)	1997-09-01	Goodman et al.	Applicant
US5668636(A)	1997-09-01	Beach et al.	Applicant
US5671282(A)	1997-09-01	Wolff et al.	Applicant
US5673316(A)	1997-09-01	Auerbach et al.	Applicant
US5687236(A)	1997-11-01	Moskowitz et al.	Applicant
US5710636(A)	1998-01-01	Curry	Applicant
US5719939(A)	1998-02-01	Tel	Applicant
US5721788(A)	1998-02-01	Powell et al.	Applicant
US5727092(A)	1998-03-01	Sandford, II et al.	Applicant
US5735547(A)	1998-04-01	Morelle et al.	Applicant
US5740244(A)	1998-04-01	Indeck et al.	Applicant
US5742845(A)	1998-04-01	Wagner	Applicant
US5745604(A)	1998-04-01	Rhoads	Applicant
US5761686(A)	1998-06-01	Bloomberg	Applicant
US5765152(A)	1998-06-01	Erickson	Examiner
US5768426(A)	1998-06-01	Rhoads	Applicant
US5774452(A)	1998-06-01	Wolosewicz	Applicant
US5778102(A)	1998-07-01	Sandford, II et al.	Applicant
US5790693(A)	1998-08-01	Graves et al.	Applicant
US5790697(A)	1998-08-01	Munro et al.	Applicant
US5804803(A)	1998-09-01	Cragun et al.	Applicant
US5809160(A)	1998-09-01	Powell et al.	Applicant
US5809317(A)	1998-09-01	Kogan et al.	Applicant
US5817205(A)	1998-10-01	Kaule	Applicant
US5818441(A)	1998-10-01	Throckmorton et al.	Applicant
US5819289(A)	1998-10-01	Sanford, II et al.	Applicant
US5825871(A)	1998-10-01	Mark	Applicant
US5825892(A)	1998-10-01	Braudaway et al.	Applicant
US5838458(A)	1998-11-01	Tsai	Applicant
US5841978(A)	1998-11-01	Rhoads	Applicant
US5848144(A)	1998-12-01	Ahrens	Applicant
US5848413(A)	1998-12-01	Wolff	Applicant
US5852673(A)	1998-12-01	Young	Applicant
US5857038(A)	1999-01-01	Owada et al.	Applicant
US5862218(A)	1999-01-01	Steinberg	Applicant
US5862260(A)	1999-01-01	Rhoads	Applicant
US5869819(A)	1999-02-01	Knowles et al.	Applicant
US5871615(A)	1999-02-01	Harris	Applicant
US5872589(A)	1999-02-01	Morales	Applicant
US5875249(A)	1999-02-01	Mintzer et al.	Applicant
US5892900(A)	1999-04-01	Ginter et al.	Applicant
US5893101(A)	1999-04-01	Balogh et al.	Applicant
US5898779(A)	1999-04-01	Squilla et al.	Applicant
US5900608(A)	1999-05-01	Iida	Applicant
US5902353(A)	1999-05-01	Reber et al.	Applicant
US5903729(A)	1999-05-01	Reber et al.	Applicant
US5903892(A)	1999-05-01	Hoffert et al.	Examiner
US5905248(A)	1999-05-01	Russell et al.	Applicant
US5905251(A)	1999-05-01	Knowles	Applicant
US5905810(A)	1999-05-01	Jones et al.	Applicant
US5913210(A)	1999-06-01	Call	Applicant
US5915027(A)	1999-06-01	Cox et al.	Applicant
US5930767(A)	1999-07-01	Reber et al.	Applicant
US5932863(A)	1999-08-01	Rathus et al.	Applicant
US5933798(A)	1999-08-01	Linnartz	Applicant
US5933829(A)	1999-08-01	Durst et al.	Applicant
US5938726(A)	1999-08-01	Reber et al.	Applicant
US5938727(A)	1999-08-01	Ikeda	Applicant
US5939695(A)	1999-08-01	Nelson	Applicant
US5940595(A)	1999-08-01	Reber et al.	Applicant
US5949055(A)	1999-09-01	Fleet et al.	Applicant
US5950173(A)	1999-09-01	Perkowski	Applicant
US5963916(A)	1999-10-01	Kaplan	Applicant
US5971277(A)	1999-10-01	Cragun et al.	Applicant
US5974141(A)	1999-10-01	Saito	Applicant
US5974548(A)	1999-10-01	Adams	Applicant
US5978773(A)	1999-11-01	Hudetz et al.	Applicant
US5979757(A)	1999-11-01	Tracy et al.	Applicant
US5983176(A)	1999-11-01	Hoffert et al.	Examiner
US5983218(A)	1999-11-01	Syeda-Mahmoo	Applicant
US5991426(A)	1999-11-01	Cox et al.	Applicant
US6005501(A)	1999-12-01	Wolosewicz	Applicant
US6024287(A)	2000-02-01	Takai et al.	Applicant
US6035177(A)	2000-03-01	Moses et al.	Applicant
US6052486(A)	2000-04-01	Knowlton et al.	Applicant
US6064764(A)	2000-05-01	Bhaskaran et al.	Applicant
US6122403(A)	2000-09-01	Rhoads	Applicant
US6166750(A)	2000-12-01	Negishi	Applicant
US6188787(B1)	2001-02-01	Ohmae et al.	Applicant
US6243480(B1)	2001-06-01	Zhao et al.	Applicant
US6266430(B1)	2001-07-01	Rhoads et al.	Applicant
US6286036(B1)	2001-09-01	Rhoads	Applicant
US6301360(B1)	2001-10-01	Bocionek et al.	Applicant
US6311214(B1)	2001-10-01	Rhoads	Applicant
US6321648(B1)	2001-11-01	Berson et al.	Applicant
US6321981(B1)	2001-11-01	Ray et al.	Applicant
US6324573(B1)	2001-11-01	Rhoads	Applicant
US6324574(B1)	2001-11-01	Gong	Applicant
US6343204(B1)	2002-01-01	Yang	Applicant
US6359985(B1)	2002-03-01	Koch et al.	Applicant
US6411725(B1)	2002-06-01	Rhoads	Applicant
US6496802(B1)	2002-12-01	van Zoest et al.	Applicant
US6522769(B1)	2003-02-01	Rhoads et al.	Applicant
US6542927(B2)	2003-04-01	Rhoads	Applicant
US6553129(B1)	2003-04-01	Rhoads	Applicant
US6577746(B1)	2003-06-01	Evans et al.	Applicant
US2001/0017709(A1)	2001-08-01	Murakami et al.	Applicant
US2001/0024510(A1)	2001-09-01	Iwamura	Applicant
US2001/0026618(A1)	2001-10-01	Van Wie et al.	Applicant
US2001/0026629(A1)	2001-10-01	Oki	Applicant
US2001/0030759(A1)	2001-10-01	Hayashi et al.	Applicant
US2001/0053299(A1)	2001-12-01	Matsunoshita et al.	Applicant
US2002/0001095(A1)	2002-01-01	Kawakami et al.	Applicant
US2002/0003891(A1)	2002-01-01	Hoshino	Applicant
US2002/0009208(A1)	2002-01-01	Alattar et al.	Applicant
US2002/0018228(A1)	2002-02-01	Torigoe	Applicant
US2002/0051237(A1)	2002-05-01	Ohara	Applicant
CA2235002	1998-12-01		Applicant
DE3806411	1989-09-01		Applicant
DE19521969(C1)	1997-02-01		Applicant
EP366381(A2)	1989-10-01		Applicant
EP372601	1990-06-01		Applicant
EP411232	1991-02-01		Applicant
EP418964(A1)	1991-03-01		Applicant
EP441702	1991-08-01		Applicant
EP493091	1992-07-01		Applicant
EP58482	1992-08-01		Applicant
EP551016	1993-07-01		Applicant
EP581317	1994-02-01		Applicant
EP605208	1994-07-01		Applicant
EP649074	1995-04-01		Applicant
EP705025	1996-04-01		Applicant
EP711061	1996-05-01		Applicant
EP789480	1997-08-01		Applicant
EP872995	1998-10-01		Applicant
EP642060(B1)	1999-04-01		Applicant
EP1122939	2001-08-01		Applicant
GB2063018	1981-05-01		Applicant
GB2067871	1981-07-01		Applicant
GB2196167	1988-04-01		Applicant
GB2204984	1988-11-01		Applicant
JP4-248771	1992-02-01		Applicant
JP5/242217	1993-09-01		Applicant
JP8-30759	1996-02-01		Applicant
WO89/08915	1989-09-01		Applicant
WO93/25038	1993-12-01		Applicant
WO94/27228	1994-11-01		Applicant
WO95/04665	1995-02-01		Applicant
WO95/10813	1995-04-01		Applicant
WO95/10835	1995-04-01		Applicant
WO95/14289	1995-05-01		Applicant
WO95/20291	1995-07-01		Applicant
WO96/26494	1996-08-01		Applicant
WO96/27259	1996-09-01		Applicant
WO97/43736	1997-11-01		Applicant
WO98/14887	1998-04-01		Applicant
WO98/20642	1998-05-01		Applicant
WO98/24050	1998-06-01		Applicant
WO98/40823	1998-09-01		Applicant
WO98/49813	1998-11-01		Applicant
WO99/34277	1999-07-01		Applicant
WO99/36876	1999-07-01		Applicant
WO/44131	2000-07-01		Applicant
WO1/08405	2001-02-01		Applicant
WO1/80169	2001-10-01		Applicant

Non-Patent Literature (168)

U.S. patent application Ser. No. 09/314,648, Rodriguez et al., filed May 19, 1999.Applicant
U.S. patent application Ser. No. 09/342,688, Rodriguez et al., filed Jun. 29, 1999.Applicant
U.S. patent application Ser. No. 09/342,971, Rodriguez et al., filed Jun. 29, 1999.Applicant
U.S. patent application Ser. No. 09/679,261, Davis et al., filed Oct. 4, 2000.Applicant
U.S. patent application Ser. No. 09/562,517, Davis et al., filed May 1, 2000.Applicant
U.S. patent application Ser. No. 09/547,664, Rhoads et al., filed Apr. 12, 2000.Applicant
U.S. patent application Ser. No. 09/571,442, Rhoads et al., filed May 15, 2000.Applicant
U.S. patent application Ser. No. 09/858,189, Rhoads et al., filed May 14, 2001.Applicant
U.S. patent application Ser. No. 09/631,409, Brundage et al., filed Aug. 3, 2000.Applicant
U.S. patent application Ser. No. 09/452,021, Davis et al., filed Nov. 30, 1999.Applicant
U.S. patent application Ser. No. 09/629,401, Seder et al., filed Aug. 1, 2000.Applicant
U.S. patent application Ser. No. 09/473,396, Evans et al., filed Dec. 28, 1999.Applicant
U.S. patent application Ser. No. 09/563,664, Levy et al., filed May 2, 2000.Applicant
U.S. patent application Ser. No. 09/670,115, Rhoads et al., filed Sep. 26, 2000.Applicant
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.Applicant
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.Applicant
“High Water FBI Limited Presentation Image Copyright Protection Software,” FBI Ltd brochure, Jul., 1995, 17 pp.Applicant
Koch et al., “Copyright Protection for Multimedia Data,” Fraunhofer Institute for Computer Graphics, Dec. 16, 1994, 15 pp.Applicant
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 pp.Applicant
Kurak et al., “A Cautionary Note On Image Downgrading,” 1992 IEEE, pp. 153-159.Applicant
Mintzer et al., “Safeguarding Digital library Contents and Users” Digital Watermarking, D-Lib Magazine, Dec. 1997; ISSN 1082-9873.Applicant
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 pp.Applicant
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.Applicant
SDMI Example Use Scenarios (Non-Exhaustive), Version 1.2, Jun. 16, 1999.Applicant
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.Applicant
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.Applicant
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.Applicant
Tanaka et al., “New Integrated Coding Schemes for Computer-Aided Facsimile,” Proc. IEEE Int'l Conf. on Sys. Integration, Apr. 1990, pp. 275-281.Applicant
Tirkel et al, “Electronic Water Mark,” DICTA-93, Macquarie University, Syndney, Australia, Dec., 1993, pp. 666-673.Applicant
Weber et al., “Correlative Image Registration,” Seminars in Nuclear Medicine, vol XXIV, No. 4, Oct., 1994, pp. 311-323.Applicant
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.Applicant
Dautzenberg, “Watermarking Images,” Department of Microelectronics and Electrical Engineering, Trinity College Dublin, 47 pp., Oct. 1994.Applicant
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).Applicant
U.S. patent application Ser. No. 09/404,291, Levy, filed Sep. 23, 1999.Applicant
U.S. patent application Ser. No. 09/234,780, Rhoads/Gustafson, filed Jan. 20, 1999.Applicant
U.S. patent application Ser. No. 09/478,713, Cookson, filed Jan. 6, 2000.Applicant
Cookson, Chris, General Principles of Music Uses on Portable Devices, presented to SDMI, Mar. 5, 1999.Applicant
Winograd, J.M., “Audio Watermarking Architecture for Secure Digital Music Distribution,” a Proposal to the SDMI Portable Devices Working Group, by Aris Technologies, Inc., Mar. 26, 1999.Applicant
Mintzer et al., “Safeguarding Digital Library Contents and Users: Digital Watermarking,” D-Lib Magazine, Dec. 1997, 12 pp.Applicant
U.S. patent application Ser. No. 09/765,102, Shaw, filed Jan. 17, 2001.Applicant
U.S. patent application Ser. No. 09/761,349, Rhoads, filed Jan. 16, 2001.Applicant
U.S. patent application Ser. No. 09/761,280, Rhoads, filed Jan. 16, 2001.Applicant
U.S. patent application Ser. No. 09/645,779, Tian et al., filed Aug. 24, 2000.Applicant
U.S. patent application Ser. No. 09/689,226, Brunk, filed Oct. 11, 2000.Applicant
U.S. patent application Ser. No. 09/689,250, Ahmed, filed Oct. 11, 2000.Applicant
U.S. patent application Ser. No. 09/689,293, Tian et al., filed Oct. 11, 2000.Applicant
U.S. patent application Ser. No. 09/625,577, Carr et al., filed Jul. 25, 2000.Applicant
U.S. patent application Ser. No. 09/574,726, Rhoads et al., filed May 18, 2000.Applicant
U.S. patent application Ser. No. 09/562,524, Carr et al., May 1, 2000.Applicant
U.S. patent application Ser. No. 09/498,223, Rhoads et al., filed Feb. 3, 2000.Applicant
U.S. patent application Ser. No. 09/465,418, Rhoads et al., filed Dec. 16, 1999.Applicant
U.S. patent application Ser. No. 09/431,990, Rhoads, filed Nov. 3, 1999.Applicant
U.S. patent application Ser. No. 09/428,359, Davis et al., filed Oct. 28, 2000.Applicant
U.S. patent application Ser. No. 09/342,972, Rhoads, filed Jun. 29, 1999.Applicant
U.S. patent application Ser. No. 09/293,602, Rhoads, filed Apr. 15, 1999.Applicant
U.S. patent application Ser. No. 09/293,601, Rhoads, filed Apr. 15, 1999.Applicant
U.S. patent application Ser. No. 09/287,940, Rhoads, filed Apr. 7, 1999.Applicant
U.S. patent application Ser. No. 09/185,380, Davis et al., filed Nov. 3, 1998.Applicant
U.S. patent application Ser. No. 09/074,034, Rhoads, filed May 6, 1998.Applicant
U.S. patent application Ser. No. 09/127,502, Rhoads, filed Jul. 31, 1998.Applicant
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.Applicant
Audio Watermarking Architectures for Persistent Protection, Presentation to SDMI PDWG, Mar. 29, 1999, J. Winegrad, Aris Technologies, pp 1-16.Applicant
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 pp.Applicant
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.Applicant
Levy, “AIPL's Proposal for SDMI. An Underlying Security System” (slide presentation), Mar. 29, 1999, 23 slides.Applicant
Microsoft Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, SDMI, PDWG Tokyo, May 23, 1999, 9 pp.Applicant
Response to CfP for Technology Solutions to Screen Digital Audio Content for LCM Acceptance, NTT Waveless Radio Consotium, May 23, 1999, 9 pp.Applicant
Sandford II et al., “The Data Embedding Method”, Proceedings of the SPIE vol. 2615, pp. 226-259, 1996.Applicant
Thomas, Keith, Screening Technology for Content from Compact Discs, May 24, 1999, 11 pp.Applicant
Tirkel et al., “Electronic Water Mark,” Dicta-93, Marquarie University, Sydney, Australia, Dec., 1993, pp. 666-672.Applicant
Vidal et al., “Non-Noticeable Information Embedding in Color Images: Marking and Detection”, IEEE 1999, pp. 293-297.Applicant
Wolfgang et al., “A Watermark for Digital Images,” Computer Vision and Image Processing Laboratory, Purdue University, Sep. 1996, pp. 219-222.Applicant
“Access Control and COpyright Protection for Images, WorkPackage 8: Watermarking,” Jun. 30, 1995, 46 pp.Applicant
“Access Control and COpyright Protection for Images, WorkPackage 3: Evaluation of Existing Systems,” Apr. 19, 1995, 68 pp.Applicant
“Access Control and COpyright Protection for Images, WorkPackage 1: Access Control and Copyright Protection for Images Need Evaluation,” Jun., 1995, 21 pp.Applicant
“Access Control and COpyright Protection for Images, Conditional Access and Copyright Protection Based on the Use of Trusted Third Parties,” 1995, 43 pp.Applicant
Arachelian, “White Noise Storm,” Apr. 11, 1994, Internet reference, 13 pp.Applicant
Arazi, et al., “Intuition, Perception, and Secure Communication,” IEEE Transactionson Systems, Man, and Cybernetics, vol. 19, No. 5, Sep./Oct. 1989, pp. 1016-1020.Applicant
Arthur, “Digital Fingerprints Protect Artwork,” New Scientist, Nov. 12, 1994, p. 24.Applicant
Aura, “Invisible Communication,” Helskinki University of Technology, Digital Systems Laboratory, Nov. 5, 1995, 13 pp.Applicant
Bender et al, “Techniques for Data Hiding,” Draft Preprint, Private Correspondence, dated Oct. 30, 1995.Applicant
Bender et al., “Techniques for Data Hiding,” Massachusetts Institute of Technology, Media Laboratory, Jan. 1995, 10 pp.Applicant
Boneh, “Collusion-Secure Fingerprinting for Digital Data,” Department of Computer Science, Princeton University, 1995, 31 pp.Applicant
Boney et al., “Digital Watermarks for Audio Signals,” Proceedings of Multimedia '96, 1996 IEEE, PP. 473-480.Applicant
Boucqueau et al., Equitable Conditional Access and Copyright Protection for Image Based on Trusted Third Parties, Teleservices & Multimedia Communications, 2nd Int. Cost 237 Workshop, Second International Cost 237 Workshop, Nov., 1995; published 1996, pp. 229-243.Applicant
Brassil et al., “Hiding Information in Document Images,” Nov., 1995, 7 pp.Applicant
Brown, “S-Tools for Windows, Version 1.00, .COPYRGT. 1994 Andy Brown, What is Steganography,” Internet reference, Mar. 6, 1994, 6 pp.Applicant
Bruyndonckx et al., Neural Network Post-Processing of Coded Images Using Perceptual Masking, 1994, 3 pp.Applicant
Bruyndonckx et al., “Spatial Method for Copyright Labeling of Digital Images,” 1994, 6 pp.Applicant
Burgett et al., “A Novel Method for Copyright Labeling Digitized Image Data,” requested by e-mail from author (unavailable/password protected on IGD WWW site); received Sep. 18, 1995, 12 pp.Applicant
Caronni, “Assuring Ownership Rights for Digital Images,” Published in the Proceedings of ‘Reliable IT Systems,’ VIS '95, HH. Bruggemann and W. Gerhardt-Hackl (Ed.), Vieweg Publishing Company, Germany, 1995, Jun. 14, 1994, 10 pp.Applicant
Caruso, “Digital Commerce, 2 plans for watermarks, which can bind proof of authorship to electronic works.” New York Times, Aug. 7, 1995, one p.Applicant
Castro et al., “Registration of Translated and Rotated Images Using Finite Fourier Transforms,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-9, No. 5, Sep. 1987, pp. 700-703.Applicant
Choudhury, et al., “Copyright Protection for Electronic Publishing over Computer Networks,” IEEE Network Magazine, Jun. 1994, 18 pp.Applicant
Clarke, “Invisible Code Tags Electronic Images,” Electronic Engineering Times, Jun. 12, 1995, n. 852, p. 42.Applicant
“Copyright Protection for Digital Images, Digital Fingerprinting from FBI,” Highwater FBI brochure, 1995, 4 pp.Applicant
“The Copyright Can of Worms Opened Up By The New Electronic Media,” Computergram Internations, pCGN07170006, Jul. 17, 1995 and “The Copyright Can of Worms Opened Up By the New Electronic Media—2,” Computergram Internations, pCGN07210008, Jul. 21, 1995, 3 pp. total.Applicant
Cox et al., “Secure Spread Spectrum Watermarking for Multimedia,” NEC Research Institute Technical Report, Dec. 5, 1995, 33 pp.Applicant
Cox et al., “A Secure, Imperceptable Yet Perceptually Salient, Spread Spectrum Watermark for Multimedia,” IEEE, Southcon/96, Conference Record, Pp. 192-197, 1996.Applicant
“Cyphertech Systems: Introduces Digital Encoding Device to Prevent TV Piracy,” Hollywood Reporter, Oct. 20, 1993, p. 23.Applicant
Delaigle et al., “Digital Watermarking,” Proc. SPIE—Int. Soc. Opt. Eng., vol. 2659, pp. 99-110, 1996.Applicant
Delaigle et al., “A Psychovisual Approach for Digital Picture Watermarking,” 1995, 20 pp.Applicant
DICE Digital Watermark System, Q&A, Dec., 1995, 12 pp.Applicant
Digimare presentation at RSA Conference, approximately Jan. 17, 1996, 4 pp.Applicant
Fimmerstad, “The Virtual Art Museum,” Ericsson Connexion, Dec., 1995, pp. 29-31.Applicant
Fitzgerald, “Invisible Digital Copyright ID,” Editor & Publisher, Jun. 25, 1994, p. 62.Applicant
“Foiling Card Forgers With Magnetic ‘Noise,’” Wall Street Journal, Feb. 8, 1994.Applicant
Frequently Asked Questions About Digimare Signature Technology, Aug. 1, 1995, HTTP://WWW.DIGIMARC.COM, 9 pp.Applicant
Friedman, “The Trustworthy Digital Camera: Restoring Credibility to the Photographic Image,” IEEE Transactions on Consumer Electronics, vol. 39, No. 4, Nov., 1993, pp. 905-910.Applicant
Gabor, et al., “Theory of Communication,” J. Inst. Elect. Eng. 93, 1946, pp. 429-441.Applicant
Hartung et al., Digital Watermarking of Raw and Compressed Video, Proc. SPIE 2952, Digital Compression Technologies and Systems for Video Communications, Oct., 1996, pp 205-213.Applicant
Hecht, “Embedded Data Glyph Technology for Hardcopy Digital Documents,” SPIE vol. 2171, Feb. 1994, pp. 341-352.Applicant
“Holographic signatures for digital images,” The Seybold Report on Desktop Publishing, Aug. 1995, one p.Applicant
Humphrey, “Stamping Out Crime,” Hollywood Reporter, Jan. 26, 1994, p. S48.Applicant
Jain, “Image Coding Via a Nearest Neighbors Image Model,” IEEE Transactions on Communications, vol. COM-23, No. 3, Mar. 1975, pp. 318-331.Applicant
Johhnson, “Steganography,” Dec. 10, 1995, 32 pp.Applicant
JPEG Group's JPEG Software (release 4), FTP.CSUA.BEREKELEY.EDU/PUB/CYPHERPUNKS/APPLICATIONS/JSTEG/JPEG.ANNOUNCEMENT.GZ.Applicant
Kassam, Signal Detection in Non-Gaussian Noise, Dowden & Culver, 1988, pp. 1-96.Applicant
Koch et al., “Digital Copyright Labeling: Providing Evidence of Misuse and Tracking Unauthorized Distribution of Copyrighted Materials,” Oasis Magazine, Dec. 1995, 3 pp.Applicant
Luc, “Analysis of Spread Spectrum System Parameters for Design of Hidden Transmission,” Radioengineering, vol. 4, No. 2, Jun. 1995, pp. 26-29.Applicant
Machado, “Announcing Stego 1.0a2, The First Steganography Tool for the Macintosh,” Internet reference, Nov. 28, 1993, 3 pp.Applicant
Macq, “Cryptology for Digital TV Broadcasting,” Proceedings of the IEEE, vol. 83, No. 6, Jun. 1995, pp. 944-957.Applicant
Matthews, “When Seeing is Not Believing,” New Scientist, Oct. 16, 1993, pp. 13-15.Applicant
Matsui et al., “Video-Steganography: How to Secretly Embed a Signature in a Picture,” IMA Intellectual Property Project Proceedings, Jan. 1994, vol. 1, Issue 1, pp. 187-205.Applicant
Mintzer et al., “Toward on-line, Worldwide Access to Vatican Library Materials,” IBM J. Res. Develop. vol. 40 No. 2, Mar., 1996, pp. 139-162.Applicant
Moller, et al., “Rechnergestutzte Steganographie: Wie sie Funktioniert und warum folglich jede Reglementierung von Verschlusselung unsinnig ist,” DuD, Datenschutz and Datensicherung, Jun. 18, 1994 318-326.Applicant
“NAB—Cyphertech Starts Anti-Piracy Broadcast Tests,” Newsbytes, NEW03230023, Mar. 23, 1994.Applicant
Nakamura et al., “A Unified Coding Method of Image and Text Data Using Discrete Orthogonal Transform,” Systems and Computers in Japan, vol. 21, No. 3, 1990, pp. 87-92.Applicant
Nakamura et al., “A Unified Coding Method of Dithered Image and Text Data Using Micropatterns,” Electronics and Communications in Japan, Part 1, vol. 72, No. 4, 1989, pp. 50-56.Applicant
New Product Information, “FBI at AppleExpo” (Olympia, London), Nov., 1995, 2 pp.Applicant
Ohnishi et al., Embedding a Seal into a Picture Under Orthogonal Wavelet Transform, Proceedings of Multimedia '96, 1996, IEEE, pp. 514-421.Applicant
ORuanaidh et al, “Watermarking Digital Images for Copyright Protection,” http://www.kalman.mee.tcd.ie/people/jjr/eva.sub.—pap.html, Feb. 2, 1996, 8 pp. (Also published Aug., 1996, IEEE Proceedings-Vision, Image and Signal Processing, vol. 143, No. 4, pp. 250-256.).Applicant
Pennebaker et al., JPEG Still Image Data Compression Standard, Chapter 3, “Aspects of the Human Visual System,” pp. 23-27, 1993, Van Nostrand Reinhold, New York.Applicant
Pickholtz et al., “Theory of Spread-Spectrum Communications—A Tutorial,” Transactions on Communications, vol. COM-30, No. 5, May, 1982, pp. 855-884.Applicant
Pitas et al., “Applying Signatures on Digital Images,” IEEE Workshop on Nonlinear Image and Signal Processing, Neos Marmaras, Greece, pp. 460-463, Jun., 1995.Applicant
Port, “Halting Highway Robbery on the Internet,” Business Week, Oct. 17, 1994, p. 212.Applicant
Roberts, “Picture Coding Using Pseudorandom Noise,” IRE Trans. on Information Theory, vol. 8, No. 2, Feb., 1962, pp. 145-154.Applicant
Sapwater et al., “Electronic Copyright Protection,” Photo>Electronic Imaging, vol. 37, No. 6, 1994, pp. 16-21. Schneier, “Digital Signatures, Cryptographic Algorithms Can Create Nonforgeable Signatures for Electronic Documents, Making Them Valid Legal Instruments” BYTE, Nov. 1993, pp. 309-312.Applicant
[email protected], “Hide and Seek v. 4.0,” Internet reference, Apr. 10, 1994, 3 pp.Applicant
Short, “Steps Toward Unmasking Secure Communications,” International Journal of Bifurcation and Chaos, vol. 4, No. 4, 1994, pp. 959-977.Applicant
Simmons, “Subliminal Channels; Past and Present,” ETT, vol. 5, No. 4, Jul.-Aug. 1994, pp. 45-59.Applicant
Sheng et al., “Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,” Journal of Optical Society of America, vol. 3, No. 6, Jun., 1986, pp. 771-776.Applicant
Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part I,” IEEE Communications Magazine, Aug., 1983, pp. 1-17.Applicant
Sklar, “A Structured Overview of Digital Communications—a Tutorial Review—Part II,” IEEE Communications Magazine, Oct., 1983, pp. 6-21.Applicant
“Steganography,” Intellectural Property and the National Information Infrastructure The Report of the Working Group on Intellectual Property Rights, Sep. 1995, pp. 212-213.Applicant
Tanaka et al., “Embedding Secret Information Into a Dithered Multi-Level Image,” Proc. IEEE Military Comm. Conf., Sep. 1990, pp. 216-220.Applicant
Tanaka, “Embedding the Attribute Information Into a Dithered Image,” Systems and Computers in Japan, vol. 21, No. 7, 1990, pp. 43-50.Applicant
Tirkel et al., “A Two-Dimensional Digital Watermark,” 1995, 6 pp.Applicant
Toga et al., “Registration Revisited,” Journal of Neuroscience Methods, 48 (1993), pp. 1-13.Applicant
van Schyndel et al., “Towards a Robust Digital Watermark,” ACCV '95, vol. 2, Dec., 1995, pp. 504-508.Applicant
Wagner, “Fingerprinting,” 1983 IEEE, pp. 18-22.Applicant
Walton, “Image Authentication for a Slippery New Age,” Dr. Dobb's Journal, Apr. 1995, pp. 18-26, 82-87.Applicant
“Watermarking & Digital Signature: Protect Your Work!” Published on Internet 1996, http://Itswww.epfl.ch/.about.jordan/watermarking.html.Applicant
Wise, “The History of Copyright, Photographers' Rights Span Three Centuries,” Photo>Electronic Imaging, vol. 37, No. 6, 1994.Applicant
van Schyndel et al., “A Digital Watermark,” IEEE International Conference on Image Processing, Nov. 13-16, 1994, pp. 86-90.Applicant
Zhao et al., “Embedding Robust Labels Into Images for Copyright Protection,” Proc. of the International Congress on Intellectual Property Rights for Specialized Information, Knowledge and New Technologies (Vienna, Austria) Aug. 21-25, 1995, 10 pp.Applicant
Bender, “Applications for Data Hiding,” IBM Systems Journal, vol. 39, No. 3-4, pp. 547-568, 2000.Applicant
Gruhl et al., “Information Hiding to Foil the Casual Counterfeiter,” Proc. 2d Information Hiding Workshop, LNCS vol. 1525, pp. 1-15 (Apr. 15, 1998).Applicant
U.S. patent application Ser. No. 60/000,442, Hudetz, filed Jun. 20, 1995.Applicant
U.S. patent application Ser. No. 60/082,228, Rhoads, filed Apr. 16, 1998.Applicant
U.S. patent application Ser. No. 60/141,763, Davis, filed Jun. 30, 1999.Applicant
U.S. patent application Ser. No. 60/158,015, Davis et al., filed Oct. 6, 1999.Applicant
U.S. patent application Ser. No. 60/071,983, Levy, filed Jan. 20, 1998.Applicant
U.S. patent application Ser. No. 09/404,291, Levy, filed Sep. 23, 1999.Applicant
U.S. patent application Ser. No. 60/114,725, Levy, filed Dec. 31, 1998.Applicant
U.S. patent application Ser. No. 09/234,780, Rhoads/Gustafson, filed Jan. 20, 1999.Applicant
U.S. patent application Ser. No. 60/116,641, Cookson, filed Jan. 21, 1999.Applicant
U.S. patent application Ser. No. 09/478,713, Cookson, filed Jan. 6, 2000.Applicant

Abstract