The present disclosure relates generally to improving accuracy of data derived from analysis of connected devices and their association with particular categories.
Users are increasingly accessing media across a range of devices. However, determining which devices are associated with particular users can be difficult. Many systems exist that purport to map devices to particular categories (sometimes referred to as device mapping or device graphing). For example, a device mapping system can generate a device map indicating that a first device and a second device belong to a particular category. In some examples, the devices can me mapped to a particular user based on the categories assigned to each device. In other examples, the devices are assigned into a household-wide device map. However, accuracy of the device map is difficult to assess. Therefore, there is a need in the art to determine and improve the accuracy of device maps.
Provided are methods, devices, and computer-program products for determining an accuracy score for a device mapping system by processing media (e.g., video and/or audio data) being played by one or more devices. In some examples, the accuracy score can be based on a device map of the device mapping system. In such examples, the device map can purport to link devices that are associated together.
In some examples, the accuracy score can be further based on media content viewing data from an automated content recognition (ACR) system or other system that can determine media content being viewed by one or more media player devices. In some cases, the media content can include video content (which can include audio content) or audio content. The media content can be processed and analyzed (e.g., using an ACR system) to determine media content that is being viewed by one or more media player devices, which can be stored as viewing data. In one illustrative example when an ACR system is used to determine media content being viewed by a media player device, the media player device can decode video data (and, in some cases, audio data) associated with video programs. The media player device can place the decoded contents of each frame of the video into a video frame buffer in preparation for display or for further processing of pixel information of the video frames. The media player device can process the buffered video data and can produce unknown data points (which can be referred to as “cue points”) representing an unknown video segment currently being played by the player device. A matching server can receive the unknown cue points, and can compare the unknown cue points with stored candidate cue points to determine a match between a candidate video segment and the unknown video segment.
The viewing data can then be processed to determine the accuracy score. In such examples, the media viewing data (sometimes referred to as viewing behavior) can indicate media content being played by a media player device. In some examples, the accuracy score can indicate whether the device mapping system is assigning similar categories to devices that have similar playback of media content. In such examples, the device map can be compared to device-category designations that are assigned based on randomness to determine an accuracy of the device mapping system. If the device map is determined to have a sufficiently low probability of being merely random in nature, the device mapping system can be determined to be accurate.
In some examples, the accuracy score can be used by the device mapping system to improve its process for generating the device map. For example, the device mapping system can modify one or more operations to attempt to improve the accuracy score.
In some examples, a system is provided that includes one or more processors and one or more non transitory machine readable storage media containing instructions that, when executed on the one or more processors, cause the one or more processors to perform operations. The operations include obtaining a plurality of categories assigned to groups of media player devices. The plurality of categories are determined using a device mapping system. A category includes a categorization for a group of the media player devices. The operations further include determining viewing behaviors of the groups of media player devices. The viewing behaviors are determined using automated content recognition by matching viewed media content viewed by the media player devices with stored media content. The operations further include determining a correlation between the plurality of categories and the viewing behaviors of the groups of media player devices, and determining an accuracy score for the device mapping system using the determined correlation. The operations further include assigning the accuracy score to the device mapping system, wherein the accuracy score is used to improve the device mapping system.
In some examples, a method is provided that includes obtaining a plurality of categories assigned to groups of media player devices. The plurality of categories are determined using a device mapping system. A category includes a categorization for a group of the media player devices. The method further includes determining viewing behaviors of the groups of media player devices. The viewing behaviors are determined using automated content recognition by matching viewed media content viewed by the media player devices with stored media content. The method further includes determining a correlation between the plurality of categories and the viewing behaviors of the groups of media player devices, and determining an accuracy score for the device mapping system using the determined correlation. The method further includes assigning the accuracy score to the device mapping system, wherein the accuracy score is used to improve the device mapping system.
In some examples, computer-program product tangibly embodied in a non-transitory machine-readable storage medium is provided that includes instructions that, when executed by the one or more processors, cause the one or more processors to: obtain a plurality of categories assigned to groups of media player devices, wherein the plurality of categories are determined using a device mapping system, and wherein a category includes a categorization for a group of the media player devices; determine viewing behaviors of the groups of media player devices, wherein the viewing behaviors are determined using automated content recognition by matching viewed media content viewed by the media player devices with stored media content; determine a correlation between the plurality of categories and the viewing behaviors of the groups of media player devices; determine an accuracy score for the device mapping system using the determined correlation; and assign the accuracy score to the device mapping system, wherein the accuracy score is used to improve the device mapping system.
In some aspects, the correlation between the plurality of categories and the viewing behaviors of the groups of media player devices is based on a variance in viewing behaviors among the plurality of categories.
In some aspects, determining the accuracy score for the device mapping system includes performing a statistical hypothesis test to determine whether the correlation between the plurality of categories and the viewing behaviors of the groups of media player devices is random.
In some aspects, the system, method, and computer-program product include comparing a result of the statistical hypothesis test to a randomness threshold, and determining the correlation is random when the result is less than the randomness threshold.
In some aspects, the accuracy score is determined for the device mapping system based on the comparison of the result of the statistical hypothesis test to the randomness threshold.
In some aspects, media content is video content, and performing the automated content recognition includes: receiving a pixel cue point associated with a frame of an unknown video segment, wherein the pixel cue point includes a set of pixel values corresponding to the frame; identifying a candidate reference data point in a database of reference data points, wherein the candidate reference data point is similar to the pixel cue point, and wherein the candidate reference data point includes one or more pixel values corresponding to a candidate frame of a candidate video segment; adding a token to a bin associated with the candidate reference data point and the candidate video segment; determining whether a number of tokens in the bin exceeds a value; and identifying the unknown video segment as matching the candidate video segment when the number of tokens in the bin exceeds the value.
In some aspects, the viewing behaviors include at least one or more of an amount of time of the groups of media player devices view one or more of a plurality of channels, incomes associated with users of the groups of media player devices, age groups of users of the groups of media player devices, education levels of users of the groups of media player devices, or numbers of devices in the groups of media player devices.
This summary is not intended to identify key or essential features of the claimed subject matter, nor is it intended to be used in isolation to determine the scope of the claimed subject matter. The subject matter should be understood by reference to appropriate portions of the entire specification of this patent, any or all drawings, and each claim.
The foregoing, together with other features and embodiments, will become more apparent upon referring to the following specification, claims, and accompanying drawings.
Illustrative embodiments of the present invention are described in detail below with reference to the following drawing figures:
In the following description, for the purposes of explanation, specific details are set forth in order to provide a thorough understanding of embodiments of the invention. However, it will be apparent that various embodiments may be practiced without these specific details. The figures and description are not intended to be restrictive.
The ensuing description provides exemplary embodiments only, and is not intended to limit the scope, applicability, or configuration of the disclosure. Rather, the ensuing description of the exemplary embodiments will provide those skilled in the art with an enabling description for implementing an exemplary embodiment. It should be understood that various changes may be made in the function and arrangement of elements without departing from the spirit and scope of the invention as set forth in the appended claims.
Specific details are given in the following description to provide a thorough understanding of the embodiments. However, it will be understood by one of ordinary skill in the art that the embodiments may be practiced without these specific details. For example, circuits, systems, networks, processes, and other components may be shown as components in block diagram form in order not to obscure the embodiments in unnecessary detail. In other instances, well-known circuits, processes, algorithms, structures, and techniques may be shown without unnecessary detail in order to avoid obscuring the embodiments.
Also, it is noted that individual embodiments may be described as a process which is depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed, but could have additional steps not included in a figure. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination can correspond to a return of the function to the calling function or the main function.
The term “machine-readable storage medium” or “computer-readable storage medium” includes, but is not limited to, portable or non-portable storage devices, optical storage devices, and various other mediums capable of storing, containing, or carrying instruction(s) and/or data. A machine-readable storage medium or computer-readable storage medium may include a non-transitory medium in which data can be stored and that does not include carrier waves and/or transitory electronic signals propagating wirelessly or over wired connections. Examples of a non-transitory medium may include, but are not limited to, a magnetic disk or tape, optical storage media such as compact disk (CD) or digital versatile disk (DVD), flash memory, memory or memory devices. A computer-program product may include code and/or machine-executable instructions that may represent a procedure, a function, a subprogram, a program, a routine, a subroutine, a module, a software package, a class, or any combination of instructions, data structures, or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, or other information may be passed, forwarded, or transmitted using any suitable means including memory sharing, message passing, token passing, network transmission, or other transmission technique.
Furthermore, embodiments may be implemented by hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks (e.g., a computer-program product) may be stored in a machine-readable medium. A processor(s) may perform the necessary tasks.
Systems depicted in some of the figures may be provided in various configurations. In some embodiments, the systems may be configured as a distributed system where one or more components of the system are distributed across one or more networks in a cloud computing system.
Provided are methods, devices, and computer-program products for determining accuracy of device mapping systems. In some examples, an accuracy score can be determined for a device mapping system. In some cases, the accuracy score can be based on a device map of the device mapping system. In such cases, the device map can include information linking media player devices (also referred to as “devices” or “player devices” or “media devices”) that are categorized or associated together. In some examples, a device (or “player device” or “media player device”) can be defined as a network-connected device, such as a smartphone, tablet, smart TV, laptop, smart watch or other wearable device, or any other network-connected device (e.g., Internet-connected, broadband network connected, cellular network connected, or other network-connected device) that can receive and display media content. In some examples, the device map can be generated based on assigning one or more category segments (or “categories”) to each device included in the device map. In such examples, category segments or categories can include demographic attributes, such as annual household income, age group, education level, number of television sets, and/or various preferences regarding entertainment choices, or any suitable combination thereof. However, it should be recognized that category segments or categories can be any logical group that can associate a plurality of devices together.
In some examples, the accuracy score can be further based on viewing data from an automated content recognition (ACR) component or other system that can determine media content being viewed by one or more media players. In some cases, the media content can include video content (which can include audio content) or audio content. The media content can be processed and analyzed (e.g., using an ACR system) to determine what media content is being viewed by one or more media players, which can be stored as viewing data. The viewing data can then be processed to determine the accuracy score. In such examples, the viewing data (sometimes referred to as viewing behavior) can indicate media content being played by a media player device. In some examples, the accuracy score can indicate whether the device mapping system is assigning similar categories to devices that have similar playback of media content. In such examples, the device map can be determined to be random, indicating that the device mapping system is inaccurate. In contrast, if the device map is determined to have a sufficiently low probability of being merely random in nature, the device mapping system can be determined to be accurate.
In some examples, the accuracy score can be used by the device mapping system to improve its process for generating the device map. For example, the device mapping system can modify one or more operations to attempt to improve the accuracy score.
In some examples, data from the one or more devices 110 can be processed by one or more components of the system, including the device map categorization system 120 and the viewing behavior system 130. The one or more devices 110 can include laptops (e.g., laptop 112), tablets (e.g., a first tablet 114 or a second tablet 115), phones (e.g., smart phone 116), televisions (e.g., television 118), or any other network-connected device that can receive and display media content (e.g., auditory or visual content). In some examples, the one or more devices 110 can be included in one or more networks.
As described above, data from the one or more devices 110 can be processed by the device map categorization system 120. Processing can include assigning one or more category segments to each of the one or more devices 110 (e.g., using category segment generator 122), generating a device map for the one or more devices 110 (e.g., using device map generator 124), and generating a data report for the device map (e.g., using data report generator 126). In some examples, each device in the device map can be assigned at least one category segment (also referred to as a category). In such examples, an category segment assigned to the device can indicate that the device ranks above a threshold for one or more behaviors and/or one or more characteristics that are associated with the category segment. In some examples, the device map can indicate links or associations between a plurality of devices. Illustrative examples of the data from the one or more devices 110 can include cookies from browsers and IP addresses.
In some examples, the data report generator 126 can generate a data report of the device map and/or the one or more category segments. In such examples, the data report can include information for each of the one or more devices 110 and corresponding category segments. In one illustrative example, the data report can include information as to the type of device (such as differentiating a smart TV from a mobile tablet) to be used to differentiate TV program playback (e.g., broadcast TV, streaming TV, or other TV program). For example, it can be useful to determine if particular media content is being viewed on a television in a home or on a handheld device. There are many other uses for having information about category segments that are well known to the skilled person.
As described above, the one or more devices 110 can also be processed by the viewing behavior system 130. In some examples, the viewing behavior system 130 can include an automated content recognition (ACR) engine 132. The ACR engine 132 can identify media content (e.g., auditory or visual content) being displayed or played on a device (e.g., a device of the one or more devices 110). In such examples, the ACR engine 132 can also identify a channel or other metadata associated with the media content.
While there are many ways that media content can be identified, one method (described in more detail below with respect to
The matching system 700 can include a player device 702 and a matching server 704 (e.g., an ACR engine). The player device 702 can include a media client 706, an input device 708, an output device 710, and one or more contextual applications 726. The media client 706 (which can be a television system, a computer system, or other electronic device capable of connecting to the Internet) can decode data (e.g., broadcast signals, data packets, or other frame data) associated with video programs 728. The media client 706 can place the decoded contents of each frame of the video into a video frame buffer in preparation for display or for further processing of pixel information of the video frames. In some examples, the player device 702 can be any electronic decoding system that can receive and decode a video signal. The player device 702 can receive video programs 728 and store video information in a video buffer (not shown). The player device 702 can process the video buffer information and produce unknown data points (which can be referred to as “cue points”). The media client 706 can transmit the unknown data points to the matching server 704 for comparison with reference data points in the reference database 716.
The input device 708 can include any suitable device that allows a request or other information to be input to the media client 706. For example, the input device 708 can include a keyboard, a mouse, a voice-recognition input device, a wireless interface for receiving wireless input from a wireless device (e.g., from a remote controller, a mobile device, or other suitable wireless device), or any other suitable input device. The output device 710 can include any suitable device that can present or otherwise output information, such as a display, a wireless interface for transmitting a wireless output to a wireless device (e.g., to a mobile device or other suitable wireless device), a printer, or other suitable output device.
The matching system 700 can begin a process of identifying a video segment by first collecting data samples from known video data sources 718. For example, the matching server 104 can collect data to build and maintain a reference database 716 from a variety of video data sources 718. The video data sources 718 can include media providers of television programs, movies, or any other suitable video source. Video data from the video data sources 718 can be provided as over-the-air broadcasts, as cable TV channels, as streaming sources from the Internet, and from any other video data source. In some examples, the matching server 704 can process the received video from the video data sources 718 to generate and collect reference video data points in the reference database 716, as described below. In some examples, video programs from video data sources 718 can be processed by a reference video program ingest system (not shown), which can produce the reference video data points and send them to the reference database 716 for storage. The reference data points can be used as described above to determine information that is then used to analyze unknown data points.
The matching server 704 can store reference video data points for each video program received for a period of time (e.g., a number of days, a number of weeks, a number of months, or any other suitable period of time) in the reference database 716. The matching server 704 can build and continuously or periodically update the reference database 716 of television programming samples (e.g., including reference data points, which may also be referred to as cues or cue values). In some examples, the data collected is a compressed representation of the video information sampled from periodic video frames (e.g., every fifth video frame, every tenth video frame, every fifteenth video frame, or other suitable number of frames). In some examples, a number of bytes of data per frame (e.g., 25 bytes, 50 bytes, 75 bytes, 100 bytes, or any other amount of bytes per frame) can be collected for each program source. Any number of program sources can be used to obtain video, such as 25 channels, 50 channels, 75 channels, 100 channels, 200 channels, or any other number of program sources.
The media client 706 can send a communication 722 to a matching engine 712 of the matching server 704. The communication 722 can include a request for the matching engine 712 to identify unknown content. For example, the unknown content can include one or more unknown data points and the reference database 716 can include a plurality of reference data points. The matching engine 712 can identify the unknown content by matching the unknown data points to reference data in the reference database 716. In some examples, the unknown content can include unknown video data being presented by a display (for video-based ACR), a search query (for a MapReduce system, a Bigtable system, or other data storage system), an unknown image of a face (for facial recognition), an unknown image of a pattern (for pattern recognition), or any other unknown data that can be matched against a database of reference data. The reference data points can be derived from data received from the video data sources 718. For example, data points can be extracted from the information provided from the video data sources 718 and can be indexed and stored in the reference database 716.
The matching engine 712 can send a request to the candidate determination engine 714 to determine candidate data points from the reference database 716. A candidate data point can be a reference data point that is a certain determined distance from the unknown data point. In some examples, a distance between a reference data point and an unknown data point can be determined by comparing one or more pixels (e.g., a single pixel, a value representing group of pixels (e.g., a mean, an average, a median, or other value), or other suitable number of pixels) of the reference data point with one or more pixels of the unknown data point. In some examples, a reference data point can be the certain determined distance from an unknown data point when the pixels at each sample location are within a particular pixel value range.
In one illustrative example, a pixel value of a pixel can include a red value, a green value, and a blue value (in a red-green-blue (RGB) color space). In such an example, a first pixel (or value representing a first group of pixels) can be compared to a second pixel (or value representing a second group of pixels) by comparing the corresponding red values, green values, and blue values respectively, and ensuring that the values are within a certain value range (e.g., within 0-5 values). For example, the first pixel can be matched with the second pixel when (1) a red value of the first pixel is within 5 values in a 0-255 value range (plus or minus) of a red value of the second pixel, (2) a green value of the first pixel is within 5 values in a 0-255 value range (plus or minus) of a green value of the second pixel, and (3) a blue value of the first pixel is within 5 values in a 0-255 value range (plus or minus) of a blue value of the second pixel. In such an example, a candidate data point is a reference data point that is an approximate match to the unknown data point, leading to multiple candidate data points (related to different media segments) being identified for the unknown data point. The candidate determination engine 714 can return the candidate data points to the matching engine 712.
For a candidate data point, the matching engine 712 can add a token into a bin that is associated with the candidate data point and that is assigned to an identified video segment from which the candidate data point is derived. A corresponding token can be added to all bins that correspond to identified candidate data points. As more unknown data points (corresponding to the unknown content being viewed) are received by the matching server 704 from the player device 702, a similar candidate data point determination process can be performed, and tokens can be added to the bins corresponding to identified candidate data points. Only one of the bins corresponds to the segment of the unknown video content being viewed, with the other bins corresponding to candidate data points that are matched due to similar data point values (e.g., having similar pixel color values), but that do not correspond to the actual segment being viewed. The bin for the unknown video content segment being viewed will have more tokens assigned to it than other bins for segments that are not being watched. For example, as more unknown data points are received, a larger number of reference data points that correspond to the bin are identified as candidate data points, leading to more tokens being added to the bin. Once a bin includes a particular number of tokens, the matching engine 712 can determine that the video segment associated with the bin is currently being displayed on the player device 702. A video segment can include an entire video program or a portion of the video program. For example, a video segment can be a video program, a scene of a video program, one or more frames of a video program, or any other portion of a video program. An example of a system for identifying media content is described in U.S. patent application Ser. No. 15/240,801, which is hereby incorporated by reference in its entirety, for all purposes.
Referring back to
In some examples, the statistical correlator 136 can evaluate the device map using the viewing data output from the ACR engine 132 to determine a correlation between the categories generated using the device map categorization system 120 and the viewing behaviors of the groups of devices assigned to the different categories. In some cases, the statistical correlator 136 can determine whether the device mapping system that generated the device map is accurate.
In one illustrative example, a graph can include an x-axis for an average channel viewing time (i.e., time spent in total) and a y-axis for channel variance. In such examples, the channel variance can indicate a variance in viewing time between difference channels. In some examples, each point (e.g., a circle) on a graph can represent an category segment or category (e.g., as described above with the category segment generator 124). For example, when the category segment is for a household (e.g., a plurality of devices), a circle at (2, 10) can indicate that the household was active for 2 units of time (e.g., hours, minutes, seconds, etc.), and during which one or more channels were viewed for 10 units of time (e.g., hours, minutes, seconds, etc.) more than one or more other channels. For another example, when the category segment is for a device, a circle at (2, 10) can indicate that the device was active for 2 units of time (e.g., hours, minutes, seconds, etc.), and during which one or more channels were viewed for 10 units of time (e.g., hours minutes, seconds, etc.) more than one or more other channels.
While the examples shown in
In some examples, the statistical correlator 136 can perform a statistical evaluation of viewing data (e.g., viewing time of video segments) from the ACR engine 132 and the device map from the device map categorization system 120. The statistical evaluation can represent an accuracy of the predictions of the device map versus viewing data as detected by the ACR engine 132. For example, the statistical evaluation can indicate whether there is a correlation between devices with similar viewing data and the categories that were assigned to the devices. As another example, the statistical correlator 136 can determine how channel viewing varies between each category segment. It should be recognized that the statistical evaluation can be performed using any suitable statistical evaluation technique, including, for example, analysis of variance (ANOVA), chi-squared, f-test, t-test, any combination thereof, or the like. For illustrative purposes, ANOVA will be used as an example herein. However, one of ordinary skill will appreciate that any other suitable statistical evaluation test can be used by the statistical correlator 136 to determine a correlation.
ANOVA can be used to analyze differences between means (or averages) of logical groups. In some examples, a mean of information associated with the ACR engine 132 can be calculated for each category segment received from the device map categorization system 120. For example, for each device, a variance in viewing time between different channels can be calculated (e.g., as shown in
In some examples, ANOVA can compare two types of variances: the variance within each category segment and the variance between different category segments. To calculate the variances, a sum of squares (SS) between different category segments (referred to as a “SS between”) can be computed: SSbetween=Σn(
where k is a number of distinct samples. In some examples, a variance within each category segment (referred to as a “variance within”) can also be computed: SSwithin=ΣΣn(x−
After the variance between and variance within are calculated, an F-ratio can be computed. The F-ratio can be based on the variance between and variance within:
The F-ratio can indicate an amount of randomness with the data. In some examples, a critical value for the F-ratio can be identified such that when the F-value is less than the critical value, the device mapping system fails the test (i.e., the data is identified as random).
In some examples, the statistical correlator 126 can send a message to the category measure system 120 (e.g., to the category segment generator 122 or the device map generator 124). In such examples, the message can indicate whether the data report is satisfactory in light of media content from the one or more devices 110. In some examples, the data report can be satisfactory when it is determined that the categories do not appear to be random based on the statistical evaluation performed by the statistical correlator 136. Using this methodology to score device map systems, modifications to the device map systems can be identified and compared to other accuracy scores to determine progress of the modifications.
Process 400 is illustrated as a logical flow diagram, the operation of which represent a sequence of operations that can be implemented in hardware, computer instructions, or a combination thereof. In the context of computer instructions, the operations represent computer-executable instructions stored on one or more computer-readable storage media that, when executed by one or more processors, perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures, and the like that perform particular functions or implement particular data types. The order in which the operations are described is not intended to be construed as a limitation, and any number of the described operations can be combined in any order and/or in parallel to implement the processes.
Additionally, the process 400 can be performed under the control of one or more computer systems configured with executable instructions and can be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) executing collectively on one or more processors, by hardware, or combinations thereof. As noted above, the code can be stored on a machine-readable storage medium, for example, in the form of a computer program comprising a plurality of instructions executable by one or more processors. The machine-readable storage medium can be non-transitory.
The process 400 can include obtaining a plurality of categories assigned to groups of media player devices (step 410). In some examples, the plurality of categories can be determined using a device mapping system. In such examples, a category can include a categorization for a group of media player devices (e.g., an category segment, a device segment, a viewing segment, or the like), such as: incomes associated with users of the groups of media player devices, age groups of users of the groups of media player devices, education levels of users of the groups of media player devices, or numbers of devices in the groups of media player devices. In some examples, a media player device can be a network-connected device that can receive and display media content. Examples of media player devices can include a smartphone, a tablet, a smart TV, a laptop, or any other suitable network-connected device.
The process 400 can further include determining viewing behaviors of the groups of media player devices (step 420). In some examples, the viewing behaviors can include at least one or more of an amount of time that the groups of media player devices view one or more of a plurality of channels, recorded programming (e.g., from a DVR), live programming, video-on-demand content, content from the Internet (e.g., YouTube or NetFlix), a specific programming type (e.g., sports or reality television), or any combination thereof. In some examples, the viewing behaviors can be determined using automated content recognition (ACR). For example, the ACR can match viewed media content viewed by the media player devices with stored media content. In such examples, media content can be auditory or visual (e.g., audio, video, or still image).
In examples where media content is video content, performing the automated content recognition can include receiving a pixel cue point associated with a frame of an unknown video segment, wherein the pixel cue point includes a set of pixel values corresponding to the frame; identifying a candidate reference data point in a database of reference data points, wherein the candidate reference data point is similar to the pixel cue point, and wherein the candidate reference data point includes one or more pixel values corresponding to a candidate frame of a candidate video segment; adding a token to a bin associated with the candidate reference data point and the candidate video segment; determining whether a number of tokens in the bin exceeds a value; and identifying the unknown video segment as matching the candidate video segment when the number of tokens in the bin exceeds the value.
The process 400 can further include determining a correlation between the plurality of categories and the viewing behaviors of the groups of media player devices (step 430). In some examples, the correlation between the plurality of categories and the viewing behaviors of the groups of media player devices can be based on a variance in viewing behavior among the plurality of categories.
The process 400 can further include determining an accuracy score for the device mapping system using the determined correlation (step 440). In some examples, determining the accuracy score of the device mapping system includes performing a statistical hypothesis test (e.g., such as the F-ratio test described above) to determine whether the correlation between the plurality of categories and the viewing behaviors of the groups of media player devices is random. In some examples, the process 300 can further include comparing a result of the statistical hypothesis test to a randomness threshold (sometimes reference to as a critical value) and determining the correlation is random when the result is less than the randomness threshold. In some examples, the accuracy score can be determined for the device mapping system based on the comparison of the result of the statistical hypothesis test to the randomness threshold.
The process 400 can further include assigning (or sending) the accuracy score to the device mapping system (step 450). In some examples, the accuracy score can be used to improve the device mapping system. For example, an optimization algorithm (such as hill climbing) can be used to compare an updated accuracy score to the accuracy score, where the updated accuracy score is determined after updating one or more parameters of the device mapping system.
Process 500 is illustrated as a logical flow diagram, the operation of which represent a sequence of operations that can be implemented in hardware, computer instructions, or a combination thereof. In the context of computer instructions, the operations represent computer-executable instructions stored on one or more computer-readable storage media that, when executed by one or more processors, perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures, and the like that perform particular functions or implement particular data types. The order in which the operations are described is not intended to be construed as a limitation, and any number of the described operations can be combined in any order and/or in parallel to implement the processes.
Additionally, the process 500 can be performed under the control of one or more computer systems configured with executable instructions and can be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) executing collectively on one or more processors, by hardware, or combinations thereof. As noted above, the code can be stored on a machine-readable storage medium, for example, in the form of a computer program comprising a plurality of instructions executable by one or more processors. The machine-readable storage medium can be non-transitory.
The process 500 can include calculating a value for each of one or more devices (step 510). In some examples, the value can be a number of hours that a device is tuned to each channel of one or more channels available to the device. In some examples, the one or more devices can be indicated by a device mapping system. In such examples, the device mapping system can provide an indication of the one or more devices and a particular category (sometimes referred to as an category segment) for each of the one or more devices.
The process 500 can further include performing a statistical analysis for the value for each of the one or more devices to identify how channel viewing varies between each segment indicated by the device mapping system (step 520). In some examples, the statistical analysis can be analysis of variance (ANOVA), chi-squared, f-test, t-test, or the like. If the statistical analysis is ANOVA, the process 500 can further include: determining that the segments are poorly identified by the device mapping system when there is a low amount of variance between the segments (step 530), determining that the segments correlate to viewing behaviors when there is a high amount of variance between the segments (step 540), and performing an F-test (or other suitable statistical analysis test or statistical hypothesis test) to determine whether there is a low amount or a high amount of variance between the segments.
Process 600 is illustrated as a logical flow diagram, the operation of which represent a sequence of operations that can be implemented in hardware, computer instructions, or a combination thereof. In the context of computer instructions, the operations represent computer-executable instructions stored on one or more computer-readable storage media that, when executed by one or more processors, perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures, and the like that perform particular functions or implement particular data types. The order in which the operations are described is not intended to be construed as a limitation, and any number of the described operations can be combined in any order and/or in parallel to implement the processes.
Additionally, the process 600 can be performed under the control of one or more computer systems configured with executable instructions and can be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) executing collectively on one or more processors, by hardware, or combinations thereof. As noted above, the code can be stored on a machine-readable storage medium, for example, in the form of a computer program comprising a plurality of instructions executable by one or more processors. The machine-readable storage medium can be non-transitory.
The process 600 can include obtaining a device map for one or more devices (step 610). In some examples, the one or more devices can each be media devices that make up a household. In some examples, the device map can be generated by a third-party system. In such examples, the device map can be generated based on raw data (e.g., internet protocol (IP) traffic such as use of a local area connection and/or the Internet, including time spent on email, Facebook, YouTube, or the like). In other examples, the raw data can be assembled by collecting browser data such as cookies and other data mining activities from the one or more devices.
In some examples, a request for the device map can include an indication of one or more devices that the device map should be based on. In other examples, the request can include the raw data. A person of ordinary skill in the art will recognize that the device map may be generated using proprietary processes, which is known in the art. Data used in generating a device map can be derived from analyzing cookies that collect on devices as a user accesses various Internet sites. In some examples, the type of Internet-connected device can be derived from remotely querying configuration information within a device.
The process 600 can further include associating (or mapping) the device map to media content viewing (step 620). In some examples, associating can include associating an IP address of the device map to an IP address of a device being monitored for media content viewing (using some form of content recognition). In such examples, associating can also include associating media content viewing detected from the device with the IP address of the device map. An example of associating a device map to media content viewing would be where a device map predicts that the associated household likes culinary things because they search websites that feature food recipes and kitchen tools which then maps to their TV viewing of the Food channel.
The process 600 can further include generating a first database for viewing statistics based on data from one or more reference sources (e.g., one or more devices such as a television in a home) (step 630). In some examples, the first database can be generated by a third party using proprietary processes of associating Internet activity gathered from one or more devices of a device map. In such examples, the proprietary processes do not use actual viewing records. In some examples, the first database can be used to associate viewer interest with media content viewing. For example, the first database can associate media content viewing with product interest, such as specific automobile brands.
The process 600 can further include generating a second database for video segment viewing using automated content recognition (step 640). In some examples, the automated content recognition can identify media content being viewed on one or more media devices (as described herein). The identified media content can be analyzed to determine what is being viewed by the one or more media devices. Based on what is being viewed, the second database can be generated to include information on viewing behavior of the one or more devices.
The process 600 further includes performing a statistical evaluation (e.g., a statistical correlation as described above) using the first database and the second database (step 650). In some examples, the statistical evaluation can compare the first database and the second database.
The process 600 further includes evaluating the device map based on the statistical evaluation (step 660). For example, if the statistical evaluation indicates that one or more category segments were selected randomly, the device map can be determined to be inadequate. However, if the statistical evaluation indicates that one or more category segments correlate with viewing behavior, the device map can be determined to be accurate. In some examples, the process 600 can be recursive such that when step 660 ends, the process 600 can repeat steps 630, 640, 650, and 660.
In some examples, the process flow can further include a cue point cache 806. The cue point cache 806 can be a storage device for supporting ingest (storage) of cue point data. The process flow can further include a real-time reference database 804. The real-time reference database 804 can be a database of television programming currently available on one or more television channels. The real-time reference database 804 can gather and process the one or more television channels for the purpose of comparison to the cue point data from the media device 801 for identifying video segments currently being displayed on the media device 801.
In some examples, the process flow can further include a search router 803. The search router 803 can accept device map information for one or more devices in a household (such as devices 805A, 805B, 805C, and 805D) for the purpose of correlating the device map information with viewing information from the media device 801.
In the foregoing specification, aspects of the invention are described with reference to specific embodiments thereof, but those skilled in the art will recognize that the invention is not limited thereto. Various features and aspects of the above-described invention may be used individually or jointly. Further, embodiments can be utilized in any number of environments and applications beyond those described herein without departing from the broader spirit and scope of the specification. The specification and drawings are, accordingly, to be regarded as illustrative rather than restrictive. In addition, while systems have been described, it should be recognized that a system can be one or more servers. In addition, the ACR engine 132, the statistical correlator 136, the external data ingestor 134, the category segment generator 122, the device map generator 124, the data report generator 126, the device mapping system, the viewing behavior system 130, the device map categorization system 120, or the like can be implemented by one or more servers.
In the foregoing description, for the purposes of illustration, methods were described in a particular order. It should be appreciated that in alternate embodiments, the methods may be performed in a different order than that described. It should also be appreciated that the methods described above may be performed by hardware components or may be embodied in sequences of machine-executable instructions, which may be used to cause a machine, such as a general-purpose or special-purpose processor or logic circuits programmed with the instructions to perform the methods. These machine-executable instructions may be stored on one or more machine readable mediums, such as CD-ROMs or other type of optical disks, floppy diskettes, ROMs, RAMs, EPROMs, EEPROMs, magnetic or optical cards, flash memory, or other types of machine-readable mediums suitable for storing electronic instructions. Alternatively, the methods may be performed by a combination of hardware and software.
Where components are described as being configured to perform certain operations, such configuration can be accomplished, for example, by designing electronic circuits or other hardware to perform the operation, by programming programmable electronic circuits (e.g., microprocessors, or other suitable electronic circuits) to perform the operation, or any combination thereof.
While illustrative embodiments of the application have been described in detail herein, it is to be understood that the inventive concepts may be otherwise variously embodied and employed, and that the appended claims are intended to be construed to include such variations, except as limited by the prior art.
This application claims the benefit of U.S. Provisional Application No. 62/482,495, filed Apr. 6, 2017, which is hereby incorporated by reference in its entirety for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
4677466 | Lert, Jr. et al. | Jun 1987 | A |
4697209 | Kiewit et al. | Sep 1987 | A |
4739398 | Thomas et al. | Apr 1988 | A |
5019899 | Boles et al. | May 1991 | A |
5319453 | Copriviza et al. | Jun 1994 | A |
5436653 | Ellis et al. | Jul 1995 | A |
5481294 | Thomas et al. | Jan 1996 | A |
5557334 | Legate | Sep 1996 | A |
5572246 | Ellis et al. | Nov 1996 | A |
5812286 | Li | Sep 1998 | A |
5826165 | Echeita et al. | Oct 1998 | A |
5918223 | Blum et al. | Jun 1999 | A |
5945988 | Williams | Aug 1999 | A |
6008802 | Goldschmidt et al. | Dec 1999 | A |
6025837 | Matthews, III et al. | Feb 2000 | A |
6035177 | Moses et al. | Mar 2000 | A |
6064764 | Bhaskaran et al. | May 2000 | A |
6381362 | Deshpande et al. | Apr 2002 | B1 |
6415438 | Blackketter et al. | Jul 2002 | B1 |
6463585 | Hendricks et al. | Oct 2002 | B1 |
6469749 | Dimitrova | Oct 2002 | B1 |
6577346 | Perlman | Jun 2003 | B1 |
6577405 | Kranz et al. | Jun 2003 | B2 |
6628801 | Powell et al. | Sep 2003 | B2 |
6647548 | Lu et al. | Nov 2003 | B1 |
6675174 | Bolle et al. | Jan 2004 | B1 |
6771316 | Iggulden | Aug 2004 | B1 |
6804659 | Graham et al. | Oct 2004 | B1 |
6978470 | Swix et al. | Dec 2005 | B2 |
6990453 | Wang et al. | Jan 2006 | B2 |
7028327 | Dougherty et al. | Apr 2006 | B1 |
7039930 | Goodman et al. | May 2006 | B1 |
7050068 | Bastos et al. | May 2006 | B1 |
7051351 | Goldman et al. | May 2006 | B2 |
7064796 | Roy et al. | Jun 2006 | B2 |
7089575 | Agnihotri et al. | Aug 2006 | B2 |
7136875 | Anderson et al. | Nov 2006 | B2 |
7210157 | Devara | Apr 2007 | B2 |
7346512 | Wang et al. | Mar 2008 | B2 |
7421723 | Harkness et al. | Sep 2008 | B2 |
7590998 | Hanley | Sep 2009 | B2 |
7623823 | Zito et al. | Nov 2009 | B2 |
7793318 | Deng | Sep 2010 | B2 |
7933451 | Kloer | Apr 2011 | B2 |
8001571 | Schwartz et al. | Aug 2011 | B1 |
8094872 | Yagnik et al. | Jan 2012 | B1 |
8171004 | Kaminski, Jr. et al. | May 2012 | B1 |
8171030 | Peira et al. | May 2012 | B2 |
8175413 | Ioffe et al. | May 2012 | B1 |
8189945 | Stojancic et al. | May 2012 | B2 |
8195689 | Ramanathan et al. | Jun 2012 | B2 |
8229227 | Stojancic et al. | Jul 2012 | B2 |
8335786 | Peira et al. | Dec 2012 | B2 |
8364703 | Ramanathan et al. | Jan 2013 | B2 |
8385644 | Stojancic et al. | Feb 2013 | B2 |
8392789 | Biscondi et al. | Mar 2013 | B2 |
8494234 | Djordjevic et al. | Jul 2013 | B1 |
8522283 | Laligand et al. | Aug 2013 | B2 |
8595781 | Neumeier et al. | Nov 2013 | B2 |
8625902 | Baheti et al. | Jan 2014 | B2 |
8769854 | Battaglia | Jul 2014 | B1 |
8776105 | Sinha et al. | Jul 2014 | B2 |
8832723 | Sinha et al. | Sep 2014 | B2 |
8856817 | Sinha et al. | Oct 2014 | B2 |
8893167 | Sinha et al. | Nov 2014 | B2 |
8893168 | Sinha et al. | Nov 2014 | B2 |
8898714 | Neumeier et al. | Nov 2014 | B2 |
8918804 | Sinha et al. | Dec 2014 | B2 |
8918832 | Sinha et al. | Dec 2014 | B2 |
8930980 | Neumeier et al. | Jan 2015 | B2 |
8959202 | Haitsma et al. | Feb 2015 | B2 |
9055309 | Neumeier et al. | Jun 2015 | B2 |
9055335 | Neumeier et al. | Jun 2015 | B2 |
9071868 | Neumeier et al. | Jun 2015 | B2 |
9094714 | Neumeier et al. | Jul 2015 | B2 |
9094715 | Neumeier et al. | Jul 2015 | B2 |
9262671 | Unzueta | Feb 2016 | B2 |
9368021 | Touloumtzis | Jun 2016 | B2 |
9449090 | Neumeier et al. | Sep 2016 | B2 |
9465867 | Hoarty | Oct 2016 | B2 |
9838753 | Neumeier et al. | Dec 2017 | B2 |
9955192 | Neumeier et al. | Apr 2018 | B2 |
20010039658 | Walton | Nov 2001 | A1 |
20010044992 | Jahrling | Nov 2001 | A1 |
20020026635 | Wheeler et al. | Feb 2002 | A1 |
20020054695 | Bjorn et al. | May 2002 | A1 |
20020056088 | Silva, Jr. et al. | May 2002 | A1 |
20020059633 | Harkness et al. | May 2002 | A1 |
20020083060 | Wang et al. | Jun 2002 | A1 |
20020100041 | Rosenberg et al. | Jul 2002 | A1 |
20020105907 | Bruekers et al. | Aug 2002 | A1 |
20020120925 | Logan | Aug 2002 | A1 |
20020122042 | Bates | Sep 2002 | A1 |
20020162117 | Pearson et al. | Oct 2002 | A1 |
20020162118 | Levy et al. | Oct 2002 | A1 |
20030026422 | Gerheim et al. | Feb 2003 | A1 |
20030086341 | Wells | May 2003 | A1 |
20030121037 | Swix et al. | Jun 2003 | A1 |
20030121046 | Roy et al. | Jun 2003 | A1 |
20030147561 | Faibish et al. | Aug 2003 | A1 |
20030188321 | Shoff et al. | Oct 2003 | A1 |
20040045020 | Witt et al. | Mar 2004 | A1 |
20040059708 | Dean et al. | Mar 2004 | A1 |
20040183825 | Stauder et al. | Sep 2004 | A1 |
20040216171 | Barone, Jr. et al. | Oct 2004 | A1 |
20040221237 | Foote et al. | Nov 2004 | A1 |
20040226035 | Hauser | Nov 2004 | A1 |
20040240562 | Bargeron et al. | Dec 2004 | A1 |
20050015795 | Iggulden | Jan 2005 | A1 |
20050015796 | Bruckner et al. | Jan 2005 | A1 |
20050027766 | Ben | Feb 2005 | A1 |
20050066352 | Herley | Mar 2005 | A1 |
20050172312 | Lienhart et al. | Aug 2005 | A1 |
20050207416 | Rajkotia | Sep 2005 | A1 |
20050209065 | Schlosser et al. | Sep 2005 | A1 |
20050235318 | Grauch et al. | Oct 2005 | A1 |
20060029368 | Harville | Feb 2006 | A1 |
20060031914 | Dakss et al. | Feb 2006 | A1 |
20060133647 | Werner et al. | Jun 2006 | A1 |
20060153296 | Deng | Jul 2006 | A1 |
20060155952 | Haas | Jul 2006 | A1 |
20060173831 | Basso et al. | Aug 2006 | A1 |
20060187358 | Lienhart et al. | Aug 2006 | A1 |
20060195857 | Wheeler et al. | Aug 2006 | A1 |
20060195860 | Eldering et al. | Aug 2006 | A1 |
20060245724 | Hwang et al. | Nov 2006 | A1 |
20060245725 | Lim | Nov 2006 | A1 |
20060253330 | Maggio et al. | Nov 2006 | A1 |
20070033608 | Eigeldinger | Feb 2007 | A1 |
20070050832 | Wright et al. | Mar 2007 | A1 |
20070061724 | Slothouber et al. | Mar 2007 | A1 |
20070061831 | Savoor et al. | Mar 2007 | A1 |
20070094696 | Sakai | Apr 2007 | A1 |
20070109449 | Cheung | May 2007 | A1 |
20070113263 | Chatani | May 2007 | A1 |
20070139563 | Zhong | Jun 2007 | A1 |
20070143796 | Malik | Jun 2007 | A1 |
20070168409 | Cheung | Jul 2007 | A1 |
20070180459 | Smithpeters et al. | Aug 2007 | A1 |
20070192782 | Ramaswamy | Aug 2007 | A1 |
20070250901 | McIntire et al. | Oct 2007 | A1 |
20070261070 | Brown et al. | Nov 2007 | A1 |
20070261075 | Glasberg | Nov 2007 | A1 |
20070271300 | Ramaswamy | Nov 2007 | A1 |
20070274537 | Srinivasan | Nov 2007 | A1 |
20070300280 | Turner et al. | Dec 2007 | A1 |
20080044102 | Ekin | Feb 2008 | A1 |
20080046945 | Hanley | Feb 2008 | A1 |
20080089551 | Heather et al. | Apr 2008 | A1 |
20080138030 | Bryan et al. | Jun 2008 | A1 |
20080155588 | Roberts et al. | Jun 2008 | A1 |
20080155627 | O'Connor et al. | Jun 2008 | A1 |
20080172690 | Kanojia et al. | Jul 2008 | A1 |
20080208891 | Wang et al. | Aug 2008 | A1 |
20080240562 | Fukuda et al. | Oct 2008 | A1 |
20080263620 | Berkvens et al. | Oct 2008 | A1 |
20080276266 | Huchital et al. | Nov 2008 | A1 |
20080310731 | Stojancic et al. | Dec 2008 | A1 |
20080313140 | Pereira et al. | Dec 2008 | A1 |
20090007195 | Beyabani | Jan 2009 | A1 |
20090024923 | Hartwig et al. | Jan 2009 | A1 |
20090028517 | Shen et al. | Jan 2009 | A1 |
20090052784 | Covell et al. | Feb 2009 | A1 |
20090087027 | Eaton et al. | Apr 2009 | A1 |
20090088878 | Otsuka et al. | Apr 2009 | A1 |
20090100361 | Abello et al. | Apr 2009 | A1 |
20090131861 | Braig et al. | May 2009 | A1 |
20090172728 | Shkedi et al. | Jul 2009 | A1 |
20090172746 | Aldrey et al. | Jul 2009 | A1 |
20090213270 | Ismert et al. | Aug 2009 | A1 |
20090235312 | Morad et al. | Sep 2009 | A1 |
20100010648 | Bull et al. | Jan 2010 | A1 |
20100083299 | Nelson | Apr 2010 | A1 |
20100115543 | Falcon | May 2010 | A1 |
20100125870 | Ukawa et al. | May 2010 | A1 |
20100166257 | Wredenhagen | Jul 2010 | A1 |
20100199295 | Katpelly et al. | Aug 2010 | A1 |
20100235486 | White et al. | Sep 2010 | A1 |
20100269138 | Krikorian et al. | Oct 2010 | A1 |
20100306805 | Neumeier et al. | Dec 2010 | A1 |
20100306808 | Neumeier et al. | Dec 2010 | A1 |
20110015996 | Kassoway et al. | Jan 2011 | A1 |
20110026761 | Radhakrishnan et al. | Feb 2011 | A1 |
20110041154 | Olson | Feb 2011 | A1 |
20110055552 | Francis et al. | Mar 2011 | A1 |
20110096955 | Voloshynovskiy et al. | Apr 2011 | A1 |
20110251987 | Buchheit | Apr 2011 | A1 |
20110247042 | Mallinson | Oct 2011 | A1 |
20110289099 | Quan | Nov 2011 | A1 |
20110299770 | Vaddadi et al. | Dec 2011 | A1 |
20120017240 | Shkedi | Jan 2012 | A1 |
20120054143 | Doig et al. | Mar 2012 | A1 |
20120095958 | Pereira et al. | Apr 2012 | A1 |
20120158511 | Lucero et al. | Jun 2012 | A1 |
20120174155 | Mowrey et al. | Jul 2012 | A1 |
20120177249 | Levy et al. | Jul 2012 | A1 |
20120185566 | Nagasaka | Jul 2012 | A1 |
20120272259 | Cortes | Oct 2012 | A1 |
20120294586 | Weaver et al. | Nov 2012 | A1 |
20120317240 | Wang | Dec 2012 | A1 |
20120324494 | Burger et al. | Dec 2012 | A1 |
20130007191 | Klappert et al. | Jan 2013 | A1 |
20130042262 | Riethmueller | Feb 2013 | A1 |
20130054356 | Richman et al. | Feb 2013 | A1 |
20130067523 | Etsuko et al. | Mar 2013 | A1 |
20130070847 | Iwamoto et al. | Mar 2013 | A1 |
20130108173 | Lienhart et al. | May 2013 | A1 |
20130139209 | Urrabazo et al. | May 2013 | A1 |
20130202150 | Sinha et al. | Aug 2013 | A1 |
20130205325 | Sinha | Aug 2013 | A1 |
20130209065 | Yeung | Aug 2013 | A1 |
20130290502 | Bilobrov | Oct 2013 | A1 |
20130297727 | Levy | Nov 2013 | A1 |
20130318096 | Cheung | Nov 2013 | A1 |
20140016696 | Nelson | Jan 2014 | A1 |
20140052737 | Ramanathan et al. | Feb 2014 | A1 |
20140082663 | Neumeier et al. | Mar 2014 | A1 |
20140088742 | Srinivasan | Mar 2014 | A1 |
20140130092 | Kunisetty | May 2014 | A1 |
20140188487 | Perez Gonzalez | Jul 2014 | A1 |
20140193027 | Scherf | Jul 2014 | A1 |
20140195548 | Harron | Jul 2014 | A1 |
20140201769 | Neumeier et al. | Jul 2014 | A1 |
20140201772 | Neumeier et al. | Jul 2014 | A1 |
20140219554 | Yamaguchi et al. | Aug 2014 | A1 |
20140237576 | Zhang | Aug 2014 | A1 |
20140258375 | Munoz | Sep 2014 | A1 |
20140270489 | Jaewhan et al. | Sep 2014 | A1 |
20140270504 | Baum et al. | Sep 2014 | A1 |
20140270505 | McCarthy | Sep 2014 | A1 |
20140282670 | Sinha | Sep 2014 | A1 |
20140282671 | McMillan | Sep 2014 | A1 |
20140293794 | Zhong et al. | Oct 2014 | A1 |
20140344880 | Geller et al. | Nov 2014 | A1 |
20150026728 | Carter et al. | Jan 2015 | A1 |
20150100979 | Moskowitz et al. | Apr 2015 | A1 |
20150112988 | Pereira et al. | Apr 2015 | A1 |
20150120839 | Kannan et al. | Apr 2015 | A1 |
20150163545 | Freed et al. | Jun 2015 | A1 |
20150181311 | Navin et al. | Jun 2015 | A1 |
20150189500 | Bosworth | Jul 2015 | A1 |
20150256891 | Kim et al. | Sep 2015 | A1 |
20150302890 | Ergen et al. | Oct 2015 | A1 |
20150382075 | Neumeier et al. | Dec 2015 | A1 |
20160050457 | Mondal | Feb 2016 | A1 |
20160125471 | Hsu | May 2016 | A1 |
20160227261 | Neumeier et al. | Aug 2016 | A1 |
20160286244 | Chang et al. | Sep 2016 | A1 |
20160307043 | Neumeier | Oct 2016 | A1 |
20160314794 | Leitman et al. | Oct 2016 | A1 |
20160353172 | Miller et al. | Dec 2016 | A1 |
20160359791 | Zhang et al. | Dec 2016 | A1 |
20170017645 | Neumeier et al. | Jan 2017 | A1 |
20170017651 | Neumeier et al. | Jan 2017 | A1 |
20170017652 | Neumeier et al. | Jan 2017 | A1 |
20170019716 | Neumeier et al. | Jan 2017 | A1 |
20170019719 | Neumeier et al. | Jan 2017 | A1 |
20170026671 | Neumeier et al. | Jan 2017 | A1 |
20170031573 | Kaneko | Feb 2017 | A1 |
20170032033 | Neumeier et al. | Feb 2017 | A1 |
20170032034 | Neumeier et al. | Feb 2017 | A1 |
20170054819 | Huffaker | Feb 2017 | A1 |
20170134770 | Neumeier et al. | May 2017 | A9 |
20170142465 | Ray | May 2017 | A1 |
20170186042 | Wong et al. | Jun 2017 | A1 |
20170311014 | Fleischman | Oct 2017 | A1 |
20170353776 | Holden et al. | Dec 2017 | A1 |
20180084308 | Lopatecki | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
2501316 | Sep 2005 | CA |
1557096 | Dec 2004 | CN |
101162470 | Apr 2008 | CN |
1681304 | Jul 2010 | CN |
102377960 | Mar 2012 | CN |
101681373 | Sep 2012 | CN |
248 533 | Aug 1994 | EP |
1578126 | Sep 2005 | EP |
1 760 693 | Mar 2007 | EP |
2 084 624 | Aug 2009 | EP |
2 352 289 | Aug 2011 | EP |
2 541 963 | Jan 2013 | EP |
2 685 450 | Jan 2014 | EP |
2457694 | Aug 2009 | GB |
0144992 | Jun 2001 | WO |
2005101998 | Nov 2005 | WO |
2007114796 | Oct 2007 | WO |
2008065340 | Jun 2008 | WO |
2009131861 | Oct 2009 | WO |
2009150425 | Dec 2009 | WO |
2010135082 | Nov 2010 | WO |
2011090540 | Jul 2011 | WO |
2012057724 | May 2012 | WO |
2012108975 | Aug 2012 | WO |
2012170451 | Dec 2012 | WO |
2014142758 | Sep 2014 | WO |
2014145929 | Sep 2014 | WO |
WO-2014142758 | Sep 2014 | WO |
2015100372 | Jul 2015 | WO |
2016123495 | Aug 2016 | WO |
2016168556 | Oct 2016 | WO |
2017011758 | Jan 2017 | WO |
2017011792 | Jan 2017 | WO |
Entry |
---|
International Search Report and Written Opinion dated Mar. 31, 2015 for PCT Application No. PCT/US2014/072255, 8 pages. |
International Search Report and Written Opinion dated Apr. 26, 2016 for PCT Application No. PCT/US2016/015681, 13 pages. |
“How to: Watch from the beginning |About Dish” (Dec. 31, 2014) XP055265764, retrieved on Apr. 15, 2016 from URL:http://about.dish.com/blog/hopper/how-watch-beginning 2 pages. |
International Search Report and Written Opinion dated Jun. 24, 2016 for PCT Application No. PCT/US2016/027691, 13 pages. |
Gionis et al., “Similarity Search in High Dimension via Hashing”, Proceedings of the 25th VLDB Conference, 1999, 12 pages. |
Huang , “Bounded Coordinate System Indexing for Real-time Video Clip Search”, Retrieved from the Internet:URL:http://staff.itee.uq.edu.aujzxf/papers/TOIS.pdf, Jan. 1, 2009, 32 pages. |
Kim et al., “Edge-Based Spatial Descriptor Using Color Vector Angle for Effective Image Retrieval”, Modeling Decisions for Artificial Intelligence; Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence, Jul. 1, 2005, pp. 365-375. |
Liu et al., “Near-duplicate video retrieval”, ACM Computing Surveys, vol. 45, No. 4, Aug. 30, 2013, pp. 1-23. |
International Search Report and Written Opinion dated Oct. 12, 2016 for PCT Application No. PCT/US2016/042522,13 pages. |
International Search Report and Written Opinion dated Oct. 11, 2016 for PCT Application No. PCT/US2016/042621, 13 pages. |
International Search Report and Written Opinion dated Oct. 20, 2016 for PCT Application No. PCT/US2016/042611,12 pages. |
Scouarnec et al., “Cache policies for cloud-based systems:To keep or not to keep”, 2014 IEEE 7th International Conference on Cloud Computing, IEEE XP032696624, Jun. 27, 2014, pp. 1-8. |
International Search Report and Written Opinion dated Oct. 25, 2016 for PCT Application No. PCT/US2016/042564, 14 pages. |
Anonymous; “Cache (computing)” Wikipedia, the free encyclopedia, URL:http://en.wikipedia.org/w/index.phpti tle=Cache (computing)&oldid=474222804, Jan. 31, 2012; 6 pages. |
International Search Report and Written Opinion dated Oct. 24, 2016 for PCT Application No. PCT/US2016/042557, 11 pages. |
Anil K. Jain, “Image Coding Via a Nearest Neighbors Image Model” IEEE Transactions on Communications, vol. Com-23, No. 3, Mar. 1975, pp. 318-331. |
Lee et al., “Fast Video Search Algorithm for Large Video Database Using Adjacent Pixel Intensity Difference Quantization Histogram Feature” International Journal of Computer Science and Network Security, vol. 9, No. 9, Sep. 2009, pp. 214-220. |
Li et al., A Confidence Based Recognition System for TV Commercial Extraction, Conferences in Research and Practice in Information Technology vol. 75, 2008. |
International Search Report and Written Opinion dated Jul. 27, 2011 for PCT Application No. PCT/US2010/057153, 8 pages. |
International Search Report and Written Opinion dated Aug. 31, 2011 for PCT Application No. PCT/US2010/057155, 8 pages. |
International Search Report and Written Opinion dated Aug. 26, 2014 for PCT Application No. PCT/US2014/030782; 11 pages. |
International Search Report and Written Opinion dated Jul. 21, 2014 for PCT Application No. PCT/US2014/030795; 10 pages. |
International Search Report and Written Opinion, dated Jul. 25, 2014 for PCT Application No. PCT/US2014/030805, 10 pages. |
Extended European Search Report dated Mar. 7, 2013 for European Application No. 12178359.1, 8 pages. |
Extended European Search Report dated Oct. 11, 2013 for European Application No. 10844152.8, 19 pages. |
Kabal (P.), Ramachandran (R.P.): The computation of line spectral frequencies using Chebyshev polynomials, IEEE Trans. on ASSP, vol. 34, No. 6, pp. 1419-1426, 1986. |
Itakura (F.): Line spectral representation of linear predictive coefficients of speech signals, J. Acoust. Soc. Amer., vol. 57, Supplement No. 1, S35, 1975, 3 pages. |
Bistritz (Y.), Pellerm (S.): Immittance Spectral Pairs (ISP) for speech encoding, Proc. ICASSP'93, pp. 11-9 to 11-12. |
International Search Report and Written Opinion dated Mar. 8, 2016 for PCT Application No. PCT/US2015/062945; 9 pages. |
Extended European Search Report dated Dec. 21, 2016 for European Application No. 14763506.4, 11 pages. |
Extended European Search Report dated Nov. 23, 2016 for European Application No. 14764182.3, 10 pages. |
Extended European Search Report dated Jan. 24, 2017 for European Application No. 14762850.7, 12 pages. |
Extended European Search Report dated Jun. 16, 2017, for European Patent Application No. 14873564.0, 8 pages. |
U.S. Appl. No. 14/551,933 , “Final Office Action”, dated May 23, 2016, 19 pages. |
U.S. Appl. No. 14/551,933 , “Non-Final Office Action”, dated Oct. 17, 2016, 15 pages. |
U.S. Appl. No. 14/551,933 , “Non-Final Office Action”, dated Dec. 31, 2015, 24 pages. |
U.S. Appl. No. 14/551,933 , “Notice of Allowance”, dated Mar. 21, 2017, 8 pages. |
U.S. Appl. No. 14/217,039 , “Non-Final Office Action”, dated May 23, 2014, 27 pages. |
U.S. Appl. No. 14/217,039 , “Final Office Action”, dated Nov. 7, 2014, 15 pages. |
U.S. Appl. No. 14/217,039 , “Notice of Allowance”, dated Jan. 29, 2015, 8 pages. |
U.S. Appl. No. 14/678,856 , “Non-Final Office Action”, dated Dec. 1, 2015, 28 pages. |
U.S. Appl. No. 14/678,856 , “Notice of Allowance”, dated May 20, 2016, 9 pages. |
U.S. Appl. No. 14/217,075, “Non-Final Office Action”, dated Jul. 16, 2014, 39 pages. |
U.S. Appl. No. 14/217,075, “Notice of Allowance ”, dated Feb. 20, 2015, 51 pages. |
U.S. Appl. No. 14/217,094, “Notice of Allowance ”, dated Sep. 4, 2014, 30 pages. |
U.S. Appl. No. 14/217,375, “Non-Final Office Action”, dated Apr. 1, 2015, 39 pages. |
U.S. Appl. No. 14/217,375, “Notice of Allowance”, dated Apr. 1, 2015, 31 pages. |
U.S. Appl. No. 14/217,425, “Non-Final Office Action”, dated Apr. 7, 2015, 12 pages. |
U.S. Appl. No. 14/217,425, “Notice of Allowance”, dated May 20, 2015, 15 pages. |
U.S. Appl. No. 14/217,435, “Non-Final Office Action”, dated Nov. 24, 2014, 9 pages. |
U.S. Appl. No. 14/217,435, “Notice of Allowance”, dated Jun. 5, 2015, 9 pages. |
U.S. Appl. No. 15/011,099 , “First Action Interview Office Action Summary”, dated May 9, 2017, 6 pages. |
U.S. Appl. No. 15/011,099 , “First Action Interview Pilot Program Pre-Interview Communication”, dated Feb. 28, 2017, 5 pages. |
U.S. Appl. No. 12/788,721 , “Non-Final Office Action”, dated Mar. 28, 2012, 15 Pages. |
U.S. Appl. No. 12/788,721 , “Final Office Action”, dated Aug. 15, 2012, 22 Pages. |
U.S. Appl. No. 12/788,721 , “Notice of Allowance”, dated Aug. 15, 2013, 16 Pages. |
U.S. Appl. No. 14/763,158 , “Non-Final Office Action”, dated Jun. 27, 2016, 16 Pages. |
U.S. Appl. No. 14/763,158 , “Final Office Action”, dated Sep. 7, 2016, 12 Pages. |
U.S. Appl. No. 14/763,158 , “Notice of Allowance”, dated Mar. 17, 2016, 8 Pages. |
U.S. Appl. No. 14/807,849 , “Non-Final Office Action”, dated Nov. 25, 2015, 12 Pages. |
U.S. Appl. No. 14/807,849 , “Final Office Action”, dated Apr. 19, 2016, 13 pages. |
U.S. Appl. No. 14/807,849 , “Non-Final Office Action”, dated Feb. 28, 2017, 10 Pages. |
U.S. Appl. No. 14/089,003 , “Notice of Allowance”, dated Jul. 30, 2014, 24 Pages. |
U.S. Appl. No. 12/788,748 , “Non-Final Office Action”, dated Jan. 10, 2013, 10 Pages. |
U.S. Appl. No. 12/788,748 , “Final Office Action”, dated Nov. 21, 2013, 13 Pages. |
U.S. Appl. No. 12/788,748 , “Notice of Allowance”, dated Mar. 6, 2014, 7 Pages. |
U.S. Appl. No. 14/953,994 , “Non-Final Office Action”, dated Mar. 3, 2016, 34 Pages. |
U.S. Appl. No. 14/953,994 , “Final Office Action”, dated Jun. 1, 2016, 36 Pages. |
U.S. Appl. No. 14/953,994 , “Notice of Allowance”, dated Aug. 31, 2016, 15 Pages. |
U.S. Appl. No. 14/807,849 , “Final Office Action”, dated Jun. 22, 2017, 10 pages. |
U.S. Appl. No. 15/011,099 , “Final Office Action”, dated Jul. 24, 2017, 22 pages. |
U.S. Appl. No. 15/240,801 , “Non-Final Office Action”, dated Aug. 11, 2017, 18 pages. |
U.S. Appl. No. 15/240,815 , “Non-Final Office Action”, dated Aug. 23, 2017, 15 pages. |
U.S. Appl. No. 15/211,345 , “First Action Interview Pilot Program Pre-Interview Communication”, dated Sep. 19, 2017, 8 pages. |
U.S. Appl. No. 14/807,849 , “Notice of Allowance”, dated Nov. 30, 2017, 9 Pages. |
U.S. Appl. No. 15/240,801 , “Final Office Action”, dated Dec. 22, 2017, 24 pages. |
U.S. Appl. No. 15/011,099, “Non-Final Office Action”, dated Jan. 22, 2018, 23 pages. |
U.S. Appl. No. 15/240,815 , “Final Office Action”, dated Mar. 2, 2018, 14 pages. |
U.S. Appl. No. 15/211,345 , “Final Office Action”, dated Mar. 2, 2018, 14 pages. |
Extended European Search Report dated Mar. 22, 2018 for European Application No. 15865033.3, 10 pages. |
U.S. Appl. No. 15/099,842 , “Final Office Action”, dated Apr. 2, 2018, 8 pages. |
Number | Date | Country | |
---|---|---|---|
20180293269 A1 | Oct 2018 | US |
Number | Date | Country | |
---|---|---|---|
62482495 | Apr 2017 | US |