Routing networks for use with content linking systems

Information

  • Patent Grant
  • 7369676
  • Patent Number
    7,369,676
  • Date Filed
    Tuesday, November 15, 2005
    19 years ago
  • Date Issued
    Tuesday, May 6, 2008
    16 years ago
Abstract
A method of linking a content object with a network resource presents a content object to a reader, discerns an identifier associated with the content object, transfers the identifier to an indexing system, and in response receives an internet address corresponding to the content object. To enhance the response of the indexing system, it includes multiple routers, which it selects based on location relative to the reader. For example, the method sends user location data to a master system, and in response, receives an address of an indexing system close to the user location.
Description
FIELD OF THE INVENTION

The invention relates to routers, and more particularly relates to routers used in linking to computer resources based on data represented in content identification technologies such as digital watermarks, bar codes, or the like.


BACKGROUND AND SUMMARY OF THE INVENTION

Digital watermarking is the science of encoding physical and electronic objects with plural-bit digital data, in such a manner that the data is essentially hidden from human perception, yet can be recovered by computer analysis. In physical objects, the data may be encoded in the form of surface texturing, or printing. Such marking can be detected from optical scan data, e.g., from a scanner or web cam. In electronic objects (e.g., digital audio or imagery—including video), the data may be encoded as slight variations in sample values. Or, if the object is represented in a so-called orthogonal domain (also termed “non-perceptual,” e.g., MPEG, DCT, wavelet, etc.), the data may be encoded as slight variations in quantization values or levels. The present assignee's U.S. Pat. Nos. 6,122,403, and 6,614,914, are illustrative of certain watermarking technologies.


Watermarking can be used to tag objects with a persistent digital identifier, and as such finds myriad uses. Some are in the realm of device control—e.g., tagging video data with a do-not-copy flag that is respected by compliant video recorders. (The music industry's Secure Digital Music Initiative (SDMI), and the motion picture industry's Copy Protection Technical Working Group (CPTWG), are working to establish standards relating to watermark usage for device control.) Other watermark applications are in the field of copyright communication, e.g., indicating that an audio track is the property of a particular copyright holder.


This document describes systems that use content identification technologies used to associate an object with a store of related data. For example, an image watermark may contain an index value that serves to identify a database record specifying (a) the owner's name; (b) contact information; (c) license terms and conditions, (d) copyright date, (e) whether adult content is depicted, etc., etc. (The present assignee's MarcCentre service provides such functionality.)


Another watermark application that encodes data to associate an object with a store of related data, is so-called “connected content” technology. In such applications, a watermark in one content object (e.g., a printed magazine article) serves to link to a related content object (e.g., a web page devoted to the same topic). The watermark can literally encode an electronic address of the related content object, but more typically encodes an index value that identifies a database record containing that address information. U.S. Pat. No. 6,947,571 details a number of connected-content applications and techniques. The present assignee markets such technology under the brands “Digimarc MediaBridge,” “Digimarc Mobile” and “ImageBridge.” In the Digimarc MediaBridge offering, the system that associates object identifiers with corresponding computer resources is termed the “Grand Central” router.


One aspect of the invention is a method of linking a content object with a network resource. The method comprises presenting a content object to a reader; discerning from data obtained by the reader an identifier associated with the content object; transferring the identifier to an indexing system; and receiving from the indexing system an internet address corresponding to said content object. The method further includes sending user data to a master system, the user data providing information related to user location; receiving from said master system an address of an indexing system close to the user location, the master system selecting the indexing system from among plural different indexing systems; and transferring said identifier to said selected indexing system using the address.


In one embodiment, the indexing system makes several routers available, and utilizes them in manners designed to speed system response time.


The foregoing and other features and advantages of the invention will be more readily apparent from the following detailed description.







DETAILED DESCRIPTION

To speed response time in systems like those referenced above (including the Digimarc MediaBridge application detailed in U.S. Pat. No. 6,947,571), it is desirable that the responding system be located close—in network terms—to the client application or device.


It has been the intent from the outset to have more than one Digimarc MediaBridge Grand Central router, and to field them at various locations throughout the US and internationally.


Based on the location of the user (using the country code or postal code they have stored on their computer or have given to Digimarc during the software registration process), we communicate with a specific Digimarc MediaBridge Grand Central router located closest to them geographically (or network-geographically).


When a user connects between their PC and a website hosted on a computer somewhere else in the world, the connection is not normally a single connection between just those two computers. The Internet isn't built that way. The Internet takes the user's request (specified via the Uniform Resource Locator—URL) and routes the user through whatever intermediary computers, routers and switches that seem appropriate at the time of the user's request. This mechanism is similar in many ways to making a long-distance phone call. Each of the connections through an intermediary is called a ‘hop’. Typically, the further away the URL is geographically located on the world-wide web, the more ‘hops’ it takes to make the connection. The more ‘hops’ the more latency is introduced as each intermediary point and the slower the actual response and the less reliable the connection.


All communication between the Digimarc MediaBridge reader/detector application and the Digimarc MediaBridge Grand Central router is accomplished by sending messages back and forth over the Internet. One of the ways that Digimarc improves the reliability of its service and can slightly increase its speed is to minimize the ‘hops’ in the user's connection with the Digimarc MediaBridge Grand Central router. The simplest way to do this is to find the Digimarc MediaBridge Grand Central router geographically closest to the user.


One approach to this goal works as follows:


The reader/detector queries a “master” router when the reader/detector application is first invoked, sending along the country or postal code from the user's computer


The “master” router matches the country or postal code to the appropriate Digimarc MediaBridge Grand Central router—the one closest to the user and sends that reply back to the reader/detector application


The reader/detector application now uses this supplied closest Digimarc MediaBridge Grand Central router for all future communications required to perform its ID to action association functions


A simple ‘hop’ map currently might look like this

    • originating user in Glenmoore, Pa. 19343. Digimarc MediaBridge Grand Central router located in Tulsa, Okla.
      • Glenmoore to Paoli, Pa. (ISP dial in connection point)
      • to Philadelphia, Pa. (Internet “hub”)
      • to Dallas, Tex. (Internet “hub”)
      • to Tulsa, Okla. (Internet “hub”)
      • to Digimarc Offices in Tulsa, Okla.


With a second Digimarc MediaBridge Grand Central router located in Philadelphia, the ‘hop’ map looks like

    • Glenmoore to Paoli, Pa. (ISP dial in connection point)
    • to Philadelphia, Pa. (Internet “hub”)
    • to Philadelphia Digimarc MediaBridge Grand Central router


If the second Digimarc MediaBridge Grand Central router is located in New York, N.Y., the ‘hop’ map looks like

    • Glenmoore to Paoli, Pa. (ISP dial in connection point)
    • to Philadelphia, Pa. (Internet “hub”)
    • to NY, N.Y. (Internet “hub”)
    • to NY Digimarc MediaBridge Grand Central router


U.S. Pat. No. 6,947,571 also disclosed methods for handling watermark-based requests from client applications based, e.g., on the watermark's “type” and “number.”


In an enhanced system, the client application can specify a router/product handler, allowing the Back Office facility to better load balance versus the associated watermark registry database. The client application can do this by appending a router name/number to the basic URL it now uses to communicate with the Back Office. Each of these “type-specific” Back Office router/product handlers can be responsible for servicing a specific, smaller portion of the entire registry database, speeding up their performance and keeping the consumer's perceived response time short.


This enhancement can be in addition to the “geographic routing” feature detailed above.


To provide a comprehensive disclosure without unduly lengthening this specification, the patents and applications cited in this specification are incorporated herein by references.


Having described and illustrated the subject technologies with reference to illustrative embodiments, it should be recognized that the invention is not so limited. For example, while the illustrative embodiment employed digital watermarking technology, the same principles can be applied in other contexts, such as bar code-based systems. Systems for linking to computer resources based on bar code indicia are shown, e.g., in U.S. Pat. Nos. 6,314,457, 6,154,738, 6,108,656, and 5,913,210.


The implementation of the functionality described above (including watermark decoding) is straightforward to artisans in the field, and thus not further belabored here. Conventionally, such technology is implemented by suitable software, stored in long term memory (e.g., disk, ROM, etc.), and transferred to temporary memory (e.g., RAM) for execution on an associated CPU. In other implementations, the functionality can be achieved by dedicated hardware, or by a combination of hardware and software. Reprogrammable logic, including FPGAs, can advantageously be employed in certain implementations.


It should be recognized that the particular combinations of elements and features in the 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.


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 embodiments are illustrative only and should not be taken as limiting the scope of the invention. Rather, I claim as my invention all such modifications as may come within the scope and spirit of the following claims and equivalents thereof.

Claims
  • 1. In a method of linking a content object with a network resource, a method comprising: presenting a content object to a reader;discerning from data obtained by the reader an identifier associated with the content object;transferring the identifier to an indexing system; andreceiving from the indexing system an internet address corresponding to said content object;the method further including:sending user data to a master system, the user data providing information related to user location;receiving from said master system an address of an indexing system close to the user location, the master system selecting the indexing system from among plural different indexing systems; andtransferring said identifier to said selected indexing system using the address.
  • 2. The method of claim 1 wherein the user data comprises a postal code.
  • 3. The method of claim 1 wherein the user data comprises a country identifier.
  • 4. The method of claim 1 wherein the user data also comprises object type data, and said identifying comprises identifying the indexing system as a function of both the user location and the object type data.
  • 5. The method of claim 1 wherein said content object comprises a printed substrate.
  • 6. A routing method for use by a router in an object-to-web linking system, comprising: receiving an object identifier sent from a client device, said identifier corresponding to a content object received on said client device;receiving a location identifier sent from a client device and identifying a location of said device;by reference to at least said location identifier, determining an address of an content object-related database system remote from said router, from several possible such database systems; andtransferring said object identifier to said determined database system.
  • 7. The method of claim 6 that further includes: receiving an object type identifier from the client device; anddetermining said address by reference to at least said location data and said object type identifier.
RELATED APPLICATION DATA

This application is a continuation of U.S. patent application Ser. No. 10/032,212, filed Dec. 20, 2001 (now U.S. Pat. No. 6,965,683) which claims priority from provisional application 60/257,822, filed Dec. 21, 2000, which are hereby incorporated by reference.

US Referenced Citations (42)
Number Name Date Kind
5444779 Daniele Aug 1995 A
5606609 Houser et al. Feb 1997 A
5901224 Hecht May 1999 A
5905800 Moskowitz et al. May 1999 A
5983351 Glogau Nov 1999 A
5987127 Ikenoue et al. Nov 1999 A
6003030 Kenner et al. Dec 1999 A
6006332 Rabne et al. Dec 1999 A
6108703 Leighton et al. Aug 2000 A
6119143 Dias et al. Sep 2000 A
6122403 Rhoads Sep 2000 A
6170014 Darago et al. Jan 2001 B1
6185598 Farber et al. Feb 2001 B1
6233684 Stefik et al. May 2001 B1
6243480 Zhao et al. Jun 2001 B1
6249226 Harrison et al. Jun 2001 B1
6269394 Kenner et al. Jul 2001 B1
6289450 Pensak et al. Sep 2001 B1
6377986 Philyaw et al. Apr 2002 B1
6430554 Rothschild Aug 2002 B1
6466329 Mukai Oct 2002 B1
6491217 Catan Dec 2002 B2
6650761 Rodriguez et al. Nov 2003 B1
6651053 Rothschild Nov 2003 B1
6675165 Rothschild Jan 2004 B1
6701369 Philyaw Mar 2004 B1
6766363 Rothschild Jul 2004 B1
6965683 Hein, III Nov 2005 B2
7240100 Wein et al. Jul 2007 B1
7293093 Leighton et al. Nov 2007 B2
20010021916 Takai Sep 2001 A1
20010021978 Okayasu et al. Sep 2001 A1
20010044824 Hunter et al. Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020032698 Cox Mar 2002 A1
20020059162 Shinoda et al. May 2002 A1
20020062382 Rhoads et al. May 2002 A1
20020075298 Schena et al. Jun 2002 A1
20020080271 Eveleens et al. Jun 2002 A1
20020152388 Linnartz et al. Oct 2002 A1
20020194480 Nagao Dec 2002 A1
20030083098 Yamazaki et al. May 2003 A1
Foreign Referenced Citations (3)
Number Date Country
WO0115021 Mar 2001 WO
WO0171517 Sep 2001 WO
WO0173586 Oct 2001 WO
Related Publications (1)
Number Date Country
20060274915 A1 Dec 2006 US
Provisional Applications (1)
Number Date Country
60257822 Dec 2000 US
Continuations (1)
Number Date Country
Parent 10032212 Dec 2001 US
Child 11280835 US