Systems and methods for partitioning search indexes for improved efficiency in identifying media segments

Description

FIELD

The present disclosure relates to improving management of system resources used for recognition of content displayed by a media system (e.g., a television system, a computer system, or other electronic device capable of connecting to the Internet). Further, the present disclosure relates to effectively and efficiently identifying content. For example, various techniques and systems are provided for partitioning search indexes into buckets that may be searched in parallel to improve identification efficiency of content.

BACKGROUND

Advancements in fiber optic and digital transmission technology have enabled the television industry to rapidly increase channel capacity and, hence, to provide hundreds of channels of television program in addition to thousands or more channels of on-demand programming. From the perspective of an automated content recognition (ACR) system which is monitoring television receivers nationwide, the problem is even more challenging with the presence of 10 to 20 local channels per major DMA (approximately 100 in the U.S.), totaling thousands of broadcast channels and tens of thousands of pieces of on-demand content.

SUMMARY OF THE INVENTION

Embodiments of the invention generally relate to systems and methods for identifying video segments displayed on a screen of a television system or audio segments from any source, and to systems and methods for providing contextually targeted content to media systems based on such video or audio segment identification. As used herein, the term “media systems” includes, but is not limited to, television systems, audio systems, and the like. As used herein, the term “television systems” includes, but is not limited to, televisions such as web TVs and connected TVs (also known as “Smart TVs”) and equipment incorporated in, or co-located with, the television, such as a set-top box (STB), a digital video disc (DVD) player or a digital video recorder (DVR). As used herein, the term “television signals” includes signals representing video and audio data which are broadcast together (with or without metadata) to provide the picture and sound components of a television program or commercial. As used herein, the term “metadata” means data about or relating to the video/audio data in television signals.

Embodiments of the present invention are directed to systems and methods for advantageously partitioning very large volumes of content for the purpose of automated content recognition resulting in enhanced accuracy of content recognition from unknown sources such as client media devices including smart TVs, cable and satellite set-top boxes and Internet-connected network media players and the like. It is contemplated that the invention can be applied not just to media data but to any large database that must be searched in multiple dimensions simultaneously.

Under the load of a large number of content sources, the task of minimizing false positives and maximizing correct content identification can be considerably enhanced by the creation of multiple indexes of content identifiers (also referred to herein as “cues”) where certain indexes are various subsets of the larger collection of information. These grouped indexes can be selected using a variety of parameters such as, for one example, the popularity of a television program as determined by TV ratings or social media mentions. The more popular channels, perhaps the top ten percent, can be grouped into one search index and the remaining 90 percent into another index, for example. Another grouping might be the separation of content into a third index of just local television channels and yet a fourth example might be to separate the on-demand from the broadcast content into an on-demand index. Yet another content group could be derived from content that is considered important commercially and would benefit by being isolated in a separate search space. Any appropriate segregation of related content could be employed to further the benefit of embodiments of the invention.

Once separated into content groups and indexed (hashed), the result is a vector space of multiple dimensions anywhere from 16 to 100, known as a ‘space’, and colloquially as a “bucket”. The buckets are individually searched and the search results are fed to the path pursuit process described in U.S. Pat. No. 8,595,781, herein incorporated by reference in its entirety. The path pursuit process attempts to find a matching media segment in each respective bucket and can be executed in concurrently or in parallel. Candidates from each said bucket are weighed and a final decision is made to select the closest matching video segment, thus identifying which video segment is being displayed on a screen of a television system. In particular, the resulting data identifying the video segment being currently viewed can be used to enable the capture and appropriately respond to a TV viewer's reaction (such as requesting more information about a product being advertised or background information of an actor on screen). Furthermore, identifying which video segment is being displayed on the screen allows the central system of the invention to maintain a census of currently viewed television programming for various data analysis uses. Many other uses of said knowledge of current video segment might possibly also be including the substitution of more relevant commercial messages during detected commercial breaks, among other options.

In accordance with some embodiments, the video segment is identified by sampling at particular intervals (e.g., 100 milliseconds) a subset of the pixel data being displayed on the screen (or associated audio data) and then finding similar pixel (or audio) data in a content database. In accordance with other embodiments, the video segment is identified by extracting audio or image data associated with such video segment and then finding similar audio or image data in a content database. In accordance with alternative embodiments, the video segment is identified by processing the audio data associated with such video segment using known automated speech recognition techniques. In accordance with further alternative embodiments, the video segment is identified by processing metadata associated with such video segment.

Embodiments of the invention are further directed to systems and methods for providing contextually targeted content to an interactive television system. The contextual targeting is based on not only identification of the video segment being displayed, but also a determination concerning the playing time or offset time of the particular portion of the video segment being currently displayed. The terms “playing time” and “offset time” will be used interchangeably herein and refer to a time which is offset from a fixed point in time, such as the starting time of a particular television program or commercial.

More specifically, embodiments of the invention comprises technology that can detect what is playing on a connected TV, deduce the subject matter of what is being played, and interact with the viewer accordingly. In particular, the technology disclosed herein overcomes the limited ability of interactive TVs to strictly pull functionality from a server via the Internet, thereby enabling novel business models including the ability to provide instant access to video-on-demand versions of content, and providing the user with the option to view higher resolutions or 3D formats of the content if available, and with the additional ability to start over, fast forward, pause and rewind. The invention also enables having some or all advertising messages included in the now VOD programing, customized, by way of example only and without limitation, with respect to the viewer's location, demographic group, or shopping history, or to have the commercials reduced in number or length or eliminated altogether to support certain business models.

In accordance with some embodiments, the video segment is identified and the offset time is determined by sampling a subset of the pixel data (or associated audio data) being displayed on the screen and then finding similar pixel (or audio) data in a content database. In accordance with other embodiments, the video segment is identified and the offset time is determined by extracting audio or image data associated with such video segment and then finding similar audio or image data in a content database. In accordance with alternative embodiments, the video segment is identified and the offset time is determined by processing the audio data associated with such video segment using known automated speech recognition techniques. In accordance with further alternative embodiments, the video segment is identified and the offset time is determined by processing metadata associated with such video segment.

As is described in more detail herein, the system for identifying video segments being viewed on a connected TV and, optionally, determining offset times, can reside on the television system of which the connected TV is a component. In accordance with alternative embodiments, one part of the software for identifying video segments resides on the television system and another part resides on a server connected to the television system via the Internet.

According to one embodiment of the invention, a method is provided. The method comprises receiving a plurality of known media content. The plurality of known media content has associated known content identifiers (i.e., cues). The method further comprises partitioning the plurality of known media content into a first index and a second index, and separating the first index into one or more first buckets. The first index is separated into first buckets using the known content identifiers that are associated with the known media content in the first index. The method further comprises separating the second index into one or more second buckets. The second index is separated into second buckets using the known content identifiers that are associated with the known media content in the second index. The method further comprises receiving unknown content identifiers corresponding to unknown media content being displayed by a media system, and concurrently searching the first buckets and the second buckets for the unknown content identifiers. The method further comprises selecting known media content from the first buckets or the second buckets. The selected known media content is associated with the unknown content identifiers. The method further comprises identifying the unknown media content as the known media content. The method may be implemented on a computer.

According to another embodiment of the invention, a system is provided. The system includes one or more processors. The system further includes a non-transitory machine-readable storage medium containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including the steps recited in the above method.

According to another embodiment of the invention, a computer program product tangibly embodied in a non-transitory machine-readable storage medium of a computing device may be provided. The computer program product may include instructions configured to cause one or more data processors to perform the steps recited in the above method.

The terms and expressions that have been employed are used as terms of description and not of limitation, and there is no intention in the use of such terms and expressions of excluding any equivalents of the features shown and described or portions thereof. It is recognized, however, that various modifications are possible within the scope of the systems and methods claimed. Thus, it should be understood that, although the present system and methods have been specifically disclosed by examples and optional features, modification and variation of the concepts herein disclosed may be resorted to by those skilled in the art, and that such modifications and variations are considered to be within the scope of the systems and methods as defined by the appended claims.

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.

BRIEF DESCRIPTION OF THE DRAWINGS

Illustrative embodiments of the present invention are described in detail below with reference to the following drawing figures, in which like reference numerals represent like components or parts throughout the several drawings.

FIG. 1 is a block diagram of an example of a matching system for identifying media content being displayed by a media system according to embodiments of the invention.

FIG. 2 is an example of a matching system identifying unknown data point according to embodiments of the invention.

FIG. 3 is a block diagram of an example of a media capture system according to embodiments of the invention.

FIG. 4 is a block diagram of an example of a system for collecting media content presented by a display according to embodiments of the invention.

FIG. 5 is a diagram showing the processing path of cue data according to embodiments of the invention.

FIG. 6 is a graphic plot of a vector map laid out using excessively clustered pseudo-random projections according to embodiments of the invention.

FIG. 7 is a graphic plot of a vector map laid out using more evenly spaced pseudo-random projections according to embodiments of the invention.

FIG. 8 illustrates clustered cue data that is not centered on the randomly generated vectors according to embodiments of the invention.

FIG. 9 illustrates clustered cue data that is centered on the randomly generated vectors using a mathematical offset function according to embodiments of the invention.

FIG. 10 is a graphic plot illustrating a moderate number of cue points in the area between two vectors known as a “bucket”, which used by embodiments of the invention to locate candidate matching cues.

FIG. 11 is a graphic plot illustrating a high number of cue points in the bucket according to embodiments of the invention.

FIG. 12 is a graphical representation of a bucket that is searched for match candidates, which are supplied to the media matching engine according to embodiments of the invention.

FIG. 13 is a graphical representation of different sized buckets that can be searched concurrently or in parallel, each bucket feeding into the media matching engine according to embodiments of the invention.

FIG. 14 is a diagram of an interactive television system and related server systems for processing video cues in which media types are processed into individual indexes that are searched by individual media matching processes to produce separate outputs according to embodiments of the invention.

FIG. 15 is a flow diagram of a method for processing video cues in which media types are processed into individual indexes that are searched by individual media matching processes to produce separate outputs according to embodiments of the invention.

FIG. 16 is a diagram of an interactive television system and related server systems for processing video cues in which media types are processed into individual indexes and combined before being searched by a media matching process according to embodiments of the invention.

FIG. 17 is a flow diagram of a method for processing video cues in which media types are processed into individual indexes that are combined prior to being searched by a media matching process according to an embodiment of the invention.

FIG. 18 is a diagram of an interactive television system and related server systems for processing video cues in which media types are processed into individual indexes that are individually tagged and weighted before being searched by a media matching process according to embodiments of the invention.

FIG. 19 is a flow diagram of a method for processing video cues in which media types are processed into individual indexes that are individually tagged and weighted prior to being searched by a media matching process according to embodiments of the invention.

FIG. 20 is a diagram of a media processing center that detects television advertisements according to embodiments of the invention.

FIG. 21 is a flow diagram of a method for identifying television advertisements according to embodiments of the invention.

FIG. 22 is a diagram of a video segment with an advertisement block (i.e., ad pod) in which a TV advertisement is substituted according to embodiments of the invention.

FIG. 23 is a diagram of a media processing center that detects video program segments according to embodiments of the invention.

FIG. 24 is a flow diagram of a method for identifying video program segments and overlaying contextually related multimedia according to embodiments of the invention.

FIG. 25 is a diagram of a video segment with overlaid contextually related multimedia content according to embodiments of the invention.

FIG. 26 is a diagram of video segments with and without overlaid contextually related multimedia content according to embodiments of the invention.

FIG. 27 is a chart illustrating point locations and the path points around them according to embodiments of the invention.

FIG. 28 is a chart illustrating a set of points that lie within a distance from a query point according to embodiments of the invention.

FIG. 29 is a chart illustrating possible point values according to embodiments of the invention.

FIG. 30 is a chart illustrating a space divided into rings of exponentially growing width according to embodiments of the invention.

FIG. 31 is a chart illustrating self-intersecting paths and a query point according to embodiments of the invention.

FIG. 32 is a chart illustrating three consecutive point locations and the path points around them according to embodiments of the invention.

DETAILED DESCRIPTION OF THE INVENTION

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.

Advancements in fiber optic and digital transmission technology have enabled the television industry to rapidly increase channel capacity and on a national basis be capable of providing thousands of channels of television programming and hundreds of thousands of channels of on-demand programming. To support national business models that involve monitoring millions of active television display systems and rapidly identifying, sometimes close to real time, so many thousands of broadcast channels and tens of thousands of on-demand content delivery systems, and to do so while utilizing commercially reasonable computing resources is an unmet need addressed by the systems and methods described herein.

As described in further detail below, certain aspects and features of the present disclosure relate to identifying unknown video segments by comparing unknown data points to one or more reference data points. The systems and methods described herein improve the efficiency of storing and searching large datasets that are used to identify the unknown video segments. For example, the systems and methods allow identification of the unknown data segments while reducing the density of the large datasets required to perform the identification. The techniques can be applied to any system that harvests and manipulates large volumes of data. Illustrative examples of these systems include automated content-based searching systems (e.g., automated content recognition for video-related applications or other suitable application), MapReduce systems, Bigtable systems, pattern recognition systems, facial recognition systems, classification systems, computer vision systems, data compression systems, cluster analysis, or any other suitable system. One of ordinary skill in the art will appreciate that the techniques described herein can be applied to any other system that stores data that is compared to unknown data. In the context of automated content recognition (ACR), for example, the systems and methods reduce the amount of data that must be stored in order for a matching system to search and find relationships between unknown and known data groups.

By way of example only and without limitation, some examples described herein use an automated audio and/or video content recognition system for illustrative purposes. However, one of ordinary skill in the art will appreciate that the other systems can use the same techniques.

A significant challenge with ACR systems and other systems that use large volumes of data can be managing the amount of data that is required for the system to function. Another challenge includes a need to build and maintain a database of known content to serve as a reference to match incoming content. Building and maintaining such a database involves collecting and digesting a vast amount (e.g., hundreds, thousands, or more) of content (e.g., nationally distributed television programs and an even larger amount of local television broadcasts among many other potential content sources). The digesting can be performed using any available technique that reduces the raw data (e.g., video or audio) into compressed, searchable data. With a 24-hour, seven-day-a-week operating schedule and a sliding window of perhaps two weeks of content (e.g., television programming) to store, the data volume required to perform ACR can build rapidly. Similar challenges can be present with other systems that harvest and manipulate large volumes of data, such as the example systems described above.

The central automated content recognition (ACR) system described herein is employed to detect and identify a video program currently being displayed on a remote client television system and can do so in close to real time to support certain business models. The media matching engine employs a media search index (e.g., hash table) that is divided into multiple segments, generally referred to as buckets. In some embodiments, cue data (e.g., content identifiers) are processed into independent indexes based on a plurality of decision factors such as by separating national content from local content, or separating the top 10% of the popular content from the remaining 90% of less popular content, or separating broadcast media from on-demand media, etc. Once separated, the unknown cue data from a client television system or other device may be tested by the central server against each index. Searching one or more indexes may be done in parallel (i.e., concurrently). The results of each index lookup (i.e., search) may be applied in parallel to a content matching system, such as the path pursuit system of U.S. Pat. No. 8,595,781 B2, incorporated by reference herein in its entirety.

The smaller datasets (i.e., buckets) may yield more accurate match results and, hence, enhance the search efficiency of the content matching system.

FIG. 1 illustrates a matching system 100 that can identify unknown content. In some examples, the unknown content can include one or more unknown data points. In such examples, the matching system 100 can match unknown data points with reference data points to identify unknown video segments associated with the unknown data points. The reference data points can be included in a reference database 116.

The matching system 100 includes a client device 102 and a matching server 104. The client device 102 includes a media client 106, an input device 108, an output device 110, and one or more contextual applications 126. The media client 106 (which can include 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 128. The media client 106 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 client device 102 can be any electronic decoding system that can receive and decode a video signal. The client device 102 can receive video programs 128 and store video information in a video buffer (not shown). The client device 102 can process the video buffer information and produce unknown data points (which can referred to as “cues”), described in more detail below with respect to FIG. 3. The media client 106 can transmit the unknown data points to the matching server 104 for comparison with reference data points in the reference database 116.

The input device 108 can include any suitable device that allows a request or other information to be input to the media client 106. For example, the input device 108 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 110 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 100 can begin a process of identifying a video segment by first collecting data samples from known video data sources 118. For example, the matching server 104 collects data to build and maintain a reference database 116 from a variety of video data sources 118. The video data sources 118 can include media providers of television programs, movies, or any other suitable video source. Video data from the video data sources 118 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 104 can process the received video from the video data sources 118 to generate and collect reference video data points in the reference database 116, as described below. In some examples, video programs from video data sources 118 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 116 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 104 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 116. The matching server 104 can build and continuously or periodically update the reference database 116 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) are 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. Using the example amount of data, the total data collected during a 24-hour period over three days becomes very large. Therefore, reducing the number of actual reference data point sets is advantageous in reducing the storage load of the matching server 104.

The media client 106 can send a communication 122 to a matching engine 112 of the matching server 104. The communication 122 can include a request for the matching engine 112 to identify unknown content. For example, the unknown content can include one or more unknown data points and the reference database 116 can include a plurality of reference data points. The matching engine 112 can identify the unknown content by matching the unknown data points to reference data in the reference database 116. 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 118. For example, data points can be extracted from the information provided from the video data sources 118 and can be indexed and stored in the reference database 116.

The matching engine 112 can send a request to the candidate determination engine 114 to determine candidate data points from the reference database 116. 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 114 can return the candidate data points to the matching engine 112.

For a candidate data point, the matching engine 112 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 104 from the client device 102, 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 112 can determine that the video segment associated with the bin is currently being displayed on the client device 102. 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.

FIG. 2 illustrates components of a matching system 200 for identifying unknown data. For example, the matching engine 212 can perform a matching process for identifying unknown content (e.g., unknown media segments, a search query, an image of a face or a pattern, or the like) using a database of known content (e.g., known media segments, information stored in a database for searching against, known faces or patterns, or the like). For example, the matching engine 212 receives unknown data content 202 (which can be referred to as a “cue”) to be matched with a reference data point of the reference data points 204 in a reference database. The unknown data content 202 can also be received by the candidate determination engine 214, or sent to the candidate determination engine 214 from the matching engine 212. The candidate determination engine 214 can conduct a search process to identify candidate data points 206 by searching the reference data points 204 in the reference database. In one example, the search process can include a nearest neighbor search process to produce a set of neighboring values (that are a certain distance from the unknown values of the unknown data content 202). The candidate data points 206 are input to the matching engine 212 for conducting the matching process to generate a matching result 208. Depending on the application, the matching result 208 can include video data being presented by a display, a search result, a determined face using facial recognition, a determined pattern using pattern recognition, or any other result.

In determining candidate data points 206 for an unknown data point (e.g., unknown data content 202), the candidate determination engine 214 determines a distance between the unknown data point and the reference data points 204 in the reference database. The reference data points that are a certain distance from the unknown data point are identified as the candidate data points 206. In some examples, a distance between a reference data point and an unknown data point can be determined by comparing one or more pixels of the reference data point with one or more pixels of the unknown data point, as described above with respect to FIG. 1. In some examples, a reference data point can be the certain distance from an unknown data point when the pixels at each sample location are within a particular value range. As described above, a candidate data point is a reference data point that is an approximate match to the unknown data point, and because of the approximate matching, multiple candidate data points (related to different media segments) are identified for the unknown data point. The candidate determination engine 114 can return the candidate data points to the matching engine 112.

FIG. 3 illustrates an example of a video ingest capture system 400 including a memory buffer 302 of a decoder. The decoder can be part of the matching server 104 or the media client 106. The decoder may not operate with or require a physical television display panel or device. The decoder can decode and, when required, decrypt a digital video program into an uncompressed bitmap representation of a television program. For purposes of building a reference database of reference video data (e.g., reference database 316), the matching server 104 can acquire one or more arrays of video pixels, which are read from the video frame buffer. An array of video pixels is referred to as a video patch. A video patch can be any arbitrary shape or pattern but, for the purposes of this specific example, is described as a 10×10 pixel array, including ten pixels horizontally by ten pixels vertically. Also for the purpose of this example, it is assumed that there are 25 pixel-patch positions extracted from within the video frame buffer that are evenly distributed within the boundaries of the buffer.

An example allocation of pixel patches (e.g., pixel patch 304) is shown in FIG. 3. As noted above, a pixel patch can include an array of pixels, such as a 10×10 array. For example, the pixel patch 304 includes a 10×10 array of pixels. A pixel can include color values, such as a red, a green, and a blue value. For example, a pixel 306 is shown having Red-Green-Blue (RGB) color values. The color values for a pixel can be represented by an eight-bit binary value for each color. Other suitable color values that can be used to represent colors of a pixel include luma and chroma (Y, Cb, Cr) values or any other suitable color values.

A mean value (or an average value in some cases) of each pixel patch is taken, and a resulting data record is created and tagged with a time code (or time stamp). For example, a mean value is found for each 10×10 pixel patch array, in which case twenty-four bits of data per twenty-five display buffer locations are produced for a total of 600 bits of pixel information per frame. In one example, a mean of the pixel patch 304 is calculated, and is shown by pixel patch mean 308. In one illustrative example, the time code can include an “epoch time,” which representing the total elapsed time (in fractions of a second) since midnight, Jan. 1, 1970. For example, the pixel patch mean 308 values are assembled with a time code 412. Epoch time is an accepted convention in computing systems, including, for example, Unix-based systems. Information about the video program, known as metadata, is appended to the data record. The metadata can include any information about a program, such as a program identifier, a program time, a program length, or any other information. The data record including the mean value of a pixel patch, the time code, and metadata, forms a “data point” (also referred to as a “cue”). The data point 310 is one example of a reference video data point.

A process of identifying unknown video segments begins with steps similar to creating the reference database. For example, FIG. 4 illustrates a video ingest capture system 400 including a memory buffer 402 of a decoder. The video ingest capture system 400 can be part of the client device 102 that processes data presented by a display (e.g., on an Internet-connected television monitor, such as a smart TV, a mobile device, or other television viewing device). The video ingest capture system 400 can utilize a similar process to generate unknown video data point 410 as that used by system 300 for creating reference video data point 310. In one example, the media client 106 can transmit the unknown video data point 410 to the matching engine 112 to identify a video segment associated with the unknown video data point 410 by the matching server 104.

As shown in FIG. 4, a video patch 404 can include a 10×10 array of pixels. The video patch 404 can be extracted from a video frame being presented by a display. A plurality of such pixel patches can be extracted from the video frame. In one illustrative example, if twenty-five such pixel patches are extracted from the video frame, the result will be a point representing a position in a 75-dimension space. A mean (or average) value can be computed for each color value of the array (e.g., RGB color value, Y, Cr, Cb color values, or the like). A data record (e.g., unknown video data point 410) is formed from the mean pixel values and the current time is appended to the data. One or more unknown video data points can be sent to the matching server 104 to be matched with data from the reference database 116 using the techniques described above.

According to some embodiments of the invention, the size of the data being searched is reduced to produce a more efficient method of searching said data. A block diagram of the process of generating an index is illustrated in FIG. 5, in which incoming cues in the form of average pixel values of a region of the video frame 501 are processed by a hash function 502, generating a value 503 that is stored in a database 510. The database 510 is divided into four sections by vectors 508 and 509. The result of applying the hash function 502 is used to address the storage area. In this example, the two most significant bits 505 determine a storage space (i.e., a vector space), in this case, the storage space associated with bits 10 in the upper left quadrant. The remaining bits 506 address a subdivision of the storage space. In this example, the lower six bits 506 address one of 64 subdivisions, also known as buckets 507.

The process of subdividing a database suitable for ACR is further illustrated in FIGS. 6 and 7. In FIG. 6, a process is diagrammed for plotting pseudo-randomly generated vectors dividing the Cartesian space in preparation for use in addressing a large media cue database. The vectors may be Monte Carlo-generated, in one embodiment. In this example, the pseudo-random process did not plot a sufficiently evenly distributed set of vectors. This is apparent in examining the angular difference between vector 601 and vector 602 as compared to the angular difference between vector 603 and vector 604.

In FIG. 7, the vectors can be seen to be considerably more evenly distributed as shown by examining the angular difference between vector 701 and vector 702 as compared to the angular difference between vector 703 and vector 704. The vectors may be Monte Carlo-generated, in one embodiment. This process can be quantified and measured automatically or simply by observation, as will be appreciated by one skilled in the art. Once a random set of projections is found, the process does not need to be repeated.

A subsequent step in preparing the storage and search space of an ACR system involves normalizing the address space to be centered on a representative selection of data samples. FIG. 8 illustrates a dataset of cue data 801 that is not centered in the vector space in which it is represented. The offset of this data in the search space may result in less accuracy in finding matching data in an ACR system. Consequently, a process may be applied to the values of the dataset such that the cue data 901 is centered in the vector space, as illustrated in FIG. 9.

A further consideration in optimizing a dataset of cue data for ACR purposes involves considering data density found in each bucket of the database. For example, in FIG. 10, a bucket 1002 is illustrated containing a moderate number of data items 1001, which represents an ideal data density. In contrast, FIG. 11 illustrates another vector space with a bucket 1102 that contains an excess of data items 1101. According to some embodiments, when this process is employed as part of a media matching engine, the data is discarded and the search continues when buckets are encountered that are excessively full, albert delayed in finding a result.

FIG. 12 is an illustration of a system that may involve storing all reference data (such as, for example, video data cues) into an addressing scheme involving a single bucket 1201 per address space segment. The single bucket approach provides the search space for locating candidate match data (i.e., “suspects”), for use by the media matching engine 1202. Depending on the number of media sources, it is possible that a large number of buckets will be excessively full and reduce the accuracy of the ACR system, resulting in additional false positive matches or missed opportunities to find a match. Additionally, the computational load of the entire system is increased which may result in delays for producing matching results, which can degrade or even disable the functionality of certain features or business models.

Embodiments of the invention provide multiple methods of optimizing data storage such that undesirable bucket fullness is minimized. By way of example, a representation of an embodiment of the invention is shown in FIG. 13. In FIG. 13, multiple buckets 1301-1303 are employed to represent subdivisions of the data separated by, in this illustrated example, media type or regional considerations. This multiple bucket approach also provides the search spaces for locating candidate match data for use by the media matching engine 1304.

In a specific example of separating data for more efficient storage, FIG. 14 illustrates a system in which video on demand (VOD) content feeds 1401 are supplied to an ingest processor 1404 that extracts cues, indexes the cues and stores the results in a database 1407. Similarly, primary television feeds 1402 are supplied to an ingest processor 1405 that extracts cues, indexes the cues, and stores the results in a database 1408. Television event feeds 1403 are supplied to an ingest processor 1406 that extracts cues, indexes the cues and stores the results in a database 1409. VOD content feeds 1401, primary television feeds 1402, and television event feeds 1403 may be collectively referred to as “known content”. The television event feeds 1403 may be, for example, television advertisements to be detected by the system of FIG. 14 for the purpose of targeted advertising which requires accurate and timely detection of the event. Likewise, television event feeds 1403 may include programming that has associated interactive content to be displayed during certain program scenes, a process also requiring accuracy and a real-time response.

In this example, each type of programming 1401-1403 is processed in parallel (i.e., concurrently) with the unknown media 1413 being displayed on a media system. However, in other embodiments, the programming 1401-1403 may be processed prior to receiving the unknown media 1413. The unknown media 1413 is replicated by the cue cloning engine 1414. The unknown cues (i.e., the unknown content identifiers) may then be provided to independent media matching engines 1410-1412. Media matching engines 1410-1412 may be similar to matching engine 112 of FIG. 1. Media matching engine 1410 may compare the unknown cues to the cues associated with the VOD content feeds 1401. Media matching engine 1411 may compare the unknown cues to the cues associated with the primary television feeds 1402. Media matching engine 1412 may compare the unknown cues to the cues associated with television event feeds 1403. Each media matching engine 1410-1412 may select one or more matches (e.g., one match per bucket) and provide the matches to results engine 1415. Results engine 1415 may be similar to results engine 120 of FIG. 1. Results engine 1415 accumulates and processes the matches and determines a final result 1416. The final result 1416 may be stored in a database, used for a programming census, and/or used to provide contextually targeted information, as described further herein.

A method that may be employed by the system of FIG. 14 is described with reference to the flowchart of FIG. 15. At step 1501, known media content of at least one type is received (e.g., VOD content feeds 1401, primary television feeds 1402, television event feeds 1403, etc.). At step 1502, a hash function is applied to the cues associated with the known media content generated by ingest processors 1404-1406, and the known cues are indexed. At step 1503, the hashed cue indexes are stored in respective databases 1407-1409.

At step 1504, unknown media content 1413 is received, its cues are copied by cue cloning engine 1414, and the unknown cues are provided to media matching engines 1410-1412. At step 1506, it is determined whether the number of suspects (i.e., matches) harvested is greater than a threshold for any of the indexes (i.e., for the indexes of cues associated with VOD content feeds 1401, primary television feeds 1402, and/or television event feeds 1403). If the number of suspects harvested is greater than the threshold, those suspects are discarded at step 1507 and the method returns to step 1505. Step 1507 may be performed because, for example, a high number of suspects may include a high number of false positives. If the number of suspects harvested is not greater than the threshold, then a match process is executed between the unknown media content cues and the known media content cues at step 1508, resulting in identification of matching known media content. At step 1510, results are executed based on the identification of the matching known media content, such as an event being triggered (e.g., display of contextually targeted information), statistics being tallied, etc.

Another example of optimizing an ACR system is illustrated in FIG. 16. In FIG. 16, VOD content feeds 1601, primary television feeds 1602, and television event feeds 1603 are separately processed by ingest processors 1604-1606 (e.g., cued, indexed, and separated into buckets) and stored in individual databases 1607-1609. Instead of further processing the data independently, the embodiment of FIG. 16 addresses the buckets independently, then combines them with a bucket combiner engine 1610. If a bucket is excessively full, it may be rejected and not combined with the other buckets according to one embodiment.

Unknown media 1613 being displayed by a media system is provided to media matching & results processing engine 1614. From the combined bucket, media matching & results processing engine 1614 extracts suspects and performs the matching process using a path pursuit system, for example, to find match results 1615. Media matching & results processing engine 1614 may be similar to matching engine 112 and results engine 120 of FIG. 1, for example. The embodiment of FIG. 16 is advantageous in that buckets are combined after each bucket is examined for fullness and rejected if above a predetermined threshold. Using the independent data groupings of feeds 1601-1603, the system of FIG. 16 achieves increased accuracy and reduced processing requirements.

A method that may be employed by the system of FIG. 16 is described with reference to the flowchart of FIG. 17. At step 1701, known media content of at least one type is received (e.g., VOD content feeds 1601, primary television feeds 1602, television event feeds 1603, etc.). At step 1702, a hash function is applied to the cues associated with the known media content generated by ingest processors 1604-1606, and the known cues are indexed and bucketed. At step 1703, the hashed cue indexes are stored in respective databases 1607-1609. At step 1704, the indexes are combined by a bucket combiner engine 1610.

At step 1705, unknown media content 1613 is received, its cues are copied, and the unknown cues are provided to a media matching engine 1614. At step 1706, the media matching engine 1614 harvests suspects from the combined bucket, and executes a match process between the known and unknown cues at step 1707 to identify a match. At step 1708, results are executed based on the identification of the matching known media content, such as an event being triggered (e.g., display of contextually targeted information), statistics being tallied, etc.

Another embodiment of the invention is illustrated in FIG. 18. In FIG. 18, VOD content feeds 1801, primary television feeds 1802, and television event feeds 1803 are separately processed by ingest processors 1804-1806 (e.g., cued, indexed, and separated into buckets) and stored in individual databases 1807-1809. According to this embodiment, the indexes are independently tagged and weighted by index tagging & weighting engines 1810-1812. The tagged, weighted and bucketed cues are then combined with their respective tags using a bucket combiner engine 1810. If a bucket is excessively full, it may be rejected and not combined with the other buckets according to one embodiment.

Unknown media 1813 being displayed by a media system is provided to media matching & results processing engine 1814. Media matching & results processing engine 1814 may be similar to matching engine 112 and results engine 120 of FIG. 1, for example. From the combined bucket, media matching & results processing engine 1814 extracts suspects and performs the matching process using path pursuit system, for example, to find match results 1815. Results 1815 have the further advantage of the weighting function being applied to the index. The embodiment of FIG. 18 is advantageous in that buckets are combined after each bucket is examined for fullness and rejected if above a predetermined threshold. By using the independent data groupings of feeds 1801-1803, the system of FIG. 18 achieves increased accuracy and reduced processing requirements. Additionally, the tag information attached to the respective index of the match result can be evaluated to provide prioritization of actions upon positive identification of the match result.

A method that may be employed by the system of FIG. 18 is described with reference to the flowchart of FIG. 19. At step 1901, known media content of at least one type is received (e.g., VOD content feeds 1801, primary television feeds 1802, television event feeds 1803, etc.). At step 1902, a hash function is applied to the cues associated with the known media content generated by ingest processors 1804-1806, and the known cues are indexed and bucketed. At step 1903, the hashed cue indexes are stored in respective databases 1807-1809. At step 1904, the indexes are tagged and weighted by index tagging & weighting engines 1810-1812. At step 1905, the indexes are combined by a bucket combiner engine 1810.

At step 1906, unknown media content 1813 is received, its cues are copied, and the unknown cues are provided to a media matching engine 1814. At step 1907, the media matching engine 1814 harvests suspects from the combined bucket, and executes a match process between the known and unknown cues at step 1908 to identify a match. At step 1909, results are executed based on the identification of the matching known media content, such as an event being triggered (e.g., display of contextually targeted information), statistics being tallied, etc.

FIG. 20 is a diagram of a media processing center 2000 that detects television advertisements according to embodiments of the invention. The media processing center 2000 may be a central server, for example. The media processing center 2000 receives reference television program information at television ingest 2001 from participating content sources. The television programming may be processed and stored, such as by television database 2002. It is contemplated that the programming may be provided by a multichannel video program distributor (MVPD) both cable- and satellite-based, as well as by sources distributing content by way of the Internet.

In this specific example of television advertisement substitution, the system of FIG. 20 employs a second reference database (i.e., video segment database 2004) used in conjunction with a high-speed video segment detector 2005 for detecting special events such as television advertisements that are candidates for substitution. These events are detected by event manager 2006, which maintains a list of candidate video segments (e.g., television advertisements), and issues instructions to television system 2007 when a video segment is detected. Contextual event manager 2008 receives the instructions that are to be executed by television system 2007 on command.

The television client 2009 extracts media cues, either video or audio or both, from the displaying television programming. The media cues are transmitted via a network to video segment match engine 2003 of media processing center 2000. If a match is found to a special video segment, a message 2011 is issued to all enrolled televisions that are currently displaying the video segment (e.g., television system 2007 via contextual event manager 2008). Upon receipt of message 2011, contextual event manager 2008 retrieves the previously supplied address of a television advertisement that is to be substituted along with a substitution time and duration. Contextual event manager 2008 then addresses the substitute advertisement database 2010 at 2012 at the supplied start time which then streams the addressed substitute advertisement 2013 to television system 2007. At the end of the substitution period as conveyed by event manager 2006, television system 2007 switches back to the original television program that was playing at the start of the substitution sequence.

A method that may be employed by the system of FIG. 20 is described with reference to the flowchart of FIG. 21. At step 2101, television ingest is received and media cues of an unknown video segment are extracted. At step 2102, the cues of the unknown video segment are tested against the cues of known video segments extracted from a video segment database 2103. At step 2104, it is determined whether a match has been found in the known video segments. If no match has been found, the method loops back to step 2102, and the unknown video segment is compared to further known video segments. If a match has been found, the method continues at step 2106.

At step 2106, a video segment identifier associated with the matching known video segment is tested against a database of advertisement substitution identifiers 2105. At step 2107, it is determined whether there is an advertisement substitution event match (i.e., if the video segment identifier matches an identifier in database 2105). If no match has been found, the method loops back to step 2106, and the video segment identifier is compared to further advertisement substitution identifiers. If a match has been found, the method continues at step 1808.

At step 2108, a notice of an about-to-air substitute advertisement is sent to all active television systems tuned to the respective channel. At step 2109, the television system starts a countdown timer to the airing of the substitute advertisement. At step 2110, it is determined whether a timeout has occurred. If a timeout has not occurred, the countdown timer continues. If a timeout has occurred (i.e., the countdown has expired), the substitute advertise is pulled at step 2111 from a substitute advertisement server or database 2112. At step 2113, the video and/or audio being displayed on the television system is switched to the substitute advertisement. At step 2114, it is determined whether a timeout has occurred. If a timeout has not occurred, the substitute advertisement continues airing. If a timeout has occurred (i.e., the substitute advertisement has ended), the video and/or audio is switched back to the original programming on the television system at step 2115.

For further understanding of the timing of the television advertisement substitution system and method described above, FIG. 22 illustrates a video segment timeline 2201 as received at a media processing center (e.g., media processing center 2000) with a television advertisement group 2204 (also known as an “ad pod” 2204). The ad pod 2204 contains a multiplicity of individual television advertisements of various durations. The video segment 2201 is processed by a media processing center (e.g., media processing center 2000) and added to the video matching reference database. A 30 second advertisement starts at 2202, followed by short and long advertisements, then a 15 second advertisement airs at 2203. The ad pod 2204 ends and programming resumes at 2205.

A television system 2007 (e.g., a consumer television in a typical home) receives the same television programming 2206 as the media processing center. However, due to the structure of the television distribution network, the media processing center receives television programming about four to five seconds in advance of when the same programming is received at a user's television (e.g., television system 2007). Taking advantage of this delay, the media processing center according to embodiments of the invention has sufficient time to detect any particular video segment that may be a candidate for additional processing, then determine if an event is stored in video segment database 2004 at time 2208. If an event is stored, then event manager 2006 may supply instructions and, if appropriate, provide additional media to eligible television clients (e.g., television system 2007) via the contextual event manager 2008. The contextual event manager 2008 then responds at time 2207 to address a substitute video segment 2209b and cause the substitute video segment to be displayed on television system 2007 in place of the originally broadcast video segment 2209a. The substitute video segment 2209b may be addressed from a video server on the premises of the media processing center, or may be addressed from any server connected to the Internet.

In yet another embodiment of the invention, the detection of a video segment may trigger additional information to be displayed from a process operating within a television client 2309. FIG. 23 illustrates a media processing center 2300 which, among many services, detects video segments displaying on the television client 2309 by, for example, comparing cues of video frames 2309b to known cues of known content. The known content may be received by television ingest 2301, the cues extracted, and stored in television database 2302. The cues are matched by video segment matching engine 2303. Match results may then be applied to event manager 2306.

If an event has been registered to trigger an action in the presence of the matched video segment, the context asset manager 2305 will be addressed to supply media in the form of a graphic overlay window, for example, as stored by context assets database 2304. The graphic overlay window along with certain timing information is then sent via a network 2311 to a contextual event manager 2308 of each television system 2307 that is detected to be displaying the video segment. Upon receipt of the contextually related media, contextual event manager 2308 may display the media as, for example, an overlaid window occupying a portion of the display area and containing information which is usually related to the topic of the video segment currently being displayed.

A method that may be employed by the system of FIG. 23 is described with reference to the flowchart of FIG. 24. At step 2401, television ingest is received and media cues of an unknown video segment are extracted. At step 2402, the cues of the unknown video segment are tested against the cues of known video segments extracted from a video segment database 2403. At step 2404, it is determined whether a match has been found in the known video segments. If no match has been found, the method loops back to step 2402, and the unknown video segment is compared to further known video segments. If a match has been found, the method continues at step 2406.

At step 2406, a video segment identifier associated with the matching known video segment is tested against a database of context associated media 2405. At step 2407, it is determined whether there is a contextually related media event match (i.e., if the video segment identifier matches an identifier in database 2405). If no match has been found, the method loops back to step 2406, and the video segment identifier is compared to further contextually related event identifiers. If a match has been found, the method continues at step 2408.

At step 2408, a notice of an about-to-air video segment is sent to all active television systems tuned to the respective channel. At step 2409, the television system starts a countdown timer to the airing of the video segment. At step 2410, it is determined whether a timeout has occurred. If a timeout has not occurred, the countdown timer continues. If a timeout has occurred (i.e., the countdown has expired), the overlaid media is triggered at step 2411 from an overlay media database 2412. At step 2413, the overlaid window is opened and displayed on the original programming. At step 2414, the overlaid window is closed at the end of a timer (e.g., at the end of 30 seconds), or at a segment change trigger (e.g., at the end of a video segment and beginning of a new video segment).

The timing of contextual media overlay graphics is illustrated in FIG. 25. A television program channel 2501 is received at a media processing center and video segments are detected and stored in a reference media database. When a video segment 2502 which has associated contextually related media for local display on a television system is detected, a signal is sent at 2506 to the television system which is detected to be displaying the same television program channel 2504 (i.e., 2501 and 2504 represent the same television program channel). At the start of video segment 2 on the television system (i.e., at time 2505a), the local processor of the television system executes instructions received from the media processing center. The instructions display a graphics overlay window (i.e., supplemental television content 2507) with additional information related to the underlying video program. The supplemental television content 2507 displays until the end of video segment 22505b.

The video frame representations of FIG. 26 illustrate the actions based on the timeline of FIG. 25 according to one embodiment. In FIG. 26, a video segment 2601 displays a scene of a tropical island. At video segment 2602, the content programmer wishes to display an overlay window inviting the viewer to receive information for booking a vacation to the tropical island. As discussed above, at time 2505 which is the start of video segment 2602, the processor of the television system follows the provided instructions to display a graphics overlay window with supplemental information 2604. At the end of the segment 2505b, instructions to the processor of the television system cause the video overlay window to be removed, resulting in an unobstructed video segment 2603.

The nearest neighbor and path pursuit techniques mentioned previously are now described in detail. An example of tracking video transmission using ambiguous cues is given, but the general concept can be applied to any field, such as those described above.

A method for efficient video pursuit is presented. Given a large number of video segments, the system must be able to identify in real time what segment a given query video input is taken from and in what time offset. The segment and offset together are referred to as the location. The method is called video pursuit since it must be able to efficiently detect and adapt to pausing, fast forwarding, rewinding, abrupt switching to other segments and switching to unknown segments. Before being able to pursue live video the database is processed. Visual cues (a handful of pixel values) are taken from frames every constant fraction of a second and put in specialized data structure (Note that this can also be done in real time). The video pursuit is performed by continuously receiving cues from the input video and updating a set of beliefs or estimates about its current location. Each cue either agrees or disagrees with the estimates, and they are adjusted to reflect the new evidence. A video location is assumed to be the correct one if the confidence in this being true is high enough. By tracking only a small set of possible “suspect” locations, this can be done efficiently.

A method is described for video pursuit but uses mathematical constructs to explain and investigate it. It is the aim of this introduction to give the reader the necessary tools to translate between the two domains. A video signal is comprised of sequential frames. Each can be thought of as a still image. Every frame is a raster of pixels. Each pixel is made out of three intensity values corresponding to the red, green and blue (RGB) make of that pixel's color. In the terminology of this manuscript, a cue is a list of RGB values of a subset of the pixels in a frame and a corresponding time stamp. The number of pixels in a cue is significantly smaller than in a frame, usually between 5 and 15. Being an ordered list of scalar values, the cue values are in fact a vector. This vector is also referred to as a point.

Although these points are in high dimension, usually between 15 and 150, they can be imagined as points in two dimensions. In fact, the illustrations will be given as two dimensional plots. Now, consider the progression of a video and its corresponding cue points. Usually a small change in time produces a small change in pixel values. The pixel point can be viewed as “moving” a little between frames. Following these tiny movements from frame to frame, the cue follows a path in space like a bead would on a bent wire.

In the language of this analogy, in video pursuit the locations of the bead in space (the cue points) are received and the part of wire (path) the bead is following is looked for. This is made significantly harder by two facts. First, the bead does not follow the wire exactly but rather keeps some varying unknown distance from it. Second the wires are all tangled together. These statements are made exact in section 2. The algorithm described below does this in two conceptual steps. When a cue is received, it looks for all points on all the known paths that are sufficiently close to the cue point; these are called suspects. This is done efficiently using the Probabilistic Point Location in Equal Balls algorithm. These suspects are added to a history data structure and the probability of each of them indicating the true location is calculated. This step also includes removing suspect locations that are sufficiently unlikely. This history update process ensures that on the one hand only a small history is kept but on the other hand no probable locations are ever deleted. The generic algorithm is given in Algorithm 1 and illustrated in FIG. 27.

Algorithm 1 Generic path pursuit algorithm.

1:
Set of suspects is empty

2:
loop

3:
Receive latest cue.

4:
Find path points who are close to it.

5:
Add them to the set of suspects.

6:
Based on the suspects update the location likelihood function.

7:
Remove from suspect set those who do not contribute to the

likelihood function.

8:
if A location is significantly likely then

9:
Output the likely location.

10:
end if

11:
end loop

The document begins with describing the Probabilistic Point Location in Equal Balls (PPLEB) algorithm in Section 1. It is used in order to perform line 5 in Algorithm 1 efficiently. The ability to perform this search for suspects quickly is crucial for the applicability of this method. Later, in section 2 one possible statistical model is described for performing lines 6 and 7. The described model is a natural choice for the setup. It is also shown how it can be used very efficiently.

Section 1—Probabilistic Point Location in Equal Balls

The following section describes a simple algorithm for performing probabilistic point location in equal balls (PPLEB). In the traditional PLEB (point location in equal balls), one starts with a set of n points x, in lR d and a specified ball of radius r. The algorithm is given O(poly(n)) preprocessing time to produce an efficient data structure. Then, given a query point x the algorithm is required to return all points x, such that ∥x−x_i∥≤r. The set of points such that ∥x−x_i∥≤r. geometrically lie within a ball of radius r surrounding the query x (see FIG. 23). This relation is referred to as x, being close to x or as x, and x being neighbors.

The problem of PPLEB and the problem of nearest neighbor search are two similar problems that received much attention in the academic community. In fact, these problems were among the first studied in the field of computational geometry. Many different methods cater to the case where the ambient dimension dis small or constant. These partition the space in different ways and recursively search through the parts. These methods include KD-trees, cover-trees, and others. Although very efficient in low dimension, when the ambient dimension is high, they tend to perform very poorly. This is known as the “curse of dimensionality”. Various approaches attempt to solve this problem while overcoming the curse of dimensionality. The algorithm used herein uses a simpler and faster version of the algorithm and can rely on Local Sensitive Hashing.

Section 1.1 Locality Sensitive Hashing

In the scheme of local sensitive hashing, one devises a family of hash functions H such that:

$\begin{matrix} \underset{u \sim U}{\Pr} (u (x) \neq u (y) ❘  x - y  \leq r) \equiv p \underset{u \sim U}{\Pr} (u (x) \neq u (y) ❘  x - y  \geq 2 r) \geq 2 p \end{matrix}$

In words, the probability of x and y being mapped to the same value by h is significantly higher if they are close to each other.

For the sake of clarity, let us first deal with a simplified scenario where all incoming vectors are of the same length r′ and r′>√{square root over (2r)}. The reason for the latter condition will become clear later. First a random function uϵU is defined, which separates between x and y according to the angle between them. Let {right arrow over (u)} be a random vector chosen uniformly from the unit sphere S^d-1and let u(x)=sign({right arrow over (u)}·x). It is easy to verify that Pr_u-U(u(x))≠u(y))=0_x,y/π. Moreover, for any points x, y, x′, y′ on a circle such that ∥x′−y′∥≤2∥x−y∥, 0_x′,y≤20_x,yis achieved. Defining p, the following equations are used:

$\underset{u \sim U}{\Pr} (u (x) \neq u (y) ❘  x - y  \leq r) \equiv p \underset{u \sim U}{\Pr} (u (x) \neq u (y) ❘  x - y  \geq 2 r) \geq 2 p$

The family of functions H is set to be a cross product of t independent copies of u, i.e. h(x)=[ul(x), . . . , u_t(x)]. Intuitively, one would like to have that if h(x)=h(y) then x and y are likely to be close to each other. Let us quantify that. First, compute the expected number of false positive mistakes n_fp. These are the cases for which h(x)=h(y) but ∥x−y∥>2r. A value t is found for which n_fpis no more than 1, i.e. one is not expected to be wrong.

E[n_ft]≤n(1−2p)^t≤1
→t≥log(1/n)/log(1−2p)

Now, the probability that h(x)=h(y) given that they are neighbors is computed:

$\begin{matrix} P r (h (x) = h (y) ❘  x - y  \leq r) \geq {(1 - p)}^{l o g (1 / n) / l o g (1 - 2 p)} = {(1 / n)}^{\log (1 - p) / \log (1 - 2 p)} \geq 1 / \sqrt{n} . \end{matrix}$

Note here that one must have that 2p<1 which requires r′>√{square root over (2r)}. This might not sound like a very high success probability. Indeed, 1/√{square root over (n)} is significantly smaller than ½. The next section will describe how to boost this probability up to ½.

Section 1.2 The Point Search Algorithm

Each function h maps every point in space to a bucket. Define the bucket function B_h: custom character ^d→2^[n] of a point x with respect to hash function has B_h(x)≡{x_i|h(x_i)=h(x)}. The data structure maintained is m=O(√{square root over (n)}) instances of bucket functions [Bh₁, . . . , Bh_m]. When one searches for a point x, the function returns B(x)=∪i B_hj(x). According to the previous section, there are two desired results:

Pr(x_iϵB(x)|∥x_i−x∥≤r)≥½
E[|B(x)∩{x_i|∥x−x_i∥>2r}|]≤√{square root over (n)}

In other words, while with probability at least ½ each neighbor of x is found, one is not likely to find many non-neighbors.

Section 1.3 Dealing with Different Radii Input Vectors

The previous sections only dealt with searching through vectors of the same length, namely r′. Now described is how one can use the construction as a building block to support a search in different radii. As seen in FIG. 11, the space is divided into rings of exponentially growing width. Ring i, denoted by R_i, includes all points x_isuch that ∥x_i∥∈[2r(1+∈)ⁱ, 2r(1+∈)ⁱ⁺¹]. Doing this achieves two ends. First, if x_iand x_jbelong to the same ring, then ∥x_j∥/(1+∈)≤∥x_i∥≤∥x_j∥(1+∈). Second, any search can be performed in at most 1/∈ such rings. Moreover, if the maximal length vector in the data set is r′ then the total number of rings in the system is O(log(r′/r)).

Section 2 The Path Pursuit Problem

In the path pursuit problem, a fixed path in space is given along with the positions of a particle in a sequence of time points. The terms particle, cue, and point will be used interchangeably. The algorithm is required to output the position of the particle on the path. This is made harder by a few factors: the particle only follows the path approximately; the path can be discontinuous and intersect itself many times; both particle and path positions are given in a sequence of time points (different for each).

It is important to note that this problem can simulate tracking a particle on any number of paths. This is simply done by concatenating the paths into one long path and interpreting the resulting position as the position on the individual paths.

More precisely, let path P be parametric curve P: custom character →^d. The curve parameter will be referred to as the time. The points on the path that are known to us are given in arbitrary time points t_i, i.e. n pairs (t_i, P(t_i)) are given. The particle follows the path but its positions are given in different time points, as shown in FIG. 12. Further, m pairs (t′_j, x(t′_j)) are given, where x(t′_j) is the position of the particle in time t′_j.

Section 2.1 Likelihood Estimation

Since the particle does not follow the path exactly and since the path can intersect itself many times it is usually impossible to positively identify the position on the path the particle is actually on. Therefore, a probability distribution is computed on all possible path locations. If a location probability is significantly probable, the particle position is assumed to be known. The following section describes how this can be done efficiently.

If the particle is following the path, then the time difference between the particle time stamp and the offset of the corresponding points on P should be relatively fixed. In other words, if x(t′) is currently in offset t on the path then it should be close to P(t). Also, τ seconds ago it should have been in offset t−τ. Thus x(t′−τ) should be close to P(t−τ) (note that if the particle is intersecting the path, and x(t′) is close to P(t) temporarily, it is unlikely that x(t′−τ) and P(t−τ) will also be close). Define the relative offset as Δ=t−t′. Notice that as long as the particle is following the path the relative offset Δ remains unchanged. Namely, x(t′) is close to P(t′+Δ).

The maximum likelihood relative offset is obtained by calculating:

$Δ = \underset{δ}{argmax} \Pr (x (t_{m}^{'}), x (t_{m - 1}^{'}), \dots, x (t_{1}^{'}) ❘ P, δ)$

In words, the most likely relative offset is the one for which the history of the particle is most likely. This equation however cannot be solved without a statistical model. This model must quantify: How tightly x follows the path; How likely it is that x ‘)umps” between locations; How smooth the path and particle curves are between the measured points.

Section 2.2 Time Discounted Binning

Now described is a statistical model for estimating the likelihood function. The model makes the assumption that the particle's deviation away from the path distributes normally with standard deviation ar. It also assumes that at any given point in time, there is some non-zero probability the particle will abruptly switch to another path. This is manifested by an exponential discount with time for past points. Apart for being a reasonable choice for a modeling point of view this model also has the advantage of being efficiently updateable. For some constant time unit 1:, set the likelihood function to be proportional to ƒ which is defined as follows:

$f_{m} (⌊ δ / τ ⌋) = \sum_{j = 1}^{m} \sum_{i = 1}^{n} {e^{- {(\frac{[❘ x [(t_{j}^{'}) - P (t_{i} + δ) ❘]}{or})}^{2}} (1 - ζ)}^{r_{i}^{'} - t_{j}^{'}} .$

Here α<<1 is a scale coefficient and ξ>0 is the probability that the particle will jump to a random location on the path in a given time unit.

Updating the function ƒ efficiently can be achieved using the following simple observation.

$f_{m} (⌊ δ / τ ⌋) = \sum_{i = 1}^{n} e^{- {(\frac{[❘ x [(t_{m}^{'}) - P (t_{i} + δ) ❘]}{or})}^{2}} + f_{m - 1} (⌊ δ / τ ⌋) {(1 - ζ)}^{t_{m}^{'} - t_{m - 1}^{'}}$

Moreover, since α<<1, if ∥x(t′_m)−P(t_i)∥≥r, the follow occurs:

$e^{- {(\frac{[❘ x (t_{m}^{'}) - P (t_{i}) ❘]}{or})}^{2}} \approx 0.$

This is an important property of the likelihood function since the sum update can now performed only over the neighbors of x(t′_j) and not the entire path. Denote by S the set of(t_i, P(t_i)) such that ∥x(t′_m)−P(t_i)∥≤r. The follow equation occurs:

$f_{m} (⌊ δ / τ ⌋) = \sum_{(t_{i}, P (t_{i}) ϵ S \land ⌊ (t_{m}^{'} - t_{i}) / τ ⌋ = ⌊ δ / τ ⌋} e^{- {(\frac{[❘ x [(t_{m}^{'}) - P (t_{i}) ❘]}{or})}^{2}} + f_{m - 1} (δ) {(1 - ζ)}^{t_{m}^{'} - t_{m - 1}^{'}}$

This is described in Algorithm 2.2 below. The term ƒ is used as a sparse vector that receives also negative integer indices. The set S is the set of all neighbors of x(t_i) on the path and can be computed quickly using the PPLEB algorithm. It is easy to verify that if the number of neighbors of x(t_i) is bounded by some constant n_nearthen the number of non-zeros in the vector ƒ is bounded by n_near/ξ which is only a constant factor larger. The final stage of the algorithm is to output a specific value of δ if ƒ(└δ/τ┘) is above some threshold value.

Algorithm 2 Efficient likelihood update.

1:
f ← 0

2:
while (t_j′, x(t_j′)) ϵ INPUT do

3:
f ← (1 − ζ)^t^j^′t^j−1^′ f

4:
S ← {(t_i, P(t_i)) | ∥x(t_j′) − P(t_i)∥ ≤ r}

5:
for (t_i, P(t_i)) ϵ S do

6:
δ ← t_j′ − t_i

7:

f (⌊ δ / τ ⌋) \leftarrow f (⌊ δ / τ ⌋) + ⅇ^{- {(\frac{ x (t_{i}) - P (t^{'}) }{στ})}^{2}}

8:
end for

9:
Set all f values below threshold ϵ to zero.

10:
end while

FIG. 28 gives three consecutive point locations and the path points around them. Note that neither the bottom point nor middle one alone would have been sufficient to identify the correct part of the path. Together, however, they are. Adding the top point increases the certainty that the particle is indeed of the final (left) curve of the path.

In FIG. 29, given a set of n (grey) points, the algorithm is given a query point (black) and returns the set of points that lie within distance r from it (the points inside the circle). In the traditional setting, the algorithm must return all such points. In the probabilistic setting each such point should be returned only with some constant probability.

FIG. 30 illustrates the values of u(x₁), u(x₂), and u(x). Intuitively, the function u gives different values to x₁and x₂if the dashed line passes between them and the same value otherwise. Passing the dashed line in a random direction ensures that the probability of this happening is directly proportional to angle between x₁and x₂.

FIG. 31 shows that by dividing the space into rings such that ring R_iis between radius 2r(1+ϵ)ⁱand 2r(1+ϵ)ⁱ⁺¹, it can be made sure that any two vectors within a ring are the same length up to (1+ϵ) factors and that any search is performed in at most 1/ϵ rings.

FIG. 32 shows a self-intersecting paths and a query point (in black). It illustrates that without the history of the particle positions it is impossible to know where it is on the path.

FIG. 32 gives three consecutive point locations and the path points around them. Note that neither x(t₁) nor x(t₂) alone would have been sufficient to identify the correct part of the path. Together however they are. Adding x(t₃) increases the certainty that the particle is indeed of the final (left) curve of the path.

In summary, embodiments of the invention improve upon the media matching and identification process by dividing reference data (i.e., known media content data) into a plurality of reference databases which can be searched independently, simultaneously, concurrently, or a combination. The results of the search process can then be weighted and scored for a final result.

Although described herein with respect to real-time identification of television programming, it is contemplated that the systems and methods described herein may be applied to any “big data” problem where multi-dimensional searches can be advanced by partitioning data sets into preferred subsets. Further, although described substantially herein as relating to video data and graphical displays, it is contemplated that the systems and methods described herein may be similarly used with respect to audio data and audible displays. For example, substitute audio data may be provided in certain embodiments.

Substantial variations may be made in accordance with specific requirements. For example, customized hardware might also be used, and/or particular elements might be implemented in hardware, software (including portable software, such as applets, etc.), or both. Further, connection to other access or computing devices such as network input/output devices may be employed.

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 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.

Claims

1. A system comprising: one or more processors; andone or more non-transitory machine-readable storage media containing instructions which when executed on the one or more processors, cause the one or more processors to perform operations including: transmitting a cue derived from a video frame of media associated with a particular channel, the cue including a representation of one or more subsets of pixels of the video frame;receiving in response to transmitting the cue, a media substitution request, wherein the media substitution request includes a substitute media identifier corresponding to a substitute media segment and an identification of a first time interval configured to synchronize presentation of the substitute media segment;determining when the first time interval has expired;retrieving, in response to determining that the first time interval has expired, the substitute media segment corresponding to the substitute media identifier;determining a second time interval over which the substitute media segment is to be presented;presenting the substitute media segment, the substitute media segment being presented during a media segment of the media associated with the particular channel;determining when the second time interval has expired; andterminating, in response to determining that the second time interval has expired, the substitute media segment.
2. The system of claim 1, wherein the substitute media segment is presented in place of a media segment of the media associated with the particular channel.
3. The system of claim 1, wherein the substitute media segment is presented within an overlay window that is displayed over a portion of the media associated with the particular channel.
4. The system of claim 1, wherein the substitute media segment is contextually related to the media associated with the particular channel.
5. The system of claim 1, wherein the media substitution request is received in response to the media associated with the particular channel being identified.
6. The system of claim 1, wherein the operations further include: generating a media cue from a media segment of the media associated with the particular channel, wherein the media cue is configured for use in identifying media segments of the media associated with the particular channel; andtransmitting the media cue to identify the media segment, wherein upon being identified, media substitution requests are transmitted to a plurality of display devices that are presenting the media associated with the particular channel.
7. A computer-implemented method comprising: transmitting, by a display device, a cue derived from a video frame of media associated with a particular channel, the cue including a representation of one or more subsets of pixels of the video frame;receiving, by the display device in response to transmitting the cue, a media substitution request, wherein the media substitution request includes a substitute media identifier corresponding a substitute media segment and an identification of a first time interval configured to synchronize presentation of the substitute media segment;determining when the first time interval has expired;retrieving, in response to determining that the first time interval has expired, the substitute media segment corresponding to the substitute media identifier;determining a second time interval over which the substitute media segment is to be presented;presenting, by the display device, the substitute media segment, the substitute media segment being presenting over a media segment of the media associated with the particular channel; andterminating, in response to determining that the second time interval has expired, the substitute media segment.
8. The computer-implemented method of claim 7, wherein the substitute media segment is presented in place of a media segment of the media associated with the particular channel.
9. The computer-implemented method of claim 7, wherein the substitute media segment is presented within an overlay window that is displayed over a portion of the media associated with the particular channel.
10. The computer-implemented method of claim 7, wherein the substitute media segment is contextually related to the media associated with the particular channel.
11. The computer-implemented method of claim 7, wherein the media substitution request is received in response to the media associated with the particular channel being identified.
12. The computer-implemented method of claim 7, further comprising: generating a media cue from a media segment of the media associated with the particular channel, wherein the media cue is configured for use in identifying media segments of the media associated with the particular channel; andtransmitting the media cue to identify the media segment, wherein upon being identified, media substitution requests are transmitted to a plurality of display devices that are presenting the media associated with the particular channel.
13. A non-transitory machine-readable storage medium of a display device, the non-transitory machine-readable storage medium containing instructions which when executed on one or more processors, cause the one or more processors to perform operations including: transmitting a cue derived from a video frame of media associated with a particular channel, the cue including a representation of one or more subsets of pixels of the video frame;receiving in response to transmitting the cue, a media substitution request, wherein the media substitution request includes a substitute media identifier corresponding to a substitute media segment and an identification of a first time interval configured to synchronize presentation of the substitute media segment;determining when the first time interval has expired;retrieving, in response to determining that the first time interval has expired, the substitute media segment corresponding to the substitute media identifier;determining a second time interval over which the substitute media segment is to be presented;presenting the substitute media segment, the substitute media segment being presented during a media segment of the media associated with the particular channel;determining when the second time interval has expired; andterminating, in response to determining that the second time interval has expired, the substitute media segment.
14. The non-transitory machine-readable storage medium of claim 13, wherein the substitute media segment is presented in place of a media segment of the media associated with the particular channel.
15. The non-transitory machine-readable storage medium of claim 13, wherein the substitute media segment is presented within an overlay window that is displayed over a portion of the media associated with the particular channel.
16. The non-transitory machine-readable storage medium of claim 13, wherein the substitute media segment is contextually related to the media associated with the particular channel.
17. The non-transitory machine-readable storage medium of claim 13, wherein the operations further include: generating a media cue from a media segment of the media associated with the particular channel, wherein the media cue is configured for use in identifying media segments of the media associated with the particular channel; andtransmitting the media cue to identify the media segment, wherein upon being identified, media substitution requests are transmitted to a plurality of display devices that are presenting the media associated with the particular channel.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 15/211,492 filed Jul. 15, 2016, which claims the benefit of U.S. Provisional Patent Application No. 62/193,351, filed Jul. 16, 2015, the disclosures of which are hereby incorporated by reference in their entirety for all purposes. This application is related to U.S. patent application Ser. No. 14/551,933, filed Nov. 24, 2014, which is a continuation of U.S. patent application Ser. No. 12/788,721, filed May 27, 2010, now U.S. Pat. No. 8,595,781, which claims the benefit of U.S. Provisional Patent Application No. 61/182,334, filed May 29, 2009, and U.S. Provisional Patent Application No. 61/290,714, filed Dec. 29, 2009, the disclosures of which are herein incorporated by reference in their entireties for all purposes.

US Referenced Citations (363)

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
5006987	Harless	Apr 1991	A
5019899	Boles et al.	May 1991	A
5193001	Kerdranvrat	Mar 1993	A
5210820	Kenyon	May 1993	A
5319453	Copriviza et al.	Jun 1994	A
5436653	Ellis et al.	Jul 1995	A
5473607	Hausman	Dec 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
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
6298482	Seidman	Oct 2001	B1
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
7098959	Mishima et al.	Aug 2006	B2
7136875	Anderson et al.	Nov 2006	B2
7178106	Lamkin et al.	Feb 2007	B2
7210157	Devara	Apr 2007	B2
7243239	Kirovski	Jul 2007	B2
7325013	Caruso	Jan 2008	B2
7346512	Wang et al.	Mar 2008	B2
7356830	Dimitrova	Apr 2008	B1
7421723	Harkness et al.	Sep 2008	B2
7545984	Kiel et al.	Jun 2009	B1
7590998	Hanley	Sep 2009	B2
7623823	Zito et al.	Nov 2009	B2
7787696	Wilhelm et al.	Aug 2010	B2
7793318	Deng	Sep 2010	B2
7933451	Kloer	Apr 2011	B2
7987491	Reisman	Jul 2011	B2
7991764	Rathod	Aug 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
8195589	Bakke et al.	Jun 2012	B2
8195689	Ramanathan et al.	Jun 2012	B2
8229227	Stojancic et al.	Jul 2012	B2
8335786	Peira et al.	Dec 2012	B2
8352535	Peled	Jan 2013	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
8619877	McDowell	Dec 2013	B2
8625902	Baheti et al.	Jan 2014	B2
8769854	Battaglia	Jul 2014	B1
8776105	Sinha et al.	Jul 2014	B2
8788328	George	Jul 2014	B1
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
9083710	Yadav	Jul 2015	B1
9094714	Neumeier et al.	Jul 2015	B2
9094715	Neumeier et al.	Jul 2015	B2
9165604	Plotnick	Oct 2015	B2
9262671	Unzueta	Feb 2016	B2
9368021	Touloumtzis	Jun 2016	B2
9432616	Hurd	Aug 2016	B1
9449090	Neumeier et al.	Sep 2016	B2
9465867	Hoarty	Oct 2016	B2
9484065	McDowell	Nov 2016	B2
9838753	Neumeier et al.	Dec 2017	B2
9955192	Neumeier et al.	Apr 2018	B2
10080062	Neumeier et al.	Sep 2018	B2
10116972	Neumeier et al.	Oct 2018	B2
10169455	Neumeier et al.	Jan 2019	B2
10185768	Neumeier et al.	Jan 2019	B2
10192138	Neumeier et al.	Jan 2019	B2
10271098	Neumeier et al.	Apr 2019	B2
10284884	Neumeier et al.	May 2019	B2
10306274	Neumeier et al.	May 2019	B2
10375451	Neumeier et al.	Aug 2019	B2
10405014	Neumeier et al.	Sep 2019	B2
10482349	Neumeier	Nov 2019	B2
10674223	Neumeier et al.	Jun 2020	B2
10820048	Neumeier et al.	Oct 2020	B2
11272248	Neumeier et al.	Mar 2022	B2
11308144	Neumeier et al.	Apr 2022	B2
20010039658	Walton	Nov 2001	A1
20010044992	Jahrling	Nov 2001	A1
20020026635	Wheeler et al.	Feb 2002	A1
20020054069	Britt et al.	May 2002	A1
20020054695	Bjorn et al.	May 2002	A1
20020056088	Silva, Jr. et al.	May 2002	A1
20020059633	Harkness et al.	May 2002	A1
20020078144	Lamkin et al.	Jun 2002	A1
20020083060	Wang et al.	Jun 2002	A1
20020083442	Eldering	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
20020144262	Plotnick	Oct 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
20030105794	Jashinschi	Jun 2003	A1
20030118243	Sezer	Jun 2003	A1
20030121037	Swix et al.	Jun 2003	A1
20030121046	Roy	Jun 2003	A1
20030147561	Faibish	Aug 2003	A1
20030182291	Kurupati	Sep 2003	A1
20030188321	Shoff et al.	Oct 2003	A1
20030208763	McElhatten et al.	Nov 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 et al.	Oct 2004	A1
20040221237	Foote et al.	Nov 2004	A1
20040226035	Hauser	Nov 2004	A1
20040237102	Konig	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
20050120372	Itakura	Jun 2005	A1
20050149968	Konig et al.	Jul 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
20060029286	Lim et al.	Feb 2006	A1
20060029368	Harville	Feb 2006	A1
20060031914	Dakss et al.	Feb 2006	A1
20060116989	Bellannkonda	Jun 2006	A1
20060120624	Jojic	Jun 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
20060193506	Dorphan 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
20060277047	DeBusk et al.	Dec 2006	A1
20060294561	Grannan et al.	Dec 2006	A1
20070005540	Fadde	Jan 2007	A1
20070009235	Walters et al.	Jan 2007	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
20070083901	Bond	Apr 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
20070154169	Cordray	Jul 2007	A1
20070168409	Cheung	Jul 2007	A1
20070180459	Smithpeters et al.	Aug 2007	A1
20070192782	Ramaswamy	Aug 2007	A1
20070198839	Carle	Aug 2007	A1
20070242880	Stebbings	Oct 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
20080005086	Moore	Jan 2008	A1
20080044102	Ekin	Feb 2008	A1
20080046945	Hanley	Feb 2008	A1
20080052161	Cohen	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
20080193102	Tischer	Aug 2008	A1
20080208891	Wang et al.	Aug 2008	A1
20080209480	Eide	Aug 2008	A1
20080240562	Fukuda et al.	Oct 2008	A1
20080249986	Clarke-Martin	Oct 2008	A1
20080263620	Berkvens et al.	Oct 2008	A1
20080276266	Huchital et al.	Nov 2008	A1
20080309819	Hardacker et al.	Dec 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
20090116702	Conradt	May 2009	A1
20090131861	Braig et al.	May 2009	A1
20090172728	Shkedi et al.	Jul 2009	A1
20090172746	Aldrey et al.	Jul 2009	A1
20090175538	Bronstein 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
20100042790	Mondal et al.	Feb 2010	A1
20100083299	Nelson	Apr 2010	A1
20100115543	Falcon	May 2010	A1
20100115574	Hardt et al.	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
20100253838	Garg et al.	Oct 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	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
20110307683	Spackman	Dec 2011	A1
20120017240	Shkedi	Jan 2012	A1
20120054143	Doig et al.	Mar 2012	A1
20120076357	Yamamoto et al.	Mar 2012	A1
20120095958	Pereira et al.	Apr 2012	A1
20120117584	Gordon	May 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
20120327450	Sagan	Dec 2012	A1
20130007191	Klappert et al.	Jan 2013	A1
20130007792	Jeon et al.	Jan 2013	A1
20130042262	Riethmueller	Feb 2013	A1
20130050564	Adams et al.	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
20130198768	Kitazato	Aug 2013	A1
20130202150	Sinha et al.	Aug 2013	A1
20130205315	Sinha	Aug 2013	A1
20130209065	Yeung	Aug 2013	A1
20130212609	Sinha et al.	Aug 2013	A1
20130290502	Bilobrov	Oct 2013	A1
20130297727	Levy	Nov 2013	A1
20130318096	Cheung	Nov 2013	A1
20140016696	Nelson	Jan 2014	A1
20140025837	Swenson	Jan 2014	A1
20140052737	Ramanathan et al.	Feb 2014	A1
20140082663	Neumeier et al.	Mar 2014	A1
20140088742	Srinivasan	Mar 2014	A1
20140105567	Casagrande	Apr 2014	A1
20140123165	Mukherjee et al.	May 2014	A1
20140130092	Kunisetty	May 2014	A1
20140153571	Neugebauer	Jun 2014	A1
20140188487	Perez Gonzalez	Jul 2014	A1
20140193027	Scherf	Jul 2014	A1
20140195548	Harron	Jul 2014	A1
20140196085	Dunker	Jul 2014	A1
20140201769	Neumeier et al.	Jul 2014	A1
20140201772	Neumeier	Jul 2014	A1
20140201787	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
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
20150040074	Hofmann et al.	Feb 2015	A1
20150067714	Bhogal	Mar 2015	A1
20150100979	Moskowitz et al.	Apr 2015	A1
20150112988	Pereira et al.	Apr 2015	A1
20150120839	Kannan et al.	Apr 2015	A1
20150121409	Zhang et al.	Apr 2015	A1
20150128161	Conrad et al.	May 2015	A1
20150131845	Forouhar	May 2015	A1
20150135206	Reisman	May 2015	A1
20150163545	Freed et al.	Jun 2015	A1
20150181311	Navin et al.	Jun 2015	A1
20150188967	Paulauskas	Jul 2015	A1
20150205727	Kimmel	Jul 2015	A1
20150229998	Kaushal et al.	Aug 2015	A1
20150256891	Kim et al.	Sep 2015	A1
20150302890	Ergen et al.	Oct 2015	A1
20150382075	Neumeier et al.	Dec 2015	A1
20160073166	Hu	Mar 2016	A1
20160112319	Hasani	Apr 2016	A1
20160154880	Hoarty	Jun 2016	A1
20160227261	Neumeier et al.	Aug 2016	A1
20160227291	Shaw et al.	Aug 2016	A1
20160286244	Chang et al.	Sep 2016	A1
20160307043	Neumeier	Oct 2016	A1
20160314794	Leitman et al.	Oct 2016	A1
20160316262	Chen	Oct 2016	A1
20160330529	Byers	Nov 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
20170090814	Yeung	Mar 2017	A1
20170134770	Neumeier et al.	May 2017	A9
20170186042	Wong et al.	Jun 2017	A1
20170311014	Fleischman	Oct 2017	A1
20170325005	Liassides	Nov 2017	A1
20170353776	Holden et al.	Dec 2017	A1
20180227646	Navin et al.	Aug 2018	A9

Foreign Referenced Citations (34)

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
1504445	Aug 2008	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
2015100372	Jul 2015	WO
2016033676	Mar 2016	WO
2016123495	Aug 2016	WO
2016168556	Oct 2016	WO
2017011758	Jan 2017	WO
2017011792	Jan 2017	WO

Non-Patent Literature Citations (127)

Entry
Arbelaez et al., “Contour Detection and Hierarchical Image Segmentation;” Feb. 16, 2010; Electrical Engineering and Computer Sciences University of California at Berkeley; Technical Report No. UCB/EECS-2010-17; http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-17.html (Year: 2010).
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-19 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.
Extended European Search Report dated Jun. 28, 2019, for European Patent Application No. 19166400.2, 9 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 page.
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”, Jun. 27, 2016, dated 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”, Mar. 3, 2016, dated 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.
U.S. Appl. No. 15/210,730, “Notice of Allowance”, dated May 23, 2018, 10 pages.
U.S. Appl. No. 15/796,706, “Non-Final Office Action”, dated Jun. 26, 2018, 17 pages.
U.S. Appl. No. 15/011,099, “Notice of Allowance”, dated Jun. 28, 2018, 12 pages.
U.S. Appl. No. 15/796,698, “Non-Final Office Action”, dated Jul. 5, 2018, 15 pages.
U.S. Appl. No. 15/240,801, “Notice of Allowance”, dated Aug. 30, 2018, 9 pages.
U.S. Appl. No. 15/211,345, “Non-Final Office Action”, dated Sep. 4, 2018, 13 pages.
U.S. Appl. No. 15/099,842, “Notice of Allowance”, dated Sep. 7, 2018, 10 pages.
U.S. Appl. No. 15/240,815, “Notice of Allowance”, dated Sep. 12, 2018, 9 pages.
U.S. Appl. No. 15/290,848, “First Action Interview Office Action Summary”, dated Nov. 2, 2018, 5 pages.
U.S. Appl. No. 15/796,692, “Notice of Allowance”, dated Dec. 5, 2018, 8 pages.
U.S. Appl. No. 15/796,698, “Notice of Allowance”, dated Dec. 20, 2018, 8 pages.
U.S. Appl. No. 15/796,706, “Notice of Allowance”, dated Jan. 11, 2019, 9 pages.
U.S. Appl. No. 15/211,508, “Non-Final Office Action”, dated Jan. 10, 2019, 20 pages.
U.S. Appl. No. 15/211,492, “Non-Final Office Action”, dated Jan. 11, 2019, 19 pages.
U.S. Appl. No. 16/141,598, “First Action Interview Office Action Summary”, dated Jan. 11, 2019, 8 pages.
U.S. Appl. No. 15/290,848, “Non-Final Office Action”, dated Mar. 5, 2019, 5 pages.
U.S. Appl. No. 15/211,991, “Non-Final Office Action”, dated Feb. 26, 2019, 8 pages.
U.S. Appl. No. 15/211,345, “Notice of Allowance”, dated Mar. 20, 2019, 6 pages.
U.S. Appl. No. 16/210,796, “Non-Final Office Action”, dated Mar. 22, 2019, 7 pages.
U.S. Appl. No. 16/141,598, “Notice of Allowance”, dated Apr. 25, 2019, 11 pages.
U.S. Appl. No. 15/211,508, “Final Office Action”, dated Jun. 20, 2019, 20 pages.
U.S. Appl. No. 15/211,492, “Final Office Action”, dated Jun. 20, 2019, 18 pages.
U.S. Appl. No. 16/210,796, “Notice of Allowance”, dated Jul. 11, 2019, 9 pages.
U.S. Appl. No. 16/214,875, “Non-Final Office Action”, dated Jul. 29, 2019, 12 pages.
U.S. Appl. No. 15/211,991, “Final Office Action”, dated Oct. 31, 2019, 9 pages.
U.S. Appl. No. 16/214,875, “Final Office Action”, dated Jan. 29, 2020, 13 pages.
U.S. Appl. No. 16/290,055, “Non-Final Office Action”, dated Feb. 19, 2020, 18 pages.
U.S. Appl. No. 16/379,663, “Non-Final Office Action”, dated Feb. 24, 2020, 19 pages.
U.S. Appl. No. 15/211,991, “Non-Final Office Action”, dated Mar. 19, 2020, 19 pages.
U.S. Appl. No. 15/211,508, “Non-Final Office Action”, dated Apr. 3, 2020, 25 pages.
U.S. Appl. No. 15/211,492, “Non-Final Office Action”, dated Apr. 6, 2020, 18 pages.
U.S. Appl. No. 16/290,055, “Notice of Allowance”, dated Jun. 25, 2020, 10 pages.
U.S. Appl. No. 16/214,875, “Non-Final Office Action”, dated Jul. 15, 2020, 21 pages.
U.S. Appl. No. 16/379,663, “Final Office Action”, dated Jul. 28, 2020, 15 pages.
U.S. Appl. No. 16/444,152, “Notice of Allowance”, dated Aug. 19, 2020, 6 pages.
U.S. Appl. No. 15/211,991, “Notice of Allowance”, dated Sep. 17, 2020, 13 pages.
U.S. Appl. No. 15/211,492, “Final Office Action”, dated Oct. 26, 2020, 18 pages.
U.S. Appl. No. 15/211,508, “Notice of Allowance”, dated Oct. 27, 2020, 13 pages.
U.S. Appl. No. 16/519,292, “Notice of Allowance”, dated Oct. 29, 2020, 10 pages.
U.S. Appl. No. 16/214,875, “Final Office Action”, dated Nov. 30, 2020, 17 pages.
U.S. Appl. No. 16/379,663, “Notice of Allowance”, dated Feb. 16, 2021, 9 pages.
U.S. Appl. No. 17/028,026, “Non-Final Office Action”, dated Jun. 22, 2021, 15 pages.
U.S. Appl. No. 17/028,026, “Notice of Allowance”, dated Dec. 30, 2021, 9 pages.
U.S. Appl. No. 15/211,492, “Notice of Allowance”, dated Dec. 10, 2021, 11 pages.

Related Publications (1)

	Number	Date	Country
	20220269708 A1	Aug 2022	US

Provisional Applications (1)

	Number	Date	Country
	62193351	Jul 2015	US

Continuations (1)

	Number	Date	Country
Parent	15211492	Jul 2016	US
Child	17689174		US

Systems and methods for partitioning search indexes for improved efficiency in identifying media segments

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Abstract