Matrix code-based user interface

Information

  • Patent Grant
  • 10015550
  • Patent Number
    10,015,550
  • Date Filed
    Monday, September 14, 2015
    10 years ago
  • Date Issued
    Tuesday, July 3, 2018
    7 years ago
Abstract
A method for presenting a matrix code may include receiving, at a content receiver, a signal carrying identifying data relating to a remotely accessible program, generating, at a content receiver, a matrix code from the identifying data relating to the remotely accessible program, transmitting the matrix code as part of a content presentation to a presentation device for display, and receiving the remotely accessible program in response to a user capture of the matrix code. A method for remotely controlling a set top box and a method for setting a recording time on a set top box are also described. A method of preparing a program guide may include gathering program information, generating matrix codes for each program including program data, and associating the matrix codes with respective programs.
Description
FIELD OF THE INVENTION

The present disclosure relates generally to an interface for television programming. More particularly, the present disclosure relates to QR codes presented on a display for scanning, where the codes have audiovisual program information stored therein.


BRIEF SUMMARY OF THE INVENTION

In one embodiment, a method for presenting a matrix code for expressing an interest in a remotely accessible program may include receiving, at a content receiver, a signal carrying identifying data relating to the remotely accessible program. The method may also include generating, at the content receiver, a matrix code from the identifying data relating to the remotely accessible program. The method may also include transmitting the matrix code as part of a content presentation to a presentation device for display. The method may further include receiving the remotely accessible program in response to a user capture of the matrix code. The method may be part of a process including scanning the matrix code, communicating with a service provider, and scheduling and downloading the remotely accessible program.


In one embodiment, a method for presenting a matrix code for expressing an interest in a remotely accessible program may include receiving, at a content receiver, a signal carrying identifying data relating to the remotely accessible program. The method may also include generating, at the content receiver, a matrix code from the identifying data relating to the remotely accessible program. The method may also include transmitting the matrix code as part of a content presentation to a presentation device for display. The method may further include receiving the remotely accessible program in response to a user capture of the matrix code. The method may be part of a process including scanning the matrix code, communicating with a service provider, and scheduling and downloading the remotely accessible program.


In another embodiment, a method of setting a recording time on a set top box may include receiving an instruction to record from a service provider, coordinating the recording time with previously scheduled recordings, and setting the set top box to record.


In still another embodiment, a method of preparing a program guide may include gathering program information, generating matrix codes for each program including program data, and associating the matrix codes with respective programs.


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 diagram illustrating a system for transmitting audiovisual content and for supporting upstream communication from a user to a television service provider, according to certain embodiments.



FIG. 2A is a flow chart illustrating a method for presenting a matrix code for expressing an interest in an on-demand program.



FIG. 2B is a flow chart illustrating an alternative method for presenting a matrix code for expressing an interest in an on-demand program.



FIG. 3 is a flow chart illustrating a method for remotely controlling a set top box.



FIG. 4 is a flow chart illustrating a method for setting a recording time on a set top box.



FIG. 5 is a flow chart illustrating a method for preparing a program guide.



FIG. 6 is a flow chart illustrating a method for receiving and updating a program guide.





DETAILED DESCRIPTION OF THE INVENTION

The description that follows includes sample systems and methods 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.


Audiovisual programming generally involves transmitting signals carrying audiovisual content to a receiver. Generally, the audiovisual content includes streams of data supporting several viewable programs at any given time. As such, the signals may be processed and the audiovisual content may be selectively displayed on a presentation device by, for example, selecting a particular channel. Although a receiver may not be set to a particular channel, it receives data for several channels. In this manner, service providers may allow users to have flexibility in what they watch without requiring that the user communicate information to the service provider. However, in the case of pay-per-view, video-on-demand, and other types of viewing, it can be beneficial for the user to be able to communicate with the provider. In some cases, for example, a satellite set top box may be connected to a phone line to order pay-per-view movies, shows, or events. In other cases, a set top box may have an Internet connection. In these cases, the phone line or Internet connection may allow the user to communicate upstream to the television service provider and initiate changes to the audiovisual content available to them.


The present disclosure relates to systems and methods for communicating with a television provider as well as methods associated with modifying and/or scheduling the viewing or storing of audiovisual content. In some embodiments, the system includes a satellite configured to receive transmissions and instructions from a satellite provider.


The methods, in some embodiments, involve producing a matrix code, such as a QR code, and associating the matrix code with programming promoting audiovisual content that is remotely accessible. That is, the programming may include an advertisement, the audiovisual content may be a TV show or movie, and the audio visual content may be remotely accessible from a service provider via on-demand programming, for example. A user may scan the code using, for example, a smartphone when viewing the advertisement. The code may include information and instructions for a smartphone to communicate with the satellite service provider to schedule the download of the advertised TV show or movie to the user's set top box for later on-demand viewing. In other embodiments, the code may include information and instructions for their smartphone to communicate with the satellite service provider to unlock or otherwise release controls on a pay-per-view channel, out-of-package channel, or other channel for immediate viewing. In another embodiment, a QR code may be produced and associated with a television program. The QR code may be viewable in an electronic program guide and may be visually associated with the television program. In this embodiment, a user may scan the code when viewing the program guide. The code may include information and instructions for a smartphone, or other reader device, to communicate with the television service provider to, in turn, send an instruction to the user's set top box to schedule a recording of the television program. Other embodiments and variations of those mentioned will be described below.


Referring now to FIG. 1, a sample system 100 for performing the methods described herein is shown. As shown, the system 100 may include a receiver 102 for receiving audiovisual programs and instructions from a service provider. The system 100 may also include a presentation device 104 for displaying the programs. The system 100 may also include a reader 106 for reading information displayed on the presentation device 104, typically in the form of a matrix code 140. The reader may be in communication with a network 108 supported by one or more servers 110 for processing the information captured from presentation device 104.


The receiver 102 may be configured to receive a signal carrying a broadcast television program, a program guide, a menu, a movie or other audiovisual content. The receiver 102 may further be configured for transmitting the content to the presentation device 104 for viewing. As such, the receiver 102 may be in the form of a set top box 116 or a satellite system as shown including a dish 112, cabling 114 leading to the set top box 116, and cabling 118 leading to the presentation device 104, for example. Other examples of a receiver 102 may include an antenna system employing an analog or digital antenna connected by cabling leading either to a television receiver or directly to the presentation device 104. Still other examples may include a cable system including an incoming cable leading directly to a presentation device 104 or to a presentation device via a set top box.


In some embodiments, the receiver 102 may be configured to convert, configure, or otherwise modify the display prior to transmitting it to the presentation device for viewing. The receiver may further be configured for storing and displaying audiovisual content. The receiver may thus be in the form of a computer-type device having one or more processing units 120, one or more inputs 122, one or more outputs 124, and one or more computer readable storage media 126 (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; non-transitory storage media; and so on).


In some embodiments, these computer-type elements may be incorporated into a set top box 116 for receiving a broadcast, program guide information, audio and video streams, other audiovisual content, or other information. The set top box 116 may receive the information through the one or more inputs 122, process or store the incoming information, and selectively output information to the presentation device 104 for viewing and interaction by a viewer. For example, the viewer may select which television channel they would like to watch, select from time-shifted television programs stored in the storage medium, or select movies from a video-on-demand menu, for example. In another example, the viewer may navigate an electronic program guide or other series of menus, which may be output to the presentation device 104. Instructions executed by the processor 120 may be stored in the storage medium 126 or received through the one or more inputs 122 or both. The set top box 120 may include a remote control 128 for remote interaction with the viewer.


The presentation device 104 may include one or more inputs 130 for receiving information from the receiver and an electronic device 132 for receiving information from the one or more inputs 130 and transmitting the information to a display screen, speaker, or other output 134. The presentation device 104 may be a television, computer monitor, or other device for presenting a viewer with visual and/or audio stimuli.


The reader 106 may be a remote device configured for optically scanning information from the presentation device 104. The reader 106, like the receiver 102 described above, may also be a computer-type device having one or more inputs, a processor, a computer readable storage medium, and one or more outputs. One of the inputs of the reader 106 may include an optical receiver configured for receiving and recording light patterns. The optical receiver may be a digital optical receiver similar to that found in digital cameras and some mobile phones. In some embodiments, the reader 106 may be in the form of a personal digital assistant (PDA), a portable computing device, a tablet computer, a smartphone and the like. The reader 106 may receive image input, for example, from the optical receiver and the processor may access processing instructions for the image from the computer readable storage medium. That is, in some embodiments, the reader 106 may have decoding software stored in the storage medium for decoding matrix codes. In some embodiments, the software may include an auto run feature when a matrix code is scanned. The processor may process the image produced by the optical receiver and may follow additional instructions produced by the processing of the image.


The reader 106 may have Internet access capability via a wireless telephone network, hardwired connection, WiFi access, or another network connection. In following instructions provided by the storage medium or, for example, from a processed image, the reader 106 may access the Internet or other network 108 and conduct additional activities by interacting with web-based systems 110 or other network connected systems 110.


The network connected systems or servers 110 may include web servers connected to a network (e.g., the Internet) for supporting web sites or other web interfaces. The network connected systems or servers 110 may also include the computers, systems, or servers of a television service provider. For example, the receiver 102 may be configured to receive information via satellite from the server 110 of a respective television service provider. As such, a full-circle system of information transfer may be provided, as shown best in FIG. 1.


Having described a system 100 upon which the current methods may be performed, reference is now made to FIGS. 2-4, which each illustrate a portion of a process for using matrix codes displayed in programming content to express interest in or purchase a remotely accessible program, such as an on-demand program. For example, programming content in the form of an advertisement or television commercial may be embedded in a television program and the advertisement may relate to a movie, for example, that is available via an on-demand service provided by the television service provider. A viewer of the advertisement may scan the matrix code in the advertisement with a smartphone, for example, and the smartphone may communicate via a network to the service provider that the user is interested in the advertised movie via the on-demand system. Accordingly, the television service provider may schedule the movie to be downloaded to the user's set top box. As such, the next time the user accesses the on-demand features of his system, the advertised movie may be available for them to purchase and watch in an on demand manner. The method 200 of FIG. 2A or the method 250 shown in FIG. 2B may perform part of this larger process by generating a matrix code containing information regarding an on-demand program and displaying it in an advertisement. FIGS. 3 and 4 may relate to the responsive processes of scheduling and downloading the video.


Before discussing the operations performed in the method, additional information is provided with regard to the programming content, the matrix codes included therein, and the information in the matrix codes. The programming content may be in the form of commercials embedded in a television program or placed in spaces within a television program that interrupt programming. Other programming content may include banner ads that scroll or otherwise appear at a bottom, top, side, or corner of a screen, for example, during programming or while viewing a program guide, menu, or other display available from a service provider. That is, the program guide, for example, may be designed to stream advertisements while a viewer is reviewing or scrolling through the guide. Other menus, such as time-shifted program menus, on-demand menus, or others may also be designed to stream advertisements while a viewer is viewing the menu. Still other advertisements may include standing or intermittent logos present during programming, on the program guide, menu, or other display. Still other advertisements may include pop up ads appearing to the viewer.


The programming content may include a matrix code, such as a QR code, that is presented to the user for viewing and/or capturing, such as scanning with a reader 106. The matrix code may be visible throughout the advertisement or it may appear for a portion thereof. In some embodiments, a prompt may be incorporated into the advertisement indicating when the matrix code will appear so that a viewer may be ready to scan the code. The prompt may suggest that additional information about the advertised program may be available or the prompt may indicate that scanning the code may make the program available in the user's on-demand menu. In systems where on-demand programs require purchase, the prompt may suggest that scanning the code will make the program available in an on-demand menu for later purchase, while other embodiments may suggest that scanning the code will cause the program to be purchased. In the latter embodiment, controls may be put in place on the user's account for verifying the smartphone or other reader 106 that is scanning the code to prevent third party viewers from purchasing programs and charging the account holder.


An exemplary matrix code 140, as depicted in FIG. 1, is a two-dimensional display (such as a QR code) defining patterns and regions that embody data, similar to a bar code. The matrix code 140 may take the form of alternating black and white elements, such as squares or other geometric shapes. The two-dimensional nature of the display may generally allow for more data to be stored than a typical bar code. While the present disclosure is related to the use of two-dimensional matrix codes 140, other data storing/displaying images or systems may also be used. For example, holographic images allowing for three-dimensional storage of data may be used, as may changing images that allow for recording and/or display of information over time. Each of these and other methods for storing information in a display may be used and are considered to be included in the term “matrix code” 140.


The matrix codes 140 in the present embodiment may store advertisement data and/or identifying data. The advertisement data may relate to the content of the advertised movie or on-demand program, while the identifying data may pertain to, for example, the title of the on-demand program in addition to the account information of the user. The advertisement data may, for example, include a Uniform Resource Locator (URL) allowing the reader 106 to access a corresponding website via the Internet 108. The website may include additional information regarding the on-demand program. For example, the additional information may include movie trailers, additional advertisements, related products, games, coupons, or other information or incentives relating to the advertised on-demand program. Unrelated information or products may also be provided. In other embodiments, the advertisement data may include executable code that, when processed by the reader 106, causes the reader 106 to execute the program and perform an activity. For example, the executable code may run an advertisement on the reader 106 that is the same or different from the advertisement from which the matrix code was scanned or a movie trailer may be played on the reader. In other embodiments, the scanned code may include a link to download related applications such as games, for example. Other types of advertisement data may be included in the matrix code 140 and may be particularly configured to entice viewers of television to scan the codes when viewing advertisements. The enticement may be by way of additional information, applications, convenience, or other benefits flowing to the viewer who scans the matrix code.


The advertisement data may be supplied by the advertiser. For example, a producer of a movie may develop, or have developed, an advertisement for its movie. At the time of developing the advertisement, a matrix code 140 and any associated prompts, highlights, or other features to encourage viewers to scan the matrix code 140 may be included in the advertisement. When a network or other program providing entity assembles programming they may include the advertisement in their programming. Accordingly, the receiver in the system above may receive the advertisement together with the program or other audiovisual content being provided by the broadcasting network. In other embodiments, a television service provider such as a satellite or cable provider may coordinate the inclusion of advertisements in a program or in a program guide or other menu. Without more, the advertisement may run with the program or menu and, if scanned by a viewer, the advertisement data may be decoded and actions may be taken by the reader 106 according to the advertisement data.


In other embodiments, the advertisement data may be pre-supplied to the receiver 102, which in turn may generate a matrix code to be displayed with the advertisement. That is, the receiver 102 may include advertisement data corresponding to a list of known advertisers stored in the computer readable storage medium 126. For example, the receiver 102 may have a URL address stored in a database and associated with a corresponding advertiser. When the receiver 102 receives a signal that includes advertisements for the advertiser, the receiver 102 may overlay the particular advertisement with a matrix code 140. The matrix code 140 may include the stored advertisement data, such as the URL address. Thus, where advertisers have not supplied their own matrix codes 140 with advertisement data, the receiver 102 may be capable of doing so. In still other embodiments, the matrix code 140 with advertisement data may be provided by a television network or a satellite service, cable service, or other television service provider.


As indicated, the matrix code 140 presented on the presentation device 104 may also include identifying data in addition to the advertisement data. The identifying data may include information about the account holder such as an account number and a set top box identifier such as a serial number, access card number, or other box identifying information. The identifying data may also include a movie title or other identifying information about the on-demand movie, program, show, or other audiovisual content. That is, in addition to the title, other identifying information may include the type of content such as movie or television show or series, movie genre, or other category information to assist the on-demand provider with identifying the correct on-demand program. In some cases, the identifying data may also include whether the user has expressed interest in an on-demand program or whether they have authorized the purchase of the program.


The identifying data may also include instructions to be performed by the reader 106 to allow the identifying data to be communicated to the television provider for scheduling and downloading of the on-demand content. For example, the identifying data may include instructions for the receiver to generate an e-mail, text, telephone call, or other transmission to transmit the identifying data to a server 110 having processing instructions stored thereon. Other instructions included in the identifying data may include URL information for the reader 106 to access the Internet and provide the identifying information to a server 110 via a website or other network interface.


The identifying data may be supplied by the receiver 102 and may be stored in the computer readable storage medium 126 thereof. The receiver 102 may be associated with a television service provider such as a satellite or cable provider. Accordingly, the receiver 102 may have information stored therein about the associated account holder and/or its location and may further include information regarding the particular set top box being used, such as a serial number, access card number, or other distinguishing box information. This identifying data may be stored in a computer readable storage medium 126 within the box 116 and be available for including in the matrix code. The identifying data relating to the on-demand program may be taken from the advertisement data by the receiver 102. For example, when an incoming advertisement includes a matrix code with advertisement data, the receiver 102 may read the matrix code and pull the title of the on-demand program from the provided matrix code. In other embodiments, for example, when a television service provider is inserting advertisements into spaces within programs, the service provider may tag particular ads with identifying information allowing the receiver 102 to read and store the information as identifying data for use in a matrix code.


The receiver 102 may generate and insert a matrix code 140 in an advertisement that does not already have a matrix code or the matrix code 140 of an advertisement already having a matrix code 140. When the matrix code 140 is not already provided, the receiver 102 may analyze the incoming stream and read, for example, movie titles associated with commercials and other identifying data from metadata in the stream, data on the storage medium, and the like. The receiver 102 may then generate a matrix code 140 and insert it, together with any prompts or other information, concurrently with the advertisement. This may include providing a banner along the bottom, top, side, or corner of a display during the advertisement that displays the matrix code and, optionally, further instructs the viewer to scan the code with, for example, their smartphone. When the matrix code 140 is already provided in an advertisement, the receiver 102 may modify or replace the matrix code 140 such that it may include the identifying data. This may involve modification of the matrix code 140 such that the advertisement data in the code 140 remains and the identifying data is read from the computer readable storage medium 126 and added to the matrix code 140. The modified matrix code 140 may then be shown in place of the originally provided matrix code 140. In some embodiments, the receiver 102 may read the matrix code 140 and create a new matrix code 140 including the advertisement data provided by the advertisers matrix code 140 and the identifying data provided by the receiver 102. The receiver 102 may then overlay the new matrix code 140 over the advertiser supplied matrix code 140 for display to the viewer. This latter approach may allow a television service provider to exercise more control over the appearance and capability of matrix codes 140 displayed by their service. This may allow for proprietary forms of matrix codes 140 to be used by several television service providers.


In each of the above cases when a matrix code 140 is provided and is modified, or when a matrix code 140 is absent and is produced, the receiver 102 may rely on matrix code software stored therein. The software may include a matrix code development module for developing matrix codes and incorporating data therein. The software may further include a matrix code decoding software for decoding matrix codes already present in a program. The software may also include a matrix code editing module for modifying or editing matrix codes 140 to add or remove data therefrom.


With this background regarding programming content, matrix codes, and the data stored therein, the methods 200 and 250 may be described in more detail. The methods 200 and 250 may be performed by all or a portion of the system 100 of FIG. 1. The method may also be performed by other systems.


Referring to FIG. 2A, the receiver 102 may receive a signal carrying one or more matrix codes associated with an identifier (202). For example, a service provider may pre-assemble a plurality of matrix codes 140 and associate them with identifiers. The matrix codes 140 and identifiers may be stored in a database. The operation depicted in box 202 may involve receiving a data transmission including the data in the database from a service provider. In one embodiment, for example, each of the matrix codes 140 may relate to or contain identifying data of an on-demand movie title and each code may be associated with a particular identifier. The codes 140 may have additional identifying data and may also include advertiser data as described above. Having received the one or more matrix codes 140 associated with an identifier, the receiver 102 may store the codes 140 and identifiers in a computer readable storage medium 126. This process of receiving data including matrix codes 140 and identifiers may occur on an ongoing basis where the stored data is continually updated, or the process may occur periodically, such as overnight for example. Either way, the process may be intended to continually prepare the set top box 116, for example, to receive programming content carrying instructions to retrieve the stored matrix codes 140.


With continued reference to FIG. 2A, the receiver 102 may receive a signal carrying programming content (206), such as a television advertisement, for example. The signal carrying the programming content may include a data stream, a video stream, and an audio stream. In the data stream, or otherwise, the programming content may include instructions for the receiver 102 to retrieve a particular matrix code 140 in addition to instructions on what to do with the matrix code 140. For example, the data stream of the programming content may instruct the receiver 102 to retrieve a particular matrix code 140 by providing a particular identifier to the receiver 102 and instructing the receiver to retrieve the associated matrix code 140. The programming content may further include instructions on how, when, and where to display the matrix code. For example, when the programming content is a 30 second television commercial, the instruction may direct the receiver to display the retrieved matrix code in 20 seconds lasting for 10 seconds thereby presenting the matrix code for the last 10 seconds of the television commercial. In other cases, the instruction may direct the receiver 102 to display the code 140 immediately and throughout the length of the commercial. In still other embodiments, the instructions may direct the receiver 102 to display the code 140 at the beginning and end of the commercial. In addition to temporal instructions, the instruction may also indicate where on the screen to display the matrix code 140 so as to suitably appear within the programming content. In some embodiments, the instruction may include directing the receiver 102 to display a prompt or other pop-up for encouraging or enticing a user to capture the matrix code 140 with a reader 106.


Having received the instruction from the data stream or other portion of the programming content, the receiver 102 may retrieve the designated matrix code (210). Where the instructions include an identifier, for example, the receiver 102 may search the stored matrix codes 140 and identifiers and retrieve the matrix code 140 associated with the identifier matching that provided by the programming content. Having retrieved the matrix code 140, the receiver 102 may then follow the additional instructions provided by the programming content to output the matrix code 140 and/or other content to the presentation device (212). The preloaded matrix codes 140 and identifiers may allow the receiver 102 to react in real time to incoming programming content allowing matrix codes 140 to be included in programming content without delay, interruption, or loss of content. As is described with respect to FIGS. 3 and 4 below, the matrix code 140 may be captured by a user and the identifying data from the code 140 may be communicated to a service provider including instructions to download a particular on-demand program, for example, to a user's set top box for the option to purchase the on-demand program.


Turning now to the embodiment shown in FIG. 2B, the receiver 102 may receive a signal carrying a programming content (252), such as an advertisement, for example. The received signal, like operation (206) above, may be any programming content signal and may have advertisements, or spaces for advertisements, incorporated therein. For example, the signal may be a television broadcast signal carrying a live program or it may be a signal carrying a program guide or other menu. As such, the signal received by the receiver 102 may include several forms and may be carrying at least one of several types of audiovisual content.


Having received a signal carrying programming content (252), the receiver 102 may temporarily store the content (254) in a computer readable storage medium 126 and may further search the advertisement for a matrix code (256). Depending on whether an initial matrix code is present, the receiver may generate a matrix code 140, or choose not to, by performing differing operations (258). For example, when an initial matrix code is present, the receiver 102 may generate a matrix code 140 by first utilizing a decoding software module stored on the storage medium to decode and read the initial matrix code. The receiver 102 may analyze the read data to determine if the advertisement relates to an on-demand program. This may occur by comparing a program title found in the initial matrix code to a database of on-demand programs available from a television service provider. If the advertisement relates to an on-demand program, the receiver 102 may then rely on an editing software module to generate a matrix code 140 by modifying the initial matrix code to include identifying data (260). Once modified, the advertisement with the modified matrix code 140 may be temporarily stored (264) as a revised advertisement.


In another example, when an initial matrix code is not present, the receiver 102 may process any associated, tagged, or other information defining the nature of the advertisement. That is, without a matrix code in the advertisement, other options may be used to determine the nature of the advertisement and further determine, for example, if it relates to a movie or other program and the title of the program. Such information may be obtained from advertisement metadata, for example. When a program title is identified, the title may be compared to, for example, a database of on-demand programs available from a television service provider. If the advertisement relates to an on-demand program, the receiver may generate a matrix code 140. In this example, the receiver 102 may also provide advertisement data by searching a database associated with receiver 102 or accessed via a network such as the Internet for advertisement data consistent with the advertisement in the broadcast. For example, the receiver 102 may obtain a Web address for a producer of a movie advertised in the advertisement. The receiver 102 may then rely on a matrix code development module to produce a matrix code 140 including both the searched for advertisement data and the identifying data (262). Once the matrix code 140 is compiled, it may be associated with the advertisement and the advertisement may be temporarily stored as a revised advertisement (264). In both of the above cases, the advertisement with the generated matrix code may then be output to the presentation device (266).


Once a program including matrix codes 140 has been output to a presentation device 104, a viewer may scan a matrix code when it is presented on the presentation device 104. The matrix code 140 may have advertisement data and/or identifying data stored therein. The viewer may direct the optical receiver portion of a reader 106 toward the presentation device 104 when the presentation device 104 is displaying a matrix code 140. The viewer may then actuate the optical receiver by, for example, depressing a shutter button. The reader 106 may thus capture an image of the matrix code 140. In some embodiments, the viewer may zoom, focus, or otherwise direct the reader toward the portion of the presentation device displaying the matrix code.


As mentioned above, the reader 106 may include an auto run feature causing the reader 106 to begin the decoding process when a matrix code 140 has been captured. In other cases, the viewer may deliberately select software resident on the reader 106 and direct the software to decode the captured image of the matrix code 140. The software may decode the image thus producing the advertisement data and the identifying data. Depending on the nature of the data, the processor may automatically follow instructions provided by the advertisement and/or identifying data. For example, when the reader 106 has Internet connectivity, the advertisement data may include instructions for the processor to launch a web browser and browse to a particular URL address causing a website with information relating to the advertisement to appear on a display of the reader 106. The viewer may then view the website and interact with the website as desired. The identifying data may include instructions for the processor to compile and send an e-mail, text, or other communication to an on-demand server for requesting the on-demand program advertised. The communication may be received by the on-demand server and the identifying data contained in the communication may be used to schedule and download the advertised on-demand program to the set top box of the user.


Referring now to FIG. 3, a method for scheduling and downloading a requested on-demand program is shown. It is noted that on-demand programming often occurs by storing several programs locally in the computer readable storage medium of a user's set top box. As such, once selected, paid for, or otherwise receiving authorization, the user may have the program streamed from their set top box to their presentation device. The locally stored nature of the data allows the program to be played immediately, without downloading, and avoids buffering and other difficulties with data streaming over wider networks. However, set top boxes may have a limited amount of storage and while a television provider may have access to large numbers of movies and other on-demand programs, they may not be able to make them all available via an on-demand service due to lack of storage space available on users' set top boxes. Accordingly, in some circumstances, television service providers periodically review the on-demand selections available on users' set top boxes and update the available selections. This commonly occurs during overnight hours and involves deleting old selections from the set top box and downloading new ones to the set top box. In this manner, a television service provider may keep the on-demand options available to its users fresh and new while also making a wider range of selections available than the set top box is capable of storing at a given time.


Operations described herein may allow a television service provider to tailor the selections available in a user's on-demand menu by receiving expressions of interest from the user. Accordingly, and turning again to FIG. 3, the server or other system 110 of the television service provider may receive a transmission (302) from the reader 106. The transmission, as suggested by the method 200 and the subsequent discussion regarding the reader 106 scanning the matrix code, may include identifying data regarding a user and an on-demand program the user may be interested in or has chosen to purchase. The server 110 may thus search the on-demand programs stored in a database to locate the associated on-demand program. The server 110 may then schedule a time to send a signal (304) to the user's receiver 102 for storing the program in the user's computer readable storage medium 126 and reflecting the availability of the program in the user's on-demand menu. It is noted that the scheduled time may be immediate or it may be delayed and schedule for overnight hours, for example. Other times may be selected depending on the practices of the television service provider, the expectations of the user, and other factors. The server 110 may also select a channel, frequency, or other band defining mode for sending the signal to the set top box 116. In addition, the server 110 may develop an instruction (306) for the user's set top box 116 to schedule a recording at the corresponding time and on a corresponding channel. Alternatively, to provide the server 110 with flexibility regarding when to send the signal, the instruction to the set top box 116 may be more flexible and may, instead include instructions for the set top box 116 to watch for an incoming signal having the on-demand content and to record the content when the signal is transmitted. Once the instruction is developed, the server 110 may transmit the instruction (308) to the user's receiver 102. The server may then transmit the content (310) to the user for recording by the receiver 102 at the scheduled time or, when the receiver 102 can be flexible as to the time of the transmission, the server 110 may transmit the content when it is convenient, feasible, or efficient. In some embodiments, the transmission of the instruction to schedule a recording (308) and the transmission of the content (310) may occur substantially simultaneously. That is, the instruction to record may be sent (308) and may be immediately followed by the transmission of the content. (310) In still other embodiments, the transmission (310) and the recording (308) may occur in segments.


Referring now to FIG. 4, a user's receiver 102 may receive the instruction (402) from the television service provider's server and the receiver 102 may set itself to record (406) based on the instruction. As indicated, this may include setting the set top box 116 to record a particular channel at a particular time. In some embodiments, the set top box 116 may coordinate the recording (404) by conducting a recording conflict check. That is, the set top box 116 may include a plurality of scheduled recordings based on the user's preferences for television programming. In this embodiment, the set top box 116 may review whether it has other programs scheduled for recording at the time instructed by the server 110. Where conflicts are found, the set top box 116 may communicate via phone line, Internet, or other network connection that this time conflicts with other recordings and the time may thus be adjusted and coordinated to avoid missing a planned recording. In still other embodiments, where a conflict is found, a pop-up may be presented to a user on the presentation device 104 that indicates that a scheduled on-demand download is in conflict with a scheduled recording and the user may choose to cancel the on-demand download or cancel the previously scheduled recording. In still other embodiments, the user may be provided with the option to instruct rescheduling of the on-demand download. In still other embodiments, the prompt to the user on the display device may include presenting a matrix code 140 having the conflict information allowing the user to scan the code 140 for communicating to the service provider. The receiver 102 may then receive a transmission (408) from the server 110 of the television service provider including the on-demand content and the receiver 102 may record (410) or otherwise store the content in the computer readable storage medium 126. The set top box 116 may also update the on-demand menu to reflect the availability of the newly recorded on-demand program.


This overall process including the method for generating a matrix code 200, the method for scheduling and downloading an on-demand program 300, and the method for coordinating and recording the on-demand program 400 may be advantageous for several reasons. For example, the process may allow a television service provider to make on-demand programs available to a user that the provider is substantially certain the user is interested in. Moreover, the provider may further monitor the expressions of interest from their users and may be better equipped to tailor the on-demand selections available to the user beyond programs where a specific expression of interest was provided. That is, where a user expresses an interest in a program by scanning a matrix code in an advertisement for an action film, for example, the provider may weight that user's on-demand selections more toward action films. Other profiling techniques may be used to attempt to tailor users' on-demand menus to their particular interests.


Turning now to FIGS. 5 and 6, another embodiment of a method for communicating upstream to modify or change content available to a user is shown. The methods shown in FIGS. 5 and 6 may be part of a larger process using matrix codes appearing in an electronic programming guide. This process may include a television service provider preparing the program guide, generating matrix codes relating to the programs in the guide, and associating the codes with the programs in the guide as shown in method 500 of FIG. 5. The program guide containing the matrix codes may then be transmitted to a user. In some embodiments, the matrix codes 140 may be provided by a set top box 116 rather than by the television service provider, as shown in FIG. 6. In either case, the matrix codes 140 within the program guide may be scanned by a reader 106 and information stored therein may be transmitted to the service provider by the reader. Methods similar to those described with respect to FIGS. 3 and 4 may also be used as part of this larger process to control the content available to a user. In one embodiment, for example, the matrix code produce by method 500 or 600 may include identifying data relating to the program and instructions to record the program on an ongoing basis. The reader 106 may scan the code and communicate the instruction to the service provider. The service provider, similar to the operations shown in FIG. 3, may develop an instruction to record and transmit the instruction to a user's set top box 116. Similar to FIG. 4, the set top box may receive the instruction, conduct any coordination, and record the program.


With particular reference to FIG. 5, a method 500 for preparing a program guide is shown. As shown, a television service provider may receive program data from one or more networks (502). The program data may include program titles, the date and time of the scheduled airing of the program, and any other descriptive information regarding the program. The service provider may compile the several programs and create an electronic program guide (504) reflecting the several channels that may be available to its users and the programs that may be available on each respective channel at particular times.


The service provider may generate a matrix code 140 for each program within the guide (506). The matrix code 140 may be generated with matrix code development software and configured to store several types of information. In this embodiment, the matrix code may include program data such as the name of the television program or other identifier and the date, time, and channel that the television program is scheduled to air. The program data may include descriptive information regarding the program and the particular episode that is scheduled to air. In addition, the program data may include URL links to network web sites offering episode selection, products, or other information relating to the program. Other program data may also be included.


The matrix code 140 generated may also include instructions. For example, the matrix code 140 may be intended to allow a user to schedule recording of the program or series of programs associated with the matrix code 140. In other embodiments, it may be intended for allowing storage of the information about the program for sharing with others. In still other embodiments, the matrix code 140 may be intended to display the information on a reader 106 or execute a program on the reader 106 or access a website. As such, the matrix code 140 may include one or more instructions that instructs the reader 106 on how to proceed having scanned the matrix code 140.


The matrix code 140 having the program data may be associated with its respective television program (508) and arranged in a manner to reflect association therewith. For example, the matrix code may be placed just behind or just in front of the program title in the menu. In other embodiments, the program guide may be configured to reveal additional information about the program when selected by a user with, for example, their remote control. In this embodiment, the matrix code 140 may not appear in the general guide, but may appear when additional information is revealed after selection by the user. In other embodiments, the matrix code 140 may be available in both the general menu and in a more detailed view. The prepared program guide may then be transmitted to the user (510). The transmission may include periodic transmissions allowing the program to be updated with additional programs and information and to reflect changes in programming.


Referring to FIG. 6, a method of displaying the program guide 600 may be provided. In this embodiment, a receiver 102 may receive the program guide (602) from the service provider transmission. In this embodiment, for example, where the program guide includes matrix codes 140 having program data, the receiver may generate a matrix code for each program (604), by updating the already present codes 140 with user information. That is, for example, the receiver 102 may read account information and/or set top box data such as a serial number or access card data from one or more computer readable storage media contained therein. The receiver may include matrix code software for reading, editing, and/or creating matrix codes, and the receiver may modify the matrix code 140 already present in the guide to include information specific to the user. As such, the resulting matrix codes 140 may be associated with particular programs and may include program data, instructions, and user information. This step of updating the matrix codes 140 with the user information may occur each time an updated program guide is transmitted by the service provider (510) and received by the receiver (602). The set top box 116 may then display the guide (608) when instructed to do so by a user. For example, the user may instruct the set top box 116 to display the guide using a remote control or control on the set top box 116.


In other embodiments of the method 600, for example, the service provider may compile the program guide, but may not provide the matrix codes 140. In this embodiment, the receiver 102 may be configured to generate matrix codes (604) by creating them. In this embodiment, the generation of the matrix codes 140 may be more involved than that described above. That is, rather than updating the matrix codes 140 with user information, the present embodiment may include creating matrix codes 140 that include program data, instructions, and user information. In this embodiment, the receiver 102 may receive the program guide (602). The receiver 102 may then read the program guide information from the program guide and develop and store program data. The receiver 102 may have instructions for what a reader 106, for example, should do with the code data stored therein. In addition, as above, the receiver may have account information and/or set top box information also stored therein. Accordingly, having read the program guide information, the receiver 102 may generate a matrix code (604) for each program in the guide including program data, instructions, and user information. The receiver 102 may also associate each matrix code (606) with its respective program and arrange the matrix code 140 visually within the guide to appear associated with the program. Each time an updated program guide is received from the service provider or at some interval thereof, the receiver 102 may generate the matrix codes (604) and associate them with the programs (606) in the guide. As with the above embodiment, the set top box 116 may display the guide (608) when instructed to do so by a user.


In either of the above embodiments, a user may scan a matrix code within the program guide with a reader 106. As with previous embodiments, the reader 106 may store the data and may require action by the user to do something with the read data or the reader 106 may include an auto run feature allowing the code 140 to be automatically decoded, for example. In some embodiments, the data read by the reader 106 may be stored therein and may be viewable on the reader 106. In some embodiments, the stored data, particularly the program data portion thereof, may be sent via text or data message or e-mailed to a friend along with comments about the show. For example, where a user want to notify a friend of an upcoming showing of a program, they may do so by scanning the matrix code 140 from their program guide and communicating the program data to the friend.


In other embodiments, the instruction portion of the data stored in the matrix code 140 may include instructions to access a website, send a text message, or otherwise communicate to the service provider an interest in recording the show in the guide. Where the service provider receives such a transmission, the methods 300 and 400 may be used to schedule the user's set top box 116 to record. However, the aspect of method 300 relating to scheduling the download may be omitted. That is, if the program is present in a program guide, the date, time, and channel of the airing may already be scheduled. As such, the aspect of method 300 regarding developing an instruction and transmitting an instruction to the user may be used. The several operations of method 400 may be used to receive the instruction, coordinate the instruction, set the box 116 to record, and record the showing.


In still other embodiments, the instruction portion of the data stored in the matrix code 140 may be to access a website for example available via the program data. In this embodiment, for example, the reader may access a URL address associated with the program and available in the program data portion of the matrix code 140. The reader 106 may connect to the Internet, navigate to the URL address, and allow the user to interact with the website. The user may, for example, select online episodes to view, watch trailers, or otherwise interact with a website featuring the respective television program.


In still other embodiments, a combination of the above processes for scanning and using the matrix code 140 data may be provided. Likewise, multiple matrix codes 140 may be provided for each program depending on the intended use of the information in the matrix code 140. For example, one matrix code 140 may be used if the user would like to set their set top box 116 to record just the shown episode. Another matrix code 140 may be used if the user would like to set their set top box 116 to record a series. Still a further matrix code 140 may be provided if the user would just like to receive additional information about the program, for example. In other embodiments, the instruction portion of the code data may include instructions to prompt the user with a question of their intention. As such, once scanned with a reader 106, the user may be prompted with a question such as, “Just this episode or entire series?” The user's response to the prompt may be included in the communication to the service provider allowing the service provider to develop a suitable instruction for sending to the user's set top box 116. In still other embodiments, the multiple matrix codes 140 may include data relating to how many episodes to save and for how long to save the episodes. Other common questions regarding recording television programs may be avoided by having matrix codes 140 configured to cause recording in a certain manner. In other embodiments, the user may be able to control the type of matrix codes available for scanning by selecting from setup options available on their set top box 116.


The methods 500 and 600 relating to generating matrix codes for an electronic programming guide may be advantageous for several reasons. For example, the availability of a matrix code 140 in the program guide may make it convenient for a user to set their set top box to record. This may be particularly true where multiple programs are being recorded. Additional advantages associated with allowing for additional information or sharing with friends may also be realized.


It is noted here that while matrix codes in advertisements have been described as being configured for expressing interest in on-demand programming, other uses may also be available. That is, a matrix code in an advertisement for an upcoming television show may allow for scanning thereof, communication to a service provider, and recording of the show or series. Similarly, a matrix code in an advertisement may also be used to express interest in or purchase pay-per-view programs by communicating to the service provider instructions to allow access to a pay-per-view channel where a program may be streamed on a repeating basis. In addition, while matrix codes in the program guide have been described for use with respect to scheduled programming, they may also be used to order or purchase on-demand programming or pay-per-view programming.


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 operations in the methods disclosed are examples of sample approaches. In other embodiments, the specific order or hierarchy of operations in the method can be rearranged while remaining within the disclosed subject matter. The accompanying method claims present elements of the various operations 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, comprising: transmitting, by a television service provider server, television programming to a television receiver device over a television network;receiving, by the television service provider server, a communication from a mobile device, the communication containing identifying data associated with the television receiver device and program information;in response to the communication received from the mobile device: (a) searching, by the television service provider server, a database to locate a program corresponding to the program information received from the mobile device;(b) generating, by the television service provider server, an instruction for the television receiver device to record the program, wherein the instruction corresponds to an instruction for the television receiver device to detect a predetermined signal associated with the program, and to record the program in response to detecting the predetermined signal; and(c) transmitting, by the television service provider server, the instruction for the television receiver device to detect the predetermined signal associated with the program and to record the program in response to detecting the predetermined signal, to the television receiver device over the television network;after transmitting the instruction to the television receiver device, determining, by the television service provider server, a time to transmit the program to the television receiver device;in response to the arrival of the determined time to transmit the program to the television receiver device, transmitting, by the television service provider server, the predetermined signal to the television receiver device at the determined time; andtransmitting, by the television service provider server, the program to the television receiver device after the transmission of the predetermined signal.
  • 2. The method of claim 1, wherein the program information received from the mobile device includes data identifying an on-demand program.
  • 3. The method of claim 1, wherein the communication received from the mobile device further comprises user account information associated with the television receiver device.
  • 4. The method of claim 1, wherein the program information received from the mobile device includes scheduling information of a program already scheduled for recording by the television receiver device.
  • 5. A television provider server, comprising: a first wireless network interface configured to receive wireless signals from one or more mobile devices;a second network interface configured to transmit television signals to one or more television receiver devices over a television network;one or more processors; andmemory communicatively coupled with and readable by the one or more processors and having stored therein processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: transmit television programming to a television receiver device over the television network;receive a communication from a mobile device, the communication containing identifying data associated with the television receiver device and program information;in response to the communication received from the mobile device: (a) search a database within the television provider server to locate a program corresponding to the program information received from the mobile device;(b) generate an instruction for the television receiver device to record the program, wherein the instruction corresponds to an instruction for the television receiver device to detect a predetermined signal associated with the program, and to record the program in response to detecting the predetermined signal; and(c) transmit the instruction for the television receiver device to detect the predetermined signal associated with the program and to record the program in response to detecting the predetermined signal, to the television receiver device over the television network;after transmitting the instruction to the television receiver device, determine a time to transmit the program to the television receiver device;in response to the arrival of the determined time to transmit the program to the television receiver device, transmit the predetermined signal to the television receiver device at the determined time; andtransmit the program to the television receiver device after the transmission of the predetermined signal.
  • 6. The television provider server of claim 5, the memory having stored therein additional processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: determine a time to transmit the instruction to the television receiver device, wherein the determined time is based on a determination of network traffic patterns associated with the television network.
  • 7. A system, comprising: a television receiver device, comprising: one or more processors; andmemory communicatively coupled with and readable by the one or more processors and having stored therein processor-readable instructions which, when executed by the one or more processors, cause the television receiver device to: receive a first signal carrying matrix code data associated with a matrix code stored by the television receiver device; andgenerate the matrix code as part of a content presentation to a presentation device for display;a mobile device, comprising: one or more processors; andmemory communicatively coupled with and readable by the one or more processors and having stored therein processor-readable instructions which, when executed by the one or more processors, cause the mobile device to: scan the matrix code displayed via the presentation device;generate a communication to a television provider server based on scanned matrix code; andtransmit the communication to the television provider server in response to scanning the matrix code; andthe television provider server, comprising: one or more processors; andmemory communicatively coupled with and readable by the one or more processors and having stored therein processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: transmit television programming to the television receiver device over a television network;receive the communication from the mobile device, the communication containing identifying data associated with the television receiver device and program information;in response to receiving the communication from the mobile device: (a) search a database within the television provider server to locate a program corresponding to the program information received from the mobile device;(b) generate an instruction for the television receiver device to record the program, wherein the instruction corresponds to an instruction for the television receiver device to detect a predetermined signal associated with the program, and to record the program in response to detecting the predetermined signal; and(c) transmit the instruction for the television receiver device to detect the predetermined signal associated with the program and to record the program in response to detecting the predetermined signal, to the television receiver device over the television network;after transmitting the instruction to the television receiver device, determine a time to transmit the program to the television receiver device;in response to the arrival of the determined time to transmit the program to the television receiver device, transmit the predetermined signal to the television receiver device at the determined time; andtransmit the program to the television receiver device after the transmission of the predetermined signal.
  • 8. The method of claim 1, wherein generating and transmitting the record instruction to the television receiver device comprises: determining a delayed time at which to schedule the transmission of the record instruction to the television receiver device; andtransmitting the record instruction to the television receiver device at the determined delayed time.
  • 9. The method of claim 8, wherein the delayed time at which to schedule the transmission of the record instruction to the television receiver device is determined based on the determined patterns of network traffic over the television network.
  • 10. The method of claim 1, further comprising: determining the time to transmit the program to the television receiver device, based on an efficiency calculation for the program transmission;after determining the time to transmit the program to the television receiver device, transmitting the signal to the television receiver device at the selected time; andtransmitting the program to the television receiver device following the transmission of the signal.
  • 11. The method of claim 1, further comprising: selecting, by the television service provider server, a channel over which to transmit the signal to the television receiver device; andtransmitting the signal to the television receiver device over the selected channel.
  • 12. The method of claim 1, further comprising: determining a plurality of time slots to transmit segments corresponding to the program, to the television receiver device;transmitting a plurality of signals to the television receiver device, wherein each of the plurality of signals is transmitted at the corresponding determined time slot; andtransmit a single segment of the program to the television receiver device following the transmission of one of the plurality of signals.
  • 13. The television provider server of claim 5, the memory having stored therein additional processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: determine a delayed time at which to schedule the transmission of the record instruction to the television receiver device; andtransmit the record instruction to the television receiver device at the determined delayed time.
  • 14. The television provider server of claim 13, wherein the delayed time at which to schedule the transmission of the record instruction to the television receiver device is determined based on the determined patterns of network traffic over the television network.
  • 15. The television provider server of claim 5, the memory having stored therein additional processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: determine the time to transmit the program to the television receiver device, based on an efficiency calculation for the program transmission;after determining the time to transmit the program to the television receiver device, transmit the signal to the television receiver device at the selected time; andtransmit the program to the television receiver device following the transmission of the signal.
  • 16. The television provider server of claim 5, the memory having stored therein additional processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: select a channel over which to transmit the signal to the television receiver device; andtransmit the signal to the television receiver device over the selected channel.
  • 17. The television provider server of claim 5, the memory having stored therein additional processor-readable instructions which, when executed by the one or more processors, cause the television provider server to: determine a plurality of time slots to transmit segments corresponding to the program, to the television receiver device;transmit a plurality of signals to the television receiver device, wherein each of the plurality of signals is transmitted at the corresponding determined time slot; andtransmit a single segment of the program to the television receiver device following the transmission of one of the plurality of signals.
RELATED APPLICATIONS

The present application also claims priority to and is a divisional application of U.S. patent application Ser. No. 12/973,431, filed Dec. 20, 2010, entitled “MATRIX CODE-BASED USER INTERFACE,” the entire contents of which are incorporated herein by reference for all purposes.

US Referenced Citations (319)
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
5929849 Kikinis Jul 1999 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
6766956 Boylan et al. Jul 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
7818675 Maruyama et al. Oct 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
8327403 Chilvers Dec 2012 B1
8364018 McArdle Jan 2013 B2
8380993 Chen et al. Feb 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
8640956 Gomez Feb 2014 B2
8746554 Gomez et al. Jun 2014 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
8886172 Gomez Nov 2014 B2
8931031 Schaefer Jan 2015 B2
9092830 Gomez et al. Jul 2015 B2
9148686 Gerhards et al. Sep 2015 B2
9280515 Gaede et al. Mar 2016 B2
9329966 Dugan et al. May 2016 B2
9367669 Gratton Jun 2016 B2
9571888 Casagrande et al. Feb 2017 B2
9596500 Gomez et al. Mar 2017 B2
9652108 Mountain May 2017 B2
9686584 Gaede et al. Jun 2017 B2
9736469 Schaefer et al. Aug 2017 B2
9781465 Kilaru et al. Oct 2017 B2
9792612 Dugan et al. Oct 2017 B2
20010037297 McNair Nov 2001 A1
20010052133 Pack et al. Dec 2001 A1
20020011521 Lahey et al. Jan 2002 A1
20020027612 Brill et al. Mar 2002 A1
20020049980 Hoang Apr 2002 A1
20020065728 Ogasawara May 2002 A1
20020082931 Siegel et al. Jun 2002 A1
20020112250 Koplar et al. Aug 2002 A1
20020195495 Melick et al. Dec 2002 A1
20030018711 Imanishi Jan 2003 A1
20030050854 Showghi et al. Mar 2003 A1
20030077065 Scholten et al. Apr 2003 A1
20030112974 Levy Jun 2003 A1
20030121978 Rubin et al. Jul 2003 A1
20030125092 Burnhouse et al. Jul 2003 A1
20030151562 Kulas Aug 2003 A1
20030172374 Vinson et al. Sep 2003 A1
20040005900 Zilliacus Jan 2004 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
20040049672 Nollet et al. Mar 2004 A1
20040133907 Rodriguez Jul 2004 A1
20040226042 Ellis Nov 2004 A1
20040260850 Yu et al. Dec 2004 A1
20050009564 Hayaashi et al. Jan 2005 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
20050097618 Arling et al. May 2005 A1
20050107135 Deeds et al. May 2005 A1
20050125301 Muni Jun 2005 A1
20050149967 Hanley et al. Jul 2005 A1
20050163483 Rassool Jul 2005 A1
20050180804 Andrew et al. Aug 2005 A1
20050203854 Das Sep 2005 A1
20050258250 Melick et al. Nov 2005 A1
20050262548 Shimojo et al. Nov 2005 A1
20050264694 Ilan et al. Dec 2005 A1
20060064700 Ludvig et al. Mar 2006 A1
20060065733 Lee et al. Mar 2006 A1
20060071076 Tamayama Apr 2006 A1
20060079247 Ritter Apr 2006 A1
20060086796 Onogi Apr 2006 A1
20060090179 Hsu et al. Apr 2006 A1
20060095286 Kimura May 2006 A1
20060124742 Rines et al. Jun 2006 A1
20060174317 Onomatsu et al. Aug 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
20070011709 Katz et al. 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 Abernethy et al. Jun 2007 A1
20070159522 Neven Jul 2007 A1
20070174198 Kasahara Jul 2007 A1
20070192723 Anzelde et al. Aug 2007 A1
20070200335 Tuschel Aug 2007 A1
20070205596 Mizuno et al. Sep 2007 A1
20070206020 Duffield et al. Sep 2007 A1
20070256118 Nomura et al. Nov 2007 A1
20070288594 Philyaw et al. Dec 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
20080263621 Austerlitz et al. Oct 2008 A1
20080267537 Thuries Oct 2008 A1
20080281624 Shibata Nov 2008 A1
20080285944 Tsunokawa Nov 2008 A1
20080288460 Poniatowski et al. 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
20090116074 Wilsher May 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
20090196456 Bisti et al. Aug 2009 A1
20090200367 Arnouse Aug 2009 A1
20090212112 Li et al. Aug 2009 A1
20090212113 Chiu et al. Aug 2009 A1
20090234570 Sever Sep 2009 A1
20090250512 Deck et al. Oct 2009 A1
20090254954 Jeong Oct 2009 A1
20090293088 Mukerji et al. Nov 2009 A1
20090293110 Koga Nov 2009 A1
20090294538 Wihlborg et al. Dec 2009 A1
20090300673 Bachet et al. Dec 2009 A1
20090303036 Sahuguet Dec 2009 A1
20090307232 Hall Dec 2009 A1
20090307719 Clark et al. Dec 2009 A1
20090312105 Koplar Dec 2009 A1
20090320066 Soldan et al. Dec 2009 A1
20100001072 Onogi Jan 2010 A1
20100004984 Beyabani Jan 2010 A1
20100017457 Jumpertz et al. Jan 2010 A1
20100020970 Liu et al. Jan 2010 A1
20100026721 Park et al. Feb 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
20100131373 Kubasov 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
20100169935 Abbruzzese Jul 2010 A1
20100186025 Thomas Jul 2010 A1
20100188514 Sato et al. Jul 2010 A1
20100201894 Nakayama et al. Aug 2010 A1
20100205628 Davis 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
20100272420 Soohoo 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
20110058516 Small et al. Mar 2011 A1
20110061003 Miyazawa et al. Mar 2011 A1
20110065451 Danado et al. Mar 2011 A1
20110083154 Boersma Apr 2011 A1
20110087539 Rubinstein et al. Apr 2011 A1
20110107374 Roberts et al. May 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
20110296046 Arya et al. Dec 2011 A1
20110314485 Abed Dec 2011 A1
20110321114 Newell Dec 2011 A1
20120075529 Wong et al. Mar 2012 A1
20120084206 Mehew et al. Apr 2012 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
20120311623 Davis et al. Dec 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
20140158762 Gomez et al. Jun 2014 A1
20170366806 Schaefer et al. Dec 2017 A1
20180007415 Kilaru et al. Jan 2018 A1
Foreign Referenced Citations (68)
Number Date Country
2 634 951 Jan 2010 CA
1352765 Jun 2002 CN
1571503 Jan 2005 CN
1636371 Jul 2005 CN
1675930 Sep 2005 CN
1839398 Sep 2006 CN
101 227 581 Jul 2008 CN
101253504 Aug 2008 CN
101 355 685 Jan 2009 CN
101 409 027 Apr 2009 CN
101 873 467 Oct 2010 CN
101 894 113 Nov 2010 CN
101 895 722 Nov 2010 CN
103221963 Jul 2013 CN
23 36 711 Feb 1975 DE
10 2007 038 810 Feb 2009 DE
1 768 400 Mar 2007 EM
1 021 035 Jul 2000 EP
1 383 071 Jan 2004 EP
1 555 808 Jul 2005 EP
1 724 695 Nov 2006 EP
1 757 222 Feb 2007 EP
1 831 747 Sep 2007 EP
2 079 051 Jul 2009 EP
2 131 289 Dec 2009 EP
2 439 936 Apr 2012 EP
2 643 769 Oct 2013 EP
2 643 793 Oct 2013 EP
2 565 748 Dec 1985 FR
2 929 467 Oct 2009 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
4698CHENP2013 Jun 2016 IN
7734CHENP2013 Jun 2016 IN
2000-222116 Aug 2000 JP
2002-215768 Aug 2002 JP
3929450 Jun 2007 JP
2007-213548 Aug 2007 JP
2008028583 Feb 2008 JP
2008-244556 Oct 2008 JP
2008-276716 Nov 2008 JP
2009-140204 Jun 2009 JP
2004 0087776 Oct 2004 KR
299433 Mar 1997 TW
200915193 Apr 2009 TW
200926075 Jun 2009 TW
201032139 Sep 2010 TW
201038061 Oct 2010 TW
201043039 Dec 2010 TW
9527275 Oct 1995 WO
9741690 Nov 1997 WO
0106593 Jan 2001 WO
0118589 Mar 2001 WO
0158146 Aug 2001 WO
2004019442 Mar 2004 WO
2005109338 Nov 2005 WO
2007009005 Jan 2007 WO
2009056897 May 2009 WO
2009057651 May 2009 WO
2009116954 Sep 2009 WO
2009144536 Dec 2009 WO
2010149161 Dec 2010 WO
2011009055 Jan 2011 WO
2012071176 May 2012 WO
2012071174 May 2012 WO
Non-Patent Literature Citations (279)
Entry
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.
“Android App Reviews & Showcase Just a Tapp Away,” Android Tapp, 10pp. Found online at http://www.androidtapp.com/download-the-weather-channel-android-app-from-your-tv/, Oct. 22, 2010.
O'Sullivan, “Can Mobile Barcodes Work on TV?,” India and Asia Pacific Mobile Industry Reports, Sep. 2009, 4 pp. Found online at http://gomonews.com/can-mobile-barcodes-work-on-tv/, Feb. 5, 2013.
“FOX TV Uses QR Codes,” 2D Barcode Strategy, Sep. 2010, 6 pp. Found online at http://www.2dbarcodestrategy.com/2010/09/fox-tv-uses-qr-codes.html, Oct. 22, 2010.
“FOX's Fringe Uses QR Code,” 2D Barcode Strategy, Oct. 2010, 4 pp. Found on the Internet at http://www.2dbarcodestrategy.com/2010/10/foxs-fringe-uses-qr-code.html, Oct. 22, 2010.
“Mobile Paths: QR Codes Come to TV,” Mobile Behavior: An Omnicom Group Company, Sep. 2010, 8 pp. Found online at http://www.mobilebehavior.com/2010/09/27/mobile-paths-qr-codes-come-to-tv, Oct. 22, 2010.
“What Can I Do with the QR Barcode,” Search Magnet Local-QR Barcode Technology, 2 pp. Found online at http://www.searchmagnetlocal.com/qr_barcode_technology.html, Oct. 22, 2010.
Byford, D., “Universal Interactive Device,” International Business Machines Corporation, Jun. 1998, 1 page.
Costedio, K., “Bluefly QR Codes Debut on TV,” 2 pp. Found online at http://www.barcode.com/Mobile-Barcode-news/bluefly-qr-codes-debut-on-tv.html, Oct. 22, 2010.
First Examination Report from European Patent Office dated May 18, 2015 for EP 11849496.2, 7 pages.
Extended European Search Report for EP 12152690.9 dated Jun. 19, 2012, 9 pages.
European Office Action for EP 12716751.8 dated Nov. 11, 2015, 4 pages.
Extended European Search Report for EP 11842890.3 dated Mar. 26, 2014, 8 pages.
European Office Action for EP 11842890.3 dated Mar. 13, 2015, 8 pages.
Extended European Search Report for EP 11850819.1 dated Mar. 17, 2014, 5 pages.
Office Action for EP 11850819.1 dated Nov. 12, 2015, 4 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.
Office Action from European Patent Office for Application No. 11852630.0 dated May 12, 2015, 7 pages.
European Search Report for EP 11844504 dated Feb. 24, 2015, 10 pages.
European Search Report for EP 11855065 dated Mar. 6, 2014, 6 pages.
Office Action for EP 11855065 dated Mar. 13, 2015, 6 pages.
First Office Action by the Mexican Institute of Industrial Property for Mexican Patent Application No. MX/a/2013/009881 dated Aug. 14, 2014, 3 pages.
Notice of Allowance by the Mexican Institute of Industrial Property for Mexican Patent Application No. MX/a/2013/009881 dated Jan. 12, 2015, 1 page.
Gao, J., et al., “A 2D Barcode-Based Mobile Payment System,” Multimedia and Ubiquitous Engineering, 2009, 10 pp. Found online at http://ieeexplore.ieee.org/Xplore/login.jsp?url=http%3A%2F%2Fieeexplore.ieee.org%2Fie . . . , Oct. 22, 2010.
International Search Report and Written Opinion of PCT/US2011/059977 dated Mar. 19, 2012, 7 pages.
International Preliminary Report on Patentability of PCT/US2011/059977 dated Jun. 6, 2013, 6 pages.
International Preliminary Report on Patentability of PCT/US2012/048032 dated Apr. 3, 2014, 6 pages.
International Search Report and Written Opinion of PCT/US11/60002 dated Feb. 15, 2012, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/060002 dated Jun. 6, 2013, 6 pages.
International Search Report and Written Opinion of PCT/US11/60094 dated Mar. 30, 2012, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/060094 dated Jun. 20, 2013, 6 pages.
International Search Report and Written Opinion of PCT/US11/60104 dated Mar. 29, 2012, 9 pages.
International Search Report and Written Opinion of PCT/US2011/60121 dated Feb. 14, 2012, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/060121 dated Jun. 20, 2013, 6 pages.
International Search Report and Written Opinion of PCT/US11/61074 dated Jan. 6, 2012, 11 pages.
International Search Report and Written Opinion of PCT/US11/61211 dated on Mar. 29, 2012, 8 pages.
International Preliminary Report on Patentability for PCT/US2011/061211 dated Jul. 4, 2013, 7 pages.
International Search Report and Written Opinion of PCT/US11/61773 dated Feb. 21, 2012, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/061773 dated Jun. 6, 2013, 6 pages.
International Search Report and Written Opinion of PCT/US11/61778 dated Mar. 2, 2012, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/061778 dated Jul. 11, 2013, 6 pages.
International Search Report and Written Opinion of PCT/US11/63111 dated Apr. 4, 2012, 9 pages.
International Preliminary Report on Patentability of PCT/US2011/063111 dated Jun. 13, 2013, 8 pages.
International Search Report and Written Opinion of PCT/US2011/064709 dated Apr. 10, 2012, 8 pages.
International Search Report and Written Opinion of PCT/US2011/060098 dated Mar. 29, 2012, 10 pages.
International Preliminary Report on Patentability for PCT/US2011/060098 dated Jun. 13, 2013, 9 pages.
International Search Report and Written Opinion of PCT/US2011/063308 dated Mar. 29, 2012, 10 pages.
International Preliminary Report on Patentability for PCT/US2011/063308 dated Jul. 18, 2013, 9 pages.
International Search Report and Written Opinion of PCT/US2011/068161 dated Jun. 14, 2012, 19 pages.
International Preliminary Report on Patentability of PCT/US2011/068161 dated Jul. 25, 2013, 13 pages.
International Search Report and Written Opinion of PCT/US2011/068176 dated Mar. 29, 2012, 15 pages.
International Search Report and Written Opinion of PCT/US2012/021657 dated May 23, 2012, 12 pages.
International Search Report of PCT/US2012/022581 dated Oct. 8, 2012, 18 pages.
International Preliminary Report on Patentability for PCT/US2012/022581 dated Aug. 8, 2013, 12 pages.
International Search Report and Written Opinion of PCT/US2012/022405 dated Apr. 19, 2012, 11 pages.
International Preliminary Report on Patentability for PCT/US2012/022405 dated Aug. 8, 2013, 7 pages.
International Search Report and Written Opinion of PCT/US2012/024923 dated May 22, 2012, 12 pages.
International Preliminary Report on Patentability for PCT/US2012/024923 dated Aug. 29, 2013, 8 pages.
International Search Report and Written Opinion of PCT/US2012/024956 dated Jun. 11, 2012, 10 pages.
International Preliminary Report on Patentability for PCT/US2012/024956 dated Aug. 29, 2013, 7 pages.
International Search Report and Written Opinion of PCT/US2012/025502 dated Jun. 8, 2012, 13 pages.
International Preliminary Report on Patentability of PCT/US2012/025502 dated Sep. 6, 2013, 9 pages.
International Search Report and Written Opinion of PCT/US2012/025607 dated Jun. 8, 2012, 13 pages.
International Preliminary Report on Patentability for PCT/US2012/025607 dated Sep. 12, 2013, 8 pages.
International Search Report and Written Opinion of PCT/US2012/025634 dated May 7, 2012, 8 pages.
International Preliminary Report on Patentability for PCT/US2012/025634 dated Sep. 6, 2013, 5 pages.
International Search Report and Written Opinion of PCT/US2012/026373 dated Jun. 13, 2012, 14 pages.
International Preliminary Report on Patentability for PCT/US2012/026373 dated Sep. 12, 2013, 10 pages.
International Search Report and Written Opinion of PCT/US2012/026624 dated Aug. 29, 2012, 14 pages.
International Preliminary Report on Patentability for PCT/US2012/026624 dated Sep. 12, 2013, 12 pages.
International Search Report and Written Opinion of PCT/US2012/026722 dated Jun. 28, 2012, 11 pages.
International Search Report and Written Opinion of PCT/US2012/048032, dated Oct. 16, 2012, 14 pages.
International Search Report and Written Opinion of PCT/US2011/060109 dated Feb. 14, 2012, 7 pages.
International Preliminary Report on Patentability for PCT/US2011/060109 dated Jun. 20, 2013, 7 pages.
First Examination Report from European Patent Office dated Feb. 4, 2015 for EP 12716751.8, 4 pages.
First Office Action for CN 201180065044.7 dated Feb. 13, 2015 by the State Intellectual Property Office (SIPO), 4 pages.
Second Office Action for CN 201180065044.7 dated Sep. 9, 2015 by the State Intellectual Property Office (SIPO), 23 pages.
Office Action from European Patent Office for Application No. 12716728.6 dated Feb. 26, 2015, 5 pages.
Notice of Allowance and search report for ROC (Taiwan) Patent Application No. 101106288 dated May 29, 2015, 9 pages.
Office Action of the Intellectual Property Office for ROC Patent App. No. 101101486 dated Aug. 5, 2014, 4 pages.
Office Action of the Intellectual Property Office for ROC Patent App. No. 100143194 dated Sep. 23, 2014, 10 pages.
Office Action of the Intellectual Property Office for ROC Patent App. No. 100142978 dated Sep. 23, 2014, 9 pages.
Office Action from State Intellectual Property Office for CN Appln. No. 201180056242.7 dated Jun. 17, 2015, 10 pages.
U.S. Appl. No. 13/968,611, filed Aug. 16, 2013, Notice of Allowance dated May 2, 2014, 40 pages.
The First Office Action dated Sep. 11, 2014 for Mexican Patent Application No. MX/a/2013/007672 is not translated into English, 2 pages.
The Second Office Action dated Jun. 1, 2015 for Mexican Patent Application No. MX/a/2013/007672 is not translated into English, 2 pages.
The First Office Action dated Jul. 13, 2015 for Mexican Patent Application No. MX/a/2013/009791 is not translated into English, 2 pages.
Office Action dated Nov. 12, 2014 for Mexican Patent Application No. MX/a/2013/009794, 2 pages.
Notice of Allowance dated Feb. 18, 2015 for Mexican Patent Application No. MX/a/2013/009794, 1 page.
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.
Office Action dated Feb. 10, 2015 for Mexican Patent Application No. MX/a/2013/006770, 2 pages.
Office Action dated Feb. 6, 2015 for Mexican Patent Application No. MX/a/2013/006520, 2 pages.
Office Action dated Jan. 28, 2015 for Mexican Patent Application No. MX/a/2013/006973, 9 pages.
Notice of Allowance for Mexican Patent Application No. MX/a/2013/006973 dated Sep. 4, 2015, 1 page.
Office Action dated Dec. 5, 2014 for Mexican Patent Application No. MX/a/2013/009882, 2 pages.
The Second Office Action dated Apr. 22, 2015 for Mexican Patent Application No. MX/a/2013/009883, 2 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.
Ngee, S., “Data Transmission Between PDA and PC Using WiFi for Pocket Barcode Application,” Thesis, University Teknologi Malaysia, May 2007, 126 pp. Found online at http://eprints.utm.my/6421/1/SeahYeowNgeeMFKE20007TTT.pdf, Oct. 22, 2010.
Olson, E., “Bar Codes add Detail on Items in TV Ads,” New York Times, Sep. 2010, 3 pp. Found online at http:www.nytimes.com/2010/09/27/business/media/27bluefiy.html?src=busin, Oct. 22, 2010.
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 General 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, 8 pp. Found online at Citeseer: 10.1.1.20.34[1].pdf, Oct. 22, 2010.
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, 5 pp. Found online at http://www.revenews.com/barrysilverstein/gr-codes-and-tv-campaigns-connect/, Oct. 22, 2010.
Smith, L., “QR Barcodes Make History on Global TV,” 3 pp. Found online at http://lindsaysmith.com/worlds-first-mobio-mini-telethon/, Oct. 22, 2010.
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 pp. Retrieved from the Internet: http://citeseerxist.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.
Office Action and Search Report from the State Intellectual Property Office for CN Pat. Appln. No. 201180066584.7 dated Jul. 10, 2015, 12 pages.
Office Action and Search Report for ROC (Taiwan) Patent Application No. 10014870 dated May 7, 2014, issued in the corresponding foreign application, 9 pages.
Office Action and Search Report for ROC (Taiwan) Patent Application No. 100149344 dated Jan. 23, 2015, 8 pages.
Search Report for Patent Application ROC (Taiwan) Patent Application No. 100149344 dated Oct. 28, 2015, 1 page.
Office Action and Search Report for ROC (Taiwan) Patent Application No. 100142966 dated May 27, 2014, 6 pages.
Office Action for European Patent Application No. 12707435.9 dated Mar. 12, 2015, 6 pages.
Office Action for European Patent Application No. 12719817.4 dated Jun. 23, 2014 issued in the corresponding foreign application, 5 pages.
U.S. Appl. No. 14/179,336, filed Feb. 12, 2014, Non-Final Office Action dated May 22, 2014, 14 pages.
U.S. Appl. No. 14/179,336, filed Feb. 12, 2014 Final Office Action dated Dec. 1, 2014, 30 pages.
U.S. Appl. No. 14/179,336, filed Feb. 12, 2014 Notice of Allowance dated Feb. 18, 2015, 15 pages.
U.S. Appl. No. 13/302,717, filed Nov. 22, 2011 Non Final Rejection dated Dec. 2, 2015, 27 pages.
U.S. Appl. No. 13/302,717, filed Nov. 22, 2011 Final Rejection dated May 8, 2015, 44 pages.
U.S. Appl. No. 13/302,717, filed Nov. 22, 2011 Non-Final Rejection dated Dec. 18, 2014, 71 pages.
U.S. Appl. No. 12/958,073, filed Dec. 1, 2010, Office Action dated Aug. 31, 2012, 12 pages.
U.S. Appl. No. 12/958,073, filed Dec. 1, 2010, Notice of Allowance dated Jan. 17, 2013, 17 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action dated Mar. 9, 2012, 17 pages.
U.S. Appl. No. 12/964,478, filed Dec. 9, 2010, Non-Final Office Action dated Mar. 26, 2013, 19 pages.
U.S. Appl. No. 12/964,478, filed Dec. 9, 2010, Final Office Action dated Sep. 16, 2013, 12 pages.
U.S. Appl. No. 12/971,349, filed Dec. 17, 2010, Office Action dated Nov. 10, 2011, 9 pages.
U.S. Appl. No. 12/971,349, filed Dec. 17, 2010, Final Office Action dated Jan. 20, 2012, 10 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Notice of Allowance dated Jul. 16, 2014, 15 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Final Rejection dated Oct. 30, 2012, 17 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action dated Mar. 25, 2013, 17 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action dated Jul. 12, 2013, 22 pages.
U.S. Appl. No. 12/961,369, filed Dec. 6, 2010, Non-Final Office Action dated Feb. 13, 2014, 21 pages.
U.S. Appl. No. 12/971,349, filed Dec. 7, 2010, Notice of Allowance dated Oct. 2, 2013, 24 pages.
U.S. Appl. No. 12/971,349, filed Dec. 7, 2010, Final Rejection dated Oct. 24, 2012, 11 pages.
U.S. Appl. No. 12/971,349, filed Dec. 17, 2010, Office Action dated Jul. 16, 2012, 11 pages.
U.S. Appl. No. 12/981,244, filed Dec. 29, 2010, Office Action dated Dec. 21, 2012, 23 pages.
U.S. Appl. No. 12/981,244, filed Dec. 29, 2010, Final Office Action dated Oct. 30, 2013, 10 pages.
U.S. Appl. No. 12/981,244, filed Dec. 29, 2010, Notice of Allowance dated Mar. 25, 2014, 17 pages.
U.S. Appl. No. 12/984,385, filed Jan. 4, 2011, Notice of Allowance dated Nov. 28, 2012, 11 pages.
U.S. Appl. No. 12/984,385, filed Jan. 4, 2011), Office Action dated Jul. 12, 2012, 16 pages.
U.S. Appl. No. 12/986,721, filed Jan. 7, 2011, Office Action dated Mar. 16, 2012, 6 pages.
U.S. Appl. No. 12/986,721, filed Jan. 7, 2011, Notice of Allowance dated Jun. 21, 2012, 7 pages.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Final Office Action dated May 24, 2013, 17 pages.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Office Action dated Oct. 7, 2012, 31 pages.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Non Final Office action dated Mar. 24, 2015, 39 pages.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Final Office Action dated Nov. 6, 2015, 26 pages.
U.S. Appl. No. 13/015,382, filed Jan. 27, 2011, Office Action dated Nov. 13, 2012, 7 pages.
U.S. Appl. No. 13/015,382, filed Jan. 27, 2011, Notice of Allowance dated Feb. 22, 2013, 12 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Office Action dated Nov. 2, 2012, 18 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Final Office Action dated Jun. 27, 2013, 13 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Non-Final Office Action dated Nov. 3, 2014, 33 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Final Office Action dated May 13, 2015, 34 pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Non-Final Office Action dated Dec. 14, 2015, 27 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011 Non Final Rejection dated Feb. 17, 2015, 57 pages.
U.S. Appl. No. 12/953,273, filed Nov. 23, 2010, Notice of Allowance, dated Oct. 18, 2012, 11 pages.
U.S. Appl. No. 12/965,645, filed Dec. 10, 2010, Non-Final Office Action, dated Jul. 19, 2013, 20 pages.
U.S. Appl. No. 12/965,645, filed Dec. 10, 2010, Final Office Action, dated Mar. 18, 2014, 24 pages.
U.S. Appl. No. 12/965,645, filed Dec. 10, 2010, Notice of Allowance, dated Jun. 20, 2014, 35 pages.
U.S. Appl. No. 12/973,431, filed Dec. 20, 2010, Non-Final Rejection dated May 15, 2013, 30 pages.
U.S. Appl. No. 12/973,431, filed Dec. 20, 2010, Final Office Action dated Aug. 27, 2013, 11 pages.
U.S. Appl. No. 12/973,431, filed Dec. 20, 2010 Non-Final Rejection dated Dec. 19, 2014, 30 pages.
U.S. Appl. No. 12/973,431, filed Dec. 20, 2010 Notice of Allowance dated May 28, 2015, 20 pages.
U.S. Appl. No. 13/007,317, filed Jan. 14, 2011, Office action dated Dec. 19, 2012, 29 pages.
U.S. Appl. No. 13/010,557, filed Jan. 20, 2011, Final Rejection dated Jan. 16, 2014, 17 pages.
U.S. Appl. No. 13/010,557, filed Jan. 20, 2011, Non-Final Rejection dated Aug. 5, 2013, 17 pages.
U.S. Appl. No. 13/014,591, Notice of Allowance dated May 24, 2013, 32 pages.
U.S. Appl. No. 13/020,678, filed Feb. 3, 2011, Office Action dated Jul. 30, 2012, 15 pages.
U.S. Appl. No. 13/020,678, filed Feb. 3, 2011, Notice of Allowance dated Jan. 3, 2013, 13 pages.
U.S. Appl. No. 13/007,317, Notice of Allowance dated May 13, 2013, 16 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Office Action dated Jan. 11, 2013, 14 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Final Office Action dated Jul. 11, 2014, 43 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Non-Final Office Action dated Feb. 6, 2015, 56 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011, Final Office Action dated Jul. 17, 2015, 63 pages.
U.S. Appl. No. 13/031,115, Notice of Allowance dated Apr. 16, 2013, 24 pages.
U.S. Appl. No. 13/034,482, filed Feb. 24, 2011 Notice of Allowance dated Aug. 29, 2014, 45 pages.
U.S. Appl. No. 13/034,482, filed Feb. 24, 2011, Final Office Action dated Apr. 25, 2013, 19 pages.
U.S. Appl. No. 13/034,482, filed Feb. 24, 2011, Office Action dated Oct. 19, 2012, 11 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Office Action dated Oct. 30, 2012, 11 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Final Rejection dated Mar. 29, 2013, 20 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011, Non Final Rejection dated Mar. 6, 2014, 20 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011 Final Rejection dated Aug. 27, 2014, 38 pages.
U.S. Appl. No. 13/035,474, filed Feb. 25, 2011 Non Final Rejection dated Sep. 11, 2015, 65 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010 Non-Final Office Action dated May 14, 2015, 21 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010 Final Office Action dated Dec. 3, 2014, 19 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Non-Final Office Action dated Jun. 6, 2014, 19 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Final Office Action dated Apr. 18, 2013, 14 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Non-Final Office Action dated Dec. 6, 2012, 17 pages.
U.S. Appl. No. 12/960,285, filed Dec. 3, 2010, Notice of Allowance dated Nov. 18, 2015, 31 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011, Non-Final Office Action dated Oct. 8, 2013, 20 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011, Final Office Action dated May 9, 2014, 41 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011 Non-Final Office Action dated Sep. 12, 2014, 41 pages.
U.S. Appl. No. 13/006,270, filed Jan. 13, 2011, Final Office Action dated Mar. 23, 2014, 51 pages.
U.S. Appl. No. 13/028,030, filed Feb. 15, 2011 Non-Final Office Action dated Dec. 17, 2013, 60 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Office Action dated Jul. 18, 2012, 15 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Final Office Action dated Jan. 31, 2013, 26 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Non-Final Office Action dated May 15, 2013, 15 pages.
U.S. Appl. No. 13/035,525, filed Feb. 25, 2011, Final Office Action dated Sep. 12, 2013, 21 pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Office Action dated Mar. 1, 2013, 20 pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Final Office Action dated Oct. 16, 2013, 28 pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Final Office Action dated May 4, 2015, 54 pages.
U.S. Appl. No. 13/037,312, filed Feb. 28, 2011, Office Action dated Aug. 15, 2012, 9 pages.
U.S. Appl. No. 13/037,312, filed Feb. 28, 2011, Notice of Allowance dated Jun. 13, 2013, 10 pages.
U.S. Appl. No. 13/037,312, filed Feb. 28, 2011, Final Office Action dated Feb. 28, 2013, 18 pages.
U.S. Appl. No. 13/037,316, filed Feb. 28, 2011, Office Action dated Jan. 30, 2013, 21 pages.
U.S. Appl. No. 13/037,316, filed Feb. 28, 2011, Final Office Action dated Aug. 28, 2013, 13 pages.
U.S. Appl. No. 13/037,333, filed Feb. 28, 2011, Notice of Allowance dated Jan. 18, 2013, 27 pages.
U.S. Appl. No. 13/192,287, filed Jul. 27, 2011, Notice of Allowance dated Dec. 14, 2015, 14 pages.
U.S. Appl. No. 13/192,287, filed Jul. 27, 2011, Final Office Action dated Jan. 28, 2014, 18 pages.
U.S. Appl. No. 13/192,287, filed Jul. 27, 2011, Non Final Office Action dated Jun. 13, 2013, 22 pages.
U.S. Appl. No. 13/673,480, filed Nov. 9, 2012, Office Action dated Jan. 16, 2013, 27 pages.
U.S. Appl. No. 13/673,480, filed Nov. 9, 2012 Final Office Action dated Sep. 9, 2013, 10 pages.
U.S. Appl. No. 13/673,480, filed Nov. 9, 2012 Notice of Allowance dated Nov. 12, 2013, 16 pages.
U.S. Appl. No. 13/475,794, filed May 18, 2012 Non-Final Office Action dated Sep. 18, 2013, 19 pages.
U.S. Appl. No. 13/475,794, filed May 18, 2012 Non-Final Office Action dated Nov. 21, 2014, 33 pages.
U.S. Appl. No. 13/475,794, filed May 18, 2012 Final Office Action dated Jun. 1, 2015, 45 pages.
U.S. Appl. No. 13/864,474, filed Apr. 17, 2013 Non Final Office Action dated Aug. 11, 2015, 59 pages.
U.S. Appl. No. 13/864,474, filed Apr. 17, 2013 Final Office Action dated Nov. 20, 2015, all pages.
Examination Search Report from the European Patent Office dated Dec. 4, 2015 for EP 12707418.5, 8 pages.
First Office Action with Search Report for CN 201280013891.3 dated Jan. 15, 2016, 3 pages.
Notice of Allowance dated Nov. 10, 2015 for Mexican Patent Application No. MX/a/2013/007672, 1 page.
Second Office Action issued by State Intellectual Property Office for CN Pat. Appln. No. 201180066584.7 dated Jan. 11, 2016, 5 pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Non-Final Office Action dated Jan. 12, 2016, 62 pages.
First Office Action and Search Report from State Intellectual Property Office for CN Appln. No. 201180064527.5 dated Oct. 23, 2015, 10 pages.
Second Office Action from State Intellectual Property Office for CN Appln. No. 201180056242.7 dated Jan. 26, 2016, 9 pages.
First Office Action and Search Report from the State Intellectual Property Office (SIPO) for CN 201180056249.9 dated Feb. 3, 2016, 7 pages.
First Office Action for CN 201280010873 dated Mar. 2, 2016, 14 pages.
U.S. Appl. No. 13/864,474, filed Apr. 17, 2013 Non Final Office Action dated Mar. 23, 2016, all pages.
European Office Action for EP 11842890.3 dated May 9, 2016, all pages.
Notice of Allowance for Mexican Patent Application No. MX/a/2013/009791 dated Mar. 15, 2016, 1 page.
Office Action for European Patent App. 12704473.3 dated Apr. 29, 2016, all pages.
Supplementary European Search Report for EP 11843423 dated Mar. 23, 2016, 8 pages.
Supplementary European Search Report for EP 11843045 dated Mar. 31, 2016, all pages.
First Office Action including Search Report from the State Intellectual Property Office for CN Patent Appln. No. 201280014034.5 dated Apr. 5, 2016, all pages.
Office Action and Search Report for ROC (Taiwan) Pat. Appln. No. 101106313 dated May 12, 2016, all pages.
Notice of Decision to Grant for CN 201280010873 dated Mar. 25, 2016, all pages.
Office Action for Korean Patent Application No. 10-2013-7015610 dated Oct. 21, 2016, all pages. (no English translation available).
Office Action for EP 11811502.1 dated Aug. 29, 2016, all pages.
Publication of Brazil appln No. BR 11 2013 012218-8 on Aug. 9, 2016, 1 page.
Second Office Action CN 201280013891.3 dated Aug. 12, 2016, all pages.
Office Action dated Oct. 17, 2016 for European Patent Appln. No. 12701638.4, all pages.
Office Action for EP 12705768.5 dated May 25, 2016, all pages.
Third Office Action from State Intellectual Property Office for CN Appln. No. 201180056242.7 dated Jul. 28, 2016, all pages.
Second Office Action from State Intellectual Property Office for CN Appln. No. 201180064527.5 dated Jun. 12, 2016, all pages.
U.S. Appl. No. 13/302,717, filed Nov. 22, 2011 Non Final Rejection dated Jun. 16, 2016, all pages.
U.S. Appl. No. 13/016,483, filed Jan. 28, 2011 Final Office Action dated Jul. 5, 2016, all pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Final Office Action dated Jul. 12, 2016, all pages.
U.S. Appl. No. 13/475,794, filed May 18, 2012 Non Final Office Action dated Jul. 29, 2016, all pages.
Notice of Allowance for Canadian Application 2,818,585 dated Apr. 3, 2017, 1 page.
Notice of Allowance for Canadian Application 2,828,463 dated Apr. 4, 2017, 1 page.
Office Action for CA 2,818,585 dated Nov. 28, 2016, all pages.
(Translation) Rejection Decision for CN Appln. No. 201180064527.5 dated Oct. 9, 2016, all pages.
Notice of Decision to Grant for KR 10-2013-7024307 dated Apr. 14, 2017, 2 pages.
Second Office Action issued by State Intellectual Property Office (SIPO) for CN 201180056249.9 dated Feb. 4, 2017, all pages.
Office Action for Korean Patent Application No. 10-2013-7020207 dated Dec. 21, 2016, all pages.
Decision to Grant for Korean Patent Application No. 10-2013-7020207 dated Mar. 9, 2017, all pages.
Office Action and Search Report for ROC (Taiwan) Pat. Appln. No. 101106313 dated Nov. 4, 2016, all pages.
Notice of Allowance for Canadian Application 2,822,214 dated Nov. 28, 2016, 1 page.
U.S. Appl. No. 12/953,227, filed Nov. 23, 2010, Notice of Allowance dated May 9, 2017, all pages.
U.S. Appl. No. 13/037,302, filed Feb. 28, 2011, Notice of Allowance dated Feb. 16, 2017, all pages.
U.S. Appl. No. 13/475,794, filed May 18, 2012 Notice of Allowance dated Jan. 5, 2017, all pages.
U.S. Appl. No. 13/864,474, filed Apr. 17, 2013 Notice of Allowance dated Feb. 16, 2017, all pages.
Office Action for Korean Patent Application No. 10-2013-7015610 dated Feb. 21, 2017, all pages.
Office Action for CA 2,823,636 dated Jan. 24, 2017, all pages.
Office Action for CA 2,825,414 dated Apr. 3, 2017, all pages.
Office Action for CA 2,825,414 dated Nov. 1, 2017, all pages.
First Examination Report for EP Appln No. 12716110.7 dated Aug. 2, 2017, all pages.
First Office Action for CA Appln No. 2828447 dated Sep. 7, 2017, all pages.
Office Action for CA 2,818,757 dated Jul. 12, 2017, all pages.
Office Action for CA 2,818,604 dated Aug. 3, 2017, all pages.
Third Office Action issued by State Intellectual Property Office (SIPO) for CN 201180056249.9 dated Aug. 21, 2017, all pages.
U.S. Appl. No. 15/595,621, filed May 15, 2017 Non-Final Rejection dated Oct. 18, 2017, all pages.
European Search Report for EP 11 846 858.6 dated Jun. 12, 2017, all pages.
Office Action for EP 11844504 dated Mar. 13, 2017, all pages.
Third Office Action from State Intellectual Property Office for CN Appln. No. CN 201280013891.3 dated Dec. 30, 2016, all pages.
Office Action dated Mar. 2, 2017 for KR 10-2013-7020865, all pages.
Notice to Grant dated Jun. 9, 2017 for KR 10-2013-7020865, all pages.
Publication of BR 11 2014 020007-6 A2 dated Jun. 20, 2017, 1 page.
Related Publications (1)
Number Date Country
20160066050 A1 Mar 2016 US
Divisions (1)
Number Date Country
Parent 12973431 Dec 2010 US
Child 14852787 US