There is considerable interest in identifying and/or measuring the receipt of, and or exposure to, audio data by an audience in order to provide market information to advertisers, media distributors, and the like, to verify airing, to circulate royalties, to detect piracy, and for any other purposes for which an estimation of audience receipt or exposure is desired. Additionally, there is a considerable interest in providing content and/or performing actions on devices based on media exposure detection. The emergence of multiple, overlapping media distribution pathways, as well as the wide variety of available user systems (e.g. PC's, PDA's, portable CD players, Internet, appliances, TV, radio, etc.) for receiving audio data and other types of data, has greatly complicated the task of measuring audience receipt of, and exposure to, individual program segments. The development of commercially viable techniques for encoding audio data with program identification data provides a crucial tool for measuring audio data receipt and exposure across multiple media distribution pathways and user systems.
One such technique involves adding an ancillary code to the audio data that uniquely identities the program signal. Most notable among these techniques is the CBET methodology developed by Arbitron Inc., which is already providing useful audience estimates to numerous media distributors and advertisers. An alternative technique for identifying program signals is extraction and subsequent pattern matching of “signatures” of the program signals. Such techniques typically involve the use of a reference signature database, which contains a reference signature for each program signal the receipt of which, and exposure to which, is to be measured. Before the program signal is broadcast, these reference signatures are created by measuring the values of certain features of the program signal and creating a feature set or “signature” from these values, commonly termed “signature extraction”, which is then stored in the database. Later, when the program signal is broadcast, signature extraction is again performed, and the signature obtained is compared to the reference signatures in the database until a match is found and the program signal is thereby identified.
However, one disadvantage of using such pattern matching techniques is that, because there is no predetermined point in the program signal from which signature extraction is designated to begin, each program signal must continually undergo signature extraction, and each of these many successive signatures extracted from a single program signal must be compared to each of the reference signatures in the database. This, of course, requires a tremendous amount of data processing, which, due to the ever increasing methods and amounts of audio data transmission, is becoming more and more economically impractical.
In order to address the problems accompanying continuous extraction and comparison of signals, which uses excessive computer processing and storage resources, it has been proposed to use a “start code” to trigger a signature extraction.
One such technique, which is disclosed in U.S. Pat. No. 4,210,990 to Lert, et al., proposes the introduction of a brief “cue” or “trigger” code into the audio data. According to Lert, et al. upon detection of this code, a signature is extracted from a portion of the signal preceding or subsequent to the code. This technique entails the use of a code having a short duration to avoid audibility but which contains sufficient information to indicate that the program signal is a signal of the type from which a signature should be extracted. The presence of this code indicates the precise point in the signal at which the signature is to be extracted, which is the same point in the signal from which a corresponding reference signature was extracted prior to broadcast, and thus, a signature need be extracted from the program signal only once. Therefore, only one signature for each program signal must be compared against the reference signatures in the database, thereby greatly reducing the amount of data processing and storage required.
One disadvantage of this technique, however, is that the presence of a code that triggers the extraction of a signature from, a portion of the signal before or after the portion of the signal that has been encoded necessarily limits the amount of information that can be obtained for producing the signature, as the encoded portion itself may contain information useful for producing the signature, and moreover, may contain information required to measure the values of certain features, such as changes of certain properties or ratios over time, which might not be accurately measured when temporal segment of the signal (i.e. the encoded portion) cannot be used.
Another disadvantage of this technique is that, because the trigger code is of short duration, the likelihood of its detection is reduced. One disadvantage of such short codes is the diminished probability of detection that may result when a signal is distorted or obscured, as is the case when program signals are broadcast in a acoustic environments. In such environments, which often contain significant amounts of noise, the trigger code will often be overwhelmed by noise, and thus, not be detected. Yet another specific disadvantage of such short codes is the diminished probability of detection that may result when certain portions of a signal unrecoverable, such as when burst errors occur during, transmission or reproduction of encoded audio signals. Burst errors may appear as temporally contiguous segments of signal error. Such errors generally are unpredictable and substantially affect the content of an encoded audio signal. Burst errors typically arise from failure in a transmission channel or reproduction device due to external interferences, as overlapping of signals from different transmission channels, an occurrence of system power spikes, an interruption in normal operations, an introduction of noise contamination (intentionally or otherwise), and the like. In a transmission system such circumstances may cause a portion of the transmitted encoded audio signals to be entirely unreceivable or significantly altered. Absent retransmission of the encoded audio signal, the affected portion of the encoded audio may be wholly unrecoverable, while in other instances, alterations to the encoded audio signal may render the embedded information signal undetectable.
In systems for acoustically reproducing audio signals recorded on media, a variety of factors may cause burst errors in the reproduced acoustic signal. Commonly, an irregularity in the recording media, caused by damage, obstruction, or wear, results in certain portions of recorded audio signals being irreproducible or significantly altered upon reproduction. Also, misalignment of, or interference with, the recording or reproducing mechanism relative to the recording medium can cause burst-type errors during an acoustic reproduction of recorded audio signals. Further, the acoustic limitations of a speaker as well as the acoustic characteristics of the listening environment may result in spatial irregularities in the distribution of acoustic energy. Such irregularities may cause burst errors to occur in received acoustic signals, interfering with recovery of the trigger code.
A further disadvantage this technique is that reproduction of a signal, short-lived code that triggers signature extraction does not reflect the receipt of a signal by at audience member who was exposed to part, or even most, of the signal if the audience member was not present at the precise point at which the portion of the signal containing the trigger code was broadcast. Regardless of what point in a signal such a code is placed, it would always be possible for audience members to be exposed to the signal for nearly half of the signal's duration without being exposed to the trigger code.
Yet another disadvantage of this technique is that a single code of short duration that triggers signature extraction does not provide any data reflecting the amount of time for which an audience member was exposed to the audio data. Such data may be desirable for many reasons, such as, for example, to determine the percentage of audience members who listen to the entirety of a particular commercial or to determine the level of exposure of certain portions of commercials broadcast at particular times of interest, such as, for example, the first half of the first commercial broadcast, or the last half of the last commercial broadcast, during a commercial break of a feature program. Still another disadvantage of this technique is that is single code that triggers signature extraction cannot mark “beginning” and “end” portions of a program segment, which may be desired, for example, to determine the time boundaries of the segment.
Accordingly, it is desired to (1) provide techniques for gathering data reflecting receipt of and/or exposure to audio data that require minimal processing and storage resources, (2) provide techniques for gathering data reflecting receipt of and/or exposure to audio data wherein the maximum possible amount of information in the audio data is available for use in creating a signature, (3) provide techniques for gathering data reflecting receipt of and/or exposure to audio data wherein as start code for triggering the extraction of a signature is easily detected, (4) provide techniques for gathering data reflecting receipt of and/or exposure, to audio data wherein a start code for triggering the extraction of a signature can be detected in noisy environments, (5) provide techniques or gathering data reflecting receipt of and/or exposure to audio data wherein a start code for triggering the extraction of a signature can be detected when burst errors occur during the broadcast of the audio data, (6) provide techniques for gathering data reflecting receipt of and/or exposure to audio data wherein a start code for triggering the extraction of a signature can be detected even when an audience member is only present for part of the audio data's broadcast, (7) provide techniques for gathering data reflecting receipt of and/or exposure to audio data wherein the duration of an audience member's exposure to a program signal can be measured, (8) provide techniques for gathering data reflecting receipt of and/or exposure to audio data wherein the beginning and end of a program signal can be determined, (9), provide techniques for using code and/or signatures to trigger actions on a processing device, such as activating a web link, presenting a digital picture, executing or activating an application (“app”), and so on, and (10) provide data gathering techniques which are likely to be adaptable to future media distribution paths and user systems which are presently unknown.
For this application, the following terms and definitions shall apply, both for the singular and plural forms of nouns and for all verb tenses:
The term “data” as used herein means any indicia, signals, marks, domains, symbols, symbol sets, representations, and any other physical form or forms representing information, whether permanent or temporary, whether visible, audible, acoustic, electric, magnetic, electromagnetic, or otherwise manifested. The term “data” as used to represent predetermined information in one physical form shall be deemed to encompass any and all representations of the same predetermined information in a different physical form or forms,
The term “audio data” as used herein means any data representing acoustic energy, including, but not limited to, audible sounds, regardless of the presence of any other data, or lack thereof, which accompanies, is appended to, is superimposed on, or is otherwise transmitted or able to be transmitted with the audio data.
The term “network” as used herein means networks of all kinds, including both intra-networks, such as a single-office network of computers, and inter-networks, such as the Internet, and is not limited to any particular such network.
The term “source identification code” as used herein means any data that is indicative of a source of audio data, including, but not limited to, (a) persons or entities that create, produce, distribute, reproduce, communicate, have a possessory interest in, or are otherwise associated with the audio data, or (b) locations, whether physical or virtual, from which data is communicated, either originally or as an intermediary, and whether the audio data is created therein or prior thereto.
The terms “audience” and “audience member” as used herein mean a person or persons, as the case may be, who access media data in any manner, whether alone or in one or more groups, whether in the same or various places, and whether at the same time or at various different times.
The term “processor” as used herein means data processing devices, apparatus, programs, circuits, systems, and subsystems, whether implemented in hardware, software, or both.
The terms “communicate” and “communicating” as used herein include both conveying data from a source to a destination, as well as delivering data to a communications medium, system or link to be conveyed to a destination. The term “communication” as used herein means the act of communicating or the data communicated, as appropriate.
The terms “coupled”, “coupled to”, and “coupled with” shall each mean a relationship between or among, two or more devices, apparatus, files, programs, media, components, networks, systems, subsystems, and/or means, constituting any one or more of (a) a connection, whether direct or through one or more other devices, apparatus, files, programs, media, components, networks, systems, subsystems, or means, (b) a communications relationship, whether direct or through one or more other devices, apparatus, files, programs, media, components, networks, systems, subsystems, or means, or (c) a functional relationship in which the operation of any one or more of the relevant devices, apparatus, tiles, programs, media, components, networks, systems, subsystems, or means depends, in whole or in part, on the operation of any one or more others thereof.
The term “audience measurement” as used herein is understood in the general sense to mean techniques directed to determining and measuring media exposure, regardless of form, as it relates to individuals and/or groups of individuals from the general public. In some cases, reports are generated from the measurement: in other cases, no report is generated. Additionally, audience measurement includes the generation of data based on media exposure to allow audience interaction. By providing content or executing actions relating to media exposure, an additional level of sophistication may be introduced to traditional audience measurement systems, and further provide unique aspects of content delivery for users.
In accordance with one exemplary embodiment, a method is provided for gathering data reflecting receipt of and/or exposure to audio data. The method comprises receiving audio data to be monitored in a monitoring device, the audio data having a monitoring code indicating that the audio data is to be monitored: detecting the monitoring code; and, in response to detection of the monitoring code, producing signature data characterizing the audio data using at least a portion of the audio data containing the monitoring code.
In another exemplary embodiment, a method is disclosed for performing an action in a computer-processing device using data reflecting receipt of and/or exposure to audio data, where the method comprises the steps of receiving audio data to be monitored in a monitoring device, the audio data having a monitoring code indicating that the audio data is to be monitored; detecting the monitoring code; in response to detection of the monitoring code, producing signature data characterizing the audio data using at least a portion of the audio data containing the monitoring code; and directing the performance of the action based on at least one of the monitoring code and signature data.
In another exemplary embodiment, a computer-processing device configured to perform an action using data reflecting receipt of and/or exposure to audio data is disclosed, comprising an input device to receive audio data having a monitoring code indicating that the audio data is to be monitored; a detector to detect the monitoring code; and a processing apparatus to produce, in response to detection of the monitoring code, signature data characterizing the audio data using at least a portion of the audio data containing the monitoring code, wherein the processing apparatus is configured to direct the performance of the action in the device based on at least one of the tin mitering code and signature data.
In yet another exemplary embodiment, a method is disclosed for performing an action in a computer-processing device using data reflecting receipt of and/or exposure to audio data, comprising: detecting monitoring code from received audio data, said monitoring code indicating that the audio data is to be monitored; producing signature data in response to detection of the monitoring code, said signature data characterizing the audio data using at least a portion of the audio data containing the monitoring code; and direct the performance of the action based on at least one of the monitoring code and signature data.
The invention and its particular features and advantages will become more apparent from the following detailed description considered with reference to the accompanying drawings, in which the same elements depicted in different drawing figures are assigned the same reference numerals.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:
Various embodiments of the present invention will be described herein below with reference to the accompanying drawings. In the following description, well-known functions or constructions are not described in detail since they would obscure the invention in unnecessary detail.
The particular audio data to be monitored varies between particular embodiments and can include any audio data which may be reproduced as acoustic energy, the measurement of the receipt of which, or exposure to which, may be desired. In certain advantageous embodiments, the audio data represents commercials having an audio component, monitored, for example, in order to estimate audience exposure to commercials or to verify airing. In other embodiments, the audio data represents other types of programs having, an audio component, including, but not limited to, television programs or movies, monitored, for example, in order to estimate audience exposure or verify their broadcast. In yet other embodiments, the audio data represents songs, monitored, for example, in order to calculate royalties or detect piracy. In still other embodiments, the audio data represents streaming media having an audio component, monitored, for example, in order to estimate audience exposure. In yet other embodiments, the audio data represents other types of audio files or audio/video files, monitored, for example, for any of the reasons discussed above.
The audio data 21 communicated from the audio source 20 to the system 30 includes a monitoring code, which code indicates that signature data is to be formed from at least a portion of the audio data relative to the monitoring code. The monitoring code is present in the audio data at the audio source 20 and is added to the audio data at the audio source 20 or prior thereto, such as, for example, in the recording studio or at any other time the audio is recorded or re-recorded (i.e. copied) prior to its communication from the audio source 20 to the system 30.
The monitoring code may be added to the audio data using any encoding technique suitable for encoding audio signals that are reproduced as acoustic energy, such as, for example, the techniques disclosed in U.S. Pat. No. 5,764,763 to Jensen, et al., and modifications thereto, which is assigned to the assignee of the present invention and which is incorporated herein by reference. Other appropriate encoding techniques are disclosed in U.S. Pat. No. 5,579,124 to Aijala, et al., U.S. Pat. Nos. 5,574,962, 5,581,800 and 5,787,334 to Fardeau, et al., U.S. Pat. No. 5,450,490 to Jensen, et al., and U.S. patent application Ser. No. 09/318,045, in the names of Neuhauser, et al., each of which is assigned to the assignee of the present application and all of which are incorporated herein by reference.
Still other suitable encoding techniques are the subject of PCT Publication WO 00/04662 to Srinivasan, U.S. Pat. No. 5,319,735 to Preuss, et al., U.S. Pat. No. 6,175,627 to Petrovich, et al., U.S. Pat. No. 5,828,325 to Wolosewicz, et al., U.S. Pat. No. 6,154,484 to Lee, et al., U.S. Pat. No. 5,945,932 to Smith, et al., PCT Publication WO 99/59275 to Lu, et al., PCT Publication WO 98/26529 to Lu, et al., and PCT Publication WO 96/27264 to Lu, et al, all of which are incorporated herein by reference.
In accordance with certain advantageous embodiments of the invention, this monitoring code occurs continuously throughout a time base of a program segment. In accordance with certain other advantageous embodiments of the invention, this monitoring code occurs repeatedly, either at a predetermined interval or at a variable interval or intervals. These types of encoded signals have certain advantages that may be desired, such as, for example, increasing the likelihood that a program segment will be identified when an audience member is only exposed to part of the program segment, or, further, determining the amount of time the audience member is actually exposed to the segment.
In another advantageous embodiment the invention, two different monitor codes occur in a program segment, the first of these codes occurring continuously or repeatedly throughout as first portion of a program segment, and the second of these codes occurring continuously or repeatedly throughout a second portion of the program segment. This type of encoded signal has certain advantages that may be desired, such as, for example, using the first and second codes as “start” and “end” codes of the program segment by defining the boundary between the first and second portions as the center, or some other predetermined point, of the program segment in order to determine the time boundaries of the segment.
In another advantageous embodiment of the invention, the audio data 21 communicated from the audio source 20 to the system 30 includes two (or more) different monitoring codes. This type of encoded data has certain advantages that may be desired, such as, for example using the codes to identify two different program types in the same signal, such as a television commercial that is being broadcast along with a movie on a television, where it is desired to monitor exposure to both the movie and the commercial. Accordingly, in response to detection of each monitoring code, a signature is extracted from the audio data of the respective program.
In another advantageous embodiment, the audio data 21 communicated from the audio source 20 to the system 30 also includes a source identification code. The source identification code may include data identifying any individual source or group of sources of the audio data, which sources may include an original source or any subsequent source in a series of sources, whether the source is located at a remote location, is a storage medium, or is a source that is internal to, or a peripheral of, the system 30. In certain embodiments, the source identification code and the monitoring code are present simultaneously in the audio data 21, while in other embodiments they are present in different time segments of the audio data 21.
After the system 30 receives the audio data, in certain embodiments, the system 30 reproduces the audio data as acoustic audio data, and the system 16 further includes a monitoring device 40 that detects this acoustic audio data. In other embodiments, the system 30 communicates the audio data via a connection to monitoring device 40, or through other wireless means, such as RF, optical, magnetic and/or electrical means. While system 30 and monitoring device 40 are shown as separate boxes in
After the audio data is received by the monitoring device 40, the audio data is processed until the monitoring code, with which the audio data has previously been encoded, is detected. In response to the detection of the monitoring code, the monitoring device 40 forms signature data 41 characterizing the audio data. In certain advantageous embodiments, the audio signature data 41 is formed from at least a portion of the program segment containing the monitoring code. This type of signature formation has certain advantages that may be desired, such as, for example, the ability to use the code as part of, or as part of the process for forming, the audio signature data, as well as the availability of other information contained in the encoded portion of the program segment for use in creating the signature data.
Suitable techniques for extracting signatures from audio data are disclosed in U.S. Pat. No. 5,612,729 to Ellis, et al. and in U.S. Pat. No. 4,739,398 to Thomas, et al., each of which is assigned to the assignee of the present invention and both of which are incorporated herein by reference. Still other suitable techniques are the subject of U.S. Pat. No. 2,662,168 to Scherbatsoy, U.S. Pat. No. 3,919,479 to Moon, et al., U.S. Pat. No. 4,697,209 to Kiewit, et al., U.S. Pat. No. 4,677,466 to Lert, et al., U.S. Pat. No. 5,512,933 to Wheatley, et al., U.S. Pat. No. 4,955,070 to Welsh, et al., U.S. Pat. No. 4,918,730 to Schulze, U.S. Pat. No. 4,843,562 to Kenyon, et al., U.S. Pat. No. 4,450,531 to Kenyon, et al., U.S. Pat. No. 4,230,990 to Lert, et al., U.S. Pat. No. 5,594,934 to Lu, et al., and PCT publication WO91/11062 to Young, et al., all of which are incorporated herein by reference.
Specific methods for forming signature data include the techniques described below. It is appreciated that this is not an exhaustive list of the techniques that can be used to form signature data characterizing the audio data. In certain embodiments, the audio signature data 41 is formed by using variations in the received audio data. For example, in some of these embodiments, the signature 41 is formed by forming a signature data set reflecting time-domain variations of the received audio data, which set, in some embodiments, reflects such variations of the received audio data in a plurality of frequency sub-bands of the received audio data. In others of these embodiments, the signature 41 is formed by forming a signature data set reflecting frequency-domain variations of the received audio data.
In certain other embodiments, the audio signature data 41 is formed by using signal-to-noise ratios that are processed for a plurality of predetermined frequency components of the audio data and/or data representing characteristics of the audio data. For example, in some of these embodiments, the signature 41 is formed by forming a signature data set comprising at least some of the signal-to-noise ratios. In others of these embodiments, the signature 41 is formed of combining selected ones of the signal-to-noise ratios. In still others of these embodiments, the signature 41 is formed by forming a signature data set reflecting time-domain variations of the signal-to-noise ratios, which set, in some embodiments, reflects such variations of the signal-to-noise ratios in a plurality of frequency sub-bands of the received audio data, which, in some such embodiments, are substantially single frequency sub-bands. In still others of these embodiments, the signature 41 is formed by forming a signature data set reflecting frequency-domain variations of the signal-to-noise ratios.
In certain other embodiments, the signature data 41 is obtained at least in part from the monitoring code and/or from different code in the audio data, such as a source identification code. In certain of such embodiments, the code comprises a plurality of code components reflecting characteristics of the audio data and the audio data is processed to recover the plurality of code components. Such embodiments are particularly useful where the magnitudes of the code components are selected to achieve masking by predetermined portions of the audio data. Such component magnitudes therefore, reflect predetermined characteristics of the audio data, so that the component magnitudes may be used to form a signature identifying the audio data.
In some of these embodiments, the signature 41 is formed as a signature data set comprising at least some of the recovered plurality of code components. In others of these embodiments, the signature 41 is formed by combining selected ones of the recovered plurality of code components. In yet other embodiments, the signature 41 can be formed using signal-to-noise ratios processed for the plurality of code components in any of the ways described above. In still further embodiments, the code is used to identify predetermined portions of the audio data, which are then used to produce the signature using any of the techniques described above. It will be appreciated that other methods of forming signatures may be employed.
After the signature data 41 is formed in the monitoring device 40, it is communicated to a reporting system 50, which processes the signature data to produce data representing the identity of the program segment. While monitoring device 40 and reporting system 50 are shown as separate boxes in
As shown in
In certain embodiments, the acoustic audio data is received by a transducer, illustrated by input device 43 of monitoring device 42, for producing electrical audio data from the received acoustic audio data. While the input device 43 typically is a microphone that receives the acoustic energy, the input device 43 can be any device capable of detecting energy associated with the speaker 70, such as, for example, a magnetic pickup for sensing magnetic fields, a capacitive pickup for sensing electric fields, or an antenna or optical sensor for electromagnetic energy. In other embodiments, however, the input device 43 comprises an electrical or optical connection with the system 32 for detecting the audio data.
In certain advantageous embodiments, the monitoring device 42 is a portable monitoring device, such as, for example, a portable people meter. In these embodiments, the portable device 42 is carried by an audience member in order to detect audio data to which the once member is exposed. In some of these embodiments, the portable device 42 is later coupled with a docking station 44, which includes or is coupled to a communications device 60, in order to communicate data to, or receive data from, at least one remotely located communications device 62.
The communications device 60 is, or includes, any device capable of performing any necessary transformations of the data to be communicated, and/or communicating/receiving the data to be communicated, to or from at least one remotely located communications device 62 via a communication system, link, or medium. Such a communications device may be, for example, a modem or network card that transforms the data into a format appropriate for communication via a telephone network, a cable television system, the Internet, a WAN, a LAN, or a wireless communications system. In embodiments that communicate the data wirelessly, the communications device 60 includes an appropriate transmitter, such as, for example, a cellular telephone transmitter, a wireless Internet transmission unit, an optical transmitter, an acoustic transmitter, or a satellite communications transmitter. In certain advantageous embodiments, the reporting system 52 has a database 54 containing reference audio signature data of identified audio data. After audio signature data is formed in the monitoring device 42, it is compared with the reference audio signature data contained in the database 54 in order to identify the received audio data.
There are numerous advantageous and suitable techniques for carrying out a pattern matching process to identify the audio data based on the audio signature data. Some of these techniques are disclosed in U.S. Pat. No. 5,612,729 to Ellis, et al. and in U.S. Pat. No. 4,739,398 to Thomas, et al., each of which is assigned to the assignee of the present invention and both of which are incorporated herein by reference. Still other suitable techniques are the subject of U.S. Pat. No. 2,662,168 to Scherbatsoy, U.S. Pat. No. 3,919,479 to Moon, et al., U.S. Pat. No. 4,697,209 to Kiewit, et al., U.S. Pat. No. 4,677,466 to Lert, et al., U.S. Pat. No. 5,512,933 to Wheatley, et al., U.S. Pat. No. 4,955,070 to Welsh, et al., U.S. Pat. No. 4,918,730 to Schulze, U.S. Pat. No. 4,843,562 to Kenyon, et al., U.S. Pat. No. 4,450,531 to Kenyon, et al., U.S. Pat. No. 4,230,990 to Lert, et al., U.S. Pat. No. 5,594,934 to Lu, et al., and PCT Publication WO91/11062 to Young et al., all of which are incorporated herein by reference.
In certain embodiments, the signature is communicated to a reporting system 52 having a reference signature database 54, and pattern matching is carried out by the reporting system 52 to identify the audio data. In other embodiments, the reference signatures are retrieved from the reference signature database 54 by the monitoring device 42 or the docking station 44, and pattern matching is carried out in the monitoring device 42 or the docking station 44. In the latter embodiments, the reference signatures in the database can be communicated to the monitoring device 42 or the docking station 44 at any time, such as, for example, continuously, periodically, when a monitoring device 42 is coupled to a docking station 44 thereof, when an audience member actively requests such a communication, or prior to initial use of the monitoring device 42 by an audience member.
After the audio signature data is formed and/or after pattern matching has been carried out, the audio signature data, or, it pattern matching has occurred, the identity of the audio data, is stored on a storage device 56 located in the reporting system. In certain embodiments, the reporting system 52 contains only a storage device 56 for storing the audio signature data. In other embodiments, the reporting system 52 is a single device containing both a reference signature database 54, a pattern matching subsystem (not shown for purposes of simplicity and clarity) and the storage device 56.
Referring to
In still further embodiments, the source is another audio reproducing system, as defined below, such that a plurality of audio reproducing systems receive and communicate audio data in succession. Each system in such a series of systems may be coupled either directly or indirectly to the system located before or after it, and such coupling may occur, permanently, temporarily, or intermittently, as illustrated stepwise in
Referring to
In still further embodiments, as illustrated in
As will be explained in further details below, device 800 captures ambient encoded audio through a microphone (not shown), preferably built in to device 800, and/or receives audio through a wired or wireless connection (e.g., 802.11g, 802.11n, Bluetooth, etc.). The audio received in device may or may not be encoded. If encoded audio is received, it is decoded and a concurrent audio signature is formed using any of the techniques described above. After the encoded audio is decoded, one or more messages are detected and one or more signatures are extracted. Each message and/or signature may then used to trigger an action on device 800. Depending on the signature and/or content of the message(s), the process may result in the device (1) displaying an image, (2) displaying text, (2) displaying an HTML page, (3) playing video arid/or audio, (4) executing software or a script, or any other similar function. The image may be a pre-sorted digital image of any kind (e.g., JPEG) and may also be barcodes, QR Codes, and/or symbols for use with code readers found in kiosks, retail checkouts and security checkpoints in private and public locations. Additionally, the message or signature may trigger device 800 to connect to server 803, which would allow server 803 to provide data and information back to device 800, and/or connect to additional servers 804 in order to request and/or instruct them to provide data and information back to device 800.
In certain embodiments, a link, such as an IP address or Universal Resource Locator (URL), may be used as one of the messages. Under a preferred embodiment, shortened links may be used in order to reduce the site of the message and thus provide more efficient transmission. Using techniques such as URL shortening or redirection, this can be readily accomplished. In shortening, every “long” URL is associated with a unique key, which is the part after the top-level domain name. The redirection instruction sent to a browser can contain in its header the HTTP status 301 (permanent redirect) or 302 (temporary redirect). There are several techniques that may be used to implement a URL shortening. Keys can be generated in base 36, assuming 26 letters and 10 numbers. Alternatively, if uppercase and lowercase letters are differentiated, then each character can represent a single digit within a number of base 62. In order to form the key, a hash function can be made, or a random number generated so that key sequence is not predictable. The advantage of URL shortening is that most protocols are capable of being shortened (e.g., HTTP, HTTPS, FTP, FTPS, MMS, POP, etc.).
With regard to encoded audio,
When utilizing a multi-layered message, one, two or three layers may be present in an encoded data stream, and each layer may be used to convey different data. Turning to
The second layer 902 of message 900 is illustrated having a similar configuration to layer 901, where each symbol set includes two synchronation symbols 909, 911, a larger number of data symbols 910, 912, and time code symbols 913. The third layer 903 includes two synchronization symbols 914, 916, and a larger number of data symbols 915, 917. The data symbols in each symbol set for the layers (901-903) should preferably have as predefined order and be indexed (e.g., 1, 2, 3). The code components of each symbol in any of the symbol sets should preferably have selected frequencies that arc different from the code components of every other symbol in the same symbol set. Under one embodiment, none of the code component frequencies used in representing the symbols of a message in one layer (e.g., Layer1901) is used to represent any symbol of another layer (e.g., Layer2902). In another embodiment, some of the code component frequencies used in representing symbols of messages in one layer (e.g., Layer3903) may be used in representing symbols of messages in another layer (e.g., Layer1901). However, in this embodiment, it is preferable that ‘shared’ layers have differing formats (e.g., Layer3903, Layer1901) in order to assist the decoder in separately decoding the data contained therein.
Sequences of data symbols within a given layer are preferably configured so that each sequence is paired with the other and is separated by a predetermined offset. Thus, as an example, if data 905 contains code 1, 2, 3 having an offset of “2”, data 907 in layer 901 would be 3, 4, 5. Since the same information is represented by two different data symbols that are separated in time and have different frequency components (frequency content), the message may be diverse in both time and frequency. Such a configuration is particularly advantageous where interference would otherwise render data symbols undetectable. Under one embodiment, each of the symbols in a layer have as duration (e.g., 0.2-0.8 sec) that matches other layers (e.g., layer1901, Layer2902). In another embodiment, the symbol duration may be different (e.g., Layer 2902, Layer 3903). During a decoding process, the decoder detects the layers and reports any predetermined segment that contains a code.
For received audio signals in the time domain, decoder 1000 transforms such signals to the frequency domain by means of function 1006. Function 1006 preferably is performed by a digital processor implementing a fast Fourier transform (FFT) although as direct cosine transform, a chirp transform or a Winograd transform algorithm (WFTA) may be employed in the alternative. Any other time-to-frequency-domain transformation function providing the necessary resolution may be employed in place of these. It will be appreciated that in certain implementations, function 306 may also be carried out by filters, by an application specific integrated circuit, or any other suitable deice or combination of devices. Function 1006 may also be implemented by one or more devices which also implement one or more of the remaining functions illustrated in
The frequency domain-converted audio signals are processed in a symbol values derivation function 1010, to produce stream of symbol values for each code symbol included in the received audio signal. The produced symbol values may represent, for example, signal energy, power, sound pressure level, amplitude, etc., measured instantaneously or over a period of time, on an absolute or relative scale, and may be expressed as a single value or as multiple values. Where the symbols are encoded as groups of single frequency components each having a predetermined frequency, the symbol values preferably represent either single frequency component values or one or more values based on single frequency component values. Function 1010 may be carried out by a digital processor, such as a DSP which advantageously carries out some or all or the other functions of decoder 1000. However, the function 1010 may also be carried out by an application specific integrated circuit, or by any other suitable device or combination of devices, and may be implemented by apparatus apart from the means which implement the remaining functions the decoder 1000.
The stream of symbol values produced by the function 1010 are accumulated over time in an appropriate storage device on a symbol-by-symbol basis, as indicated by function 1016. In particular, function 1016 is advantageous for use in decoding encoded symbols which repeat periodically, by periodically accumulating symbol values for the various possible symbols. For example, if a given symbol is expected to recur every X seconds, the function 1016 may serve to store a stream of symbol values for a period of nX seconds (n>1), and add to the stored values of one or more symbol value streams of nX seconds duration, so that peak symbol values accumulate over time, improving the signal-to-noise ratio the stored values. Function 1016 may be carried out by a digital processor, such as a DSP, which advantageously carries out some or all of the other functions of decoder 1000. However, the function 1010 may also be carried out using a memory device separate from such a processor, or by an application specific integrated circuit, or by any other suitable device or combination of devices, and may be implemented by apparatus apart from the means which implements the remaining functions of the decoder 1000.
The accumulated symbol values stored by the function 1016 are then examined by the function 1020 to detect the presence of an encoded message and output the detected message at an output 1026. Function 1020 can be carried out by matching the stored accumulated values or a processed version of such values, against stored patterns, whether by correlation or by another pattern matching technique. However, function 1020 advantageously is carried out by examining peak accumulated symbol values and their relative timing, to reconstruct their encoded message. This function may be carried out after the first stream of symbol values has been stored by the function 1016 and/or after each subsequent stream has been added thereto, so that the message is detected once the signal-to-noise ratios of the stored, accumulated streams of symbol values reveal is valid message pattern.
In order to separate the various components, the DSP repeatedly carries out FFTs on audio signal samples falling within successive predetermined intervals. The intervals may overlap, although this is not required. In an exemplary embodiment, ten overlapping FFT's are carried out during each second of decoder operation. Accordingly, the energy of each symbol period falls within five FFT periods. The FFT's are preferably windowed, although this may be omitted in order to simplify the decoder. The samples are stored and, when a sufficient number are thus available, a new FFT is performed, as indicated by steps 434 and 438.
In this embodiment, the frequency component values are produced on a relative basis. That is, each component value, is represented as a signal-to-noise ratio (SNR), produced as follows. The energy within each frequency bin of the FFT in which a frequency component of any symbol can fall provides the numerator of each corresponding SNR Its denominator is determined as an average of adjacent bin values. For example, the average of seven of the eight surrounding bin energy values may be used, the largest value of the eight being ignored in order to avoid, the influence of a possible large bin energy value which could result, for example, from an audio signal component in the neighborhood of the code frequency component. Also, given that a large energy value could also appear in the code component bin, for example, due to noise or an audio signal component, the SNR is appropriately limited. In this embodiment, if SNR>6.0, then SNR is limited to 6.0, although a different maximum value may be selected.
The ten SNR's of each FFT and corresponding to each symbol which may be present, are combined to form symbol SNR's which are stored in a circular symbol SNR buffer, as indicated in step 442. In certain embodiments, the ten SNR's for a symbol are simply added, although other ways of combining the SNR's may be employed. The symbol SNR's for each of the twelve symbols are stored in the symbol SNR buffer as separate sequences, one symbol SNR for each FFT for 50 μl FFT's. After the values produced in the 50 FFT's have been stored in the symbol SNR buffer, new symbol SNR's are combined with the previously stored values, as described below.
When the symbol SNR buffer is filled, this is detected in a step 446. In certain advantageous embodiments, the stored SNR's are adjusted to reduce the influence of noise in a step 452, although this step may be optional. In this optional step, a noise value is obtained for each symbol (row) in the buffer by obtaining the average of all stored symbol SNR's in the respective row each time the buffer is filled. Then, to compensate for the effects of noise, this average or “noise” value is subtracted from each of the stored symbol SNR values in the corresponding row. In this manner, a “symbol” appearing only briefly, and thus not a valid detection, is averaged out over time.
After the symbol SNR's have been adjusted by subtracting the noise level, the decoder attempts to recover the message by examining the pattern of maximum SNR values in the buffer in a step 456. In certain embodiments, the maximum SNR values for each symbol are located in a process of successively combining groups of five adjacent SNR's, by weighting the values in the sequence in proportion to the sequential weighting (6 10 10 10 6) and then adding the weighted SNR's to produce a comparison SNR centered in the time period of the third SNR in the sequence. This process is carried out progressively throughout the fifty FFT periods of each symbol. For example, a first group of five SNR's for a specific symbol in FFT time periods (e.g., 1-5) are weighted and added to produce a comparison SNR for a specific FFT period (e.g., 3). Then a further comparison SNR is produced using the SNR's from successive FFT periods (e.g., 2-6), and so on until comparison values have been obtained centered on all FFT periods. However, other means may be employed for recovering the message. For example, either more or less than five SNR's may be combined, they may be combined without weighing, or they may be combined in a non-linear fashion.
After the comparison SNR values have been obtained, the decoder examines the comparison SNR values for a message pattern. Under a preferred embodiment, the synchronization (“marker”) code symbols are located first. Once this information is obtained, the decoder attempts to detect the peaks of the data symbols. The use of a predetermined offset between each data symbol in the first segment and the corresponding data symbol in the second segment provides a check on the validity of the detected message. That is, if both markers are detected and the same offset is observed between each data symbol in the first segment and its corresponding data symbol in the second segment, it is highly likely that a valid message has been received. If this is the case, the message is logged, and the buffer is cleared 466. It is understood by those skilled in the art that decoder operation may be modified depending on the structure of the message, its timing, its signal path, the mode of its detection, etc., without departing from the scope of the present invention. For example, in place of storing SNR's, FFT results may be stored directly for detecting a message.
Steps employed in the decoding process illustrated in
Since each five symbol message repeats every 2½ seconds, each symbol repeats at intervals of 2½ seconds or every 25 FFT's. In order to compensate for the effects of burst errors and the like, the SNR's R1 through R150 are combined by adding corresponding values of the repeating messages to obtain 25 combined SNR values SNRn, n=1,2 . . . 25, as follows:
Accordingly, if a burst error should result in the loss of a signal interval i, only one of the six message intervals will have been lost, and the essential characteristics of the combined SNR values are likely to be unaffected by this event.
Once the combined SNR values have been determined, the decoder detects the position of the marker symbol's peak as indicated by the combined SNR values and derives the data symbol sequence based on the markers position and the peak values of the data symbols. Once the message has thus been formed, as indicated in steps 582 and 583, the message is logged. However, unlike the embodiment of
As in the decoder of
In a further variation which is especially useful in audience measurement applications, a relatively large number of message intervals are separately stored to permit a retrospective analysis of their contents to detect a channel change. In another embodiment, multiple buffers are employed, each accumulating data for a different number of intervals for use in the decoding method of
Turning to
Given that accumulated supplementary data on a device is generally undesirable, it is preferred that pushed content be erased from the device to avoid excessive memory usage. Under one example, content (603, 607) would be pushed to cell phone 800B and would reside in the phone's memory until the “push”is received. When the content from the second push is stored, the content from the previous push is erased. An erase command (and/or other commands) may be contained in the pushed data, or may be contained in data decoded from audio. Under another embodiment, multiple content pushes may be stored, and the phone may be configured to keep a predetermined amount of pushed content (e.g., seven consecutive days). Under yet another embodiment, cell phone 800B may be enabled with a protection function to allow a user to permanently store selected content that was pushed to the device. Such a configuration is particularly advantageous if a user wishes to keep the content and prevent it front being automatically deleted. Cell phone 800B may even be configured to allow a user to protect content over time increments (e.g., selecting “save today's content”).
Referring to
Each respective code may be associated with a particular action. In the example of
Utilizing encoding/decoding techniques disclosed herein, more complex arrangements can be made for incorporating supplementary data into the encoded audio. For example, multimedia identification codes can be embedded in one layer, while supplementary data (e.g., URL link) can be embedded in a second layer. Execution/activation instruction codes may be embedded in a third layer, and so on. Multi-layer messages may also be interspersed between or among media identification messages to allow customized delivery of supplementary data according to a specific schedule.
In addition to code/action table 602, a signature/action table 606 may be pushed to device 800B as well. It is understood by those skilled in the art that signature table 606 may be pushed together with code table 602, or separately at different times. Signature table 606 similarly contains action items associated with at least one signature. As illustrated in FIG. 18, a first signature SIG001 is associated with a linking action, which in this case is a shortened (http://arb.com/m3q2xt). The link is used to automatically connect device 800B to a network. Signature SIG006 is associated with a digital picture “Pic1.jpg” which may be retrieve:don the device from the pushed content 607 (item 1). Signature SIG125 is not associated with any action, while signature SIG643 is associated with activating software application “App1.apk” which accessed from pushed content 607 (item 3), or may be also may be residing as a native application on device 800B. As each signature is extracted, it is processed using 606 to determine if an action should be taken. In some cases, an action is triggered, but in other cases, no action is taken. Since audio signatures are transitory in nature, in a preferred embodiment, multiple signatures are associated with a single action. Thus, as an example, if device 800B is extracting signatures from the audio of a commercial, the configuration may be such that the plurality of signatures extracted from the commercial are associated with a single action on device 800B. This configuration is particularly advantageous in properly executing an action when signatures are being extracted in a noisy environment. In any event, the extracted signatures are transmitted via wireless or wired connection to server 803, which processes signatures 605 to produce research data that identifies the content received on device 800B.
In addition to performing actions on the device, the codes and signatures transmitted from device 800B may be processed remotely in server 803 to determine personalized content and/or files 610 that may be transmitted back to device 800B. More specifically, content identified from any of 604 and/or 605 may be processed and alternately correlated with demographic data relating to the user of device 800B to generate personalized content, software, etc. that is presented to user of device 800B. These processes may be performed on server 803 alone or together with other servers or in a “cloud.”
Turning now to
In one embodiment, the detection and identification of one or more trigger codes begins the signature extraction process. Additional codes may continue to be received that (a) may be used to perform other actions on device 720, and/or (b) serve to identify the received media. These additional codes may be collected concurrently with the signature(s) or may be collected at different times. Under one advantageous embodiment, the trigger code may be used to set predetermined time periods in which signatures are collected, regardless of whether or not any further code is collected. This can be useful in situations when users switch from encoded media content to non-encoded media content. If one or more codes are detected during that time period, the signatures may be discarded. Additionally, device 720 can execute rules such that a predetermine amount of code must be collected before any signatures are discarded.
Still referring to
In an alternate embodiment, content, software, etc. obtained from the remote processing is not only transmitted to device 720, but is also transmitted to other devices that may or may not be registered by the user of device 720. Additionally, the content, software, etc. does not have to occur in real-time, but may be performed at pre-determined times, or upon the detection of an event (e.g., device 720 is being charged or is idle). Furthermore, using a suitably-configured device, detection of certain codes/signatures may be used to affect or enhance performance of device 720. For example, detection of certain codes/signatures may unlock features on the device or enhance connectivity to a network. Moreover, actions performed as a result of media exposure detection can be used to control and/or configure other devices that are otherwise unrelated to media. For example, one exemplary action may include the transmission of a control signal to a device, such as a light dimmer, to dim the room lights when a particular program is detected. It is appreciated by those skilled in the art that a multitude of options are available using the techniques described herein.
The Abstract of the Disclosure is provided to comply with 37 C.F.R. §1.72(b), requiring an abstract that will allow the reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in a single embodiment for the purpose of streamlining, the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment.
This patent arises from a continuation of U.S. non-provisional patent application Ser. No. 13/341,365, filed on Dec. 30, 2011, which is a continuation-in-part of U.S. non-provisional patent application Ser. No. 13/046,360, filed Mar. 11, 2011, now U.S. Pat. No. 8,731,906, issued on May 20, 2014, which is a continuation of U.S. non-provisional patent application Ser. No. 11/805,075, filed May 21, 2007, now U.S. Pat. No. 7,908,133, issued Mar. 15, 2011, which is a continuation-in-part of U.S. non-provisional patent application Ser. No. 10/256,834, filed Sep. 27, 2002, now U.S. Pat. No. 7,222,071, issued May 22, 2007. U.S. non-provisional patent application Ser. No. 13/341,365, also arises from a continuation-in-part of U.S. non-provisional patent application Ser. No. 13/307,649, filed Nov. 30, 2011. Each of U.S. patent application Ser. Nos. 13/341,365; 13/046,360; 11/805,075; 10/256,834; and 13/307,649 is hereby incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
2662168 | Scherbaysoy | Dec 1953 | A |
3372233 | Currey | Mar 1968 | A |
3845391 | Crosby | Oct 1974 | A |
3919479 | Moon | Nov 1975 | A |
4025851 | Haselwood et al. | May 1977 | A |
4230990 | Lert, Jr. | Oct 1980 | A |
4425661 | Moses et al. | Jan 1984 | A |
4450531 | Kenyon et al. | May 1984 | A |
4622583 | Watanabe et al. | Nov 1986 | A |
4633302 | Damoci | Dec 1986 | A |
4639779 | Greenberg | Jan 1987 | A |
4672605 | Hustig et al. | Jun 1987 | A |
4677466 | Lert, Jr. | Jun 1987 | A |
4697209 | Kiewit et al. | Sep 1987 | A |
4739398 | Thomas et al. | Apr 1988 | A |
4745468 | Von Kohorn | May 1988 | A |
4764808 | Solar | Aug 1988 | A |
4843562 | Kenyon et al. | Jun 1989 | A |
4847685 | Gall et al. | Jul 1989 | A |
4876592 | Von Kohorn | Oct 1989 | A |
4905080 | Watanabe et al. | Feb 1990 | A |
4918730 | Schulze | Apr 1990 | A |
4926255 | Von Kohorn | May 1990 | A |
4955070 | Welsh et al. | Sep 1990 | A |
4972471 | Gross et al. | Nov 1990 | A |
4973952 | Malec et al. | Nov 1990 | A |
5019899 | Boles et al. | May 1991 | A |
5023929 | Call | Jun 1991 | A |
5034807 | Von Kohorn | Jul 1991 | A |
5057915 | Von Kohorn | Oct 1991 | A |
5117228 | Fuchigami et al. | May 1992 | A |
5165069 | Vitt et al. | Nov 1992 | A |
5214793 | Conway et al. | May 1993 | A |
5227874 | Von Kohorn | Jul 1993 | A |
5283734 | Von Kohorn | Feb 1994 | A |
5294977 | Fisher et al. | Mar 1994 | A |
5319735 | Preuss et al. | Jun 1994 | A |
5331544 | Lu et al. | Jul 1994 | A |
5373315 | Dufresne et al. | Dec 1994 | A |
5382983 | Kwoh et al. | Jan 1995 | A |
5425100 | Thomas et al. | Jun 1995 | A |
5436653 | Ellis | Jul 1995 | A |
5444769 | Koen et al. | Aug 1995 | A |
5450490 | Jensen et al. | Sep 1995 | A |
5481294 | Thomas | Jan 1996 | A |
5485199 | Elkind et al. | Jan 1996 | A |
5485634 | Weiser et al. | Jan 1996 | A |
5495282 | Mostafa et al. | Feb 1996 | A |
5510828 | Lutterbach et al. | Apr 1996 | A |
5512933 | Wheatley et al. | Apr 1996 | A |
5524195 | Clanton, III et al. | Jun 1996 | A |
5526427 | Thomas et al. | Jun 1996 | A |
5541585 | Duhame et al. | Jul 1996 | A |
5543856 | Rosser et al. | Aug 1996 | A |
5572246 | Ellis et al. | Nov 1996 | A |
5574962 | Fardeau et al. | Nov 1996 | A |
5579124 | Aijala et al. | Nov 1996 | A |
5581800 | Fardeau et al. | Dec 1996 | A |
5594934 | Lu et al. | Jan 1997 | A |
5608445 | Mischler | Mar 1997 | A |
5612729 | Ellis et al. | Mar 1997 | A |
5612741 | Loban et al. | Mar 1997 | A |
5629739 | Dougherty | May 1997 | A |
5646674 | Bacon | Jul 1997 | A |
5659366 | Kerman | Aug 1997 | A |
5666293 | Metz et al. | Sep 1997 | A |
5682196 | Freeman | Oct 1997 | A |
5687191 | Lee et al. | Nov 1997 | A |
5719634 | Keery et al. | Feb 1998 | A |
5734413 | Lappington et al. | Mar 1998 | A |
5737025 | Dougherty et al. | Apr 1998 | A |
5737026 | Lu et al. | Apr 1998 | A |
5740035 | Cohen et al. | Apr 1998 | A |
5764763 | Jensen et al. | Jun 1998 | A |
5787334 | Fardeau et al. | Jul 1998 | A |
5796785 | Spiero | Aug 1998 | A |
5815671 | Morrison | Sep 1998 | A |
5828325 | Wolosewicz et al. | Oct 1998 | A |
5841978 | Rhoads | Nov 1998 | A |
5848155 | Cox | Dec 1998 | A |
5850249 | Massetti et al. | Dec 1998 | A |
5872588 | Aras et al. | Feb 1999 | A |
5880789 | Inaba | Mar 1999 | A |
5889548 | Chan | Mar 1999 | A |
5893067 | Bender et al. | Apr 1999 | A |
5907366 | Farmer et al. | May 1999 | A |
5918223 | Blum et al. | Jun 1999 | A |
5930369 | Cox et al. | Jul 1999 | A |
5945932 | Smith et al. | Aug 1999 | A |
5956716 | Kenner et al. | Sep 1999 | A |
5966120 | Arazi et al. | Oct 1999 | A |
5978855 | Metz et al. | Nov 1999 | A |
6034722 | Viney et al. | Mar 2000 | A |
6035177 | Moses et al. | Mar 2000 | A |
6097441 | Allport | Aug 2000 | A |
6128597 | Kolluru et al. | Oct 2000 | A |
6154209 | Naughton et al. | Nov 2000 | A |
6154484 | Lee et al. | Nov 2000 | A |
6157413 | Hanafee et al. | Dec 2000 | A |
6175627 | Petrovich et al. | Jan 2001 | B1 |
6208735 | Cox et al. | Mar 2001 | B1 |
6216129 | Eldering | Apr 2001 | B1 |
6266815 | Shen et al. | Jul 2001 | B1 |
6272176 | Srinivasan | Aug 2001 | B1 |
6286036 | Rhoads | Sep 2001 | B1 |
6286140 | Ivanyi | Sep 2001 | B1 |
6298348 | Eldering | Oct 2001 | B1 |
6300888 | Chen et al. | Oct 2001 | B1 |
6308327 | Liu et al. | Oct 2001 | B1 |
6331876 | Koster et al. | Dec 2001 | B1 |
6335736 | Wagner et al. | Jan 2002 | B1 |
6360167 | Millington | Mar 2002 | B1 |
6363159 | Rhoads | Mar 2002 | B1 |
6389055 | August et al. | May 2002 | B1 |
6400827 | Rhoads | Jun 2002 | B1 |
6411725 | Rhoads | Jun 2002 | B1 |
6421445 | Jensen et al. | Jul 2002 | B1 |
6466913 | Yasuda et al. | Oct 2002 | B1 |
6467089 | Aust et al. | Oct 2002 | B1 |
6487564 | Asai et al. | Nov 2002 | B1 |
6505160 | Levy et al. | Jan 2003 | B1 |
6512836 | Xie et al. | Jan 2003 | B1 |
6513014 | Walker et al. | Jan 2003 | B1 |
6522771 | Rhoads | Feb 2003 | B2 |
6539095 | Rhoads | Mar 2003 | B1 |
6546556 | Kataoka et al. | Apr 2003 | B1 |
6553178 | Abecassis | Apr 2003 | B2 |
6572020 | Barkan | Jun 2003 | B2 |
6607136 | Atsmon et al. | Aug 2003 | B1 |
6611607 | Davis et al. | Aug 2003 | B1 |
6621881 | Srinivasan | Sep 2003 | B2 |
6642966 | Limaye | Nov 2003 | B1 |
6647548 | Lu et al. | Nov 2003 | B1 |
6651253 | Dudkiewicz et al. | Nov 2003 | B2 |
6654480 | Rhoads | Nov 2003 | B2 |
6665873 | Van Gestel et al. | Dec 2003 | B1 |
6675383 | Wheeler et al. | Jan 2004 | B1 |
6681209 | Schmidt et al. | Jan 2004 | B1 |
6683966 | Tian et al. | Jan 2004 | B1 |
6710815 | Billmaier et al. | Mar 2004 | B1 |
6714683 | Tian et al. | Mar 2004 | B1 |
6741684 | Kaars | May 2004 | B2 |
6750985 | Rhoads | Jun 2004 | B2 |
6754470 | Hendrickson et al. | Jun 2004 | B2 |
6766523 | Herley | Jul 2004 | B2 |
6804379 | Rhoads | Oct 2004 | B2 |
6804566 | Colomes et al. | Oct 2004 | B1 |
6823310 | Ishito et al. | Nov 2004 | B2 |
6829368 | Meyer et al. | Dec 2004 | B2 |
6834308 | Ikezoye et al. | Dec 2004 | B1 |
6845360 | Jensen et al. | Jan 2005 | B2 |
6862355 | Kolessar et al. | Mar 2005 | B2 |
6871180 | Neuhauser et al. | Mar 2005 | B1 |
6873688 | Aarnio | Mar 2005 | B1 |
6941275 | Swierczek | Sep 2005 | B1 |
6963906 | Portuesi | Nov 2005 | B2 |
6968564 | Srinivasan | Nov 2005 | B1 |
6970786 | Hayama et al. | Nov 2005 | B2 |
6970886 | Conwell et al. | Nov 2005 | B1 |
6996213 | De Jong | Feb 2006 | B1 |
7003731 | Rhoads et al. | Feb 2006 | B1 |
7006555 | Srinivasan | Feb 2006 | B1 |
7012565 | Park et al. | Mar 2006 | B2 |
7050603 | Rhoads et al. | May 2006 | B2 |
7051086 | Rhoads et al. | May 2006 | B2 |
7058697 | Rhoads | Jun 2006 | B2 |
7082434 | Gosselin | Jul 2006 | B2 |
7095871 | Jones et al. | Aug 2006 | B2 |
7130622 | Vanska et al. | Oct 2006 | B2 |
7143949 | Hannigan | Dec 2006 | B1 |
7171018 | Rhoads et al. | Jan 2007 | B2 |
7174293 | Kenyon et al. | Feb 2007 | B2 |
7181159 | Breen | Feb 2007 | B2 |
7185201 | Rhoads et al. | Feb 2007 | B2 |
7194752 | Kenyon et al. | Mar 2007 | B1 |
7215280 | Percy et al. | May 2007 | B1 |
7221405 | Basson et al. | May 2007 | B2 |
7221902 | Kopra et al. | May 2007 | B2 |
7222071 | Neuhauser et al. | May 2007 | B2 |
7227972 | Brundage et al. | Jun 2007 | B2 |
7248715 | Levy | Jul 2007 | B2 |
7254249 | Rhoads et al. | Aug 2007 | B2 |
7256341 | Plastina et al. | Aug 2007 | B2 |
7260221 | Atsmon | Aug 2007 | B1 |
7273978 | Uhle | Sep 2007 | B2 |
7280970 | Tamir et al. | Oct 2007 | B2 |
7324159 | Eveleens et al. | Jan 2008 | B2 |
7328153 | Wells et al. | Feb 2008 | B2 |
7328160 | Nishio et al. | Feb 2008 | B2 |
7334735 | Antebi et al. | Feb 2008 | B1 |
7346512 | Li-Chun Wang et al. | Mar 2008 | B2 |
7356700 | Noridomi et al. | Apr 2008 | B2 |
7363278 | Schmelzer et al. | Apr 2008 | B2 |
7369678 | Rhoads | May 2008 | B2 |
7379778 | Hayes et al. | May 2008 | B2 |
7383297 | Atsmon et al. | Jun 2008 | B1 |
7421723 | Harkness et al. | Sep 2008 | B2 |
7437475 | Philyaw | Oct 2008 | B2 |
7440674 | Plotnick et al. | Oct 2008 | B2 |
7443292 | Jensen et al. | Oct 2008 | B2 |
7460991 | Jones et al. | Dec 2008 | B2 |
7463143 | Forr et al. | Dec 2008 | B2 |
7486925 | Breen | Feb 2009 | B2 |
7500007 | Ikezoye et al. | Mar 2009 | B2 |
7516074 | Bilobrov | Apr 2009 | B2 |
7533266 | Bruekers et al. | May 2009 | B2 |
7577195 | Hickey, Jr. | Aug 2009 | B2 |
7587732 | Wright et al. | Sep 2009 | B2 |
7592908 | Zhang et al. | Sep 2009 | B2 |
7623823 | Zito et al. | Nov 2009 | B2 |
7627477 | Wang et al. | Dec 2009 | B2 |
7639599 | Van Der Veen et al. | Dec 2009 | B2 |
7640141 | Kolessar et al. | Dec 2009 | B2 |
7672843 | Srinivasan et al. | Mar 2010 | B2 |
7742737 | Peiffer et al. | Jun 2010 | B2 |
7757248 | Harkness et al. | Jul 2010 | B2 |
7783489 | Kenyon et al. | Aug 2010 | B2 |
7783889 | Srinivasan | Aug 2010 | B2 |
7788684 | Petrovic et al. | Aug 2010 | B2 |
7796978 | Jones et al. | Sep 2010 | B2 |
7870574 | Kenyon et al. | Jan 2011 | B2 |
7881657 | Wang et al. | Feb 2011 | B2 |
7894703 | Lapstun et al. | Feb 2011 | B2 |
7908133 | Neuhauser | Mar 2011 | B2 |
7917645 | Ikezoye et al. | Mar 2011 | B2 |
7941480 | Atsmon et al. | May 2011 | B2 |
7941816 | Harkness et al. | May 2011 | B2 |
7961881 | Jensen et al. | Jun 2011 | B2 |
8019609 | Tamir et al. | Sep 2011 | B2 |
8020000 | Oostveen et al. | Sep 2011 | B2 |
8065260 | Herre et al. | Nov 2011 | B2 |
8069037 | Singhai | Nov 2011 | B2 |
8103879 | Levy et al. | Jan 2012 | B2 |
8121830 | Srinivasan et al. | Feb 2012 | B2 |
8359205 | Srinivasan et al. | Jan 2013 | B2 |
8369972 | Topchy et al. | Feb 2013 | B2 |
8554545 | Srinivasan et al. | Oct 2013 | B2 |
8666528 | Harkness et al. | Mar 2014 | B2 |
8700407 | Wang et al. | Apr 2014 | B2 |
8707340 | Ramaswamy et al. | Apr 2014 | B2 |
8959016 | McKenna et al. | Feb 2015 | B2 |
20010044899 | Levy | Nov 2001 | A1 |
20010048803 | Imahashi et al. | Dec 2001 | A1 |
20010053190 | Srinivasan | Dec 2001 | A1 |
20010056573 | Kovac et al. | Dec 2001 | A1 |
20020004740 | Shotey et al. | Jan 2002 | A1 |
20020032734 | Rhoads | Mar 2002 | A1 |
20020033842 | Zetts | Mar 2002 | A1 |
20020053078 | Holtz et al. | May 2002 | A1 |
20020056089 | Houston | May 2002 | A1 |
20020059218 | August et al. | May 2002 | A1 |
20020062382 | Rhoads et al. | May 2002 | A1 |
20020072982 | Barton et al. | Jun 2002 | A1 |
20020090114 | Rhoads et al. | Jul 2002 | A1 |
20020108125 | Joao | Aug 2002 | A1 |
20020111934 | Narayan | Aug 2002 | A1 |
20020112002 | Abato | Aug 2002 | A1 |
20020124246 | Kaminsky et al. | Sep 2002 | A1 |
20020126872 | Brunk et al. | Sep 2002 | A1 |
20020133393 | Tatsumi et al. | Sep 2002 | A1 |
20020133562 | Newnam et al. | Sep 2002 | A1 |
20020138851 | Lord et al. | Sep 2002 | A1 |
20020144262 | Plotnick et al. | Oct 2002 | A1 |
20020161741 | Wang et al. | Oct 2002 | A1 |
20020162118 | Levy et al. | Oct 2002 | A1 |
20020164050 | Rhoads | Nov 2002 | A1 |
20020174425 | Markel et al. | Nov 2002 | A1 |
20020194592 | Tsuchida et al. | Dec 2002 | A1 |
20030005430 | Kolessar | Jan 2003 | A1 |
20030021441 | Levy et al. | Jan 2003 | A1 |
20030039465 | Bjorgan et al. | Feb 2003 | A1 |
20030086341 | Wells et al. | May 2003 | A1 |
20030088674 | Ullman et al. | May 2003 | A1 |
20030103645 | Levy et al. | Jun 2003 | A1 |
20030105870 | Baum | Jun 2003 | A1 |
20030108200 | Sako | Jun 2003 | A1 |
20030110485 | Lu et al. | Jun 2003 | A1 |
20030131350 | Peiffer et al. | Jul 2003 | A1 |
20030170001 | Breen | Sep 2003 | A1 |
20030177488 | Smith et al. | Sep 2003 | A1 |
20030181168 | Herrod et al. | Sep 2003 | A1 |
20030195851 | Ong | Oct 2003 | A1 |
20030229900 | Reisman | Dec 2003 | A1 |
20040004630 | Kalva et al. | Jan 2004 | A1 |
20040006696 | Shin et al. | Jan 2004 | A1 |
20040008615 | Oh | Jan 2004 | A1 |
20040024588 | Watson et al. | Feb 2004 | A1 |
20040031058 | Reisman | Feb 2004 | A1 |
20040058675 | Lu et al. | Mar 2004 | A1 |
20040064319 | Neuhauser et al. | Apr 2004 | A1 |
20040073916 | Petrovic et al. | Apr 2004 | A1 |
20040102961 | Jensen et al. | May 2004 | A1 |
20040111738 | Gunzinger | Jun 2004 | A1 |
20040120417 | Lynch et al. | Jun 2004 | A1 |
20040122679 | Neuhauser et al. | Jun 2004 | A1 |
20040122727 | Zhang et al. | Jun 2004 | A1 |
20040125125 | Levy | Jul 2004 | A1 |
20040127192 | Ceresoli et al. | Jul 2004 | A1 |
20040128514 | Rhoads | Jul 2004 | A1 |
20040137929 | Jones et al. | Jul 2004 | A1 |
20040143844 | Brant et al. | Jul 2004 | A1 |
20040146161 | De Jong | Jul 2004 | A1 |
20040162720 | Jang et al. | Aug 2004 | A1 |
20040170381 | Srinivasan | Sep 2004 | A1 |
20040184369 | Herre et al. | Sep 2004 | A1 |
20040186768 | Wakim et al. | Sep 2004 | A1 |
20040199387 | Wang et al. | Oct 2004 | A1 |
20040210922 | Peiffer et al. | Oct 2004 | A1 |
20040236819 | Anati et al. | Nov 2004 | A1 |
20050028189 | Heine et al. | Feb 2005 | A1 |
20050033758 | Baxter | Feb 2005 | A1 |
20050035857 | Zhang et al. | Feb 2005 | A1 |
20050036653 | Brundage et al. | Feb 2005 | A1 |
20050050577 | Westbrook et al. | Mar 2005 | A1 |
20050058319 | Rhoads et al. | Mar 2005 | A1 |
20050086488 | Kori et al. | Apr 2005 | A1 |
20050086682 | Burges et al. | Apr 2005 | A1 |
20050192933 | Rhoads et al. | Sep 2005 | A1 |
20050204379 | Yamamori | Sep 2005 | A1 |
20050215239 | Kopra et al. | Sep 2005 | A1 |
20050234728 | Tachibana et al. | Oct 2005 | A1 |
20050234774 | Dupree | Oct 2005 | A1 |
20050243784 | Fitzgerald et al. | Nov 2005 | A1 |
20050262351 | Levy | Nov 2005 | A1 |
20050267750 | Steuer et al. | Dec 2005 | A1 |
20050271246 | Sharma et al. | Dec 2005 | A1 |
20060059277 | Zito et al. | Mar 2006 | A1 |
20060083403 | Zhang et al. | Apr 2006 | A1 |
20060095401 | Krikorian et al. | May 2006 | A1 |
20060107195 | Ramaswamy et al. | May 2006 | A1 |
20060107302 | Zdepski | May 2006 | A1 |
20060110005 | Tapson | May 2006 | A1 |
20060136564 | Ambrose | Jun 2006 | A1 |
20060153041 | Miyashita et al. | Jul 2006 | A1 |
20060168613 | Wood et al. | Jul 2006 | A1 |
20060212290 | Ide | Sep 2006 | A1 |
20060224798 | Klein et al. | Oct 2006 | A1 |
20070006250 | Croy et al. | Jan 2007 | A1 |
20070016918 | Alcorn et al. | Jan 2007 | A1 |
20070055987 | Lu et al. | Mar 2007 | A1 |
20070110089 | Essafi et al. | May 2007 | A1 |
20070127717 | Herre et al. | Jun 2007 | A1 |
20070129952 | Kenyon et al. | Jun 2007 | A1 |
20070143778 | Covell et al. | Jun 2007 | A1 |
20070149114 | Danilenko | Jun 2007 | A1 |
20070162927 | Ramaswamy et al. | Jul 2007 | A1 |
20070201835 | Rhoads | Aug 2007 | A1 |
20070226760 | Neuhauser et al. | Sep 2007 | A1 |
20070274523 | Rhoads | Nov 2007 | A1 |
20070276925 | La Joie et al. | Nov 2007 | A1 |
20070276926 | LaJoie et al. | Nov 2007 | A1 |
20070288476 | Flanagan, III et al. | Dec 2007 | A1 |
20070294057 | Crystal et al. | Dec 2007 | A1 |
20070294132 | Zhang et al. | Dec 2007 | A1 |
20070294705 | Gopalakrishnan et al. | Dec 2007 | A1 |
20070294706 | Neuhauser et al. | Dec 2007 | A1 |
20080019560 | Rhoads | Jan 2008 | A1 |
20080022114 | Moskowitz | Jan 2008 | A1 |
20080028223 | Rhoads | Jan 2008 | A1 |
20080028474 | Horne et al. | Jan 2008 | A1 |
20080040354 | Ray et al. | Feb 2008 | A1 |
20080059160 | Saunders et al. | Mar 2008 | A1 |
20080065507 | Morrison et al. | Mar 2008 | A1 |
20080071530 | Ehara | Mar 2008 | A1 |
20080077956 | Morrison et al. | Mar 2008 | A1 |
20080082510 | Wang et al. | Apr 2008 | A1 |
20080082922 | Biniak et al. | Apr 2008 | A1 |
20080083003 | Biniak et al. | Apr 2008 | A1 |
20080086304 | Neuhauser | Apr 2008 | A1 |
20080101454 | Luff et al. | May 2008 | A1 |
20080133223 | Son et al. | Jun 2008 | A1 |
20080137749 | Tian et al. | Jun 2008 | A1 |
20080139182 | Levy et al. | Jun 2008 | A1 |
20080140573 | Levy et al. | Jun 2008 | A1 |
20080215333 | Tewfik et al. | Sep 2008 | A1 |
20080219496 | Tewfik et al. | Sep 2008 | A1 |
20080235077 | Harkness et al. | Sep 2008 | A1 |
20080292134 | Sharma et al. | Nov 2008 | A1 |
20080319739 | Mehrotra et al. | Dec 2008 | A1 |
20090030066 | Kiss | Jan 2009 | A1 |
20090070587 | Srinivasan et al. | Mar 2009 | A1 |
20090119723 | Tinsman | May 2009 | A1 |
20090150553 | Collart et al. | Jun 2009 | A1 |
20090193052 | Fitzgerald et al. | Jul 2009 | A1 |
20090240505 | Villemoes et al. | Sep 2009 | A1 |
20090259325 | Topchy et al. | Oct 2009 | A1 |
20090265214 | Jobs et al. | Oct 2009 | A1 |
20090281815 | Zopf | Nov 2009 | A1 |
20090307061 | Monighetti et al. | Dec 2009 | A1 |
20090307084 | Monighetti et al. | Dec 2009 | A1 |
20090326960 | Breebaat | Dec 2009 | A1 |
20100027837 | Levy et al. | Feb 2010 | A1 |
20100030838 | Atsmon et al. | Feb 2010 | A1 |
20100106510 | Topchy et al. | Apr 2010 | A1 |
20100106718 | Topchy et al. | Apr 2010 | A1 |
20100114668 | Klein et al. | May 2010 | A1 |
20100134278 | Srinivasan et al. | Jun 2010 | A1 |
20100135638 | Mio | Jun 2010 | A1 |
20100223062 | Srinivasan et al. | Sep 2010 | A1 |
20100226526 | Modro et al. | Sep 2010 | A1 |
20100268573 | Jain et al. | Oct 2010 | A1 |
20100273433 | Ozaki et al. | Oct 2010 | A1 |
20100324708 | Ojanpera | Dec 2010 | A1 |
20110092288 | Pryzby et al. | Apr 2011 | A1 |
20110208515 | Neuhauser | Aug 2011 | A1 |
20110208518 | Holtel et al. | Aug 2011 | A1 |
20110224992 | Chaoui et al. | Sep 2011 | A1 |
20110300925 | Adiraju et al. | Dec 2011 | A1 |
20120101827 | Topchy et al. | Apr 2012 | A1 |
20120203363 | McKenna et al. | Aug 2012 | A1 |
20120203559 | McKenna et al. | Aug 2012 | A1 |
20130096706 | Srinivasan et al. | Apr 2013 | A1 |
20130138231 | McKenna et al. | May 2013 | A1 |
20130160042 | Stokes et al. | Jun 2013 | A1 |
20140287834 | Adiraju et al. | Sep 2014 | A1 |
Number | Date | Country |
---|---|---|
2003230993 | Nov 2003 | AU |
2006230639 | Sep 2006 | AU |
0112901 | Jun 2003 | BR |
0309598 | Feb 2005 | BR |
2293957 | Jul 2000 | CA |
2150539 | Nov 2000 | CA |
2483104 | Nov 2003 | CA |
1149366 | May 1997 | CN |
1303547 | Jul 2001 | CN |
1372682 | Oct 2002 | CN |
1592906 | Mar 2005 | CN |
1647160 | Jul 2005 | CN |
0275328 | Jul 1988 | EP |
0713335 | May 1996 | EP |
0769749 | Apr 1997 | EP |
0887958 | Dec 1998 | EP |
1026847 | Aug 2000 | EP |
1213860 | Jun 2002 | EP |
1049320 | Jan 2003 | EP |
0883939 | May 2003 | EP |
1349370 | Oct 2003 | EP |
1453286 | Sep 2004 | EP |
1463220 | Sep 2004 | EP |
1307833 | Jun 2006 | EP |
1745464 | Oct 2007 | EP |
1504445 | Aug 2008 | EP |
1340320 | Oct 2008 | EP |
1019868 | Jan 2009 | EP |
1249002 | Mar 2011 | EP |
2000307530 | Nov 2000 | JP |
2002521702 | Jul 2002 | JP |
2002247610 | Aug 2002 | JP |
2003208187 | Jul 2003 | JP |
2003536113 | Dec 2003 | JP |
2006154851 | Jun 2006 | JP |
2007318745 | Dec 2007 | JP |
9111062 | Jul 1991 | WO |
9512278 | May 1995 | WO |
9527349 | Oct 1995 | WO |
9627264 | Sep 1996 | WO |
9702672 | Jan 1997 | WO |
9743736 | Nov 1997 | WO |
9810539 | Mar 1998 | WO |
9826529 | Jun 1998 | WO |
9832251 | Jul 1998 | WO |
9959275 | Nov 1999 | WO |
0004662 | Jan 2000 | WO |
0019699 | Apr 2000 | WO |
0072309 | Nov 2000 | WO |
0119088 | Mar 2001 | WO |
0124027 | Apr 2001 | WO |
0131497 | May 2001 | WO |
0152178 | Jul 2001 | WO |
0153922 | Jul 2001 | WO |
0199109 | Dec 2001 | WO |
0211123 | Feb 2002 | WO |
0217591 | Feb 2002 | WO |
0211123 | Feb 2002 | WO |
0227600 | Apr 2002 | WO |
0245273 | Jun 2002 | WO |
02061652 | Aug 2002 | WO |
02065318 | Aug 2002 | WO |
03009277 | Jan 2003 | WO |
03091990 | Nov 2003 | WO |
03096337 | Nov 2003 | WO |
2004010352 | Jan 2004 | WO |
2004040416 | May 2004 | WO |
2004040475 | May 2004 | WO |
2005025217 | Mar 2005 | WO |
2005038625 | Apr 2005 | WO |
2005064885 | Jul 2005 | WO |
2005101243 | Oct 2005 | WO |
2005111998 | Nov 2005 | WO |
2006012241 | Feb 2006 | WO |
2006025797 | Mar 2006 | WO |
2007056531 | May 2007 | WO |
2007056532 | May 2007 | WO |
2008042953 | Apr 2008 | WO |
2008044664 | Apr 2008 | WO |
2008045950 | Apr 2008 | WO |
2008110002 | Sep 2008 | WO |
2008110790 | Sep 2008 | WO |
2009011206 | Jan 2009 | WO |
2009061651 | May 2009 | WO |
2009064561 | May 2009 | WO |
Entry |
---|
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 13/341,365, on Nov. 19, 2012 (9 pages). |
United States Patent and Trademark Office, “Notice of Allowance,” issued in connection with U.S. Appl. No. 13/341,365, on Apr. 30, 2013 (8 pages). |
United States Patent and Trademark Office, “Notice of Allowance,” issued in connection with U.S. Appl. No. 13/341,365, on Oct. 2, 2013 (6 pages). |
United States Patent and Trademark Office, “Notice of Allowance,” issued in connection with U.S. Appl. No. 13/341,365, on Feb. 24, 2014 (5 pages). |
United States Patent and Trademark Office, “Notice of Allowance,” issued in connection with U.S. Appl. No. 13/341,365, on Jun. 4, 2014 (5 pages). |
United States Patent and Trademark Office, “Notice of Allowance,” issued in connection with U.S. Appl. No. 13/341,365, on Sep. 25, 2014 (5 pages). |
Patent Cooperation Treaty, “Written Opinion of the International Searching Authority,” issued in connection with International Patent Application No. PCT/US2012/071972, on Mar. 12, 2013 (8 pages). |
Patent Cooperation Treaty, “International Search Report,” issued in connection with International Patent Application No. PCT/US2012/071972, on Mar. 12, 2013 (2 pages). |
Patchen, Bob, “Meters for the Digital Age: An Update on Arbitron's Personal Portable Meter,” TVB Research Conference, Oct. 14, 1999 (29 pages). |
The Manchester 300, “Out of the Lab and into the Field: A Report on the Extended Field Test of Arbitron's Portable People Meter in Manchester, England,” Arbitron, 2000 (23 pages). |
Kenyon et al., “High Capacity Real Time Broadcast Monitoring,” IEEE International Conference on Systems, Man, and Cybernetics, Oct. 1991 (pp. 147-152). |
Patent Cooperation Treaty, “Written Opinion of the International Searching Authority,” issued in connection with International Patent Application No. PCT/US2012/067062, on Feb. 5, 2013 (4 pages). |
Patent Cooperation Treaty, “International Search Report,” issued in connection with International Patent Application No. PCT/US2012/067062, on Feb. 5, 2013 (3 pages). |
Fink et al. “Social- and Interactive-Television Applications Based on Real-Time Ambient-Audio Identification,” EuroITV, 2006 (11 pages). |
Calburn, “Google Researchers Prose TB Monitoring,” Information Week, Jun. 7, 2006, (3 pages). |
Anderson, “Google to Compete with Nielsen for TV-Ratings Info?,” Ars Technica, Jun. 19, 2006 (2 pages). |
Wang, “An Industrial-Strength Audio Algorithm,” Shazam Entertainment, Ltd., in Proceedings of the Fourth International Conference on Music Information Retrieval, Baltimore, Oct. 26-30, 2003 (8 pages). |
Stultz, “Handheld Captioning at Disney World Theme Parks,” article retrieved on Mar. 19, 2009, http://goflorida.about.com/od/disneyworld/a/wdw—captioning.htm, (2 pages). |
Kane, “Entrepreneur Plans On-Demand Videogame Service,” The Wall Street Journal, Mar. 24, 2009 (2 pages). |
Shazam, “Shazam turns up the volume on mobile music,” http://www.shazam.com/music/web/newsdetail.html?nid=NEWS137, Nov. 28, 2007 (1 page). |
Shazam, “Shazam and VidZone Digital Media announce UK1s first fixed price moble download service for music videos,” http://www. shazam.com/music/web/newsdetail.html?nid=NEWS136, Feb. 11, 2008 (1 page). |
Shazam, “Shazam launches new music application for Facebook fans,” http://www.shazam.com/music/web/newsdetail.html?nid=NEWS135, Feb. 18, 2008 (1 page). |
Heuer, et al. “Adaptive Multimedia Messaging based on MPEG-7 The M3-Box,” Nov. 9-10, 2000, Proc. Second Int'l Symposium on Mobile Multimedia System Application, pp. 6-13 (8 pages). |
Wactlar et al., “Digital Video Archives: Managing Through Metadata,” Building a National Strategy for Digital Preservation: Issues in Digital Media-Archiving, Apr. 2002 (14 pages). |
Mulder, “The Integration of Metadata From Production to Consumer,” EBU Technical Review, Sep. 2000, retrieved from http://www.ebu.ch/en/technical/trev/trev—284-contents.html (5 pages). |
Hopper, “EBU Project Group P/META Metadata Exchange Standards,” EBU Technical Review, Sep. 2000, retrieved from http://www.ebu.ch/en/technical/trev/trev—284-contents.html (24 page). |
Evain, “TV-Anytime Metadata—A Preliminary Specification on Schedule!,” EBU Technical Review, Sep. 2000, retrieved from http://www.ebu.ch/en/technical/trev/trev—284-contents.html (14 pages). |
Philip Laven, “EBU Technical Review (Editorial),” No. 284, Sep. 2000, retrieved from http://www.ebu.ch/en/technical/trev/trev—284-editorial.html (3 pages). |
Number | Date | Country | |
---|---|---|---|
20150154973 A1 | Jun 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13341365 | Dec 2011 | US |
Child | 14619725 | US | |
Parent | 11805075 | May 2007 | US |
Child | 13046360 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13307649 | Nov 2011 | US |
Child | 13341365 | US | |
Parent | 13046360 | Mar 2011 | US |
Child | 13307649 | US | |
Parent | 10256834 | Sep 2002 | US |
Child | 11805075 | US |