IP Library Granted Patent US 12,519,990
Granted Patent B2
US 12,519,990 · App. 18/676,456 · Granted Jan 6, 2026

Model serving for advanced frequency management

Inventors: Khaldun Matter Ahmad AlDarabsah (Santa Clara, CA); Hailong Geng (Beijing, CN); Yu Tao Zhao (Olympia, WA); Yoshihiro Tanaka (Redmond, WA); Haofei Wang (Redwood City, CA); Mark Alden Rotblat (Lafayette, CA); Jaya Kawale (San Jose, CA); Chang She (San Francisco, CA); Marios Assiotis (Park City, UT); Joseph Gallagher (San Francisco, CA); Chiyu Zhong (Bloomington, IN); Amir Mazaheri (Mountain View, CA)
Assignee: Tubi, Inc.
H04N21/23424G06Q30/0245G06Q30/0251G06Q30/0277G06V10/70G06V10/774G06V10/776G06V20/41G06V20/46H04N21/251H04N21/26208
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,519,990
App. No.
18/676,456
Granted
Jan 6, 2026
Kind
B2
Abstract

Systems and methods for entity detection using artificial intelligence, including: a deep learning model service configured to: select and analyze a set of frames from a media item to determine a set of candidate brand-probability pairs; a voting engine configured to: determining that a first brand-probability pair of a set of candidate brand-probability pairs based on at least one obtained hyperparameter value does not meet a threshold for determining whether candidate brand-probability pairs are to be included in a result set; excluding the first brand-probability pair from the result set based on the determination; sorting the result set; and selecting at least one final brand-probability pair from the result set; and an offline transcoding service configured to: store the final brand-probability pair in a repository with a relation to an identifier of the media item.

Claims (73)

1 . A system for entity detection using artificial intelligence, comprising:

a computer processor;

a deep learning model service executing on the computer processor and configured to enable the computer processor to select, according to a predefined selection procedure, a subset of frames of a media item and analyze the subset to determine a set of candidate entity-probability pairs, each representing a probability of a brand being associated with the media item, wherein the probability exceeds a predefined probability threshold, the predefined probability threshold optionally comprising a tuned hyperparameter value;

a voting engine configured to select at least one final brand for association with the media item in a transcoding repository based on a count of occurrences of the final brand within the set of candidate entity-probability pairs;

an online transcoding service configured to interface with the transcoding repository to determine occurrences of the final brand within a set of media items served to a set of recipients, wherein the set of media items comprises the media item;

a frequency management service configured to:

store a quantity of impressions associated with the final brand for each of the set of recipients in a lookup repository;

manage frequencies of serving media content associated with the final brand to the set of recipients based on the quantity of impressions, wherein the quantity of impressions for each recipient is incremented for every impression by the recipient of media content associated with the final brand; and

calculate a fingerprint of the media item using a deterministic algorithm, wherein the online transcoding service is further configured to query the transcoding repository with the fingerprint of the media item to identify whether the media item has been previously processed.

2 . The system of claim 1 , wherein the frequency management service is operatively connected to a realtime bidding service, and wherein the frequency management service is further configured to:

increment and track the quantity of impressions associated with the final brand for each of a set of digital advertisements provided for the set of recipients by the realtime bidding service;

receive a request for a digital advertisement for a recipient of the set of recipients; and

exclude a subset of the set of digital advertisements from fulfilling the request based on determining that the quantity of impressions associated with the final brand and the recipient over a duration of time exceeds a predefined frequency management limit.

3 . The system of claim 1 , wherein the frequency management service is further configured to:

receive a request for media content for a recipient of the set of recipients;

identify a candidate media item for fulfilling the request; and

wherein the online transcoding service is further configured to:

obtain a fingerprint of the candidate media item;

query a transcoding repository with the fingerprint of the candidate media item;

obtain a result for the query indicating that the candidate media item is not tracked in the transcoding repository; and

queue the candidate media item for transcoding, wherein the candidate media item is not throttled for the request by the frequency management service based on the result for the query indicating that the candidate media item is not tracked in the transcoding repository.

4 . The system of claim 1 , wherein selecting the at least one final brand for association with the media item comprises:

calculating a ranking score for each of the subset of frames of the media item based on at least one general characteristic;

sorting each of the subset of frames of the media item by their ranking score; and

selecting a portion of the subset of frames based on the sorting.

5 . The system of claim 1 , wherein the deterministic algorithm matches multiple similar media items to the same fingerprint.

6 . The system of claim 1 , wherein an offline transcoding service is further configured to store multiple brand probability pairs in the transcoding repository with association to the media item.

7 . The system of claim 1 , wherein probabilities of the candidate entity-probability pairs each represent at least one selected from a group consisting of (i) a likelihood that the media item contains the associated entity and (ii) a strength of association between the entity and the media item.

8 . A method for entity detection using artificial intelligence, comprising:

selecting, according to a predefined selection procedure, a subset of frames of a media item and analyzing, using at least one computer processor, the subset to determine a set of candidate entity-probability pairs, each representing a probability of a brand being associated with the media item, wherein the probability exceeds a predefined probability threshold, the predefined probability threshold optionally comprising a tuned hyperparameter value;

selecting at least one final brand for association with the media item in a transcoding repository based on a count of occurrences of the final brand within the set of candidate entity-probability pairs;

interfacing with the transcoding repository to determine occurrences of the final brand within a set of media items served to a set of recipients, wherein the set of media items comprises the media item;

storing a quantity of impressions associated with the final brand for each of the set of recipients in a lookup repository;

managing frequencies of serving media content associated with the final brand to the set of recipients based on the quantity of impressions, wherein the quantity of impressions for each recipient is incremented for every impression by the recipient of media content associated with the final brand; and

calculating a fingerprint of the media item using a deterministic algorithm, wherein the online transcoding service is further configured to query the transcoding repository with the fingerprint of the media item to identify whether the media item has been previously processed.

9 . The method of claim 8 , further comprising:

incrementing and tracking the quantity of impressions associated with the final brand for each of a set of digital advertisements provided for the set of recipients by a realtime bidding service;

receiving a request for a digital advertisement for a recipient of the set of recipients; and

excluding a subset of the set of digital advertisements from fulfilling the request based on determining that the quantity of impressions associated with the final brand and the recipient over a duration of time exceeds a predefined frequency management limit.

10 . The method of claim 8 , further comprising:

receiving a request for media content for a recipient of the set of recipients;

identifying a candidate media item for fulfilling the request;

obtaining a fingerprint of the candidate media item;

querying a transcoding repository with the fingerprint of the candidate media item;

obtaining a result for the query indicating that the candidate media item is not tracked in the transcoding repository; and

queueing the candidate media item for transcoding, wherein the candidate media item is not throttled for the request by the frequency management service based on the result for the query indicating that the candidate media item is not tracked in the transcoding repository.

11 . The method of claim 8 , wherein selecting the at least one final brand for association with the media item comprises:

calculating a ranking score for each of the subset of frames of the media item based on at least one general characteristic;

sorting each of the subset of frames of the media item by their ranking score; and

selecting a portion of the subset of frames based on the sorting.

12 . The method of claim 8 , wherein the deterministic algorithm matches multiple similar media items to the same fingerprint.

13 . A non-transitory computer-readable storage medium comprising a plurality of instructions for entity detection using artificial intelligence, the plurality of instructions configured to execute on at least one computer processor to enable the at least one computer processor to:

select, according to a predefined selection procedure, a subset of frames of a media item and analyze the subset to determine a set of candidate entity-probability pairs, each representing a probability of a brand being associated with the media item, wherein the probability exceeds a predefined probability threshold, the predefined probability threshold optionally comprising a tuned hyperparameter value;

select at least one final brand for association with the media item in a transcoding repository based on a count of occurrences of the final brand within the set of candidate entity-probability pairs;

interface with the transcoding repository to determine occurrences of the final brand within a set of media items served to a set of recipients, wherein the set of media items comprises the media item;

store a quantity of impressions associated with the final brand for each of the set of recipients in a lookup repository;

manage frequencies of serving media content associated with the final brand to the set of recipients based on the quantity of impressions, wherein the quantity of impressions for each recipient is incremented for every impression by the recipient of media content associated with the final brand; and

calculate a fingerprint of the media item using a deterministic algorithm, wherein the online transcoding service is further configured to query the transcoding repository with the fingerprint of the media item to identify whether the media item has been previously processed.

14 . The non-transitory computer-readable storage medium of claim 13 , the plurality of instructions further configured to execute on the at least one computer processor to enable the at least one computer processor to:

increment and track the quantity of impressions associated with the final brand for each of a set of digital advertisements provided for the set of recipients by a realtime bidding service;

receive a request for a digital advertisement for a recipient of the set of recipients; and

exclude a subset of the set of digital advertisements from fulfilling the request based on determining that the quantity of impressions associated with the final brand and the recipient over a duration of time exceeds a predefined frequency management limit.

15 . The non-transitory computer-readable storage medium of claim 13 , the plurality of instructions further configured to execute on the at least one computer processor to enable the at least one computer processor to:

receive a request for media content for a recipient of the set of recipients;

identify a candidate media item for fulfilling the request;

obtain a fingerprint of the candidate media item;

query a transcoding repository with the fingerprint of the candidate media item;

obtain a result for the query indicating that the candidate media item is not tracked in the transcoding repository; and

queue the candidate media item for transcoding, wherein the candidate media item is not throttled for the request based on the result for the query indicating that the candidate media item is not tracked in the transcoding repository.

16 . The non-transitory computer-readable storage medium of claim 13 , wherein selecting the at least one final brand for association with the media item comprises:

calculating a ranking score for each of the subset of frames of the media item based on at least one general characteristic;

sorting each of the subset of frames of the media item by their ranking score; and

selecting a portion of the subset of frames based on the sorting.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 28, 2024
From: ALDARABSAH, KHALDUN MATTER AHMAD; GENG, HAILONG; ZHAO, YU TAO; TANAKA, YOSHIHIRO; WANG, HAOFEI; ROTBLAT, MARK ALDEN; KAWALE, JAYA; SHE, CHANG; ASSIOTIS, MARIOS; GALLAGHER, JOSEPH; MAZAHERI, AMIR; ZHONG, CHIYU
To: TUBI, INC.
Reel/Frame 067544/0699 →
Continuity (3)
Continuation 17676760 · Feb 21, 2022
Provisional Application 63213177 · Jun 21, 2021
Related Publication 20240314371A1 · Sep 19, 2024
References Cited (100)
US 6546554B1 · Schmidt · 2003 [cited by applicant]
US 6804816B1 · Liu · 2004 [cited by applicant]
US 8776111B1 · Eldering et al. · 2014 [cited by applicant]
US 9215123B1 · Fears et al. · 2015 [cited by applicant]
US 9277275B1 · Arini · 2016 [cited by applicant]
US 9465604B1 · Burgyan et al. · 2016 [cited by applicant]
US 9563928B1 · Sokolowski et al. · 2017 [cited by applicant]
US 10007863B1 · Pereira et al. · 2018 [cited by applicant]
US 10671852B1 · Zadeh et al. · 2020 [cited by applicant]
US 10846737B1 · Matarese et al. · 2020 [cited by applicant]
US 10887421B2 · Moassoudi · 2021 [cited by applicant]
US 11463540B2 · Massoudi · 2022 [cited by applicant]
US 20010020255A1 · Hofmann et al. · 2001 [cited by applicant]
US 20020111995A1 · Mansour · 2002 [cited by applicant]
US 20020129129A1 · Bloch · 2002 [cited by applicant]
US 20020129368A1 · Schlack et al. · 2002 [cited by applicant]
US 20020146181A1 · Azam · 2002 [cited by applicant]
US 20020178126A1 · Beck et al. · 2002 [cited by applicant]
US 20030191726A1 · Kirshenbaum · 2003 [cited by applicant]
US 20030235184A1 · Dorenbosch et al. · 2003 [cited by applicant]
US 20050049998A1 · Ruhlow · 2005 [cited by applicant]
US 20050101321A1 · Ikeda et al. · 2005 [cited by applicant]
US 20050172243A1 · Pabla · 2005 [cited by applicant]
US 20050177835A1 · Chickering · 2005 [cited by applicant]
US 20060075019A1 · Donovan et al. · 2006 [cited by applicant]
US 20060253323A1 · Phan et al. · 2006 [cited by applicant]
US 20070233671A1 · Oztekin et al. · 2007 [cited by applicant]
US 20080082604A1 · Mansour et al. · 2008 [cited by applicant]
US 20080259906A1 · Shkedi · 2008 [cited by applicant]
US 20090006214A1 · Lerman · 2009 [cited by applicant]
US 20090013051A1 · Renschler et al. · 2009 [cited by applicant]
US 20090029687A1 · Ramer · 2009 [cited by examiner]
US 20090064301A1 · Sachdeva · 2009 [cited by applicant]
US 20090089161A1 · Alo et al. · 2009 [cited by applicant]
US 20090106785A1 · Pharn · 2009 [cited by applicant]
US 20090129479A1 · Yellamraju · 2009 [cited by applicant]
US 20090204478A1 · Kaib et al. · 2009 [cited by applicant]
US 20100037255A1 · Sheehan · 2010 [cited by applicant]
US 20100151816A1 · Besehanic et al. · 2010 [cited by applicant]
US 20100211967A1 · Ramaswamy et al. · 2010 [cited by applicant]
US 20100246981A1 · Hu et al. · 2010 [cited by applicant]
US 20110040636A1 · Simmons et al. · 2011 [cited by applicant]
US 20110093335A1 · Fordyce et al. · 2011 [cited by applicant]
US 20110103374A1 · LaJoie et al. · 2011 [cited by applicant]
US 20110113116A1 · Burdette et al. · 2011 [cited by applicant]
US 20110125594A1 · Brown et al. · 2011 [cited by applicant]
US 20110167440A1 · Greenfield · 2011 [cited by applicant]
US 20110219229A1 · Cholas et al. · 2011 [cited by applicant]
US 20110225046A1 · Eldering et al. · 2011 [cited by applicant]
US 20110246298A1 · Williams et al. · 2011 [cited by applicant]
US 20110252305A1 · Tschäni et al. · 2011 [cited by applicant]
US 20110258049A1 · Ramer · 2011 [cited by examiner]
US 20120007866A1 · Tahan · 2012 [cited by applicant]
US 20120016655A1 · Travieso · 2012 [cited by applicant]
US 20120029983A1 · Rodriguez et al. · 2012 [cited by applicant]
US 20120089455A1 · Belani et al. · 2012 [cited by applicant]
US 20120102169A1 · Yu et al. · 2012 [cited by applicant]
US 20120151079A1 · Besehanic et al. · 2012 [cited by applicant]
US 20120263385A1 · van Zwol · 2012 [cited by examiner]
US 20130110634A1 · Cochran et al. · 2013 [cited by applicant]
US 20130132856A1 · Binyamin et al. · 2013 [cited by applicant]
US 20130156269A1 · Matsui et al. · 2013 [cited by applicant]
US 20130198376A1 · Landa et al. · 2013 [cited by applicant]
US 20130227068A1 · Yasrebi et al. · 2013 [cited by applicant]
US 20130268951A1 · Wyatt et al. · 2013 [cited by applicant]
US 20130311649A1 · DeFrancesco et al. · 2013 [cited by applicant]
US 20130346202A1 · Kouladjie · 2013 [cited by applicant]
US 20140059636A1 · Patel · 2014 [cited by applicant]
US 20140075014A1 · Chourey · 2014 [cited by applicant]
US 20140101739A1 · Li et al. · 2014 [cited by applicant]
US 20140143052A1 · Stryker · 2014 [cited by applicant]
US 20140157289A1 · Aarts et al. · 2014 [cited by applicant]
US 20140181243A1 · Nieuwenhuys · 2014 [cited by applicant]
US 20140282642A1 · Needham et al. · 2014 [cited by applicant]
US 20140372415A1 · Fernandez-Ruiz · 2014 [cited by applicant]
US 20140379911A1 · Fayssal et al. · 2014 [cited by applicant]
US 20150055931A1 · Koivukangas · 2015 [cited by examiner]
US 20150082345A1 · Archer et al. · 2015 [cited by applicant]
US 20150206198A1 · Marshall · 2015 [cited by applicant]
US 20150234564A1 · Snibbe et al. · 2015 [cited by applicant]
US 20150271540A1 · Melby et al. · 2015 [cited by applicant]
US 20150382075A1 · Neumeier et al. · 2015 [cited by applicant]
US 20160358099A1 · Sturlaugson · 2016 [cited by applicant]
US 20160358209A1 · Khozani et al. · 2016 [cited by applicant]
US 20160360289A1 · Santoro et al. · 2016 [cited by applicant]
US 20170064411A1 · Goli et al. · 2017 [cited by applicant]
US 20170193560A1 · Bhalgat · 2017 [cited by applicant]
US 20170278289A1 · Marino · 2017 [cited by applicant]
US 20180349391A1 · Chechik · 2018 [cited by applicant]
US 20190138810A1 · Chen et al. · 2019 [cited by applicant]
US 20190295122A1 · Kumar · 2019 [cited by applicant]
US 20190332865A1 · Dassa · 2019 [cited by applicant]
US 20200160389A1 · Yang · 2020 [cited by examiner]
US 20200242364A1 · Zadeh · 2020 [cited by applicant]
US 20210089780A1 · Chang · 2021 [cited by applicant]
US 20210195286A1 · Lohumi et al. · 2021 [cited by applicant]
US 20220172384A1 · Pereira · 2022 [cited by applicant]
“An overview of computational challenges in online advertising”. IEEE. 2013. (Year: 2013). [cited by examiner]
“A Semantic Framework for Delivery of Context-Aware Ubiquitous Services in Pervasive Environments”. IEEE. 2012. (Year: 2012). [cited by examiner]
“Mediacampaign—A multi modal semantic analysis system for advertisement campaign detection”. IEEE. 2008. (Year: 2008). [cited by applicant]