US 8,180,844 B1Grant
System for linking from objects to remote resources
Issue Date:2012-05-15
•37 Claims
•11 Drawing Sheets
Abstract
A machine readable code (e.g., digital watermark or bar code) conveyed with objects is used in establishing links to associated electronic resources, such as web pages. The object can be physical (e.g., a magazine page) or electronic (e.g., music data). The associated electronic resource can be a web site from which goods or services (e.g., music) may be offered for sale. In some embodiments, when a code is sensed from one object, the system can foresee other object codes that may soon be sensed, and can anticipatorily provide address information for their respectively associated electronic resources. In another embodiment, the microphone of a cell phone is used to listen to ambient audio. A watermark in the audio is decoded and its payload is used to link to, or provide, related information. A variety of other concepts are also detailed, such as permitting the free distribution of low fidelity music as marketing agents for higher fidelity versions that are available for sale.
Metadata
Assignee
- Digimarc Corporation
Inventors
- Geoffrey B. Rhoads
- Bruce L. Davis
- William C. Hein, III
- Joshua A. Rosenthol
- Brian T. MacIntosh
- Kenneth L. Levy
Application Information
Application Number:US 09/531,076
Filing Date:2000-03-18
Priority Date:2000-03-18
Art Unit:2431
Classifications
IPC:
G06F15/16
Patent Drawings (11 sheets)
Description
Related Application Data
[0001] The subject matter of the present application is related to that disclosed in the following applications, each of which is incorporated herein by reference:
- [0002] U.S. Ser. No. 09/476,460, filed Dec. 30, 1999 (now U.S. Pat. No. 6,813,366);
- [0003] U.S. Ser. No. 09/343,104, filed Jun. 29, 1999 (now abandoned; a continuation was filed Jan. 23, 2004 as application Ser. No. 10/764,430);
- [0004] U.S. Ser. No. 09/314,648, filed May 19, 1999 (now U.S. Pat. No. 6,681,028);
- [0005] 60/134,782, filed May 19, 1999;
- [0006] U.S. Ser. No. 09/292,569, filed Apr. 15, 1999 (now abandoned; a continuation was filed Mar. 3, 2003 as application Ser. No. 10/379,393);
- [0007] 60/164,619, filed Nov. 10, 1999;
- [0008] 60/141,763, filed Jun. 30, 1999; and
- [0009] 60/082,228, filed Apr. 16, 1998.
Field of the Invention
[0010] The present invention relates to data networking, and more particularly relates to systems for linking between objects and associated resources remote resources.
Background and Summary of the Invention
[0011] The technology detailed below has many novel aspects and applications. For expository convenience, this disclosure focuses on one particular application—a system for linking print media to electronic content. The technology, however, is not so limited, and may more generally be viewed as a system for linking any object (physical or electronic) to a corresponding networked or local resource.
[0012] In accordance with the exemplary application of the present invention, an imperceptible code is embedded within print media, such as magazine advertisements or articles, direct mail coupons or catalogs, bank- or credit-cards, and business cards. When recognized by a suitably-enabled PC camera, that code automatically directs an associated web browser to a destination chosen by the producer of the print media. That destination, e.g., a web page, can provide additional information or services—more timely and/or more extensive than that provided by the print material. By such arrangement, more efficient internet navigation and access is provided to consumers, and more effective means for linking readers to e-commerce points of sale is provided to advertisers.
[0013] The foregoing and additional features and advantages of the inventors' technology will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
Brief Description of the Drawings
[0014] FIG. 1 is a diagram showing the principal process components of an illustrative system of which the present invention forms a part.
[0015] FIG. 2 is a block diagram showing an illustrative system for performing the response process of FIG. 1 .
[0016] FIG. 3 is a block diagram more particularly detailing an originating device used in the system of FIG. 2 .
[0017] FIG. 4 illustrates certain top level data flows in the system of FIG. 2 .
[0018] FIG. 5 illustrates certain data flows associated with the router of FIG. 2 .
[0019] FIG. 6 illustrates certain data flows associated with the registration process of FIG. 2 .
[0020] FIG. 7 illustrates certain data flows associated with the product handler of FIG. 2 .
[0021] FIGS. 8-10 show a sequence of screen shots from one application of the present invention.
Detailed Description
[0022] Before beginning a detailed exposition, it may be helpful to provide an overview of the larger system of which the present technology forms a part. As shown in FIG. 1 , the larger system entails four basic processes—registering, embedding, detection and response.
[0023] Registering refers to the process of assigning an ID to an object, and associating that ID with a corresponding action or response. Additional steps can be included, such as logging the name and/or organization of the registrant, the name of the product, a description of the object and a context in which it is found (magazine, book, audio track, etc.), etc.
[0024] Embedding refers to the process of encoding of an object with a digital identifier (e.g., a watermark conveying a serial number in its payload).
[0025] Detection is the complementary operation to embedding, i.e., discerning a digital identifier from an object.
[0026] Response refers to the action taken based on the discerned identifier.
[0027] The middle two steps—embedding and detection—can employ any of myriad well-known technologies, including bar codes, data glyphs, metadata, file header information, RF ID, UV/IR identifiers, organic transistors, and other machine-readable indicia and techniques for associating plural-bit digital data with an electronic or physical object. The detailed embodiment employs watermarking technology, although this is illustrative only.
[0028] A great number of particular watermarking techniques are known. The reader is presumed to be familiar with the literature in this field. Particular techniques for embedding and detecting watermarks are detailed in the present assignee's copending application Ser. No. 09/503,881, filed Feb. 14, 2000 (now U.S. Pat. No. 6,614,914). Other watermarking techniques for images and video are known from published patents to NEC (inventor Cox et al), IBM (inventors Morimoto and Braudaway et al), Dice (inventor Cooperman), Philips (inventors Kalker, Linnartz, Talstra, etc. Audio watermarking techniques are known from published patents to Aris (inventor Winograd, Metois, Wolosewicz, etc.), Solana (inventor Lee, Warren, etc.), Dice, AudioTrack, Philips, etc.
[0029] Referring to FIG. 2 , a system 10 according to one embodiment of the present invention includes an originating device 12, a router/server 14, a product handler 16, a registration database 17, and one or more remote resources 18.
[0030] The originating device 12 can take many different forms, e.g., a cell phone, a personal digital assistant (e.g., a Palm Pilot), a personal computer, a barcode scanning system, etc. For expository convenience, the embodiment is described with reference to a personal computer for device 12.
[0031] Device 12 interacts with an object 20. The object can be electronic or not. Electronic objects 20 can include computer files, representations of audio, video, or still imagery (e.g., files or in streaming form), etc. Non-electronic objects can include physical objects such as newspapers, magazine pages, posters, product packaging, event tickets, credit cards, paper currency, etc. Non-electronic objects can also include sounds produced by loudspeakers.
[0032] When used with non-electronic objects, device 12 (FIG. 2 ) typically includes some form of sensor or transducer 22 to produce electronic signals or data corresponding to the object. Examples include CCD- or CMOS-based optical sensors (either as part of still- or video cameras, flatbed scanners, mice, or otherwise), microphones, barcode scanners, RF ID sensors, mag stripe readers, etc. In such cases, the sensor 22 may be coupled to associated interface electronics 24, which in turn may be coupled to device driver software 26, which in turn may be coupled to one or more application programs 28. Device driver software 26 serves as a software interface, communicating at a relatively high level with the application programs 28 (e.g., through API instructions whose content and format are standardized to facilitate application programming), and at a relatively low level with the interface electronics 24.
[0033] The detailed embodiment contemplates that the object 20 is a magazine advertisement encoded with a steganographic watermark conveying a plural bit object identifier. The watermark is hidden in the advertisement's image in a manner indiscernable to human observers, but detectable by computer analysis. That analysis is performed by a watermark detector 30.
[0034] Watermark detector 30 can be implemented in various different locations in the system of FIG. 1 . Typically, the detector is implemented in the originating device 12, e.g., in the driver software 26, or in application software 28c that serves to link to external resources based on detected watermarks. But it may be implemented elsewhere, e.g., in hardware in the interface electronics 24, in an operating system associated with the device, or outside device 12 altogether. Some systems may have plural watermark detectors, implemented at different locations throughout the system.
[0035] In an illustrative system, the watermark detector is implemented in the device driver 26. Functionality of the detector is made available to the application program 28c through one or more APIs specific to watermark-related functions. One function is reading of the watermark data payload from the object 20.
[0036] The illustrated application 28c is a software program that serves to communicate the watermark data from the device 12 to the router/server 14 through one or more communications links 32 (e.g., the internet). Application 28c also receives information from the communication links 32 and presents same to the user (or otherwise uses same).
[0037] The router/server 14 is a high capacity computer including one or more CPUs, memory, disks, and I/O ports. As is familiar to artisans, the disks store operating system software and application programs, together with data, that are transferred to the memory as needed by the CPU. The router essentially serves as a middleman between the application 28c and the product handler 16. As detailed below, the router receives requests from the application, logs them in a transaction log 15, and passes them on to the appropriate product handler.
[0038] As more particularly detailed below, the handler 16 provides a response in accordance with the particular watermark payload. The response may be provided directly by the product handler to the device 12, or the handler may respond by communicating with a remote resource 18 (which may be, e.g., a data repository or service provider).
[0039] In the former case, the handler 16 may identify a URL corresponding to the watermark (using the database 17), and return the URL to the application 28c. Application 28c can then pass the URL to a web browser 28b in the device 12, and initiate a link to the internet site identified by the URL. Or the handler may have some locally stored data (e.g., audio or video, or software updates) and send it to the device 12 in response to the watermark.
[0040] In the latter case, the handler 16 does not respond directly to the device 12. Instead, the handler responds by communicating with a remote resource 18. The communication can be as simple as logging receipt of the watermark message in a remote repository. Or it can be to authenticate device 12 (or a user thereof) to a remote resource in anticipation of a further transaction (e.g., the communication can form part of an on-line licensing or digital rights management transaction). Or the communication can request the remote resource to provide data or a service back to device 12 or to another destination (e.g., to initiate an FTP file transfer, or to request that a song selection identified by the watermark be downloaded to a user's personal music library, or to update software installed on device 12).
[0041] In still other cases, hybrids of the two foregoing cases can be employed, e.g., handler 16 can send some data back to device 12, while also communicating with a remote resource 18.
[0042] In some cases, the response returned to the device 12 by handler 16 (or a remote resource 18) can serve to trigger some further action by the device 12. For example, the response returned to device 12 can include a WindowsMedia audio file, together with a request that the device 12 launch the WindowsMedia player installed on the device. (The launching of a browser pointed to a URL is another example of such triggering.)
[0043] The illustrated product handler 16 comprises essentially the same hardware elements as the router 14, e.g., CPU, memory, etc. Although FIG. 2 shows just one product handler, several product handlers can be included in the system—either co-located of geographically distributed. Different handlers can be dedicated to different functions (e.g., serving URLs, serving music, etc.) or to different watermark sources (e.g., one responds to watermarks found in audio, another responds to watermarks found in print advertising, etc.). Further specialization may also be desirable (e.g., one handler may respond to advertising placed by Ford, another may respond to advertising placed by Chevrolet; or one handler may respond to advertising appearing in Wired magazine, another may respond to advertising appearing in Time magazine, etc.). In one particular implementation, the router 14 dispatches the incoming data to one of several handlers in accordance with (1) the vendor of the originating application 28c, and (2) the particular identity of the application 28c.
[0044] The following discussion focuses on the data exchanged between the application 28c, the router/server 14, the product handler 16, and the associated protocols, in one illustrative embodiment of the invention.
Concept of Operation
[0045] When shown a watermarked image, the application 28c analyzes the image and extracts the embedded watermark payload (more particularly detailed below) from the image. The application sends some or all of this information in a message format to the router 14.
[0046] The router 14 decodes the received message, looking for vendor and product information. Based on this information, it passes the message to a corresponding product handler 16.
[0047] The product handler receives the message and attempts to match the detected watermark serial number to a registered watermark serial number earlier stored in the database 17. If a match is found, the product handler performs the desired action. As noted, typical actions include returning a URL for web redirection, serving up an HTML page for initial user navigation, initiating software downloads, etc. If a match is not found, the product handler returns an error code and message to the application 28c. If a match is found, but the corresponding action is unavailable, incomplete, inactive or invalid, the product handler returns an error code and message to the calling application.
[0048] A generalized view of the foregoing is provided in FIG. 4 .
[0049] (Note that while the system may concentrate on a certain type of object 20, and a certain vendor's application 28c, the architecture is constructed to support accessing product handlers from other vendors and corresponding to other objects. This concept makes the system suitable as a clearinghouse for processing all machine-readable indicia on web-enabled devices.)
[0050] An exemplary detection and response cycle is illustrated below.
[0051]
| User | Application | Router | Product Handler |
|---|---|---|---|
| Shows object | |||
| to sensor 22 | |||
| Acquires watermark | |||
| Creates message | |||
| packet | |||
| Sends packet to | |||
| product handler | |||
| Receives message | |||
| packet | |||
| Logs transaction | |||
| Decodes packet | |||
| Identifies product | |||
| sending packet | |||
| Passes packet to | |||
| Product Handler | |||
| corresponding to | |||
| product | |||
| Logs received | |||
| packet | |||
| Validates packet | |||
| serial number | |||
| If not found, | |||
| returns error | |||
| packet to | |||
| application | |||
| Else, returns | |||
| packet with | |||
| data/action back | |||
| to application | |||
| (e.g., URL) | |||
| Receives packet | |||
| If error, display | |||
| error message | |||
| Else, display data or | |||
| perform the requested | |||
| action (e.g., launch | |||
| browser and link | |||
| based on | |||
| received URL) | |||
| Sees the | |||
| data/action | |||
| associated | |||
| with | |||
| the object | |||
| (e.g., views | |||
| web page) | |||
[0052] The present system generalizes this example to support any product from any vendor that is capable of sending a message via the Internet that complies with the expected request format (e.g., a product code, message type, and identifier) and receiving a message in a corresponding response format. One set of message formats suitable for use in such a system are described in more detail below.
Watermark Registration—The First Step in the Process
[0053] In order for the system to identify the response (e.g., a URL) that corresponds to an object identifier (e.g., a watermark), this data must first be associated within the database 17 in association with the watermark to which it corresponds. The watermark registration process captures some basic identification information used later to validate the incoming message, and identifies the associated information/action. In the illustrated example the identification information includes:
-
- [0054] Customer Account,
- [0055] Object and associated attributes (name, description, expiration, etc.),
- [0056] Action, and
- [0057] Registered Serial Number (for registration updates)
[0058] The Customer Account identifies the watermark registrant. In most cases, this is also the party to be billed for services. For validation and security reasons, the Customer Account is required to be a known, existing account. Account information, including the account's password, is maintained by an Account Management system.
[0059] The Object and associated attributes identifies the object to be watermarked. The object attributes typically include the name and description of the object and a list of accounts authorized to access the object's registration. These authorized “supporting” accounts are typically the ad agencies, pre-press houses, etc. involved in the watermark embedding process in the print advertising example contemplated herein.
[0060] The Action defines the response the customer desires when the watermark is detected. It varies by product, but in the illustrative embodiment involves the return of some additional information regarding the watermarked object. In the illustrative system, the action is return of a URL or HTML to be used to display a web page associated with the watermarked object. For other products, the desired response may be display of the object's owner & rights information, software/data downloads, delivery of streamed audio or video, presentation of an advertisement, initiation of object-based actions, etc.
[0061] The Registered Serial Number forms the last component of the registration. It is this assigned vendor and product-unique identifier that allows the system to acquire the specific information/action for the object in question.
[0062] A few key product Registration concepts—
[0063] Watermark Registration is a product-specific process—
[0064] To allow each of the products the freedom to upgrade their capabilities without impacting any other product function or schedule, the registration process is product-specific.
[0065] Watermark registration is web-enabled—
[0066] The exemplary registration is a web-enabled process that requests the basic identifying information from the object owner (publisher, ad agency, studio, etc.) and returns to the registrant a packet with a unique identifier to be embedded within the object. A watermark embedding application (i.e., software) uses this packet to embed the watermark type and serial number within the client's object. In the illustrative system, only one watermark may be embedded within a single object. In other embodiments, multiple watermarks may be embedded into a single object.
[0067] When a customer registers a watermark, the system associates the watermark serial number with the information provided by the customer during the registration process. The associated information may vary with different products. One set of associations, for the exemplary magazine advertisement objects, is shown in the following table:
[0068]
| TABLE 1 | ||
|---|---|---|
| Registration Database Elements | ||
| Mandatory? | Information | Comments |
| Mandatory | Customer | Typically, the publisher |
| Mandatory | Publication(s) | Magazine(s) containing the ad |
| Mandatory | Issue Date | First date of the magazine/publication |
| period | ||
| Optional | Volume | Magazine/publication volume |
| information | ||
| Optional | Region Code | Optional information for regional |
| publications | ||
| Optional | Location Code | Location of the object within the |
| publication (e.g., page and, | ||
| optionally, finer location data) | ||
| Mandatory | Watermark Type | Watermarks may have varying type. |
| The type defines how to interpret the | ||
| Serial Number | ||
| Mandatory | Serial Number | Assigned watermark number |
| Mandatory | Object Name | Customer's name for the object |
| Mandatory | Object | Customer's textual description of |
| Description | the object | |
| Mandatory | Object Type | Ad or Editorial (and in other systems: |
| Direct Mailer Card, Product Packaging, | ||
| Coupon, Catalog, Business | ||
| Card, Credit Card, etc.) | ||
| Optional | Campaign | For ads and promotions, the campaign |
| name | ||
| Optional | Object size | Stated in fractions of the page |
| (full page, half, etc.) | ||
| Mandatory | Effective Date | Date on which the user will first be able |
| to initiate any actions. For publications, | ||
| typically this is the “on stand” date | ||
| Mandatory | Expiration date | Date/time when the watermark expires |
| Mandatory | Primary Action | Initially the URL used for redirection |
| Mandatory | Primary Effective | Date the Primary action becomes |
| effective | ||
| Mandatory | Primary Expires | Date the Primary action expires |
| Optional | Default Action | Reserved for future use (e.g., backup |
| to the Primary action) | ||
| Optional | Default Effective | Date the Default action becomes |
| effective | ||
| Optional | Default Expires | Date the Default action expires |
| Optional | E-mail address | Used to automatically notify |
| the Customer of problems | ||
| with the registration/Action | ||
| Mandatory | Status | Incomplete, active, inactive |
| Optional | Problem Indicator | Bad URL, slow site, etc. |
| Optional | Supporting | This field and its sub-fields are repeated |
| Accounts | for each supporting account | |
| Optional | User Fields (4) | |
| Optional | Text | User Field free text |
| Optional | Viewable by | Y/N. N hides the field form any |
| Others? | other accounts | |
[0069] Watermark registrations expire—
[0070] For some products, watermarks are granted only for a limited period of time. For these watermarks, the Registration process employs an expiration date for the assigned serial number. When the system receives a message requesting action for a serial number that has expired, an error is returned. Registrants may extend their watermark serial number expirations by updating the expiration date. Expiration extensions may result in customer charges.
[0071] Watermark registration can be completed in one or more web sessions—
[0072] Registration can be a single or multi-step process. If the media owner has all of the required information at the start of the process, the system can provide a simple web-enabled method for requesting a watermark serial number(s) on-line. With all of the information provided, the registration is considered “active.” That is, it is available for immediate use by the consumer. If the registrant does not have all of the required information available at the initial session, by providing a minimum set of information (e.g., name and/or organization name+product), a product watermark serial number may still be issued for the registrant to use in the embedding process. The most typical use of this partial registration occurs when the actions associated with the media to be watermarked (e.g., URL, etc.) are not yet known. The partially registered serial number is considered “inactive” until all of the required registration information has been completed. The system will issue an error message if requested to process an “inactive” serial number. Whether active or inactive, these registrations may be considered billable items subject to the terms and conditions of the applicable contract(s).
[0073] Registrations can be updated by the customer to reflect new information and/or to complete a previous registration session. For example, a registered customer may request a watermark serial number without specifying the URL used to redirect the consumer. The system will assign a serial number so that the customer can continue with the embedding process, but the registration will not be considered complete until the customer updates the registration with the URL and any other mandatory information regarding this serial number.
[0074] Watermark registrations are secure—
[0075] Only the registrant and those accounts that the registrant authorizes can access specific watermark registrations.
[0076] In the illustrated system, the customer account that registers a watermark may grant permission to a specific ad agency and/or pre-press house to change certain fields within the registration as a normal part of their work. Each customer, agency and pre-press house needs an account on file to be granted access to watermark registrations. The Customer account is established as part of the contract process. For ad agencies and pre-press houses, the accounts are established on an as-needed basis, through a controlled web site accessible to the customer.
[0077] For all products, the same basic tenet holds—access to the registration information is limited to only explicitly authorized accounts. Accounts are password protected. For ad agencies and pre-press houses, a single password may be shared. In other embodiments, each part may be assigned a unique password.
[0078] Watermark registration changes are logged—
[0079] All registration actions—creation, modification and deletion—are logged in an audit log. The authenticated username, the date/time of the action, and the action itself are all stored to provide a complete audit trail.
[0080] Processes and data flows associated with registration are illustrated in FIG. 6 .
Entering Data into the Registration Database
[0081] While the client application, router, and product handler have initially been described in connection with responding to watermark information sensed from media objects, the same infrastructure can be employed earlier in the process, to enter data into the registration database 17. That is, a suitably configured variant of application 28c can be used by publishers, ad agencies, pre-press houses, etc., to (a) provide initial data to the database; (b) update such data; and (c) query the database for current values. Alternatively, a dedicated registration server 19 (FIG. 2 ) can be employed.
[0082] The involvement of plural parties in the registration process can be facilitated by encapsulating the database record contents for a given watermark in a file to which information is successively added (or updated) by different entities, and used to convey data between the database 17 and the cited entities.
[0083] Consider a case where Nike advertises in Wired magazine. The ad department at Wired agrees to sell space in response to a request from a media buyer at Nike. Wired may start the related watermark work by securing from the operator of system 10 a particular watermark identifier. (This, and most of the following procedures, are effected by computers talking to computers in accordance with instructions provided by suitable software used by the various participants, etc. In the discussion that follows, this software is the registration server 19 although, as noted, product handler 16 could be arranged to perform these functions.) Wired provides the operator an issue identifier (e.g., San Francisco edition of the July, 2000 issue), and internal tracking information used by the magazine. Registration server 19 responds by sending Wired a confirmatory file, by email, that encapsulates the information thus-far (i.e., the watermark identifier, the issue ID, and the magazine tracking information). Server 19 creates a new database record, and parses the received information into corresponding fields of the record.
[0084] Wired forwards the file received from the registration server to the media buyers at Nike. Nike supplements the information with its additional data, including the name of the advertisement and internal tracking information. It then forwards the updated file to server 19. Again, this server processes the file and updates the database record with the new information. It emails a confirmatory data file to both Nike and Wired, so each has the latest set of information.
[0085] The process continues in this fashion. Each entity provides new data to the registration server 19 via an emailed encapsulating file. The server updates the corresponding database record, and dispatches updated versions of the encapsulating file to the identified participants so each has the latest information.
[0086] Once Nike has entered its data via this process, it may forward the encapsulating file to its outside ad agency. The ad agency uses the file similarly, adding its particular information, and forwarding the file to the server. The server updates the database record accordingly, adds the ad agency to its email distribution list for encapsulating files, and dispatches the latest version of the file to Wired, Nike, and the ad agency.
[0087] A pre-press house may be the next party involved, and so forth.
[0088] Identification of the URL to which the watermark ID corresponds, and updating of the database record accordingly, may not happen until near the end of the process.
[0089] At any time, any of the parties can provide additional information to the database, and share such information with others, via the same process. (Some information may not be suitable for distribution to all involved parties, and can be flagged accordingly.)
[0090] Server 19 needn't always be the hub through which all communication takes place. The file as updated by Nike, for example, can be forwarded by Nike directly to its ad agency. The ad agency can add its information, and then provide the twice-updated file to the server, etc.
[0091] By using distributed files as proxies for the actual database record, a number of advantages accrue. One is local availability of the latest information by all parties without the need for an internet connection. Thus, if a creative director wants to work on the beach, or otherwise disconnected from the net, the needed information is still available. Another is the ease of integrating software tools at each of the parties with a file of local data specific to a particular advertisement, rather than requiring the architectural hassles of interfacing with a remote database and navigating its attendant authentication and security hurdles.
[0092] While the foregoing discussion made reference to emailing files, a typical email program would not normally be used. Instead, to better manage the attendant logistics, a specialized file management/mail program is used by each of the parties. Such program would track the latest file for each advertisement, making same readily available for updating as desired, and index the files by various content fields. The user interface could thus present a list of files, grouped or sorted by any of the database fields, permitting editing or adding of information just by clicking on a given field or tab.
[0093] Of course, the file-distribution system just-described isn't essential to the system. A great variety of other arrangements can naturally be employed. One is for each party to log-on to server 19 as needed to inspect, or update, database fields for which it has appropriate permissions.
Numbering Schemes
[0094] The payload information encoded into objects (e.g., by watermarking) can take a number of forms and sizes. Four exemplary classes are discussed below:
-
- [0095] a) Domain-based payload segmentation;
- [0096] b) Customer/usage-based payload segmentation;
- [0097] c) Unsegmented payload; and
- [0098] d) Unique ID
Domain-Based Payload Segmentation
[0099] Domain-based payload segmentation approaches divide the payload into fields, each with a distinct meaning.
[0100] Consider a payload of 60 bits. Twelve bits may form a Class ID. These bits serve as an identifier for a top-level domain. 24 other bits may form a DNS ID. These bits identify an intermediate level domain. Together, the Class and DNS IDs fully identify the class of objects from which the data originates, the customer, and the server that should respond to the payload. (Some responses may be handled by the client computer, rather than dispatched to a remote server.)
[0101] The remaining 24 bits are a User ID, and serve as the most granular identifier, indicating the particular source of the payload. Based on this ID, the responding server knows exactly which response is to be provided.
[0102] This payload is embedded, in its entirety, into the customer's object. When sensed by the client computer, the application 28c parses (decodes) the payload into Class ID, DNS ID and User ID fields. The Class ID is used to trigger one or more of the client- or server-side programs. Once “launched” these products then use the Class ID in conjunction with the DNS ID and the User ID to complete the desired action.
[0103] One of the Class IDs may signify the object is a magazine page. Based thereon, the application 28c may direct the payload to the router/handler described above for response. Another Class ID may signify that the object is music. Again, the application may direct the payload to the same router. Or the application may direct the payload to a service maintained by a music industry consortium for response. Still another Class ID may signify that the object is a grocery package, and the payload should be routed to an on-line grocer for response. Yet another Class ID may signify that the object is a business card, and the payload should be processed locally, at the client machine. The mapping between Class IDs, and the corresponding response mechanism to which the application 28c should direct the payload, may be maintained by a database associated with the client computer's operating system (e.g., the Windows Registry), as further detailed in application Ser. No. 09/343,104.
[0104] Once the payload has been dispatched to a proper response destination, that entity examines the DNS ID to further classify the correct responding entity. For example, different IDs may correspond to different classes of servers within a tree of servers.
[0105] One the payload has been directed to the correct class of servers, the User ID defines the terminal “leaf” in the tree (e.g., a database record) that finally defines the response.
Customer/Usage-Based Payload Segmentation
[0106] A second approach again employs a segmented payload technique. In this arrangement, however, a first field defines the interpretation of the following bits (e.g., their segmentation into different fields).
[0107] Again, consider an exemplary payload of 60 bits. Twelve bits can be a Version ID. These bits indicate how the succeeding bits are to be parsed and interpreted, and may indicate (like the Class ID in the foregoing approach) the particular application program 28c that should be used. The Version ID bits thus serve to indicate the payload type. In the illustrated embodiment, one of these types signifies that the payload is coming from a magazine page and should be handled accordingly. In this case, the remaining 48 bits can be parsed into three fields: Owner ID (15 bits), Publication ID (15 bits), and Media ID (18 bits).
[0108] The Owner ID identifies the customer to whom the watermark is registered (e.g., Nike). This is used for ad effectiveness analysis and billing purposes. The Publication ID identifies the particular publication (e.g., July, 2000, San Francisco edition of Wired Magazine). The Media ID identifies a particular page location within that publication.
[0109] As before, the payload is embedded in its entirety into the customer's object. The payload is first parsed to determine the Version ID. If the user's device 12 has been programmed to handle such objects locally, further parsing is performed in accordance with data corresponding to that Version ID, and associated processing of the parsed data is performed. If the device has been instructed to dispatch such payloads to remote locations for service, the complete payload can be dispatched with only such further parsing (if any) as may be required to correctly identify the corresponding remote servicing entity.
Unsegemented Payload
[0110] An unsegmented payload consists only of two parts: a Version ID (as described above) and an Object ID. In an illustrative case, a 60-bit payload is again used, with 12 bits serving as the Version ID, and the remaining 48 serving as the Object ID.
[0111] In this approach the relationships of owner/customer, publication, issue, and media are all maintained in database 17 rather than literally represented in some fashion within the object identifier.
Unique ID
[0112] This case is akin to the unsegmented payload, but consists of just a single field—a unique identifier. The same application 28c is always used, and always treats the payload data consistently (e.g., processing locally, or dispatching to a predetermined destination) regardless of the payload contents.
[0113] Combinations and hybrids of the foregoing approaches can of course be used. Moreover, the 60 bit payload length is illustrative only. Longer (e.g., up to 1024 bits) or shorter (e.g., down to 8 bit) payloads can naturally be used.
[0114] In a particular embodiment, a 31-bit unsegmented payload is used, consisting of 9 bits of payload type and 22 bits of watermark serial number. Some materials (e.g., advertisements including composite graphics) may be encoded with several serial numbers. The mapping between this payload and the customer/publication/etc., is maintained in database 17.
[0115] (As noted below, the data sent from the application 28c typically includes information other than the identifier payload, e.g., the type and version number of the application 28c, the electronic address of the dispatching application, etc.)
Router
[0116] The router 14 permits any number of different products to be used by the indicia detection and response model. By keeping this function separate and generalized, new products can be added without design changes to the existing products or the product handlers 16. There are two keys to making this approach successful—speed and flexibility. By using a standardized, open interface, the router is able to facilitate both of these goals.
[0117] A premise of an exemplary interface is an enveloping technique that allows the router to “open” the outer transaction envelope and extract the vendor and application ID without decoding the remainder of the transaction (message). Given these two pieces of information, the router uses a simple lookup table to determine the product handler appropriate to complete the transaction. The router then passes the vendor, application, remainder of the transaction and the Internet “reply to” address on to the appropriate product handler. The simplicity of this handling keeps the routing delay to a minimum, while deferring the actual response processing to vendor/product-specific handlers. By including the “reply to” address in the data passed on to the product handlers, the router is freed from the responsibility of return routing for the product's response(s).
[0118] To review, the router:
-
- [0119] 1. decodes the request packet received from the client products into the packet's base components—Vendor ID, Application ID and message;
- [0120] 2. validates the request packet base components against a list of known, good values;
- [0121] 3. if a request packet component is found to be invalid, issues an error message noting the invalid components and returning same to the calling session (e.g., product);
- [0122] 4. sends the decoded request packet contents and any required identification of the calling session to the appropriate product handler; and
- [0123] 5. reports any errors encountered, including invalid packets received, to a system monitor.
[0124] Certain data flows associated with the router are shown in FIG. 5 .
Product Handler
[0125] The primary function of the illustrative product handler 16 is to process requests received from the application 28c, via the Internet and router 14, and return the requested information/action to the originating device 12. In the illustrated embodiment, the information requested is the URL associated with the watermark payload sent by the application. In other embodiments, other actions and/or information may be requested.
[0126] Each received watermark payload is validated using information in the database 17. If the watermark payload ID is found and is active, the requested action is performed. If the watermark payload ID is not found or is in an inactive state, an error message is returned to the requesting application.
[0127] All requests are logged in a transaction log for tracking and billing purposes. This includes any secondary payload information (zip code, Demographic Household ID, etc.) passed in by the application 28c. The log can be maintained by the product handler 16, or elsewhere.
[0128] To speed system response, the product handler 16 may anticipatorily send URLs to the application corresponding to watermark payloads the handler foresees may be coming. These URLs can be cached in memory associated with the application 28c, and quickly recalled if needed by the application.
[0129] Consider, for example, a magazine containing watermarked advertising. If the user presents a first ad to the device 12, the watermark is decoded and forwarded to the product handler 16, which responds with a URL corresponding to that ad. The application 28c then passes that received URL to a web browser 28b on the device 12, which initiates a link to that internet address. But the handler now knows the magazine the user is reading. By reference to the watermark first received, the handler may discern, for example, that the user is reading the San Francisco edition of the Mar. 14, 2000, Time magazine, and just looked at page 85. Based on this information the handler can query the database 17 for URLs associated with other advertising in that issue. (The database index is structured to permit fast queries identifying all ads in a given magazine issue or other collective data source.) These URLs are passed back to the application 28c and cached. If the user next presents an advertisement from page 110 to device 12, the application 28c finds it already has the corresponding URL locally cached. The application then passes the corresponding URL to the web browser. The web browser initiates the link immediately, obviating a data round trip between the application and the remote system.
[0130] The caching can be optimized in a variety of ways. One is to first send URLs corresponding to pages that are next-expected to be encountered. For example, if the user just presented page 85 to the sensor 22, after sending the URL for that page, the handler 16 would next send the URLs associated with pages 86, 87, etc. On sending the URL for the last page of the magazine (typically the rear cover), the handler could start from the beginning (typically the front cover) and send further URLs up to that for page 84. Another optimization is to first cache URLs for the most conspicuous ads, e.g., first send URLs for any 2-page spread ads, then for each full page add, then for each successively smaller fractional-page ad. Still another approach is for handler 16 to dispatch URLs to device 12 for caching in accordance with a contractually-agreed priority. One advertiser, for example, may pay a premium ad rate in exchanged for being cached before other advertisers who don't pay the premium. Other caching priorities, and combinations of such priorities, can naturally be employed.
[0131] In some systems, the advertisers or publishers may be charged for use of the system based on the number of URLs served by the system for linking. If local caching of URLs (e.g., at device 12) is employed, it is desirable for device 12 to report to router 14 (or handler 16) the URLs that are actually retrieved from the local cache and used for linking, so that the remote system can log same. Thus, each time the user presents an object to sensor 22 for which a corresponding URL is already cached, application 28c dispatches a message to router 14 reporting the event (and, usually, the particular URL involved). This event is then logged in the transaction log.
[0132] This anticipatory dispatching of URLs is one alternative function that may be performed by a product handler. Another is if the application 28c queries the product handler to determine if a more recent version of the application is available for download. If so, the application—through interaction with the user—can request that the product handler respond with a software download.
[0133] In greater detail, application 28c can periodically query the product handler as to the identity of the latest version of application 28c (e.g., the first time the application is used each day). Device 12 may have version 3.04, and the remote system may respond that version 3.07 is the most current. In such case the application 28c can alert the user—by suitable text, graphics, or other means—that a more recent version of the program is available, and query whether such updated version should be obtained. If the user so-instructs, handler 16 can serve to device 12 the latest version of the application (or a patch permitting the presently-installed version to be updated).
[0134] Sometimes it may not be necessary to update the application version. Instead, data from the remote system may indicate the desirability, or necessity, or changing just one or more parameters in the application 28c. For example, new security keys can be dispatched periodically by handler 16 to device 12, and used to change the security configuration of the application. Or the application 28c can be instructed to direct further outgoing watermark traffic—either for the next hour, day, or until instructed otherwise—to a different router 14. Such instruction can be used to optimize system performance, e.g., for router load balancing purposes, to avoid internet routes that are found to be slow, etc.
[0135] In summary, the detailed handler:
-
- [0136] 1. validates the received identifier (e.g., watermark serial number) against the list of active identifiers; and, if the serial number is not found, return an error message to the calling session, and log the error to an error handling routine;
- [0137] 2. for each received, valid watermark serial number, finds the corresponding active primary action from the database;
- [0138] 3. for each received, valid watermark serial number, if the handler finds the corresponding primary action is currently not active, it performs an alternative, “default” action instead;
- [0139] 4. if the handler finds an active primary action associated with the received valid watermark serial number, it returns the URL for application use in redirection (round trip approach), or serves the HTML page found to the calling session;
- [0140] 5. if the handler does not find an active primary action associated with the received valid watermark serial number, but does find an associated default action, it returns that URL for application use in redirection (round trip approach), or serves the HTML page found to the calling session;
- [0141] 6. if the handler does not find a valid, active primary or default action associated with the watermark serial number, it returns an error message to the calling session, and logs the error to the error handling routine;
- [0142] 7. records each transaction, including those that result in error messages, for billing and analysis purposes (in other embodiments, this function may be performed by the router, instead);
- [0143] 8. responds to a “software version request” by returning the most recent available application software version number to the calling session;
- [0144] 9. responds to a “software download request” by initiating a file transfer of the most recent available application software to the calling session;
- [0145] 10. responds to a valid Request for Registration packet upload (proper format, an existing serial number, an account ID and a valid corresponding account password) by returning a current registration packet for the provided watermark serial number;
- [0146] 11. responds to an invalid Request for Registration packet by returning an error message to the calling session noting the failure;
- [0147] 12. responds to a local transaction cache flush request by writing the locally cached transactions to the transaction log; and
- [0148] 13. responds to a multiple URL request by returning the URL associated with the provided serial number first, followed by all other active serial numbers and URLs for the publication, issue and region code (optional) provided.
[0149] Certain of the above-described processes associated with the product handler are shown in FIG. 6 .
URL Performance Monitoring
[0150] Returning to operation of the system, the URLs identified in database 17 may, from time to time, become inoperative or impaired due to equipment problems at the remote web site or otherwise. If desired, the handler 16 (or another component of the system) can be programmed to periodically test each of the links registered as active in the database (e.g., once per day), and measure the time for the associated web page to load. If the web page doesn't load, or takes much longer to load than usual (and re-tests confirm that the condition isn't an anomaly), those conditions can be flagged in the corresponding database record. If the handler is requested to provide such a URL to a device 12, the handler can send a message—either with or without the URL—indicating to the device that the URL is misbehaving.
[0151] If the URL is working, but is unduly slow to load (either compared to its historical performance, or compared to other URLs), handler 16 can provide an interim diversion to the device 12. For example, it can instruct the device to launch a second browser window, and direct that browser to an alternate destination to entertain the user while waiting for the intended page to load. When the intended page is finally loaded, the first browser window can be displayed—either by closing the second, diversionary window, or by bringing the first window to the front while keeping the second window alive in the background.
[0152] This alternate destination is desirably a low bandwidth page, so that it will not unacceptably further slow loading of the desired URL. This alternate page can be one selected by the handler, for which the URL is sent after the desired URL. Or instead of providing a URL from the handler, the handler can serve an HTML or other page directly to the device 12. Or the alternative URL can be stored at device 12 and used to invoke the second browser window upon receipt of data from handler 16 indicating that the desired content will be slow in coming. In some embodiments the user can identify several alternate URLs (e.g., weather, stock info, jokes) and the handler or the application 28c may select among them randomly or otherwise. Or an HTML page or other application can be loaded locally at the device 12 in response to a “get ready to wait” indication from the handler 16.
[0153] If a URL is marked in the database 17 as slow or inoperative, the scanning operation periodically rechecks the URL to see if its status in the database should be changed (e.g., changed from inactive to active). Inactive URLs are reported to the registrant by email, and flagged for manual follow-up if not restored to action within a predetermined period.
Illustrative Responses by Product Handler
[0154] The reader is referred to application Ser. No. 09/343,104 for a sampling of the great variety of diverse applications enabled by the illustrated system 10. A few more are detailed below.
[0155] Consider use of the system 10 to enable personalized greeting cards. A greeting card company may prepare watermarked press-on stickers for use with its cards or other correspondence. The customer shows the sticker to a camera-equipped computer (either at the retail store, at home, or elsewhere). The computer decodes the watermark and sends same to a corresponding product handler 16 through the router 14. The handler—recognizing the watermark as an unregistered greeting card sticker—invites the customer to enter a destination URL, such as the customer's personal web page. This information is entered by the consumer and forwarded to the remote system for entry in the registration database 17. Thereafter, whenever the sticker is shown to a suitably-enabled system (e.g., by the card recipient), a browser window is automatically launched and directed to the web page specified by the purchasing consumer. (The same result can, of course, be effected without use of stickers, e.g., by encoding the greeting cards themselves.)
[0156] In some applications, the product handler may have a library of different responses it can provide to a user in a particular context, depending on the user's further selection. Consider a university student having a suitably-watermarked university ID card. When the card is presented to a device 12, the product handler replies with HTML instructions causing an options menu to appear on the device screen, e.g:
-
- [0157] 1. Review calendar of upcoming university academic events
- [0158] 2. Review calendar of upcoming university sporting events
- [0159] 3. Review present class schedule
- [0160] 4. Select courses for next semester
- [0161] 5. Review grades
When the student makes a selection (e.g., with a mouse, or by moving the ID card in a specified manner), the application 28c dispatches data corresponding to the selected option to the product handler, which then responds with the requested data.
[0162] In some cases (e.g., Review present class schedule, Select courses for next semester, Review grades), care must be taken to protect such information from persons attempting access using lost or stolen IDs. Accordingly, when any of these options is selected, the handler 16 may first respond to device 12 by querying for a password or PIN. Only after entry of the correct password/PIN is the requested action performed. (For security reasons, the university may prefer that the password authentication process be performed by a dedicated on-campus server, rather than by product handler 16. Naturally, this and other tasks can be delegated to processors other than handler 16 as best fits the situation.)
[0163] In other cases, an option menu needn't be presented—the correct response is inferred from the context or environment. Consider a drivers' license that is watermarked with identification of the owner. If presented to an email kiosk 12 at an airport, the decoded watermark may be used to look-up an email account corresponding to that individual, and download new mail. If the same drivers license is presented to a check-in kiosk, the decoded watermark may be used to look up that person's flight reservation and issue a seat assignment. In both cases the kiosks can be essentially identical. One, however, identifies itself to the router/product handler as an email kiosk, the other as a check-in kiosk. The response undertaken by the router/product handler differs accordingly.
[0164] Returning to the university example, there may be cases in which students are tempted to swap photos on a student ID, e.g., to permit an imposter to take a graduate school qualifying exam on behalf of a less-qualified student. In the usual case, such photo-swapping may be difficult to detect. This problem can be combated by an exam check-in procedure that includes having each student present their ID to a device 12. An application 28c specialized for this task can forward a watermark decoded from the ID photograph to a handler 16, which responds by causing an image of the identified student to be displayed on device 12. (The university could compile the requisite database of student images as it issues ID cards.) If the exam proctor sees an image on the device that does not match the image on the ID card, appropriate action may be taken. (This arrangement is applicable wherever photo ID documents are used, including airport check-in, customs, immigration, etc.)
[0165] Still another application of the illustrated system is to look-up, or act on, meta-data associated with a marked object. Consider an image, video, or audio file that a user downloads from the internet. Familiar applications such as Microsoft's Windows Explorer (including Internet Explorer) may be configured with watermark decoders activated, e.g., from a Properties panel (accessed, e.g., by right-clicking on the file icon or name and selecting the “Properties” option). When a watermark is detected in a file, the Explorer application can send a corresponding packet to a remote system (e.g., the depicted router/product handler/database). The remote system recognizes the packet as originating through the Properties panel of Windows Explorer, and looks-up the watermark ID in a database 17. Meta-data corresponding to the file (e.g., proprietor, creation date, licensing terms, exposure data, subject, etc.) is returned from database 17 (or from another database identified by the router, handler, or database) to the application 28c, and is displayed in the Properties panel (optionally under an appropriate “tab”).
[0166] (The present assignee has long offered a “MarcCentre” service that serves as a clearinghouse through which watermark identifiers found in photographs, etc., can be used to identify the proprietors and associated information corresponding to such objects.) In embodiments of the present utilizing this service, the router 14 passes the request to MarcCentre server (a product handler in this instance), which provides the solicited information back to the originating application. The present assignee's MarcSpider service complements the service provided by the Media Commerce product. The MarcSpider service constantly scans Internet sites evaluating each graphic encountered to determine whether it contains a watermark. (Audio and video can be similarly analyzed.) With each detected watermark, the MarcSpider service records the graphic file name, size, format, date/time and URL where the graphic was found. This information is then made available to MarcSpider customers in report form.)
[0167] Instead of simply displaying the meta-data, the application and/or the remote system can make use of it. For example, if the meta-data indicates that the proprietor of a watermarked image is Corbis, and that the image can be licensed for a certain use under certain terms, the remote system can be utilized as a licensing server—receiving payment information from the user, granting the license, and forwarding transaction details to Corbis.
[0168] Still another application is the sale or promotion of music or video over the internet. Taking the case of music, an artist may freely distribute a low-fidelity (or otherwise corrupted or abridged) version of a song. The low fidelity can be by reason of bandwidth limitation (e.g., 500 Hz-2.5 KHz), monophonic (as opposed to stereo), or otherwise. The artist can seek to distribute the low-fidelity version as widely as possible, to serve as a marketing agent for the artist's other works. (The free distribution of lower-bandwidth audio may serve to alleviate some of the network bandwidth problems faced by universities whose students actively engage in transferring free music over the internet.)
[0169] Each low-fidelity version can be processed to extract an identifier (e.g., a steganographic in-band watermark; a numeric ID or song/artist name field in a in a file header; a 128-bit hash value obtained by applying a hashing algorithm to the music data, the music file header data, a portion thereof, etc.) If a listener is interested in obtaining a full-fidelity version of the work, the listener can operate a suitably programmed computer or music appliance that extracts the identifier from the work and passes it on to the remote system. The remote system can respond in various ways, e.g., by providing a full-fidelity version of the same work back to the user (such as MP3 download) and charge the user's credit card a fee (e.g., $0.99); or by directing a web browser on the user's computer to an e-commerce/fan web site associated with the music, etc. Such functionality can be provided in general purpose programs such as Microsoft's Internet Explorer, e.g., by right-clicking on a file to obtain a menu that includes this and related functions.
[0170] FIGS. 8-10 show a sequence of screen shots from such an embodiment. In FIG. 8 , a user has right-clicked on an MP3 file icon in a directory listing 200. A property menu 202 pops up that includes, as its second option “MP3Bridge.”
[0171] FIG. 9 shows what happens when the user selects the MP3Bridge option. An MP3 player 204 is launched, and a dialog box 206 appears. The dialog box queries the user, “More Information About the Artist? Yes No.”
[0172] FIG. 10 shows what happens if the user selects “Yes.” The software sends the identifier—extracted from the MP3 file—to the remote system. The remote system responds with the address of an associated web page, and instructs the user's computer to launch a new browser window directed to that page.
[0173] The same functionality can naturally be invoked through the user interface of the MP3 player (or a Windows MediaPlayer, etc., rather than through Internet Explorer). The music application can spawn a separate window, or present the options and the associated data within the existing window.
[0174] Yet another application of the remote system is as a “net nanny” filter. Links requested through the system can be checked for keywords, adult-content flags, content ratings, or other indicia of age-suitability, and provided to the requesting computer 10 only if they meet certain earlier selected criteria.
[0175] Again, it will be appreciated that the foregoing examples are but a few of myriad applications enabled by the detailed system.
Reporting
[0176] System software may enable the provision of customer-accessible reports (accessible over the internet) that show detailed and summary usage information by date, customer, publication, issue date, region, product/version, etc. These reports can be both regularly scheduled and ad-hoc. The specification of the content, relationships and the timing of the reports can be defined by the customer on-line.
[0177] Illustrative reports detail:
-
- [0178] a) Hit rates/Transactions per customer per ad
- [0179] b) Hit rates/Transactions per customer per publication per ad
- [0180] c) Hit rates/Transactions per customer per publication per issue per ad
- [0181] d) Hit rates/Transactions per customer per publication per issue per region per ad
- [0182] e) Hit rates/Transactions rates by originating application (28c)
- [0183] f) Hit rates/Transactions by originating application vendor
- [0184] g) Hit rates/Transactions rates by originating web domain (e.g., aol.com)
- [0185] h) Hit rates/Transactions rates by postal/zip codes
- [0186] i) Hit rates/Transactions by country
[0187] Additional marketing/marketplace reporting can also be produced for internal analysis by the service provider, and for sale to other entities. These reports typically provide a more global view of the impact and usage of the system. Using information stored in a demographic database, in conjunction with these usage patterns, the system can provide customers and research agencies with more detailed demographic/statistical data on the system's usage and effectiveness.
[0188] In an illustrative system, certain statistics in the demographic database are compiled using statistics from a sample of users that consent to have their activities tracked in some detail, in consideration for certain perks (e.g., give-away cameras, bar-code scanning pens, or other devices, etc.). These users are termed Demographic Households. A software program included in the systems solicits information detailed in the following table from such users over the internet, with a web-enabled interface. A related program allows such users to update/edit their user/household information previously entered. Each such session is password authenticated for security.
[0189]
Audio and Video
| User Information | Comments |
|---|---|
| Name | |
| Address | |
| Street | |
| City | |
| State | |
| Country | |
| Postal Code | |
| Phone number | |
| E-mail address | |
| Household Annual Income | Provided as raw $ or as a selection |
| from a range of numbers | |
| Occupation | |
| Education | May be per member of household. |
| Profession | If applicable |
| Number of members of household | |
| Member of household | |
| Age | |
| Sex | |
| Internet user? | |
| User of this linking service? | |
| Internet usage per week | In hours. Sum of entire household |
| Internet business usage per week | |
| Primary Internet usage? | Typical household use of the |
| Internet. May be a selection list | |
| Owned a computer since? | Year only |
| Number of computers in the home? | |
| Types of computers in the home? | Mac, PC, etc. Select all that apply |
| Rooms where the computers are | Home office, bedroom, etc. |
| located | Select all that apply |
| What ISP do you use? | |
| What is your modem speed? | Select from list that includes ISDN, |
| ADSL, cable + dial up modems. | |
| Are you willing to be an official | |
| “Demographic Household” and allow | |
| us to contact you for feedback on our | |
| products and advice on new products? | |
| What other technology devices do you | Scanners, PC cameras, |
| have in your household? | digital cameras, DVD, PDAs, |
| etc. Select all that apply | |
Audio and Video
[0190] As with paper advertisements, the illustrated system provides users of web-connected PCs or other appliances with methods of obtaining information, content, associated products, or associated services using the same principles as detailed above.
[0191] For example, an application 28 can “capture” music or other audio using a recording device (note recorder, microphone connected to PC, MP3 player, etc.) and analyze the captured audio to detect an embedded watermark. Once detected, the application passes some or all of the watermark payload information, together with identification of the application and its vendor, to the router. The router forwards the payload information to a handler corresponding to the application. The response of the product handler varies with the context and nature of the data. For example, the handler may return the artist, title, track, album, web URL and purchasing information, to the user. Recorded news and entertainment segments may include transcripts (audio, video and/or text) of the segment along with other related web site information. The handler may simply cause the device 12 to launch a browser window directed to a music commerce web site where the music can be purchased.
[0192] Audio and video applications of the present technology are more particularly detailed in the related applications cited above.
Monitoring
[0193] Automated performance monitoring occurs at several levels within the detailed system, including:
-
- [0194] a. Network monitoring (traffic+device availability)
- [0195] b. Computer system monitoring (disk space, memory utilization, CPU usage, etc.)
- [0196] c. Process monitoring (scheduled job starts, stops, run times (duration), and errors)
[0197] For each monitored point, two thresholds are typically established—warning thresholds and failure thresholds.
[0198] When a system exceeds a warning threshold value, it indicates that a situation is now present that may affect the system's performance in the near future. These warnings are used by the operations staff to help head off potentially serious problems. While the warning indicators are available at all times for operations staff viewing, they do not require immediate attention.
[0199] When a system exceeds a failure threshold, it means that a condition that directly affects the system's ability to properly serve its customers has been detected. A monitoring system immediately notifies the appropriate personnel, via pager, of the condition. If the condition is not resolved or acknowledged within the pre-defined elapsed time, the monitoring system escalates the problem notification to the backup personnel and to company management.
[0200] All monitored activities are logged (successful completion, errors, warnings and failures) for ongoing system reliability analyses.
Backup and Recovery
[0201] While the illustrated architecture desirably employs redundant systems to increase the overall reliability and availability, rapid recovery from failures is required for peak system performance. Areas of possible system failure include
-
- [0202] a) Loss of computer
- [0203] b) Loss of network/network segment
- [0204] c) Loss of electrical power
- [0205] d) Loss of Internet connectivity
- [0206] e) Loss of physical site
- [0207] f) Corrupted software
- [0208] g) Loss of data/database
- [0209] h) Corrupted database
The system has specific backup and recovery plans and procedures for each of these conditions: - [0210] a. To address the loss of computers, the architecture is built with redundant capabilities.
- [0211] b. To address the loss of network/network segment, the computers are simultaneously connected to two separate network segments.
- [0212] c. To address the loss of electrical power, the physical facility is provided with plural electrical feeds from different power substations entering the facility from plural directions.
- [0213] d. To address the loss/corruption of software and data/databases, the critical software and data are housed on redundant computers and backups of these are regularly scheduled.
- [0214] e. To address the loss of Internet connectivity, the facility has plural separate Internet connections provided on two different telecommunications trunks routed into the building from different directions.
- [0215] f. Finally, to address the loss of physical site, the system is desirably mirrored at a remote location, with the capability to direct all traffic to the mirror site until operations at the primary site are restored.
Security
[0216] The system's basic security philosophy is to grant access to each customer's information only to the users authorized by the customer. To this end, the system desirably should:
-
- [0217] 1. Create and maintain a list of authorized users (accounts).
- [0218] 2. Employ security methods to deny access to any unauthorized users.
- [0219] 3. Limit users to access only the objects they are authorized to access (typically, the objects belonging to that customer).
- [0220] 4. Report and record all unauthorized access attempts.
- [0221] 5. Maintain a log of all authorized user logins (sessions).
- [0222] 6. Provide the capability for the watermark registrant to grant access rights to other accounts (such as ad agencies and pre-press houses).
- [0223] 7. Establish initial passwords for each account
- [0224] 8. Provide the capability for each authenticated user/account to change their password
- [0225] 9. Provide the capability to reset an authenticated user/account's password in the event the current password is lost.
- [0226] 10. Store all passwords as encrypted values (to prevent theft of passwords).
- [0227] 11. Provide the capability to restrict the creation, modification, deletion, and listing/viewing of account information to authorized users.
Audit Trail
[0228] Because of the financial implications of the system's activities, all changes to any registration or customer data need to be recorded. This audit trail provides the operator and its customers with an accurate accounting for the current and previous states of the data.
[0229] The audit software desirably records the creation, modification, and deletion of all registration and customer data. The audit software also records the username, date/time of creation/modification/deletion of records, and—for modifications—the before and after images of the data changed.
Application-to-Product Handler Interface Definition
[0230] The basics of the interface between the application 28c and the handler 16 are (a) a flexible request and response package structure, and (b) a defined connection method based on industry standards. The illustrated messaging employs the http and/or the https protocol to send and receive messages among the system components. An overview is provided in FIG. 4 .
Message Format
[0231] The message format is XML-compliant and is defined by the following XML DTD—
-
- [0232] <!DOCTYPE list [
- [0233] <!ELEMENT Content (vendor, appl, prod)>
- [0234] <!ELEMENT vendor (#PCDATA)>
- [0235] <!ELEMENT appl (#PCDATA)>
- [0236] <!ELEMENT prod (#PCDATA)>
- [0237] ]>
[0238] The application 28c appends its data to this header for transmission to the product handler 16. Exemplary messages and product handler responses are detailed in the sections that follow.
Application Message Definitions
[0239] The application message definitions can be broken down into Request Code,
[0240] Primary and Secondary information.
[0241] The Request Code instructs the product handler 16 to take a specified action.
[0242] The Primary information portion contains the data required to properly service the application's request. The Primary Information varies based on the Request Code.
[0243] The Secondary Information is intended for use by analysis and reporting tools and does not instruct nor aid the product handler in servicing the user's request. Secondary Information contents change based on the Request Code and not all Request Codes are required to have associated Secondary Information. In addition, most of the Secondary Information requires the consumer to grant express consent to its collection. If that consent is not given, the application does not send Secondary Information. A special case exists for selected, consenting consumers to become part of a demographic database.
[0244] Primary and Secondary information may change by request type, but in general conform to the definitions below. The generic format for the product handler is also defined below.
[0245] Primary Information includes the Application Version, Watermark Type, Watermark Serial Number, Context and Environment.
-
- [0246] Application Version: used by the product handler to modify its actions, typically for backwards compatibility
- [0247] Watermark Type: top 9 bits of the illustrative watermark payload. Used by the product handler in processing the Watermark Serial Number
- [0248] Watermark Serial Number: remainder of the watermark payload. Provides the index used by the product handler to access the watermark in the registration database
- [0249] Context: instructs the product handler to modify/refine its action based on the consumer request's context
- [0250] Environment: instructs the product handler to modify/refine its action based on the consumer request's environment. (The environment may be specified, e.g., as home, office, car, portable appliance, etc.)
[0251] Other Request codes can, of course, be used. Each may have its own list of mandatory and optional Primary Information fields. Optional fields are excluded from the primary Information when there is no value associated.
[0252] Secondary Information:
-
- [0253] Demographic Household ID: identifier for a selected demographic group. This is used as an index to the actual demographic
- [0254] Input device: Manufacturer, model and version of the device used to detect the watermark (e.g., a TWAIN driver string)
- [0255] Operating System: operating system in use on the consumer PC
- [0256] Processor: processor type/class on the consumer PC
- [0257] Processor speed: processor clock speed, in MHz, of the consumer PC. (May be entered by user, or auto-detected.)
- [0258] Language: preferred consumer spoken language
- [0259] Country: Country where the consumer PC resides
- [0260] Postal Code: Consumer's postal code (used along with the country to pinpoint the location of the consumer).
(In addition to these explicit data, the packet sent from the device 12 also conveys an IP address (inherent in the use of http protocols) so that the remote device (e.g., the router/handler) has an address to which it can respond.)
[0261]
| Response from Product Handler | |
| RtnCode | Success =1 |
| URL | the active URL for the watermark serial |
| number received | |
| or | |
| RtnCode | Error <0 |
| Error Message | text. |
| Request for URL | |
| Required Inputs | |
| Header (XML format) | |
| Vendor | (e.g., = Digimarc) |
| Appl | (e.g., = MB) |
| Data | |
| Required information- | |
| Req | =RFU |
| Ver | = application version number |
| Type | = watermark type number |
| Ser | = watermark serial number |
| Cxt | = context |
| Env | = environment |
| Optional Information- | |
| Ctry | =User′s Country name |
| Lang | =User′s preferred Language |
| HHID | =Demographic Household Identifier |
| Det | = TWAIN string of the sensing/detecting device |
| OS | =User PC Operating System string |
| Proc | =User PC processor type and class |
| Speed | =User processor speed |
| Zip | =User postal code |
| Example: | |
| <?xml version =″1.0″?> | |
| <Content> | |
| <vendor>Digimarc</vendor> | |
| <appl>MB</appl> | |
| </Content> | |
| Req=RFU | |
| Type=1 | |
| Ser=10001 | |
| Ver=1.0 | |
| Cxt=A | |
| Env=Q | |
| Ctry=USA | |
| Lang=English | |
| HHID=1234567 | |
| Det=TWAIN string | |
| OS=Win98 | |
| Proc=Pentium III | |
| Speed=500 | |
| zip=74008-1234 | |
| Response from Product Handler | |
| RtnCode=Success/Error number (Success = 1) | |
| URL=URL associated with specified watermark type | |
| and Serial number | |
| Exp=Expiration date/time (GMT) for caching purposes - format of | |
| mm/dd/yyyy hh:mm:ss | |
| or | |
| RtnCode=Success/Error number (Error <0) | |
| MsgText=message text | |
| Error reasons: | |
| 1 Type and Serial Number OK, but no URL in database | |
| (both the primary and default URL are missing) | |
| 2 Type and Serial Number OK, but URL is marked as inactive | |
| (neither the primary nor the default is active) | |
| 3 No record in database matching the Type and Serial Number | |
| 4 Request format error - incomplete data | |
| Request for Configuration | |
| Required Inputs | |
| Header (XML format) | |
| Vendor | (e.g., = Digimarc) |
| Appl | (e.g., = MB) |
| Data | |
| Required information - | |
| Req | =RFC |
| OS | =User PC Operating System |
| Example: | |
| < ?xml version=″1.0″?> | |
| <Content> | |
| <vendor>Digimarc</vendor> | |
| <appl>MB</appl> | |
| </Content> | |
| Req=RFC | |
| OS=Win98 | |
| Response from product handler | |
| RtnCode= Success/Error number (Success = 1) | |
| Ver=Latest Application version# available for download | |
| https=yes (or n ) | |
| GCURL=URL used to route subsequent Application requests | |
| or | |
| RtnCode= Success/Error number (Error <0) | |
| MsgText=message text | |
| Error reasons: | |
| 5 Unknown Operating System | |
| 4 Request format error-incomplete data | |
| Request for Associated URLs | |
| Required Inputs | |
| Header (XML format) | |
| Vendor | = Digimarc |
| Appl | = MB |
| Data | |
| Required information - | |
| Req | =RFA |
| Ver | =application version number |
| Type | =watermark type number |
| Ser | =watermark serial number |
| Cxt | =context |
| Env | =environment |
| Example: | |
| < ?xml version=″1.0″?> | |
| <Content> | |
| <vendor>Digimarc</vendor> | |
| <appl>MB</appl> | |
| </Content> | |
| Req=RFA | |
| Type=1 | |
| Ser=10001 | |
| Ver=1.0 | |
| Response from product handler | |
| RtnCode=Success/Error number (Success = 1) | |
| Ser1=watermark serial number | |
| Type1=watermark type number | |
| URL1= URL associated with specified watermark type and Serial | |
| number | |
| Exp1=Expiration date/time (GMT) | |
| Ser2=watermark serial number | |
| Type2=watermark type number | |
| URL2= URL associated with specified watermark type and Serial | |
| number | |
| Exp2=Expiration date/time (GMT) | |
| ... . . | |
| Ser‘n’=watermark serial number | |
| Type‘n’=watermark type number | |
| URL‘n’=URL associated with specified watermark type and Serial | |
| number | |
| Exp‘n’=Expiration date/time (GMT) | |
| or | |
| RtnCode=Success/Error number (Error <0) | |
| MsgText=message text | |
| Error reasons: | |
| 8 Type and Serial Number OK, but no associated watermarks | |
| or URLs in database | |
| 9 Type and Serial Number OK, but all associated | |
| URLs are marked as inactive | |
| 3 No record in database matching the Type and Serial Number | |
| 4 Request format error - incomplete data | |
| Request for Transaction Download | |
| (Needed to account for locally cached redirections. | |
| One request per local redirection.) | |
| Required Inputs | |
| Header (XML format) | |
| Vendor | = Digimarc |
| Appl | = MB |
| Data | |
| Required information - | |
| Req | =RFT |
| Ver | =application version number |
| Type | =watermark type number |
| Ser | =watermark serial number |
| Cxt | =context |
| Env | =environment |
| Optional Information | |
| Ctry | =User’s Country name |
| Lang | =User’s preferred Language |
| HHID | =Demographic Household Identifier |
| Det | =TWAIN string of the sensor device |
| OS | =User PC Operating System string |
| Proc | =User PC processor type and class |
| Speed | =User processor speed |
| Zip | =User postal code |
| Example: | |
| <?xml version=″1.0″?> | |
| <Content> | |
| <vendor>Digimarc</vendor> | |
| <appl>MB</appl> | |
| </Content> | |
| Req=RFT | |
| Type=1 | |
| Ser=10001 | |
| Ver=1.0 | |
| Cxt=A | |
| Env=Q | |
| Ctry=USA | |
| Lang=English | |
| HHID=1234567 | |
| Det=TWAIN string | |
| OS=Win98 | |
| Proc=Pentium III | |
| Speed=500 | |
| zip=74008-1234 | |
| Response from product handler | |
| RtnCode=Success/Error number (Success = 1) | |
| Or | |
| RtnCode=Success/Error number (Error <0) | |
| MsgText=message text | |
| Error reasons: | |
| 4 Request format error - incomplete data | |
[0262] To provide the fastest possible system response, it is desirable that data exchanges between the originating device 12 and the remote system be as short as possible—preferably of a size that can be transported in a single internet data packet (i.e., less than about 536 bits). Such an arrangement avoids the overhead associated with data division on transmission, and data reassembly on reception.
[0263] Generally speaking, the combined elapsed time of the system service (i.e., watermark recognition by application 28c, packet delivery to router, decoding by router, handling by product handler, and return of response to application) for a single request shall average no more than 3 seconds as measured from receipt of request to 1st byte sent in response to request. Typical speeds are less than 2 seconds, with many responses being provided in less than 1 second.
[0264] Having described and illustrated the principles of our technology with reference to a preferred embodiment, it should be apparent that the technology can be modified in arrangement and detail without departing from such principles.
[0265] For example, while the detailed embodiment relies on watermark technology to identify the object 20, this is not essential. Any technology permitting machine identification of the object can be employed, including bar codes (1- or 2-D), data glyphs, and other machine-readable indicia, mag stripes, RF IDs, hash-codes based on object data, etc.
[0266] Similarly, while the detailed embodiment described the coupling between various system components as being effected by the internet, this need not be the case. Some of the linking can be effected by wireless data transmission. Other links can be conveyed through private data networks, telephone services, etc.
[0267] While the detailed router, product handler, and registration server are illustrated as comprising distinct computers, in other embodiments these functions can be consolidated in one or two computers (with functions illustrated as performed in two computers being consolidated into one, etc.), or can be distributed among more than three computers. The components can be co-located, or distributed geographically. In some embodiments some or all of the functions performed by these components can be provided by the user's computer itself.
[0268] Likewise, the common reference to a “computer” as the device 12 shouldn't obscure the fact that the device can take many other forms. A cell phone, for example, has a processor, screen display, microphone, and wireless link that makes it well-suited for use in connection with the above-described technology. (Consider its use, for example, as the audio listening device in the arrangement disclosed in application Ser. No. 09/476,460.) Personal digital assistants, such as Palm Pilots and the like can be used (and accessorized for use) as device 12. Etc., etc.
[0269] While the detailed embodiment is a system of many parts, it will be recognized that novelty also resides in individual components thereof, and that such components can also be employed in other systems and devices.
[0270] To provide a comprehensive disclosure without unduly lengthening the specification, applicants incorporate by reference any patents and patent applications referenced above.
[0271] 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.
[0272] In view of the wide variety of embodiments to which the principles and features discussed above can be applied, it should be apparent that the detailed embodiment is illustrative only and should not be taken as limiting the scope of the invention. Rather, we claim as our invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
We claim:
1. A system for linking from physical or digital objects to corresponding digital resources, the system comprising:
a registration server configured to:
receive data relating to an object, wherein the data comprises an identity and an owner of the object; and
associate the data in a database with data relating to a corresponding response;
an originating device configured to:
sense data from an input object;
process the data; and
forward the processed data to a router;
wherein the router is configured to:
process the processed data from the originating device;
log information concerning the processed data;
identify a product handler to which at least certain of the processed data should be forwarded—from among plural different product handler; and
forward the at least certain of the processed data to the identified product handler; and
a product handler configured to provide a response to the originating device in accordance with the information provided thereto by the router, wherein the product handler is distinct from the router.
2. The system of claim 1, wherein the router is further configured to check information in the database.
3. The system of claim 1, wherein the registration server is further configured to generate an encapsulating file and distribute the file to predetermined parties.
4. A method of linking from physical objects to corresponding electronic resources, the method comprising:
sensing object payload data from a machine readable feature associated with a first physical object, using a hardware sensing device, wherein the first physical object is a member of a logical set;
querying a database with at least some of the object payload data to obtain first address information associated with the first physical object;
initiating an electronic link based on the first address information;
foreseeing information about object payloads that may be forthcoming but that do not share with the first object the payload data with which the database was queried; and
anticipatorily obtaining second address information associated with such foreseen object payloads after obtaining the first address information associated with the first physical object, wherein address information associated with other physical objects—but not associated with the first physical object—is obtained in expectation that such other physical objects may thereafter be sensed, and wherein the second address is associated with a physical object that has not previously been sensed by the hardware sensing device, and wherein the second address information is associated with other physical objects that are also members of the logical set.
5. The method of claim 4, wherein the logical set comprises a set of advertisements found in a particular magazine.
6. The method of claim 4, wherein the received second address information is in an order.
7. The method of claim 6, wherein the order is based on an order of printed pages in a bound volume.
8. The method of claim 6, wherein the order is based on a contractual arrangement.
9. The method of claim 4, wherein the sensing comprises sensing an object identifier from a first physical, tangible object, wherein the sensed identifier serves to identify the physical, tangible object.
10. A method comprising:
sensing a first object identifier from a first object, using a hardware sensor device, wherein the first object is a member of a logical set;
sending the first object identifier from a first device to a second device;
in response, receiving from the second device, first address information corresponding to the first object identifier;
initiating a link from the first device in accordance with the first address information;
after receiving from the second device the first address information, receiving from the second device second address information corresponding to additional objects related to the first object but that have not previously been sensed by the hardware sensor device, wherein the second address information is associated with other physical objects that are also members of the logical set; and
storing the second address information in a memory at the first device;
wherein, if an object included among the identified additional objects is sensed by the hardware sensor device, the corresponding second address information can be retrieved from the memory in the first device without the intervening delays of communicating with the second device.
11. A method of linking from physical objects to corresponding electronic resources, the method comprising:
decoding object payload data sensed by a hardware sensing device from a machine readable feature associated with a physical object, wherein the physical object is a member of a logical set;
querying a database with at least some of the payload data to obtain first address information associated with the physical object;
initiating an electronic link based on the obtained first address information;
foreseeing information about object payloads that may be forthcoming but that the hardware sensing device has not previously sensed; and
anticipatorily receiving second address information associated with such foreseen object payloads after initiating the electronic link, wherein the second address information is associated with other physical objects that are also members of the logical set.
12. The method of claim 11, wherein the logical set comprises a set of advertisements found in a particular magazine.
13. The method of claim 11, wherein the received second address information is in an order.
14. The method of claim 13, wherein the order is based on an order of printed pages in a bound volume.
15. The method of claim 13, wherein the order is based on a contractual arrangement.
16. A method of linking from physical objects to corresponding electronic resources, the method comprising:
decoding object payload data sensed by a hardware sensing device from a machine readable feature associated with a physical object, wherein the physical object is a member of a logical set;
querying a database with at least some of the payload data to obtain first address information associated with the physical object;
initiating an electronic link based on the obtained first address information;
foreseeing information about object payloads that may be forthcoming but that the hardware sensing device has not previously sensed, and an order in which the other object payloads may be forthcoming; and
anticipatorily receiving second address information associated with such foreseen object payloads, in such order, wherein the second address information is associated with other physical objects that are also members of the logical set.
17. The method of claim 16, wherein the order is based on an order of printed pages in a bound volume.
18. A system for linking from physical or digital objects to corresponding digital resources, the system comprising:
a database;
a registration device configured to:
receive data relating to an object, wherein the data includes an identity and an associated owner of the object; and
associate the data related to the object in the database with data relating to a corresponding digital resource;
a routing device configured to:
receive data from a user device corresponding to an input object sensed thereby;
log information concerning the received data;
identify a product handler device to which at least certain of the processed data should be forwarded—from among plural different product handler devices; and
forward at least certain of the received data to a product handler device; and
a product handler device configured to provide a response to the user device, wherein the response is determined by reference to the database in accordance with the data received from the user device.
19. The system of claim 18, further comprising a user device configured to:
sense data corresponding to an input object;
process the data corresponding to the input object; and
forward the processed data to the routing device, wherein the user device comprises a camera.
20. The system of claim 19, wherein the user device comprises a wireless telephone.
21. The system of claim 18, further comprising a steganographic watermark detector configured to decode information steganographically encoded in electronic or physical objects.
22. The system of claim 21, further comprising a user device configured to:
sense data from an input object;
process the data from the input object; and
forward the processed data to the routing device, wherein the user device comprises the steganographic watermark decoder.
23. The system of claim 22, wherein the user device comprises a wireless telephone.
24. The system of claim 23, wherein the wireless telephone comprises a 2D image sensor.
25. The system of claim 18, wherein the routing device is configured to check information in the database.
26. The system of claim 18, wherein the registration device is configured to generate an encapsulating file and distribute the file to predetermined parties.
27. A method facilitating linking from physical objects to corresponding electronic resources, the method including:
at a second device, receiving, from a first device, first object payload data decoded from a first machine readable feature associated with a first physical object, wherein the first physical object is a member of a logical set;
querying a database with at least some of the received first object payload data, to obtain first address information associated with the first physical object;
transmitting the first address information from the second device, so as to enable the first device to link to information associated with the first physical object;
anticipatorily transmitting other, second address information from the second device, wherein the second address information is associated with a second physical object for which no object payload data has previously been received by the second device from the first device, and wherein the second address information is associated with other physical objects that are also members of the logical set.
28. A non-transitory computer-readable device having instructions stored thereon that, when executed by a computing device, cause the computing device to perform operations comprising:
sensing object payload data from a machine readable feature associated with a first physical object, wherein the first physical object is a member of a logical set;
querying a database with at least some of the object payload data to obtain first address information associated with the first physical object;
initiating an electronic link based on the first address information;
foreseeing information about object payloads that may be forthcoming but that do not share with the first object the payload data with which the database was queried; and
anticipatorily obtaining second address information associated with such foreseen object payloads after obtaining the first address information associated with the first physical object, wherein address information associated with other physical objects—but not associated with the first physical object—is obtained in expectation that such other physical objects may thereafter be sensed, and wherein the second address is associated with a physical object that has not previously been sensed by the hardware sensing device, and wherein the second address information is associated with other physical objects that are also members of the logical set.
29. An apparatus comprising:
a processor; and
a memory operatively connected to the processor having instructions stored thereon that, if executed by the processor, cause the apparatus to:
sense object payload data from a machine readable feature associated with a first physical object, using a hardware sensing device, wherein the first physical object is a member of a logical set;
query a database with at least some of the object payload data to obtain first address information associated with the first physical object;
initiate an electronic link based on the first address information;
foresee information about object payloads that may be forthcoming but that do not share with the first object the payload data with which the database was queried; and
obtain second address information associated with such foreseen object payloads after obtaining the first address information associated with the first physical object, wherein address information associated with other physical objects—but not associated with the first physical object—is obtained in expectation that such other physical objects may thereafter be sensed, and wherein the second address is associated with a physical object that has not previously been sensed by the hardware sensing device, and wherein the second address information is associated with other physical objects that are also members of the logical set.
30. A non-transitory computer-readable device having instructions stored thereon that, when executed by a computing device, cause the computing device to perform operations comprising:
sensing a first object identifier from a first object, wherein the first object is a member of a logical set;
sending the first object identifier from a first device to a second device;
in response, receiving from the second device, first address information corresponding to the first object identifier;
initiating a link from the first device in accordance with the first address information;
after receiving from the second device the first address information, receiving from the second device second address information corresponding to additional objects related to the first object but that have not previously been sensed by the hardware sensor device, wherein the second address information is associated with other physical objects that are also members of the logical set; and
storing the second address information in a memory at the first device;
wherein, if an object included among the identified additional objects is sensed by the hardware sensor device, the corresponding second address information can be retrieved from the memory in the first device without the intervening delays of communicating with the second device.
31. An apparatus comprising:
a processor; and
a memory operatively connected to the processor having instructions stored thereon that, if executed by the processor, cause the apparatus to:
sense a first object identifier from a first object, using a hardware sensor device, wherein the first object is a member of a logical set;
send the first object identifier from a first device to a second device;
receive from the second device, first address information corresponding to the first object identifier;
initiate a link from the first device in accordance with the first address information;
receive from the second device, after receiving from the second device the first address information, second address information corresponding to additional objects related to the first object but that have not previously been sensed by the hardware sensor device, wherein the second address information is associated with other physical objects that are also members of the logical set; and
store the second address information in a memory at the first device;
wherein, if an object included among the identified additional objects is sensed by the hardware sensor device, the corresponding second address information can be retrieved from the memory in the first device without the intervening delays of communicating with the second device.
32. A non-transitory computer-readable device having instructions stored thereon that, when executed by a computing device, cause the computing device to perform operations comprising:
decoding object payload data from a machine readable feature associated with a physical object, wherein the physical object is a member of a logical set;
querying a database with at least some of the payload data to obtain first address information associated with the physical object;
initiating an electronic link based on the obtained first address information;
foreseeing information about object payloads that may be forthcoming but that the hardware sensing device has not previously sensed; and
anticipatorily receiving second address information associated with such foreseen object payloads after initiating the electronic link, wherein the second address information is associated with other physical objects that are also members of the logical set.
33. An apparatus comprising:
a processor; and
a memory operatively connected to the processor having instructions stored thereon that, if executed by the processor, cause the apparatus to:
decode object payload data sensed by a hardware sensing device from a machine readable feature associated with a physical object, wherein the physical object is a member of a logical set;
query a database with at least some of the payload data to obtain first address information associated with the physical object;
initiate an electronic link based on the obtained first address information;
foresee information about object payloads that may be forthcoming but that the hardware sensing device has not previously sensed; and
anticipatorily receive second address information associated with such foreseen object payloads after initiating the electronic link, wherein the second address information is associated with other physical objects that are also members of the logical set.
34. A non-transitory computer-readable device having instructions stored thereon that, when executed by a computing device, cause the computing device to perform operations comprising:
decoding object payload data from a machine readable feature associated with a physical object, wherein the physical object is a member of a logical set;
querying a database with at least some of the payload data to obtain first address information associated with the physical object;
initiating an electronic link based on the obtained first address information;
foreseeing information about object payloads that may be forthcoming but that the hardware sensing device has not previously sensed, and the order in which the other object payloads may be forthcoming; and
anticipatorily receiving second address information associated with such foreseen object payloads, in such order, wherein the second address information is associated with other physical objects that are also members of the logical set.
35. An apparatus comprising:
a processor; and
a memory operatively connected to the processor having instructions stored thereon that, if executed by the processor, cause the apparatus to:
decode object payload data sensed by a hardware sensing device from a machine readable feature associated with a physical object, wherein the physical object is a member of a logical set;
query a database with at least some of the payload data to obtain first address information associated with the physical object;
initiate an electronic link based on the obtained first address information;
foresee information about object payloads that may be forthcoming but that the hardware sensing device has not previously sensed, and the order in which the other object payloads may be forthcoming; and
anticipatorily receive second address information associated with such foreseen object payloads, in such order, wherein the second address information is associated with other physical objects that are also members of the logical set.
36. A non-transitory computer-readable device having instructions stored thereon that, when executed by a computing device, cause the computing device to perform operations comprising:
at a second device, receiving, from a first device, first object payload data decoded from a first machine readable feature associated with a first physical object, wherein the first physical object is a member of a logical set;
querying a database with at least some of the received first object payload data, to obtain first address information associated with the first physical object;
transmitting the first address information from the second device, so as to enable the first device to link to information associated with the first physical object;
anticipatorily transmitting other, second address information from the second device, wherein the second address information is associated with a second physical object for which no object payload data has previously been received by the second device from the first device, and wherein the second physical object is a member of the logical set.
37. An apparatus comprising:
a processor; and
a memory operatively connected to the processor having instructions stored thereon that, if executed by the processor, cause the apparatus to:
receive, from a first device, first object payload data decoded from a first machine readable feature associated with a first physical object, wherein the first physical object is a member of a logical set;
query a database with at least some of the received first object payload data, to obtain first address information associated with the first physical object;
transmit the first address information from the second device, so as to enable the first device to link to information associated with the first physical object;
anticipatorily transmit other, second address information from the second device, wherein the second address information is associated with a second physical object for which no object payload data has previously been received by the second device from the first device, and wherein the second physical object is a member of the logical set.
Patent Citations (372)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3845391(A) | 1974-10-01 | Cosby | Applicant |
| US4230990(A) | 1980-10-01 | Lert, Jr. et al. | Applicant |
| US4432096(A) | 1984-02-01 | Bunge | Applicant |
| US4450531(A) | 1984-05-01 | Kenyon et al. | Applicant |
| US4499601(A) | 1985-02-01 | Matthews | Applicant |
| US4639779(A) | 1987-01-01 | Greenberg | Applicant |
| US4682370(A) | 1987-07-01 | Matthews | Applicant |
| US4697209(A) | 1987-09-01 | Kiewit et al. | Applicant |
| US4739398(A) | 1988-04-01 | Thomas et al. | Applicant |
| US4780599(A) | 1988-10-01 | Baus | Applicant |
| US4907264(A) | 1990-03-01 | Seiler | Applicant |
| US4994987(A) | 1991-02-01 | Baldwin | Applicant |
| US5001696(A) | 1991-03-01 | Baldwin | Applicant |
| US5250789(A) | 1993-10-01 | Johnsen | Applicant |
| US5315098(A) | 1994-05-01 | Tow | Applicant |
| US5361871(A) | 1994-11-01 | Gupta | Applicant |
| US5382779(A) | 1995-01-01 | Gupta | Applicant |
| US5385371(A) | 1995-01-01 | Izawa | Applicant |
| US5415553(A) | 1995-05-01 | Szmidla | Applicant |
| US5418354(A) | 1995-05-01 | Halling et al. | Applicant |
| US5424524(A) | 1995-06-01 | Ruppert | Applicant |
| US5444230(A) | 1995-08-01 | Baldwin | Applicant |
| US5474457(A) | 1995-12-01 | Bromley | Applicant |
| US5478989(A) | 1995-12-01 | Shepley | Applicant |
| US5480306(A) | 1996-01-01 | Liu | Applicant |
| US5486686(A) | 1996-01-01 | Zdybel, Jr. et al. | Applicant |
| US5530852(A) | 1996-06-01 | Meske | Applicant |
| US5572653(A) | 1996-11-01 | DeTemple | Applicant |
| US5574519(A) | 1996-11-01 | Manico | Applicant |
| US5594226(A) | 1997-01-01 | Steger | Applicant |
| US5613004(A) | 1997-03-01 | Cooperman et al. | Applicant |
| US5640193(A) | 1997-06-01 | Wellner | Applicant |
| US5673316(A) | 1997-09-01 | Auerbach et al. | Applicant |
| US5703795(A) | 1997-12-01 | Mankovitz | Applicant |
| US5721919(A) | 1998-02-01 | Morel et al. | Examiner |
| US5742845(A) | 1998-04-01 | Wagner | Applicant |
| US5745782(A) | 1998-04-01 | Conway | Applicant |
| US5754981(A) | 1998-05-01 | Veeneman et al. | Applicant |
| US5761606(A) | 1998-06-01 | Wolzien | Applicant |
| US5761686(A) | 1998-06-01 | Bloomberg | Applicant |
| US5765152(A) | 1998-06-01 | Erickson | Applicant |
| US5765176(A) | 1998-06-01 | Bloomberg | Applicant |
| US5778102(A) | 1998-07-01 | Sandford, II et al. | Applicant |
| US5781914(A) | 1998-07-01 | Stork | Applicant |
| US5782692(A) | 1998-07-01 | Stelovsky | Applicant |
| US5822432(A) | 1998-10-01 | Moskowitz et al. | Applicant |
| US5832119(A) | 1998-11-01 | Rhoads | Applicant |
| US5832223(A) | 1998-11-01 | Hara | Applicant |
| US5838906(A) | 1998-11-01 | Doyle | Applicant |
| US5841978(A) | 1998-11-01 | Rhoads | Applicant |
| US5848413(A) | 1998-12-01 | Wolff | Applicant |
| US5862260(A) | 1999-01-01 | Rhoads | Applicant |
| US5892900(A) | 1999-04-01 | Ginter et al. | Applicant |
| US5899700(A) | 1999-05-01 | Williams et al. | Examiner |
| US5900608(A) | 1999-05-01 | Iida | Applicant |
| US5901224(A) | 1999-05-01 | Hecht | Applicant |
| US5902353(A) | 1999-05-01 | Reber et al. | Applicant |
| US5903729(A) | 1999-05-01 | Reber et al. | Applicant |
| US5905248(A) | 1999-05-01 | Russell et al. | Applicant |
| US5905800(A) | 1999-05-01 | Moskowitz et al. | Applicant |
| US5915027(A) | 1999-06-01 | Cox et al. | Applicant |
| US5932863(A) | 1999-08-01 | Rathus | Applicant |
| US5933498(A) | 1999-08-01 | Schneck et al. | Applicant |
| US5933829(A) | 1999-08-01 | Durst | Applicant |
| US5938726(A) | 1999-08-01 | Reber et al. | Applicant |
| US5938727(A) | 1999-08-01 | Ikeda | Applicant |
| US5956048(A) | 1999-09-01 | Gaston | Examiner |
| US5978773(A) | 1999-11-01 | Hudetz et al. | Examiner |
| US5978847(A) | 1999-11-01 | Kisor et al. | Applicant |
| US5986651(A) | 1999-11-01 | Reber et al. | Applicant |
| US5991737(A) | 1999-11-01 | Chen | Applicant |
| US5995105(A) | 1999-11-01 | Reber et al. | Applicant |
| US6002946(A) | 1999-12-01 | Reber | Applicant |
| US6031914(A) | 2000-02-01 | Tewfik et al. | Applicant |
| US6032195(A) | 2000-02-01 | Reber | Applicant |
| US6038562(A) | 2000-03-01 | Anjur et al. | Applicant |
| US6052486(A) | 2000-04-01 | Knowlton et al. | Applicant |
| US6061719(A) | 2000-05-01 | Bendinelli et al. | Examiner |
| US6081629(A) | 2000-06-01 | Browning | Applicant |
| US6081827(A) | 2000-06-01 | Reber et al. | Applicant |
| US6084528(A) | 2000-07-01 | Beach et al. | Applicant |
| US6088032(A) | 2000-07-01 | Mackinlay | Applicant |
| US6098096(A) | 2000-08-01 | Tsirigotis et al. | Applicant |
| US6098106(A) | 2000-08-01 | Philyaw et al. | Examiner |
| US6108656(A) | 2000-08-01 | Durst et al. | Applicant |
| US6119944(A) | 2000-09-01 | Mulla | Applicant |
| US6121530(A) | 2000-09-01 | Sonoda | Applicant |
| US6122403(A) | 2000-09-01 | Rhoads | Applicant |
| US6125172(A) | 2000-09-01 | August | Applicant |
| US6135646(A) | 2000-10-01 | Kahn et al. | Applicant |
| US6138151(A) | 2000-10-01 | Reber et al. | Applicant |
| US6141010(A) | 2000-10-01 | Hoyle | Examiner |
| US6148331(A) | 2000-11-01 | Parry | Applicant |
| US6164534(A) | 2000-12-01 | Rathus et al. | Applicant |
| US6182122(B1) | 2001-01-01 | Berstis | Applicant |
| US6199048(B1) | 2001-03-01 | Hudetz et al. | Applicant |
| US6229924(B1) | 2001-05-01 | Rhoads et al. | Applicant |
| US6230212(B1) | 2001-05-01 | Morel et al. | Examiner |
| US6243480(B1) | 2001-06-01 | Zhao et al. | Applicant |
| US6249226(B1) | 2001-06-01 | Harrison et al. | Applicant |
| US6249870(B1) | 2001-06-01 | Kobayashi et al. | Applicant |
| US6256638(B1) | 2001-07-01 | Dougherty | Applicant |
| US6286036(B1) | 2001-09-01 | Rhoads | Applicant |
| US6307949(B1) | 2001-10-01 | Rhoads | Applicant |
| US6311214(B1) | 2001-10-01 | Rhoads | Examiner |
| US6321992(B1) | 2001-11-01 | Knowles | Applicant |
| US6324573(B1) | 2001-11-01 | Rhoads | Applicant |
| US6345104(B1) | 2002-02-01 | Rhoads | Applicant |
| US6345256(B1) | 2002-02-01 | Milsted et al. | Applicant |
| US6353929(B1) | 2002-03-01 | Houston | Applicant |
| US6366680(B1) | 2002-04-01 | Brunk et al. | Applicant |
| US6377986(B1) | 2002-04-01 | Philyaw et al. | Examiner |
| US6381341(B1) | 2002-04-01 | Rhoads | Applicant |
| US6385329(B1) | 2002-05-01 | Sharma et al. | Applicant |
| US6386453(B1) | 2002-05-01 | Russell | Applicant |
| US6389055(B1) | 2002-05-01 | August | Applicant |
| US6400272(B1) | 2002-06-01 | Holtzman et al. | Applicant |
| US6405203(B1) | 2002-06-01 | Collart | Examiner |
| US6408082(B1) | 2002-06-01 | Rhoads et al. | Applicant |
| US6408331(B1) | 2002-06-01 | Rhoads | Applicant |
| US6411994(B2) | 2002-06-01 | van Allen | Applicant |
| US6421070(B1) | 2002-07-01 | Ramos et al. | Applicant |
| US6421450(B2) | 2002-07-01 | Nakano | Examiner |
| US6424725(B1) | 2002-07-01 | Rhoads et al. | Applicant |
| US6425525(B1) | 2002-07-01 | Swaminathan | Applicant |
| US6430554(B1) | 2002-08-01 | Rothschild | Applicant |
| US6434561(B1) | 2002-08-01 | Durst, Jr. et al. | Applicant |
| US6439465(B1) | 2002-08-01 | Bloomberg | Applicant |
| US6448979(B1) | 2002-09-01 | Schena et al. | Applicant |
| US6457177(B1) | 2002-09-01 | Reams | Applicant |
| US6460036(B1) | 2002-10-01 | Herz | Examiner |
| US6466329(B1) | 2002-10-01 | Mukai | Applicant |
| US6505160(B1) | 2003-01-01 | Levy et al. | Applicant |
| US6505191(B1) | 2003-01-01 | Baclawski | Examiner |
| US6507872(B1) | 2003-01-01 | Geshwind | Applicant |
| US6516079(B1) | 2003-02-01 | Rhoads et al. | Applicant |
| US6522770(B1) | 2003-02-01 | Seder et al. | Applicant |
| US6526449(B1) | 2003-02-01 | Philyaw et al. | Applicant |
| US6535617(B1) | 2003-03-01 | Hannigan et al. | Applicant |
| US6542927(B2) | 2003-04-01 | Rhoads | Applicant |
| US6542933(B1) | 2003-04-01 | Durst, Jr. et al. | Applicant |
| US6549933(B1) | 2003-04-01 | Barrett | Applicant |
| US6553129(B1) | 2003-04-01 | Rhoads | Applicant |
| US6567533(B1) | 2003-05-01 | Rhoads | Applicant |
| US6573916(B1) | 2003-06-01 | Grossweiler | Applicant |
| US6574609(B1) | 2003-06-01 | Downs et al. | Examiner |
| US6580808(B2) | 2003-06-01 | Rhoads | Applicant |
| US6590996(B1) | 2003-07-01 | Reed et al. | Applicant |
| US6597377(B1) | 2003-07-01 | MacPhail | Examiner |
| US6611607(B1) | 2003-08-01 | Davis et al. | Applicant |
| US6611830(B2) | 2003-08-01 | Shinoda et al. | Examiner |
| US6614914(B1) | 2003-09-01 | Rhoads et al. | Applicant |
| US6636249(B1) | 2003-10-01 | Rekimoto | Applicant |
| US6647128(B1) | 2003-11-01 | Rhoads | Applicant |
| US6647130(B2) | 2003-11-01 | Rhoads | Applicant |
| US6650761(B1) | 2003-11-01 | Rodriguez et al. | Examiner |
| US6651053(B1) | 2003-11-01 | Rothschild | Applicant |
| US6671424(B1) | 2003-12-01 | Skoll et al. | Examiner |
| US6674993(B1) | 2004-01-01 | Tarbouriech | Applicant |
| US6675165(B1) | 2004-01-01 | Rothschild | Applicant |
| US6681028(B2) | 2004-01-01 | Rodriguez et al. | Examiner |
| US6681029(B1) | 2004-01-01 | Rhoads | Applicant |
| US6687345(B1) | 2004-02-01 | Swartz | Applicant |
| US6687383(B1) | 2004-02-01 | Kanevsky et al. | Applicant |
| US6694042(B2) | 2004-02-01 | Seder et al. | Applicant |
| US6694043(B2) | 2004-02-01 | Seder et al. | Applicant |
| US6700990(B1) | 2004-03-01 | Rhoads | Applicant |
| US6700995(B2) | 2004-03-01 | Reed | Applicant |
| US6701369(B1) | 2004-03-01 | Philyaw | Applicant |
| US6704869(B2) | 2004-03-01 | Rhoads et al. | Applicant |
| US6718046(B2) | 2004-04-01 | Reed et al. | Applicant |
| US6718047(B2) | 2004-04-01 | Rhoads | Applicant |
| US6721440(B2) | 2004-04-01 | Reed et al. | Applicant |
| US6721733(B2) | 2004-04-01 | Lipson | Applicant |
| US6728726(B1) | 2004-04-01 | Bernstein et al. | Examiner |
| US6738491(B1) | 2004-05-01 | Ikenoue | Applicant |
| US6745234(B1) | 2004-06-01 | Philyaw | Applicant |
| US6760463(B2) | 2004-07-01 | Rhoads | Applicant |
| US6763123(B2) | 2004-07-01 | Reed et al. | Applicant |
| US6766363(B1) | 2004-07-01 | Rothschild | Applicant |
| US6768809(B2) | 2004-07-01 | Rhoads et al. | Applicant |
| US6775392(B1) | 2004-08-01 | Rhoads | Applicant |
| US6783069(B1) | 2004-08-01 | Hecht et al. | Applicant |
| US6786397(B2) | 2004-09-01 | Silverbrook et al. | Applicant |
| US6788293(B1) | 2004-09-01 | Silverbrook | Applicant |
| US6798894(B2) | 2004-09-01 | Rhoads | Applicant |
| US6804779(B1) | 2004-10-01 | Carroni et al. | Applicant |
| US6807570(B1) | 2004-10-01 | Allen et al. | Examiner |
| US6807676(B1) | 2004-10-01 | Robbins | Applicant |
| US6813039(B1) | 2004-11-01 | Silverbrook | Applicant |
| US6813366(B1) | 2004-11-01 | Rhoads | Applicant |
| US6820062(B1) | 2004-11-01 | Gupta | Applicant |
| US6834308(B1) | 2004-12-01 | Ikezoye et al. | Applicant |
| US6879701(B1) | 2005-04-01 | Rhoads | Applicant |
| US6917724(B2) | 2005-07-01 | Seder et al. | Applicant |
| US6920232(B2) | 2005-07-01 | Rhoads | Applicant |
| US6931588(B1) | 2005-08-01 | Nakano | Examiner |
| US6935562(B2) | 2005-08-01 | Hecht et al. | Applicant |
| US6941275(B1) | 2005-09-01 | Swierczek | Applicant |
| US6941338(B1) | 2005-09-01 | Madsen | Examiner |
| US6947571(B1) | 2005-09-01 | Rhoads et al. | Applicant |
| US6965683(B2) | 2005-11-01 | Hein, III | Examiner |
| US6968455(B2) | 2005-11-01 | Okayasu | Applicant |
| US6975746(B2) | 2005-12-01 | Davis et al. | Applicant |
| US6988202(B1) | 2006-01-01 | Rhoads et al. | Applicant |
| US6995859(B1) | 2006-02-01 | Silverbrook | Applicant |
| US6996252(B2) | 2006-02-01 | Reed et al. | Applicant |
| US7003731(B1) | 2006-02-01 | Rhoads et al. | Applicant |
| US7024016(B2) | 2006-04-01 | Rhoads et al. | Applicant |
| US7027614(B2) | 2006-04-01 | Reed | Applicant |
| US7035427(B2) | 2006-04-01 | Rhoads | Applicant |
| US7044395(B1) | 2006-05-01 | Davis et al. | Examiner |
| US7051086(B2) | 2006-05-01 | Rhoads et al. | Applicant |
| US7054465(B2) | 2006-05-01 | Rhoads | Applicant |
| US7058697(B2) | 2006-06-01 | Rhoads | Applicant |
| US7062069(B2) | 2006-06-01 | Rhoads | Applicant |
| US7065559(B1) | 2006-06-01 | Weiss | Examiner |
| US7095871(B2) | 2006-08-01 | Jones et al. | Applicant |
| US7111168(B2) | 2006-09-01 | Lofgren et al. | Examiner |
| US7111170(B2) | 2006-09-01 | Rhodes | Applicant |
| US7113614(B2) | 2006-09-01 | Rhoads | Applicant |
| US7139408(B2) | 2006-11-01 | Rhoads et al. | Applicant |
| US7158654(B2) | 2007-01-01 | Rhoads | Applicant |
| US7164780(B2) | 2007-01-01 | Brundage et al. | Applicant |
| US7171016(B1) | 2007-01-01 | Rhoads | Applicant |
| US7171018(B2) | 2007-01-01 | Rhoads et al. | Examiner |
| US7174031(B2) | 2007-02-01 | Rhoads | Applicant |
| US7177443(B2) | 2007-02-01 | Rhoads | Applicant |
| US7185201(B2) | 2007-02-01 | Rhoads | Applicant |
| US7206820(B1) | 2007-04-01 | Rhoads et al. | Applicant |
| US7209573(B2) | 2007-04-01 | Evans et al. | Examiner |
| US7213757(B2) | 2007-05-01 | Jones et al. | Applicant |
| US7224819(B2) | 2007-05-01 | Levy et al. | Applicant |
| US7248717(B2) | 2007-07-01 | Rhoads | Applicant |
| US7261612(B1) | 2007-08-01 | Hannigan et al. | Applicant |
| US7302574(B2) | 2007-11-01 | Conwell | Applicant |
| US7305104(B2) | 2007-12-01 | Carr et al. | Applicant |
| US7308110(B2) | 2007-12-01 | Rhoads | Applicant |
| US7313251(B2) | 2007-12-01 | Rhoads | Applicant |
| US7316347(B2) | 2008-01-01 | Poor | Examiner |
| US7319775(B2) | 2008-01-01 | Sharma et al. | Applicant |
| US7330564(B2) | 2008-02-01 | Brundage et al. | Applicant |
| US7369678(B2) | 2008-05-01 | Rhoads | Applicant |
| US7377421(B2) | 2008-05-01 | Rhoads | Applicant |
| US7391880(B2) | 2008-06-01 | Reed et al. | Applicant |
| US7403299(B2) | 2008-07-01 | Takahashi | Applicant |
| US7406214(B2) | 2008-07-01 | Rhoads | Applicant |
| US7421723(B2) | 2008-09-01 | Harkness | Applicant |
| US7424131(B2) | 2008-09-01 | Alattar et al. | Applicant |
| US7427030(B2) | 2008-09-01 | Jones et al. | Applicant |
| US7433491(B2) | 2008-10-01 | Rhoads | Applicant |
| US7444000(B2) | 2008-10-01 | Rhoads | Applicant |
| US7444392(B2) | 2008-10-01 | Rhoads et al. | Applicant |
| US7450734(B2) | 2008-11-01 | Rodriguez et al. | Applicant |
| US7460726(B2) | 2008-12-01 | Levy et al. | Applicant |
| US7466840(B2) | 2008-12-01 | Rhoads | Applicant |
| US7486799(B2) | 2009-02-01 | Rhoads | Applicant |
| US7502759(B2) | 2009-03-01 | Hannigan et al. | Applicant |
| US7508955(B2) | 2009-03-01 | Carr et al. | Applicant |
| US7515733(B2) | 2009-04-01 | Rhoads | Applicant |
| US7536034(B2) | 2009-05-01 | Rhoads et al. | Applicant |
| US7537170(B2) | 2009-05-01 | Reed et al. | Applicant |
| US7545952(B2) | 2009-06-01 | Brundage et al. | Applicant |
| US7564992(B2) | 2009-07-01 | Rhoads | Applicant |
| USRE40919(E) | 2009-09-01 | Rhoads | Applicant |
| US7602978(B2) | 2009-10-01 | Levy et al. | Applicant |
| US7628320(B2) | 2009-12-01 | Rhoads | Applicant |
| US7643649(B2) | 2010-01-01 | Davis et al. | Applicant |
| US7650009(B2) | 2010-01-01 | Rhoads | Applicant |
| US7653210(B2) | 2010-01-01 | Rhoads | Applicant |
| US7657058(B2) | 2010-02-01 | Sharma | Applicant |
| US7685426(B2) | 2010-03-01 | Ramos et al. | Applicant |
| US7685537(B2) | 2010-03-01 | Hoyle | Examiner |
| US7693300(B2) | 2010-04-01 | Reed et al. | Applicant |
| US7697719(B2) | 2010-04-01 | Rhoads | Applicant |
| US7711143(B2) | 2010-05-01 | Rhoads | Applicant |
| US7738673(B2) | 2010-06-01 | Reed | Applicant |
| US7747038(B2) | 2010-06-01 | Rhoads | Applicant |
| US7751588(B2) | 2010-07-01 | Rhoads | Applicant |
| US7751596(B2) | 2010-07-01 | Rhoads | Applicant |
| US7756290(B2) | 2010-07-01 | Rhoads | Applicant |
| US7760905(B2) | 2010-07-01 | Rhoads et al. | Applicant |
| US7762468(B2) | 2010-07-01 | Jones et al. | Applicant |
| US7787653(B2) | 2010-08-01 | Rhoads | Applicant |
| US7792325(B2) | 2010-09-01 | Rhoads et al. | Applicant |
| US7822225(B2) | 2010-10-01 | Alattar | Applicant |
| US7837094(B2) | 2010-11-01 | Rhoads | Applicant |
| US7917083(B2) | 2011-03-01 | Tang | Examiner |
| US7970167(B2) | 2011-06-01 | Rhoads | Examiner |
| US7991778(B2) | 2011-08-01 | Hull et al. | Examiner |
| US8045756(B2) | 2011-10-01 | Hein, III | Examiner |
| US8051169(B2) | 2011-11-01 | Rhoads | Examiner |
| US8069169(B2) | 2011-11-01 | Fitzpatrick et al. | Examiner |
| US8095796(B2) | 2012-01-01 | Conwell et al. | Examiner |
| US2001/0001854(A1) | 2001-05-01 | Schena et al. | Applicant |
| US2001/0011233(A1) | 2001-08-01 | Narayanaswami | Applicant |
| US2001/0017885(A1) | 2001-08-01 | Asai | Applicant |
| US2001/0018742(A1) | 2001-08-01 | Hirai | Applicant |
| US2001/0021916(A1) | 2001-09-01 | Takai | Applicant |
| US2001/0021978(A1) | 2001-09-01 | Okayasu et al. | Applicant |
| US2001/0028725(A1) | 2001-10-01 | Nakagawa et al. | Applicant |
| US2001/0034705(A1) | 2001-10-01 | Rhoads et al. | Applicant |
| US2001/0051996(A1) | 2001-12-01 | Cooper et al. | Applicant |
| US2001/0055407(A1) | 2001-12-01 | Rhoads | Applicant |
| US2002/0009208(A1) | 2002-01-01 | Alattar et al. | Applicant |
| US2002/0010941(A1) | 2002-01-01 | Johnson | Applicant |
| US2002/0023020(A1) | 2002-02-01 | Kenyon et al. | Applicant |
| US2002/0023148(A1) | 2002-02-01 | Ritz et al. | Applicant |
| US2002/0033844(A1) | 2002-03-01 | Levy et al. | Applicant |
| US2002/0048224(A1) | 2002-04-01 | Dygert | Applicant |
| US2002/0059162(A1) | 2002-05-01 | Shinoda et al. | Applicant |
| US2002/0059238(A1) | 2002-05-01 | Saito | Applicant |
| US2002/0062382(A1) | 2002-05-01 | Rhoads et al. | Applicant |
| US2002/0075298(A1) | 2002-06-01 | Schena et al. | Applicant |
| US2002/0080396(A1) | 2002-06-01 | Silverbrook et al. | Applicant |
| US2002/0111912(A1) | 2002-08-01 | Hunter | Applicant |
| US2002/0122568(A1) | 2002-09-01 | Zhao | Applicant |
| US2002/0131076(A1) | 2002-09-01 | Davis | Applicant |
| US2002/0176003(A1) | 2002-11-01 | Seder et al. | Applicant |
| US2002/0186886(A1) | 2002-12-01 | Rhoads | Applicant |
| US2002/0196272(A1) | 2002-12-01 | Ramos et al. | Applicant |
| US2003/0002710(A1) | 2003-01-01 | Rhoads | Applicant |
| US2003/0040957(A1) | 2003-02-01 | Rhoads et al. | Applicant |
| US2003/0103611(A1) | 2003-06-01 | Lapstun | Applicant |
| US2003/0105730(A1) | 2003-06-01 | Davis et al. | Applicant |
| US2003/0130954(A1) | 2003-07-01 | Carr et al. | Applicant |
| US2004/0005093(A1) | 2004-01-01 | Rhoads | Applicant |
| US2004/0190750(A1) | 2004-09-01 | Rodriguez et al. | Applicant |
| US2004/0240704(A1) | 2004-12-01 | Reed | Applicant |
| US2004/0264733(A1) | 2004-12-01 | Rhoads et al. | Applicant |
| US2005/0041835(A1) | 2005-02-01 | Reed et al. | Applicant |
| US2005/0043018(A1) | 2005-02-01 | Kawamoto | Applicant |
| US2005/0058318(A1) | 2005-03-01 | Rhoads | Applicant |
| US2005/0192933(A1) | 2005-09-01 | Rhoads et al. | Applicant |
| US2005/0229107(A1) | 2005-10-01 | Hull | Applicant |
| US2006/0013435(A1) | 2006-01-01 | Rhoads | Applicant |
| US2006/0041591(A1) | 2006-02-01 | Rhoads | Applicant |
| US2006/0251291(A1) | 2006-11-01 | Rhoads | Applicant |
| US2007/0055884(A1) | 2007-03-01 | Rhoads | Applicant |
| US2007/0108287(A1) | 2007-05-01 | Davis et al. | Applicant |
| US2007/0154064(A1) | 2007-07-01 | Rhoads et al. | Applicant |
| US2007/0208805(A1) | 2007-09-01 | Rhoads et al. | Applicant |
| US2007/0276841(A1) | 2007-11-01 | Rhoads et al. | Applicant |
| US2007/0276928(A1) | 2007-11-01 | Rhoads et al. | Applicant |
| US2008/0121728(A1) | 2008-05-01 | Rodriguez | Applicant |
| US2008/0133555(A1) | 2008-06-01 | Rhoads et al. | Applicant |
| US2008/0140714(A1) | 2008-06-01 | Rhoads et al. | Applicant |
| US2008/0292134(A1) | 2008-11-01 | Sharma et al. | Applicant |
| US2009/0012944(A1) | 2009-01-01 | Rodriguez et al. | Applicant |
| US2009/0116687(A1) | 2009-05-01 | Rhoads et al. | Applicant |
| US2009/0125475(A1) | 2009-05-01 | Rhoads et al. | Applicant |
| US2009/0232352(A1) | 2009-09-01 | Carr et al. | Applicant |
| US2009/0286572(A1) | 2009-11-01 | Rhoads et al. | Applicant |
| US2009/0290754(A1) | 2009-11-01 | Rhoads | Applicant |
| US2010/0027837(A1) | 2010-02-01 | Levy et al. | Applicant |
| US2010/0045816(A1) | 2010-02-01 | Rhoads | Applicant |
| US2010/0062819(A1) | 2010-03-01 | Hannigan et al. | Applicant |
| US2010/0094639(A1) | 2010-04-01 | Rhoads | Applicant |
| US2010/0114705(A1) | 2010-05-01 | Hoyle | Examiner |
| US2010/0142749(A1) | 2010-06-01 | Ellingson et al. | Applicant |
| US2010/0172540(A1) | 2010-07-01 | Davis et al. | Applicant |
| US2010/0198941(A1) | 2010-08-01 | Rhoads | Applicant |
| US2011/0007936(A1) | 2011-01-01 | Rhoads | Applicant |
| US2011/0026777(A1) | 2011-02-01 | Rhoads et al. | Applicant |
| US2011/0051998(A1) | 2011-03-01 | Rhoads | Applicant |
| US2011/0208582(A1) | 2011-08-01 | Hoyle | Examiner |
| US2011/0238506(A1) | 2011-09-01 | Perkowski et al. | Examiner |
| EP493091 | 1992-07-01 | Applicant | |
| WO9743736 | 1997-11-01 | Applicant | |
| WO9803923 | 1998-01-01 | Applicant | |
| WO9904568 | 1999-01-01 | Applicant | |
| WO171517 | 2001-09-01 | Applicant |
Non-Patent Literature (33)
- Foxwell et al, Prefetching Results of Web Searches, Proc. Computer Measurement Group Conference, Anaheim, CA, Dec. 6-11, 1998, 8. pp.Applicant
- Kroeger et al, Exploring the Bounds of Web Latency Reduction from Caching and Prefetching, USITS '97, pp. 13-22, 1997.Applicant
- Padmanabhan et al, Using Predictive Prefetching to Improve World Wide Web Latency. In Proc. of the ACM SIGCOMM '96 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 22-36, Jul. 1996.Applicant
- Wang, A Srvey of Web Caching Schemes for the Internet, ACM Computer Communication Review, 29(5):36-46, Oct. 1999.Applicant
- Wang, et al, Prefetching in World Wide Web, Proc. IEEE Global Internet 96, Nov. 1996, 12pp.Applicant
- Watson, Application Design for Wireless Computing, Proceedings of the Workshop on Mobile Computing Systems and Applications, Santa Cruz, California, Dec. 1994, 4 pp.Applicant
- Garofalakis et al., Digital Robbery; Authors are not Unprotected, IEEE Comput. Soc., US, Jun. 22, 1998, pp. 558-563.Applicant
- Banatre, Providing Quality of Service Over the Web: A Newspaper-Based Approach, Comp. Networks and ISDN Sys., vol. 29, Sep. 1997, pp. 1457-1465.Applicant
- Chinen, An Interactive Prefetching Proxy Server for Improvements of WWW Latency, in Proc. INET, 1997.Applicant
- Cunha, Determining WWW User's Next Access and Its Application to Pre-Fetching, Mar. 1997.Applicant
- Kwan et al. NCSA's World Wide Web server: Design and performance, IEEE Computer, vol. 28, No. 11, pp. 68-74, Nov. 1995.Applicant
- Digimarc Information Embedding Technology, Frequently Asked Questions (with Answers), Sep. 1996, 19 pages.Applicant
- Duchamp, Prefetching Hyperlinks, Proc. USITS '99 Oct. 11-14, 1999, 13pp.Applicant
- Frequently Asked Questions About Digimarc Signature Technology, 1995, 9 pages.Applicant
- U.S. Appl. No. 09/343,104, filed Jun. 29, 1999, Tony F. Rodriguez, et al.Applicant
- U.S. Appl. No. 09/343,101, filed Jun. 29, 1999, Bruce L. Davis, et al.Applicant
- U.S. Appl. No. 09/413,117, filed Oct. 6, 1999, Geoffrey B. Rhoads.Applicant
- U.S. Appl. No. 09/482,749, filed Jan. 13, 2000, Geoffrey B. Rhoads.Applicant
- U.S. Appl. No. 09/507,096, filed Feb. 17, 2000, Geoffrey B. Rhoads, et al.Applicant
- U.S. Appl. No. 09/538,493, filed Mar. 30, 2000, Geoffrey B. Rhoads.Applicant
- U.S. Appl. No. 09/552,998, Apr. 19, 2000, Tony F. Rodriguez, et al.Applicant
- U.S. Appl. No. 09/567,405, filed May 8, 2000, Geoffrey B. Rhoads, et al.Applicant
- U.S. Appl. No. 09/629,649, filed Aug. 1, 2000, J. Scott Carr, et al.Applicant
- U.S. Appl. No. 09/633,587, Aug. 7, 2000, Geoffrey B. Rhoads, et al.Applicant
- U.S. Appl. No. 09/689,289, filed Oct. 11, 2000, Geoffrey B. Rhoads, et al.Applicant
- U.S. Appl. No. 09/697,009, filed Oct. 25, 2000, Bruce L. Davis, et al.Applicant
- U.S. Appl. No. 09/697,015, filed Oct. 25, 2000, Bruce L Davis, et al.Applicant
- U.S. Appl. No. 12/912,461, filed Oct. 26, 2010, Adnan M. Alattar.Applicant
- U.S. Appl. No. 12/953,190, filed Nov. 23, 2010, Geoffrey B. Rhoads.Applicant
- U.S. Appl. No. 13/084,981, filed Apr. 12, 2011, Geoffrey B. Rhoads.Applicant
- Office Action on Korean Application 10-2010-700716, dated Dec. 30, 2010 (with English summary).Applicant
- Boney et al., “Digital Watermarks for Audio Signals,” IEEE Proceedings of Multimedia '96, 1996, pp. 473-480.Applicant
- Bender et al., “Techniques for Data Hiding,” SPIE vol. 2420, 1996, pp. 164-173.Applicant