Performing social networking functions using matrix codes

Information

  • Patent Grant
  • 9092830
  • Patent Number
    9,092,830
  • Date Filed
    Wednesday, February 12, 2014
    10 years ago
  • Date Issued
    Tuesday, July 28, 2015
    9 years ago
Abstract
A matrix code reader may detect a matrix code, which may be displayed along with content and include information identifying the content. The matrix code reader may obtain user information associated with a social networking service and, based at least on the content information and the user information, may transmit an instruction to the social networking service to perform a social networking service function. The matrix code reader may obtain the user information and/or the instruction to perform the social networking service function from information included in the matrix code, from a non-transitory storage medium of the matrix code reader, from a user, and so on. In some implementations, the matrix code reader may determine that additional information or a confirmation to transmit the instructions is needed and may prompt a user for the additional information or confirmation.
Description
FIELD OF THE INVENTION

This disclosure relates generally to social networking, and more specifically to performing social network functions in response to detected matrix codes.


SUMMARY

The present disclosure discloses systems and methods for performing social networking service functions utilizing matrix codes. A matrix code reader may detect a matrix code, which may be displayed along with an instance of content and include information identifying the instance of content. The matrix code reader may obtain user information associated with a social networking service and, based at least on the information identifying the instance of content and the user information, the matrix code reader may transmit an instruction to the social networking service to perform a social networking service function. The social networking function that the social networking service is instructed to perform may be any kind of function supported by the social networking service such as posting one or more status updates regarding the instance of content, posting one or more comments regarding the instance of content, scheduling one or more events associated with the instance of content, posting at least one review of the at least one instance of content, submitting a request to join a group associated with the at least one instance of content, and so on.


The matrix code reader may obtain the user information and/or the instruction to perform the social networking service function from information included in the matrix code, from a non-transitory storage medium of the matrix code reader, from a user, and so on. If the matrix code reader obtains the user information and/or the instruction to perform the social networking service function from information included in the matrix code or the non-transitory storage medium, the matrix code reader may determine that additional information is needed. In such cases, the processing unit may prompt a user for the additional information and receive such additional information in response to the prompt. Even in situations where the matrix code reader does not determine that additional information is required, the matrix code reader may prompt a user before transmitting the instruction to the social networking service in order to confirm that the user desires the instruction to be transmitted.


In one or more implementations, the social networking service may be an independent service provider entity such as Facebook™, MySpace™, Twitter™, and so on. In other implementations, the social networking service may be software and/or hardware tools that are not part of an independent service provider entity which users set up to function as social networking services such as calendaring programs, mass email or text message lists, and so on.


In some implementations, information indicating that and instruction to perform one or more social networking service functions may be included in the matrix code and the matrix code reader may determine to transmit the instruction based on such information. However, in other implementations, the matrix code may not include any user information and the matrix code reader may be configured to select an instruction to perform a social networking function related to a captured matrix code anytime a captured matrix code includes information identifying an instance of content. Such selection may be performed by consulting defaults or user preferences stored in a non-transitory storage medium of the matrix code reader, by prompting a user, and so on.


In various implementations, the instance of content may be provided to a display device by an electronic device such as a set top box, a digital video recorder, a television tuner, a content receiver, a digital video disk player, a movie theater projection system, a home computer, and so on. The instance of content that is provided may be stored in the non-transitory storage medium, received from a content source, and so on. In some instances, the instance of content may already include the matrix code when received by the electronic device. In other instances, however, the electronic device may generate the matrix code, modify the matrix code, add the matrix code to the instance of content, and so on. In implementations where the electronic device generates or modifies the matrix code, the electronic device may obtain the information identifying the content, the user information, information regarding the instruction to perform the social networking function, and so on and may include such information in the matrix code before adding the matrix code to the instance of content.


It is to be understood that both the foregoing general description and the following detailed description are for purposes of example and explanation and do not necessarily limit the present disclosure. The accompanying drawings, which are incorporated in and constitute a part of the specification, illustrate subject matter of the disclosure. Together, the descriptions and the drawings serve to explain the principles of the disclosure.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram illustrating a system for performing social networking service functions utilizing matrix codes.



FIG. 2 is a flow chart illustrating a method for performing social networking service functions utilizing matrix codes. This method may be performed by the system of FIG. 1.



FIGS. 3A-3D are diagrams illustrating a user utilizing a system to perform social networking functions by capturing matrix codes displayed on a television. The system may be the system of FIG. 1.





DETAILED DESCRIPTION OF THE EMBODIMENTS

The description that follows includes sample systems, methods, and computer program products that embody various elements of the present disclosure. However, it should be understood that the described disclosure may be practiced in a variety of forms in addition to those described herein.


Social networking services, whether independent service provider entities (such as Facebook™, MySpace™, Twitter™, and so on) or tools that are not part of an independent service provider entity which users set up to function as social networking services (such as calendaring programs, mass email or text message lists, and so on), are increasingly becoming an integral part of how people interact with each other in the modern world. Users utilize such social networking services to maintain contact with other users, inform other users of their thoughts and events in their lives, inform themselves of the thoughts and life events of other users, and so on. Users even utilize social networking services to communicate with other users regarding their viewing of content (such as movies, television programs, and so on) which may not even be related to the social networking service which is utilized. They may communicate to others that they are viewing the content, indicate their thoughts regarding the content, determine who else has viewed the content, schedule events related to the content, and so on.


However, it may be inconvenient and burdensome for users to utilize social networking services to communicate with other social networking service users regarding their viewing of content while they are viewing such content. Frequently, users must enter information regarding the social networking service (such as information to access the social networking service, log in information, indications of which functions they wish to utilize, and so on) into a device (such as a computing device) other than the device they are utilizing to view the content (such as a television, a movie theater screen, and so on). The amount of information a user is required to enter in order to utilize the social networking service may discourage the user from utilizing the social networking service he otherwise desires to utilize. Further, such social networking service utilization may distract the user from the user's primary purpose of viewing the content.


The present disclosure discloses systems and methods for performing social networking service functions utilizing matrix codes. A user may utilize a matrix code reader device to detect one or more matrix codes. The matrix code may be displayed along with one or more instances of content that a user is viewing and include information identifying the instance of content. The matrix code reader device may obtain user information for the user that is associated with one or more social networking services. Then, based at least on the information identifying the instance of content and the user information, the matrix code reader device may transmit one or more instructions to the social networking service to perform one or more social networking service functions. Hence, users may be able to direct the performance of social networking service functions related to content they are viewing without having to enter as much information and without having to distract themselves from the content as much as they otherwise would have. Thus, it may be more convenient and less burdensome for users to utilize social networking service functions related to content that they are viewing.



FIG. 1 is a block diagram illustrating a system 100 for performing social networking service functions utilizing matrix codes. The system 100 includes one or more matrix code readers 101, one or more display devices 102, and one or more social networking service computing devices 104. The matrix code reader may be any kind of electronic device capable of detecting (or capturing) matrix codes (such as QR™ codes) such as a cellular phone, a smart phone, a tablet computer, a mobile computer, a personal digital assistant, and so on. The display device may be any kind of display device such as a movie theater screen, a television, a computer monitor, a cathode ray tube display, a liquid crystal display, and so on.


The display device 102 may display one or more instances of content. The instance of content may be content such as a television program, a movie, a commercial, an instructional video, and so on. The instance of content may also include one or more matrix codes (such as QR™ codes) which may include information identifying the instance of content (such as a title, program identifier, description, and so on).


The matrix code reader 101 may include one or more processing units 106, one or more non-transitory storage media 107 (which may take the form of, but is not limited to, a magnetic storage medium; optical storage medium; magneto-optical storage medium; read only memory; random access memory; erasable programmable memory; flash memory; and so on), one or more input/output components 108 (such as keyboards, mice, touch screens, touch pads, displays, virtual keyboards, microphones, and so on), one or more communication components 109, and one or more optical detectors 110 (such as still image cameras, video cameras, barcode readers, and so on). The processing unit may execute instructions stored in the non-transitory storage medium to detect the matrix code displayed by the display device 102. The processing unit may also execute instructions stored in the non-transitory storage medium to obtain user information associated with the social networking service associated with the social networking service computing device 104 and transmit one or more instructions to the social networking service computing device via the communication component 109 to perform one or more social network service functions based at least on the information identifying the instance of content and the user information.


The social networking function that the processing unit 106 instructs the social networking service computing device 104 to perform may be any kind of function supported by the social networking service associated with the social networking service computing device. For example, the function may include posting one or more status updates regarding the instance of content (such as a status update indicating that the user is currently watching the content), posting one or more comments regarding the instance of content (such as a comment asking whether other users are watching the instance of content), scheduling one or more events associated with the instance of content (such as scheduling a party for other users to attend after the instance of content finishes), posting at least one review of the at least one instance of content (such as an in-depth review of the instance content, an indicating that the user likes the instance of content, and so on), submitting a request to join a group associated with the at least one instance of content (such as a request to join a fan group for the instance of content, requesting to join an email list for updates related to the instance of content, and so on), and so on.


In some instances, the processing unit 106 may obtain the user information and/or the instruction to perform the social networking service function from information included in the matrix code. In other instances, the matrix code may not include the user information and/or the instruction to perform the social networking service function and the processing unit may obtain the user information and/or the instruction to perform the social networking service function from information stored in the non-transitory storage medium 107, such as information stored in one or more default settings files, information previously received from a user via the input/output component 108 and stored in one or more user preference files stored in the non-transitory storage medium, and so on. In still other instances, the processing unit may obtain the user information and/or the instruction to perform the social networking service function by prompting a user for such information and receiving such information from a user via the input/output component.


In various instances where the processing unit 106 obtains the user information and/or the instruction to perform the social networking service function from information included in the matrix code or the non-transitory storage medium 107, the processing unit may determine that additional information is needed in order to transmit the instruction to the social networking service computing device 104. In such cases, the processing unit may prompt a user for the additional information and receive such additional information in response to the prompt via the input/output component 108. For example, the user information may specify a network address for the social networking service computing device and to post a comment regarding the instance of content, but may not include the comment itself. As such, the processing unit may prompt a user for a comment regarding the instance of content and may transmit an instruction to post the comment after the comment is received from the prompted user.


Even in situations where the processing unit 106 obtains the user information and/or the instruction to perform the social networking service function from information included in the matrix code or the non-transitory storage medium 107 and does not determine that additional information is required, the processing unit may prompt a user via the input/output components 108 before transmitting the instruction to the social networking service computing device 104. For example, the user information may specify a network address for the social networking service computing device and to post a status update that a user is watching the instance of content, but the processing unit may prompt the user to confirm that he wishes the status update to be posted. The processing unit may then transmit the instruction to post the status update when the confirmation is received from the prompted user.


In some implementations, information indicating that and instruction to perform one or more social networking service functions may be included in the matrix code and the matrix code reader 101 may determine to transmit the instruction based on such information. However, in other implementations, the matrix code may not include any user information and the matrix code reader may be configured to select an instruction to perform a social networking function related to a captured matrix code anytime a captured matrix code includes information identifying an instance of content. Such selection may be performed by consulting defaults or user preferences stored in the non-transitory storage medium 107, by prompting a user via the input/output components 108, and so on.



FIG. 2 illustrates a method 200 for performing social networking service functions utilizing matrix codes. The method 200 may be performed by the electronic device 101 of FIG. 1. The flow begins at block 201 and proceeds to block 202 where the matrix code reader 101 operates. The flow then proceeds to block 203 where the processing unit 106 determines whether or not the optical detector 110 detects a matrix code that includes information specifying the content with which the matrix code is included. If so, the flow proceeds to block 204. Otherwise, the flow returns to block 202 where the matrix code reader continues to operate.


At block 204, after the optical detector 110 detects a matrix code that includes information specifying the content with which the matrix code is included, the processing unit 106 decodes the matrix code. The flow then proceeds to block 205 where the processing unit determines whether or not the matrix code includes user information related to a social networking service. If not, the flow proceeds to block 207. Otherwise, the flow proceeds to block 206.


At block 206, after the processing unit 106 determines that user information related to the social networking service is included in the matrix code, the processing unit transmits an instruction to perform a social network function based on the information specifying the instance of content and the user information to the social networking service computing device 104 that is associated with the social networking service. The flow then returns to block 202 where the matrix code reader 101 continues to operate.


At block 207, after the processing unit 106 determines that user information related to the social networking service is not included in the matrix code, the processing unit determines whether the user information is stored in the non-transitory storage medium 107 of the matrix code reader 101. If so, the flow proceeds to block 208 where the processing unit retrieves the information before the flow proceeds to block 206. Otherwise, the flow proceeds to block 209.


At block 209, after the processing unit 106 determines the user information is not stored in the non-transitory storage medium 107 of the matrix code reader 101, the processing unit prompts a user for the user information via the input/output components 108 and the flow proceeds to block 210. At block 210, the processing unit receives the user information from the prompted user via the input/output components and then the flow proceeds to block 206.


Although the method 200 illustrates and describes the matrix code reader 101 decoding the matrix code and transmitting the instruction directly to the social networking service computing device 104, other contemplated arrangements are possible without departing from the scope of the present disclosure. Returning to FIG. 1, in some implementations, the system 100 may include a matrix code computing device 115 which the matrix code reader 101 may interact with via the communication component 109 to decode the matrix code, transmit instructions to the social networking service computing device 104, and so on.


In various implementations, the instance of content may be provided to the display device 102 by an electronic device 103. The electronic device may be any electronic device such as a set top box, a digital video recorder, a television tuner, a content receiver, a digital video disk player, a movie theater projection system, a home computer, and so on. The electronic device may include one or more processing units 111 which execute instructions stored in one or more non-transitory storage media 112 to provide the instance of content to the display device via the output component 113. The instance of content that is provided may be stored in the non-transitory storage medium, received from a content source 105 (such as a cable or satellite television provider, a video on demand provider, a digital video disk physical distribution network, and so on), and so on.


In some instances, the instance of content may already include the matrix code when received by the electronic device 103. In other instances, however, the electronic device may generate the matrix code, modify the matrix code, add the matrix code to the instance of content, and so on. In implementations where the electronic device generates or modifies the matrix code, the electronic device may obtain the information identifying the content, the user information, information regarding the instruction to perform the social networking function, and so on (such as from the non-transitory storage medium, via the communication component 114, from a user, and so on) and may include such information in the matrix code before adding the matrix code to the instance of content.


While the social networking computing device 104 and the associated social networking service is illustrated and described above as an independent service provider entity such as Facebook™, MySpace™, Twitter™, and so on, other contemplated arrangements are possible without departing from the scope of the present disclosure. In various implementations, the described social networking service may include software and/or hardware tools that are not part of an independent service provider entity which users set up to function as social networking services. Such tools may include as calendaring programs, mass email or text message lists, and so on. As such, in those implementations the social networking service computing device 104 may be a computing device that is configured to support the software and/or hardware tools which the user configures to function as social networking services.



FIGS. 3A-3D illustrate a user 302A-302D utilizing a system to perform social networking functions by capturing matrix codes 308B-308D displayed on a television 304A-304D. The system may be the system 100 of FIG. 1. As illustrated in FIG. 3A, the user 302A is watching Movie XYZ which is displayed on a television screen 305A of the television 304A. Also as illustrated, the user 302A has a smart phone 301A and a desktop computer 306A which is displaying a social networking service web site on a monitor screen 307A.


In FIG. 3B, the television 304B displays a matrix code 308B along with Movie XYZ on the television screen 305B. The matrix code 308B includes information specifying that the content displayed on the television screen 305B is Movie XYZ. Additionally, the matrix code 308B includes user information that specifies a network address for the social networking service web site displayed on the monitor screen 307B, log in information associated with the social networking service web site displayed on the monitor screen 307B for the user 302B, and an indication to post a status update on the social networking service web site displayed on the monitor screen 307B that the user 302B is watching Movie XYZ.


When, as depicted in FIG. 3C, the user 302C captures the matrix code 308C with the smart phone 301C, the smart phone 303C decodes the matrix code 308C to obtain the information included in the matrix code 308C. The smart phone 303C then displays a prompt on a smart phone screen 303C asking the user 302C whether or not to post an update to the social networking service web site displayed on the monitor screen 307C that the user 302C is watching Movie XYZ.


In some instances, the user 302C may not wish to share the fact that he is watching Movie XYZ with other users of the social networking service web site displayed on the monitor screen 307C. For example, Movie XYZ may constitute adult entertainment and the user 302C may not wish to alert other social networking service users that he watches adult entertainment and may respond negatively to the prompt displayed on the smart phone screen 303C utilizing input elements of the smart phone 301C.


However, as illustrated in FIG. 3D, if the user 302D responds affirmatively to the displayed prompt, the smart phone 301D transmits an instruction to the social networking service web site displayed on the monitor screen 307D to post a status update that the user 302D is watching Movie XYZ. Additionally, the smart phone 301D displays a message on the smart phone screen 303D indicating that the status of the user 302D has been updated on the social networking service web site displayed on the monitor screen 307D to indicate that the user 302D is watching Movie XYZ.


Although FIGS. 3A-3D illustrate and describe that the information utilized to transmit the instruction to post the status update to the social networking service web site is obtained by the smart phone 301A-301D from the matrix code 308B-308D, it is understood that other contemplated arrangements are possible. One of more portions of such information may be obtained from a non-transitory storage medium (not shown) of the smart phone 301A-301D, from the user 302A-302D, and so on. Further, although FIGS. 3A-3D illustrate and describe that the smart phone 301A-301D decode the matrix code 308B-308D and transmit the instruction to update the status of the user 302A-302D to the social networking service web site displayed on the monitor screen 307D, it is understood that other contemplated arrangements are possible. The smart phone 301A-301D may transmit the captured matrix code 308B-308D to one or more backend servers which may decode the matrix code. The smart phone 301A-301D may also communicate with the backend servers to transmit the instruction to update the status of the user 302A-302D to the social networking service web site displayed on the monitor screen 307D.


In the present disclosure, the methods disclosed may be implemented as sets of instructions or software readable by a device. Further, it is understood that the specific order or hierarchy of steps in the methods disclosed are examples of sample approaches. In other embodiments, the specific order or hierarchy of steps in the method can be rearranged while remaining within the disclosed subject matter. The accompanying method claims present elements of the various steps in a sample order, and are not necessarily meant to be limited to the specific order or hierarchy presented.


The described disclosure may be provided as a computer program product, or software, that may include a non-transitory machine-readable medium having stored thereon instructions, which may be used to program a computer system (or other electronic devices) to perform a process according to the present disclosure. A non-transitory machine-readable medium includes any mechanism for storing information in a form (e.g., software, processing application) readable by a machine (e.g., a computer). The non-transitory machine-readable medium may take the form of, but is not limited to, a magnetic storage medium (e.g., floppy diskette, video cassette, and so on); optical storage medium (e.g., CD-ROM); magneto-optical storage medium; read only memory (ROM); random access memory (RAM); erasable programmable memory (e.g., EPROM and EEPROM); flash memory; and so on.


It is believed that the present disclosure and many of its attendant advantages will be understood by the foregoing description, and it will be apparent that various changes may be made in the form, construction and arrangement of the components without departing from the disclosed subject matter or without sacrificing all of its material advantages. The form described is merely explanatory, and it is the intention of the following claims to encompass and include such changes.


While the present disclosure has been described with reference to various embodiments, it will be understood that these embodiments are illustrative and that the scope of the disclosure is not limited to them. Many variations, modifications, additions, and improvements are possible. More generally, embodiments in accordance with the present disclosure have been described in the context or particular embodiments. Functionality may be separated or combined in blocks differently in various embodiments of the disclosure or described with different terminology. These and other variations, modifications, additions, and improvements may fall within the scope of the disclosure as defined in the claims that follow.

Claims
  • 1. A method for performing social networking service functions utilizing matrix codes, the method comprising: detecting, by a matrix code reader, a matrix code included in an instance of content output by a content receiver, wherein the matrix code includes identifying information and a network address of a social network service;obtaining, by the matrix code reader, user information associated with the social network service;prompting, by the matrix code reader, for additional information in order to transmit at least one instruction to perform at least one social network service function; andtransmitting the at least one instruction to perform at least one social network service function, by the matrix code reader, to the social network service based at least on the identifying information and the network address and when the additional information is received by the matrix code reader.
  • 2. The method of claim 1, wherein the user information associated with the social network service is included in the matrix code.
  • 3. The method of claim 1, wherein the matrix code detected by the matrix code reader is included in the instance of content by an electronic device prior to the electronic device transmitting the instance of content to the display device.
  • 4. The method of claim 3, wherein the user information associated with the social network service is stored by the electronic device and included in the matrix code.
  • 5. The method of claim 1, wherein the user information associated with the social network service is stored by the matrix code reader.
  • 6. The method of claim 1, wherein the at least one instruction to perform at least one social network service function is included in the matrix code.
  • 7. The method of claim 1, wherein the matrix code reader selects the at least one instruction to perform at least one social network service function in response to detecting that the matrix code includes information identifying the instance of content.
  • 8. The method of claim 1, further comprising performing at least one of decoding the matrix code by the matrix code reader or transmitting the matrix code from the matrix code reader to a matrix code decoding computing device.
  • 9. The method of claim 1, wherein the at least one instruction to perform at least one social network service function comprises at least one of posting at least one status update regarding the at least one instance of content, posting at least one comment regarding the instance of content, scheduling at least one event associated with the instance of content, posting at least one review of the instance of content, or submitting a request to join a group associated with the instance of content.
  • 10. The method of claim 1, further comprising receiving by the matrix code reader the additional information.
  • 11. A system for performing social networking service functions utilizing matrix codes, comprising: at least one display device that displays at least one instance of content which includes at least one matrix code, wherein the at least one matrix code includes identifying information and a network address of a social network service; andat least one matrix code reader device, comprising: at least one optical detector that detects the at least one matrix code displayed with the at least one instance of content by the at least one display device;at least one processing unit that obtains user information associated with the social network service;at least one input/output component that prompts for and receives additional information via user-input to confirm intent to transmit to the social network service at least one instruction to perform at least one social network service function; andat least one communication component;wherein the at least one processing unit transmits the at least one instruction to perform at least one social network service function to the social network service via the at least one communication component, based at least on the identifying information, the additional information, and the network address of the social network service.
  • 12. The system of claim 11, further comprising at least one electronic device comprising: at least one output component; andat least one electronic device processing unit that combines the at least one matrix code with the at least one instance of content and transmits the at least one instance of content including the at least one matrix code to the at least one display device.
  • 13. The system of claim 12, wherein the at least one electronic device further includes at least one non-transitory storage medium that stores the user information associated with the social network service and the at least one electronic device processing unit includes the user information in the at least one matrix code.
  • 14. The system of claim 11, wherein the at least one processing unit determines the at least one instruction by at least one of determining that the at least one matrix code includes the at least one instruction or selecting the at least one instruction in response to detecting that the at least one matrix code includes information identifying the at least one instance of content.
  • 15. The system of claim 11, the at least one instruction to perform at least one social network service function comprises at least one of posting at least one status update regarding the at least one instance of content, posting at least one comment regarding the at least one instance of content, scheduling at least one event associated with the at least one instance of content, posting at least one review of the at least one instance of content, or submitting a request to join a group associated with the at least one instance of content.
  • 16. The system of claim 11, wherein the at least one processing unit decodes the at least one matrix code.
  • 17. The system of claim 11, further comprising at least one matrix code decoding computing device wherein the at least one processing unit transmits the at least one matrix code to the least one matrix code decoding computing device via the at least one communication component and the least one matrix code decoding computing device decodes the received at least one matrix code.
  • 18. The system of claim 11, wherein the at least one processing unit obtains the user information associated with at least one social networking service from at least one of the at least one matrix code or a non-transitory storage medium of the at least one matrix code reader device.
CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 13/673,480, filed Nov. 9, 2012, now U.S. Pat. No. 8,746,554, entitled “PERFORMING SOCIAL NETWORKING FUNCTIONS USING MATRIX CODES,” which is a continuation of PCT Application No. PCT/US2011/064709, filed Dec. 13, 2011, entitled “PERFORMING SOCIAL NETWORKING FUNCTIONS USING MATRIX CODES,” which claims priority to U.S. patent application Ser. No. 12/986,721, filed Jan. 7, 2011, now U.S. Pat. No. 8,292,166, entitled “PERFORMING SOCIAL NETWORKING FUNCTIONS USING MATRIX CODES,” the entirety of which are hereby incorporated by reference for all intents and purposes.

US Referenced Citations (242)
Number Name Date Kind
4809325 Hayashi et al. Feb 1989 A
4837414 Edamula Jun 1989 A
5500681 Jones Mar 1996 A
5510603 Hess et al. Apr 1996 A
5581636 Skinger Dec 1996 A
5602377 Beller et al. Feb 1997 A
5703349 Meyerson et al. Dec 1997 A
5959285 Schuessler Sep 1999 A
5963265 Bae et al. Oct 1999 A
5978855 Metz et al. Nov 1999 A
6006990 Ye et al. Dec 1999 A
6058238 Ng May 2000 A
6263502 Morrison et al. Jul 2001 B1
6438751 Voyticky et al. Aug 2002 B1
6512919 Ogasawara Jan 2003 B2
6556273 Wheeler et al. Apr 2003 B1
6704929 Ozer et al. Mar 2004 B1
6983304 Sato Jan 2006 B2
7046161 Hayes May 2006 B2
7206029 Cohen-Solal Apr 2007 B2
7206409 Antonellis et al. Apr 2007 B2
7221405 Basson et al. May 2007 B2
7244404 Rosenberg et al. Jul 2007 B2
7328848 Xia et al. Feb 2008 B2
7349668 Ilan et al. Mar 2008 B2
7369180 Xing May 2008 B2
7373652 Bayrakeri et al. May 2008 B1
7387250 Muni Jun 2008 B2
7394519 Mossman et al. Jul 2008 B1
7424976 Muramatsu Sep 2008 B2
7443449 Momosaki et al. Oct 2008 B2
7487527 Ellis et al. Feb 2009 B2
7587601 Levy et al. Sep 2009 B2
7604172 Onogi Oct 2009 B2
7612748 Tateuchi Nov 2009 B2
7624417 Dua Nov 2009 B2
7624916 Sato et al. Dec 2009 B2
7673297 Arsenault et al. Mar 2010 B1
7797430 Ichieda Sep 2010 B2
7841531 Onogi Nov 2010 B2
8010977 Hogyoku Aug 2011 B2
8045054 Bishop et al. Oct 2011 B2
8186572 Herzig May 2012 B2
8292166 Gomez et al. Oct 2012 B2
8364018 McArdle Jan 2013 B2
8386339 Minnick et al. Feb 2013 B2
8408466 Gratton Apr 2013 B2
8427455 Matsuda Apr 2013 B2
8430302 Minnick et al. Apr 2013 B2
8439257 Beals et al. May 2013 B2
8443407 Gaede et al. May 2013 B2
8468610 Beals et al. Jun 2013 B2
8511540 Anguiano Aug 2013 B2
8534540 Gratton et al. Sep 2013 B2
8550334 Gratton et al. Oct 2013 B2
8553146 Kennedy Oct 2013 B2
8786410 Beals et al. Jul 2014 B2
8827150 Gratton et al. Sep 2014 B2
8833640 Martch et al. Sep 2014 B2
8856853 Casagrande et al. Oct 2014 B2
8875173 Kilaru et al. Oct 2014 B2
20010037297 McNair Nov 2001 A1
20010052133 Pack et al. Dec 2001 A1
20020027612 Brill et al. Mar 2002 A1
20020049980 Hoang Apr 2002 A1
20020112250 Koplar et al. Aug 2002 A1
20030018711 Imanishi Jan 2003 A1
20030050854 Showghi et al. Mar 2003 A1
20030121978 Rubin et al. Jul 2003 A1
20030151562 Kulas Aug 2003 A1
20030172374 Vinson et al. Sep 2003 A1
20040019691 Daymond et al. Jan 2004 A1
20040026508 Nakajima et al. Feb 2004 A1
20040044532 Karstens Mar 2004 A1
20040046790 Agarwal et al. Mar 2004 A1
20050011958 Fukasawa et al. Jan 2005 A1
20050015800 Holcomb Jan 2005 A1
20050015815 Shoff et al. Jan 2005 A1
20050055281 Williams Mar 2005 A1
20050059339 Honda et al. Mar 2005 A1
20050125301 Muni Jun 2005 A1
20050149967 Hanley et al. Jul 2005 A1
20050180804 Andrew et al. Aug 2005 A1
20050203854 Das Sep 2005 A1
20050262548 Shimojo et al. Nov 2005 A1
20050264694 Ilan et al. Dec 2005 A1
20060064700 Ludvig et al. Mar 2006 A1
20060071076 Tamayama Apr 2006 A1
20060079247 Ritter Apr 2006 A1
20060086796 Onogi Apr 2006 A1
20060095286 Kimura May 2006 A1
20060124742 Rines et al. Jun 2006 A1
20060196950 Kiliccote Sep 2006 A1
20060203339 Kleinberger et al. Sep 2006 A1
20060208088 Sekiguchi Sep 2006 A1
20060265731 Matsuda Nov 2006 A1
20070008344 Medina Jan 2007 A1
20070016934 Okada et al. Jan 2007 A1
20070016936 Okada et al. Jan 2007 A1
20070017350 Uehara Jan 2007 A1
20070019215 Yu Jan 2007 A1
20070063050 Attia et al. Mar 2007 A1
20070073585 Apple et al. Mar 2007 A1
20070143788 Abernathy et al. Jun 2007 A1
20070192723 Anzelde et al. Aug 2007 A1
20070206020 Duffield et al. Sep 2007 A1
20070256118 Nomura et al. Nov 2007 A1
20080022323 Koo Jan 2008 A1
20080059998 McClenny et al. Mar 2008 A1
20080062164 Bassi et al. Mar 2008 A1
20080073434 Epshteyn et al. Mar 2008 A1
20080077324 Hatano et al. Mar 2008 A1
20080082684 Gaos et al. Apr 2008 A1
20080092154 Hogyoku Apr 2008 A1
20080112615 Obrea et al. May 2008 A1
20080156879 Melick et al. Jul 2008 A1
20080182561 Kim et al. Jul 2008 A1
20080189185 Matsuo et al. Aug 2008 A1
20080200153 Fitzpatrick et al. Aug 2008 A1
20080200160 Fitzpatrick et al. Aug 2008 A1
20080201078 Fitzpatrick et al. Aug 2008 A1
20080244675 Sako et al. Oct 2008 A1
20080267537 Thuries Oct 2008 A1
20080281624 Shibata Nov 2008 A1
20080288600 Clark Nov 2008 A1
20080307348 Jones et al. Dec 2008 A1
20090029725 Kindberg Jan 2009 A1
20090031071 Chiu Jan 2009 A1
20090031373 Hogyoku Jan 2009 A1
20090070699 Birkill et al. Mar 2009 A1
20090083808 Morrison Mar 2009 A1
20090088213 Rofougaran Apr 2009 A1
20090094546 Anzelde et al. Apr 2009 A1
20090108057 Mu et al. Apr 2009 A1
20090113334 Chakra et al. Apr 2009 A1
20090154759 Koskinen et al. Jun 2009 A1
20090157511 Spinnell et al. Jun 2009 A1
20090157530 Nagamoto et al. Jun 2009 A1
20090172780 Sukeda et al. Jul 2009 A1
20090179852 Refai et al. Jul 2009 A1
20090180025 Dawson Jul 2009 A1
20090212112 Li et al. Aug 2009 A1
20090212113 Chiu et al. Aug 2009 A1
20090234570 Sever Sep 2009 A1
20090254954 Jeong Oct 2009 A1
20090293110 Koga Nov 2009 A1
20090294538 Wihlborg et al. Dec 2009 A1
20090303036 Sahuguet Dec 2009 A1
20090307232 Hall Dec 2009 A1
20090312105 Koplar Dec 2009 A1
20090320066 Soldan et al. Dec 2009 A1
20100017457 Jumpertz et al. Jan 2010 A1
20100020970 Liu et al. Jan 2010 A1
20100031162 Wiser et al. Feb 2010 A1
20100036936 Cox et al. Feb 2010 A1
20100053339 Aaron et al. Mar 2010 A1
20100081375 Rosenblatt et al. Apr 2010 A1
20100089996 Koplar Apr 2010 A1
20100096448 Melick et al. Apr 2010 A1
20100103018 Yoon et al. Apr 2010 A1
20100114715 Schuster et al. May 2010 A1
20100129057 Kulkarni May 2010 A1
20100131900 Spetalnick May 2010 A1
20100131970 Falcon May 2010 A1
20100131983 Shannon et al. May 2010 A1
20100138344 Wong Jun 2010 A1
20100149187 Slavin et al. Jun 2010 A1
20100154035 Damola et al. Jun 2010 A1
20100161437 Pandey Jun 2010 A1
20100163613 Bucher et al. Jul 2010 A1
20100201894 Nakayama et al. Aug 2010 A1
20100217663 Ramer et al. Aug 2010 A1
20100225653 Sao et al. Sep 2010 A1
20100261454 Shenfield et al. Oct 2010 A1
20100262924 Kalu Oct 2010 A1
20100262992 Casagrande Oct 2010 A1
20100272193 Khan et al. Oct 2010 A1
20100275010 Ghirardi Oct 2010 A1
20100279710 Dicke et al. Nov 2010 A1
20100295868 Zahnert et al. Nov 2010 A1
20100301115 Berkun Dec 2010 A1
20100313231 Okamoto et al. Dec 2010 A1
20100319041 Ellis Dec 2010 A1
20100327060 Moran et al. Dec 2010 A1
20110000958 Herzig Jan 2011 A1
20110007630 Almhana et al. Jan 2011 A1
20110030068 Imai Feb 2011 A1
20110039573 Hardie Feb 2011 A1
20110061003 Miyazawa et al. Mar 2011 A1
20110065451 Danado et al. Mar 2011 A1
20110087539 Rubinstein et al. Apr 2011 A1
20110107386 De Los Reyes et al. May 2011 A1
20110138408 Adimatyam et al. Jun 2011 A1
20110208710 Lesavich Aug 2011 A1
20110258058 Carroll et al. Oct 2011 A1
20110264527 Fitzpatrick et al. Oct 2011 A1
20110264530 Santangelo et al. Oct 2011 A1
20110282727 Phan et al. Nov 2011 A1
20110314485 Abed Dec 2011 A1
20120096499 Dasher et al. Apr 2012 A1
20120117232 Brown et al. May 2012 A1
20120127110 Amm et al. May 2012 A1
20120128267 Dugan et al. May 2012 A1
20120130835 Fan et al. May 2012 A1
20120130851 Minnick et al. May 2012 A1
20120131416 Dugan et al. May 2012 A1
20120137318 Kilaru et al. May 2012 A1
20120138671 Gaede et al. Jun 2012 A1
20120139826 Beals et al. Jun 2012 A1
20120139835 Morrison et al. Jun 2012 A1
20120142322 Gomez Jun 2012 A1
20120151293 Beals Jun 2012 A1
20120151524 Kilaru et al. Jun 2012 A1
20120153015 Gomez et al. Jun 2012 A1
20120153017 Bracalente et al. Jun 2012 A1
20120155838 Gerhards et al. Jun 2012 A1
20120158919 Aggarwal et al. Jun 2012 A1
20120159563 Gomez et al. Jun 2012 A1
20120168493 Worms Jul 2012 A1
20120168510 Gratton Jul 2012 A1
20120169928 Casagrande et al. Jul 2012 A1
20120175416 Gomez et al. Jul 2012 A1
20120181329 Gratton et al. Jul 2012 A1
20120182320 Beals et al. Jul 2012 A1
20120188112 Beals et al. Jul 2012 A1
20120188442 Kennedy Jul 2012 A1
20120198572 Beals et al. Aug 2012 A1
20120199643 Minnick et al. Aug 2012 A1
20120206648 Casagrande et al. Aug 2012 A1
20120215830 Anguiano Aug 2012 A1
20120217292 Gratton et al. Aug 2012 A1
20120217293 Martch et al. Aug 2012 A1
20120218470 Schaefer Aug 2012 A1
20120218471 Gratton Aug 2012 A1
20120222055 Schaefer et al. Aug 2012 A1
20120222071 Gaede et al. Aug 2012 A1
20120222081 Schaefer et al. Aug 2012 A1
20120293327 Mountain Nov 2012 A1
20130068838 Gomez et al. Mar 2013 A1
20130239157 Gaede et al. Sep 2013 A1
20140046661 Bruner Feb 2014 A1
20140076963 Gratton et al. Mar 2014 A1
Foreign Referenced Citations (37)
Number Date Country
2 634 951 Jan 2010 CA
1571503 Jan 2005 CN
101 227 581 Jul 2008 CN
10 2007 038 810 Feb 2009 DE
1 021 035 Jul 2000 EP
1 383 071 Jan 2004 EP
1 724 695 Nov 2006 EP
1 757 222 Feb 2007 EP
1 768 400 Mar 2007 EP
2 079 051 Jul 2009 EP
2 131 289 Dec 2009 EP
2 439 936 Apr 2012 EP
2 565 748 Dec 1985 FR
2 044 446 Oct 1980 GB
2 165 129 Apr 1986 GB
2 311 451 Sep 1997 GB
2 325 765 Dec 1998 GB
2 471 567 Jan 2011 GB
2002-215768 Feb 2002 JP
2007-213548 Aug 2007 JP
2008-244556 Oct 2008 JP
2004 0087776 Oct 2004 KR
299433 Mar 1997 TW
200926075 Jun 2009 TW
201032139 Sep 2010 TW
201038061 Oct 2010 TW
9527275 Oct 1995 WO
9741690 Nov 1997 WO
0106593 Jan 2001 WO
0118589 Mar 2001 WO
0158146 Aug 2001 WO
2005109338 Nov 2005 WO
2007009005 Jan 2007 WO
2009144536 Mar 2009 WO
2009057651 May 2009 WO
2010149161 Dec 2010 WO
2011009055 Jan 2011 WO
Non-Patent Literature Citations (161)
Entry
International Preliminary Report on Patentability for PCT/US2011/060002 mailed Jun. 6, 2013, 6 pages.
International Preliminary Report on Patentability for PCT/US2011/060094 mailed Jun. 20, 2013, 6 pages.
International Preliminary Report on Patentability for PCT/US2011/060121 mailed Jun. 20, 2013, 6 pages.
International Preliminary Report on Patentability for PCT/US2011/061211 mailed Jul. 4, 2013, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/061773 mailed Jun. 6, 2013, 6 pages.
International Preliminary Report on Patentability for PCT/US2011/061778 mailed Jul. 11, 2013, 6 pages.
International Preliminary Report on Patentability for PCT/US2011/060098 mailed Jun. 13, 2013, 9 pages.
International Preliminary Report on Patentability for PCT/US2011/063308 mailed Jul. 18, 2013, 9 pages.
International Preliminary Report on Patentability for PCT/US2012/022581 mailed Aug. 8, 2013, 12 pages.
International Preliminary Report on Patentability for PCT/US2012/022405 mailed Aug. 8, 2013, 7 pages.
International Preliminary Report on Patentability for PCT/US2012/024923 mailed Aug. 29, 2013, 8 pages.
International Preliminary Report on Patentability for PCT/US2012/024956 mailed Aug. 29, 2013, 7 pages.
International Preliminary Report on Patentability for PCT/US2012/025607 mailed Sep. 12, 2013, 8 pages.
International Preliminary Report on Patentability for PCT/US2012/025634 mailed Sep. 6, 2013, 5 pages.
International Preliminary Report on Patentability for PCT/US2012/026373 mailed Sep. 12, 2013, 10 pages.
International Preliminary Report on Patentability for PCT/US2012/026624 mailed Sep. 12, 2013, 12 pages.
International Preliminary Report on Patentability for PCT/US2011/060109 mailed Jun. 20, 2013, 7 pages.
Office Action of the Intellectual Property Office for ROC Patent App. No. 101101486 dated Aug. 5, 2014, 4 pages.
The First Office Action for Mexican Patent Application No. MX/a/2013/006262 is not translated into English. This document is from prosecution of the corresponding foreign matter for which we do not have a translation. Dated Aug. 7, 2014, 2 pages.
Author Unknown, “Android App Reviews & Showcase Just a Tapp Away,” Android Tapp. Accessed on Oct. 22, 2010, 10 pages. Retrieved from: http://www.androidtapp.com/download-the-weather-channel-android-app-from-your-tv.
Author Unknown, “Fox TV Uses QR Codes,” 2D Barcode Strategy, Sep. 2010. Accessed on Oct. 22, 2010, 6 pages. Retrieved from: http://www.2dbarcodestrategy.com/2010/09/fox-tv-uses-qr-codes.html.
Author Unknown, “Fox's Fringe Uses QR Code,” 2D Barcode Strategy, Oct. 2010. Accessed on Oct. 22, 2010, 4 pages. Retrieved from: http://www.2dbarcodestrategy.com/2010/10/foxs-fringe-uses-qr-code.html.
Author Unknown, “Mobile Paths: QR Codes Come to TV,” Mobile Behavior: An Omnicom Group Company, Sep. 2010. Accessed on Oct. 22, 2010, 8 pages. Retrieved from: http://www.mobilebehavior.com/2010/09/27/mobile-paths-qr-codes-come-to-tv.
Author Unknown, “What Can I Do with the Qr Barcode,” Search Magnet Local-QR Barcode Technology, Accessed on Oct. 22, 2010, 2 pages. Retrieved from: http://www.searchmagnetlocal.com/qr—barcode—technology.html.
Byford, D., “Universal Interactive Device,” International Business Machines Corporation, Jun. 1998, 1 page.
Costedio, K., “Bluefly QR Codes Debut on TV,” accessed on Oct. 22, 2010, 2 pages. Retrieved from: http://www.barcode.com/Mobile-Barcode-news/bluefly-qr-codes-debut-on-tv.html.
Extended European Search Report for EP 12152690.9 dated Jun. 6, 2012, 9 pages.
Extended European Search Report for EP 11842890.3 dated Mar. 26, 2014, 8 pages.
Extended European Search Report for EP 11850819.1 dated Mar. 17, 2014, 5 pages.
Extended European Search Report for EP 11846486 dated Mar. 26, 2014, 5 pages.
Extended European Search Report for EP 11852630 dated Jun. 30, 2014, 7 pages.
Gao, J., et al., “A 2D Barcode-Based Mobile Payment System,” Multimedia and Ubiquitous Engineering, 2009. Accessed on Oct. 22, 2010, 10 pages. Retrieved from: http://ieeexplore.ieee.org.
International Search Report and Written Opinion of PCT/US2011/059977 mailed on Mar. 19, 2012, 6 pages.
International Preliminary Report on Patentability of PCT/US2011/059977 mailed on Jun. 6, 2013, 5 pages.
International Preliminary Report on Patentability of PCT/US2012/048032 mailed on Mar. 25, 2014, 5 pages.
International Search Report and Written Opinion of PCT/US2011/60002 mailed on Feb. 15, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2011/60094 mailed on Mar. 30, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2011/60104 mailed on Mar. 29, 2012, 8 pages.
International Search Report and Written Opinion of PCT/US2011/60121 mailed on Feb. 14, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2011/61074 mailed on Jan. 6, 2012, 10 pages.
International Search Report and Written Opinion of PCT/US2011/61211 mailed on Mar. 29, 2012, 7 pages.
International Search Report and Written Opinion of PCT/US2011/61773 mailed on Feb. 21, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2011/61778 mailed on Mar. 2, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2011/63111 mailed on Apr. 4, 2012, 8 pages.
International Preliminary Report on Patentability of PCT/US2011/063111 mailed Jun. 13, 2013, 7 pages.
International Preliminary Report on Patentability of PCT/US2012/048032 mailed Apr. 3, 2014, 5 pages.
International Search Report and Written Opinion of PCT/US2011/064709 mailed on Apr. 10, 2012, 7 pages.
International Search Report and Written Opinion of PCT/US2011/060098 mailed on Mar. 29, 2012, 9 pages.
International Search Report and Written Opinion of PCT/US2011/063308 mailed on Mar. 29, 2012, 9 pages.
International Search Report and Written Opinion of PCT/US2011/068161 mailed on Jun. 14, 2012, 17 pages.
International Preliminary Report on Patentability of PCT/US2011/068161 mailed on Jul. 25, 2013, 12 pages.
International Search Report and Written Opinion of PCT/US2011/068176 mailed on Mar. 29, 2012, 13 pages.
International Search Report and Written Opinion of PCT/US2012/021657 mailed on May 23, 2012, 8 pages.
International Search Report and Written Opinion of PCT/US2012/022581 mailed on Oct. 8, 2012, 16 pages.
International Search Report and Written Opinion of PCT/US2012/022405 mailed on Apr. 19, 2012, 9 pages.
International Search Report and Written Opinion of PCT/US2012/024923 mailed on May 22, 2012, 10 pages.
International Search Report and Written Opinion of PCT/US2012/024956 mailed on Jun. 11, 2012, 8pages.
International Search Report and Written Opinion of PCT/US2012/025502 mailed Jun. 8, 2012, 11 pages.
International Preliminary Report on Patentability of PCT/US2012/025502 mailed Sep. 6, 2013, 8 pages.
International Search Report and Written Opinion of PCT/US2012/025607 mailed Jun. 8, 2012, 10 pages.
International Search Report and Written Opinion of PCT/US2012/025634 mailed on May 7, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2012/026373 mailed Jun. 13, 2012, 12 pages.
International Search Report and Written Opinion of PCT/US2012/026624 mailed Aug. 29, 2012, 16 pages.
International Search Report and Written Opinion of PCT/US2012/026722 mailed Jun. 28, 2012, 9pages.
International Search Report and Written Opinion of PCT/US2012/048032, mailed Oct. 16, 2012, 6 pages.
International Search Report and Written Opinion of PCT/US2011/060109 mailed on Feb. 14, 2012, 7 pages.
Jung, Eui-Hyun et al., “A Robust Digital Watermarking System Adopting 2D Barcode against Digital Piracy on P2P Network,” IJCSNS International Journal of Computer Science and Network Security, vol. 6, No. 10, Oct. 2006, 6 pages.
Kato et al, “2D barcodes for mobile phones”, Mobile Technology, Applications and Systems, 2005 2nd International Conference on Guangzhou, China Nov. 15-17, 2005, Piscataway, NJ, USA, IEEE, Piscataway, NJ, USA, Nov. 15, 2005, pp. 8pp-8, XP031887368, DOI: 10.1109/MTAS.2005.207166; ISBN: 978-981-05-4573-4, 8 pages.
Liu, Yue et al., “Recognition of QR code with mobile phones,” Control and Decision Conference, 2008. CCDC 2008. Jul. 2-4, 2008, pp. 203, 206, 4 pages.
Ngee, S., “Data Transmission Between PDA and PC Using WiFi for Pocket Barcode Application,” Thesis, University Teknologi Malaysia, May 2007. Accessed on Oct. 22, 2010, 126 pages. Retrieved from: http://eprints.utm.my/6421/1/SeahYeowNgeeMFKE20007TTT.pdf.
Office Action and Search Report for ROC (Taiwan) Patent Application No. 10014870 dated May 7, 2014, issued in the corresponding foreign application, 20 pages.
Office Action and Search Report for ROC (Taiwan) Patent Application No. 100142966 dated May 27, 2014, 20 pages.
Office Action for European Patent Application No. 12719817.4 dated Jun. 23, 2014 issued in the corresponding foreign application, 5 pages.
O'Sullivan, “Can Mobile Barcodes Work on TV?,” India and Asia Pacific Mobile Industry Reports, Sep. 2009. Accessed on Feb. 5, 2013, 5 pages. Retrieved from: http://gomonews.com/can-mobile-barcodes-work-on-tv.
Olson, E., “Bar Codes add Detail on Items in TV Ads,” New York Times, Sep. 2010. Accessed on Oct. 22, 2010, 3 pages. Retrieved from: http:www.nytimes.com/2010/09/27/business/media/27bluefly.html?src=busin.
Publication of PCT/US2011/059977 by the India Controller General of Patents Designs and Trademarks as India Patent Publication No. 4694/CHENP/2013 A, on Sep. 5, 2014, 1 page.
Publication of PCT/US2012/025634 by the India Controller General of Patents Designs and Trademarks as India Patent Publication No. 6967/CHENP/2013 A, on Aug. 1, 2014, 1 page.
Rekimoto, J., et al., “Augment-able Reality: Situated Communication Through Physical and Digital Spaces,” Sony Computer Science Laboratory, 2002. Accessed on Oct. 22, 2010, 8 pages. Retrieved from: Citeseer: 10.1.1.20.34[1].pdf.
Schmitz, A., et al., “Ad-Hoc Multi-Displays for Mobile Interactive Applications,” 31st Annual Conference of the European Association for Computer Graphics (Eurographics 2010), May 2010, vol. 29, No. 2, 8 pages.
Silverstein, B., “QR Codes and TV Campaigns Connect,” ReveNews, Sep. 2010. Accessed on Oct. 22, 2010, 5 pages. Found online at http://www.revenews.com/barrysilverstein/qr-codes-and-tv-campaigns-connect/.
Smith, L., “QR Barcodes Make History on Global TV,” accessed on Oct. 22, 2010, 3 pages. Retrieved from: http://lindsaysmith.com/worlds-first-mobio-mini-telethon/.
U.S. Appl. No. 12/958,073, filed Dec. 1, 2010, Office Action mailed Aug. 31, 2012, 12 pages.
U.S. Appl. No. 12/958,073, filed Dec. 1, 2010, Notice of Allowance mailed Jan. 17, 2013, 17 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action mailed Mar. 9, 2012, 17 pages.
U.S. Appl. No. 12/964,478, filed Dec. 9, 2010, Non-Final Office Action mailed Mar. 26, 2013, 19 pages.
U.S. Appl. No. 12/964,478, filed Dec. 9, 2010, Final Office Action mailed Sep. 16, 2013, 12 pages.
U.S. Appl. No. 12/971,349, filed Dec. 17, 2010, Office Action mailed Nov. 10, 2011, 9 pages.
U.S. Appl. No. 12/971,349, filed Dec. 17, 2010, Final Office Action mailed Jan. 20, 2012, 10 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Notice of Allowance mailed Jul. 16, 2014, 15 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Final Rejection mailed Oct. 30, 2012, 17 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action mailed Mar. 25, 2013, 17 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action mailed Jul. 12, 2013, 22 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action mailed Feb. 13, 2014, 21 pages.
U.S. Appl. No. 12/971,349, filed Dec. 7, 2010, Notice of Allowance mailed Oct. 2, 2013, 24 pages.
U.S. Appl. No. 12/971,349, filed Dec. 7, 2010, Final Rejection mailed Oct. 24, 2012, 11 pages.
U.S. Appl. No. 12/971,349, filed Dec. 17, 2010, Office Action mailed Jul. 16, 2012, 11 pages.
U.S. Appl. No. 12/981,244, filed Dec. 29, 2010, Office Action mailed Dec. 21, 2012, 23 pages.
U.S. Appl. No. 12/981,244, filed Dec. 29, 2010, Final Office Action mailed Oct. 30, 2013, 10 pages.
U.S. Appl. No. 12/981,244, filed Dec. 29, 2010, Notice of Allowance mailed Mar. 25, 2014, 17 pages.
U.S. Appl. No. 12/984,385, filed Jan. 4, 2011, Notice of Allowance mailed Nov. 28, 2012, 11 pages.
U.S. Appl. No. 12/984,385, filed Jan. 4, 2011, Office Action mailed Jul. 12, 2012, 16 pages.
U.S. Appl. No. 12/986,721, filed Jan. 7, 2011, Office Action mailed Mar. 16, 2012, 6 pages.
U.S. Appl. No. 12/986,721, filed Jan. 7, 2011, Notice of Allowance mailed Jun. 21, 2012, 7 pages.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Final Office Action mailed May 24, 2013, 17 pages.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Office Action mailed Oct. 7, 2012, 31 pages.
U.S. Appl. No. 13/015,382, filed Jan. 27, 2011, Office Action Mailed Nov. 13, 2012, 7 pages.
U.S. Appl. No. 13/015,382, filed Jan. 27, 2011, Notice of Allowance mailed Feb. 22, 2013, 12 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Office Action mailed Nov. 2, 2012, 18 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Final Office Action mailed Jun. 27, 2013, 13 pages.
U.S. Appl. No. 12/953,273, filed Nov. 23, 2010, Notice of Allowance, mailed Oct. 18, 2012, 11 pages.
U.S. Appl. No. 12/965,645, filed Dec. 10, 2010, Non-Final Office Action, mailed Jul. 19, 2013, 20 pages.
U.S. Appl. No. 12/965,645, filed Dec. 10, 2010, Final Office Action, mailed Mar. 18, 2014, 24 pages.
U.S. Appl. No. 12/965,645, filed Dec. 10, 2010, Notice of Allowance, mailed Jun. 20, 2014, 35 pages.
U.S. Appl. No. 12/973,431, filed Dec. 20, 2010, Non-Final Rejection mailed May 15, 2013, 30 pages.
U.S. Appl. No. 12/973,431, filed Dec. 20, 2010, Final Office Action mailed Aug. 27, 2013, 11 pages.
U.S. Appl. No. 13/007,317, filed Jan. 14, 2011, Office action mailed Dec. 19, 2012, 29 pages.
U.S. Appl. No. 13/010,557, filed Jan. 20, 2011, Final Rejection mailed Jan. 16, 2014, 17 pages.
U.S. Appl. No. 13/010,557, filed Jan. 20, 2011, Non-Final Rejection mailed Aug. 5, 2013, 17 pages.
U.S. Appl. No. 13/014,591, Notice of Allowance mailed May 24, 2013, 32 pages.
U.S. Appl. No. 13/020,678, filed Feb. 3, 2011, Office Action mailed Jul. 30, 2012, 15 pages.
U.S. Appl. No. 13/020,678, filed Feb. 3, 2011, Notice of Allowance mailed Jan. 3, 2013, 13 pages.
U.S. Appl. No. 13/007,317, Notice of Allowance mailed May 13, 2013, 16 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Office Action mailed Jan. 11, 2013, 14 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Final Office Action mailed Jul. 11, 2014, 43 pages.
U.S. Appl. No. 13/031,115, Notice of Allowance mailed Apr. 16, 2013, 24 pages.
U.S. Appl. No. 13/034,482, filed Feb. 24, 2011, Notice of Allowance mailed Aug. 29, 2014, 45 pages.
U.S. Appl. No. 13/034,482, filed Feb. 24, 2011, Final Office Action mailed Apr. 25, 2013, 19 pages.
U.S. Appl. No. 13/034,482, filed Feb. 24, 2011, Office Action mailed Oct. 19, 2012, 11 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Office Action mailed Oct. 30, 2012, 11 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Final Rejection mailed Mar. 29, 2013, 20 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Non Final Rejection mailed Mar. 6, 2014, 20 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Final Rejection mailed Aug. 27, 2014, 38 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Non-Final Office Action mailed Jun. 6, 2014, 19 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Final Office Action mailed Apr. 18, 2013, 14 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Non-Final Office Action mailed Dec. 6, 2012, 17 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011, Non-Final Office Action mailed Sep. 12, 2014, 41 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011, Final Office Action mailed May 9, 2014, 41 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011, Non-Final Office Action mailed Oct. 8, 2013, 20 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Non-Final Office Action mailed Dec. 17, 2013, 60 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Office Action mailed Jul. 18, 2012, 15 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Final Office Action mailed Jan. 31, 2013, 26 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Non-Final Office Action mailed May 15, 2013, 15 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Final Office Action mailed Sep. 12, 2013, 21 pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Office Action mailed Mar. 1, 2013, 20 pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Final Office Action mailed Oct. 16, 2013, 28 pages.
U.S. Appl. No. 13/037,312, filed Feb. 28, 2011, Office Action mailed Aug. 15, 2012, 9 pages.
U.S. Appl. No. 13/037,312, filed Feb. 28, 2011, Notice of Allowance mailed Jun. 13, 2013, 10 pages.
U.S. Appl. No. 13/037,312, filed Feb. 28, 2011, Final Office Action mailed Feb. 28, 2013, 18 pages.
U.S. Appl. No. 13/037,316, filed Feb. 28, 2011, Office Action mailed Jan. 30, 2013, 21 pages.
U.S. Appl. No. 13/037,316, filed Feb. 28, 2011, Final Office Action mailed Aug. 28, 2013, 13 pages.
U.S. Appl. No. 13/037,333, filed Feb. 28, 2011, Notice of Allowance mailed Jan. 18, 2013, 27 pages.
U.S. Appl. No. 13/192,287, filed Jul. 27, 2011, Final Office Action mailed Jan. 28, 2014, 18 pages.
U.S. Appl. No. 13/192,287, filed Jul. 27, 2011, Non Final Office Action mailed Jun. 13, 2013, 22 pages.
U.S. Appl. No. 13/673,480, filed Nov. 9, 2012, Office Action mailed Jan. 16, 2013, 27 pages.
U.S. Appl. No. 13/673,480, filed Nov. 9, 2012 Final Office Action mailed Sep. 9, 2013, 10 pages.
U.S. Appl. No. 13/673,480, filed Nov. 9, 2012 Notice of Allowance mailed Nov. 12, 2013, 16 pages.
U.S. Appl. No. 13/475,794, filed May 18, 2012 Non-Final Office Action mailed Sep. 18, 2013, 19 pages.
U.S. Appl. No. 13/968,611, filed Aug. 16, 2013, Notice of Allowance mailed May 2, 2014, 40 pages.
U.S. Appl. No. 13/968,611, filed Aug. 16, 2013, Non-Final Office Action mailed Jan. 17, 2014, 21 pages.
Yamanari, T., et al., “Electronic Invisible Code Display Unit for Group Work on Reminiscence Therapy,” Proceedings of the International MultiConference of Engineers and Computer Scientists 2009, vol. 1, IMECS 2009, Mar. 2009, 6 pages. Retrieved from: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.145.6904&rep1&type=pdf.
Yang, C., et al., “Embedded Digital Information Integrated by Video-on-Demand System,” Proceedings of the Fourth International Conference on Networked Computing and Advanced Information Management, IEEE Computer Society, 2008, 6 pages.
Related Publications (1)
Number Date Country
20140158762 A1 Jun 2014 US
Continuations (3)
Number Date Country
Parent 13673480 Nov 2012 US
Child 14179336 US
Parent PCT/US2011/064709 Dec 2011 US
Child 13673480 US
Parent 12986721 Jan 2011 US
Child PCT/US2011/064709 US