IP Library Granted Patent US 12,684,178
Granted Patent B2
US 12,684,178 · App. 18/601,942 · Granted Jul 14, 2026

Video loops and management thereof

Inventor: Rockwell Scharer (Los Angeles, CA)
Assignee: Mediabook, Inc.
H04N21/23109H04H20/106H04N9/75H04N21/23418
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,684,178
App. No.
18/601,942
Filed
Mar 11, 2024
Granted
Jul 14, 2026
Kind
B2
Art Unit
2425
USPC
348/587
Abstract

Systems and methods are configured to identify replacement content within various types of media and to facilitate the use of the identified replacement content in the generation of composited content. The generation of composited content optionally includes Chroma key processes. The content may include video and or multi-dimensional virtual environments. For example, loops of replacement content may be identified within video or time variant virtual environments. These capabilities are optionally facilitated by various artificial intelligence systems, e.g., trained neural networks.

Claims (44)

1 . A media system comprising:

storage configured to store replacement content, or to store indexes to replacement content, the replacement content including video, still images, computer-generated virtual environments, mixed-reality environments or time variant virtual environments;

loop logic configured to identify preferred loops within the replacement content;

search logic configured to search the preferred loops based on received search criteria and tags characterizing the preferred loops;

sharing logic configured to distribute at least one of the preferred loops to client devices;

dynamic splicing logic configured to apply a moving frame divider to at least three video frames, the moving frame divider being configured to separate contributions to a splice of the replacement content from the start and the end of one of the preferred loops; and

a microprocessor configured to execute at least the loop logic, search logic, sharing logic or dynamic splicing logic.

2 . The system of claim 1 , wherein the preferred loops are identified based on a quality of an associated loop point.

3 . The system of claim 1 , further comprising video modification logic configured to edit content to create preferred loops.

4 . The system of claim 1 , further comprising tagging logic configured to generate tags characterizing the replacement content, the tags including scenery descriptions, descriptors of elements within the replacement content, search words, or descriptive information configured for searching for the replacement content.

5 . The system claim 4 , wherein the tagging logic is configured to tag multiple preferred loops within a video or time variant virtual environment.

6 . The system of claim 1 , wherein the search logic is configured to identify the preferred loops based on lengths of the preferred loops.

7 . The system of claim 1 , wherein the loop logic is configured to identify the preferred loops by matching an end and a start of a loop.

8 . The system of claim 1 , wherein the loop logic includes a neural network trained to identify preferred loops within replacement content.

9 . The system of claim 1 , wherein the dynamic splicing logic includes a machine learning system trained to select contributions to the at least three frames from the start and the end of the one of the preferred loops, so as to minimize discontinuities within the splice resulting of objects moving between the at least three frames.

10 . A method of providing a preferred loop including replacement content, the method comprising:

receiving a request for the replacement content the request including one or more search terms;

identifying preferred loops that satisfy the received request based on the one or more search terms;

retrieving at least one of the identified preferred loops; and

delivering the at least one of identified preferred loops to a source of the request, wherein the identified preferred loops are associated with a score representing a loop point quality of the preferred loops.

11 . The method of claim 10 , wherein the request includes a minimum preferred loop score.

12 . The method of claim 10 , further comprising modifying one or more of the preferred loops, the modification including dynamic splicing of the preferred loops.

13 . A method of providing a preferred loop including replacement content, the method comprising:

receiving a request for the replacement content the request including one or more search terms;

identifying preferred loops that satisfy the received request based on the one or more search terms;

retrieving at least one of the identified preferred loops; and

delivering the at least one of identified preferred loops to a source of the request, and using one or more of the preferred loops to generate composited content in a Chroma key process.

14 . The method of claim 13 , further comprising modifying imperfect pixels in a monochromatic matte as captured by a camera and changing the imperfect pixels color to a desired color to produce improved composited content including at least one of the preferred loops.

15 . The method of claim 13 , wherein the at least one of the preferred loops includes or is based on a virtual three-dimensional representation of an environment, the representation varying with time.

16 . The method of claim 13 , wherein the replacement content is generated using a virtual environment.

17 . The method of claim 13 , further comprising generating the replacement content using a trained machine learning system.

18 . The method of claim 13 , further comprising applying a moving frame divider to at least three video frames, the moving frame divider being configured to separate contributions to a splice of the replacement content from the start and the end of one of the preferred loops.

19 . The method of claim 13 , wherein the preferred loops are further identified based on a quality of an associated loop point, identified based on a lack of discontinuities at an associated loop point, identified based on positions of objects within identified based on a realistic transition at a loop point.

20 . The method of claim 13 , wherein the preferred loops are associated with tags configured to identify content or characteristics of the preferred loops.

21 . The method of claim 13 wherein the identified preferred loops are associated with a score representing a loop point quality of the preferred loops.

22 . The system of claim 13 , wherein the preferred loops are identified based on a lack of discontinuities at an associated loop point or identified based on positions of objects within the received content.

23 . The system of claim 1 , wherein the preferred loops are identified based on a realistic transition at a loop point.

24 . The system of claim 1 , wherein the search logic is configured to identify the preferred loops based on lighting characteristics of the replacement content.

25 . The system of claim 1 , wherein the search logic is configured to identify the preferred loops based on quality of a loop points within a preferred loop, the quality of the loop points including a smoothness of a transitions between ends of the preferred loops and starts of the preferred loops.

26 . The method of claim 10 , further comprising modifying one or more of the preferred loops, the modification including adjusting brightness and/or color of the preferred loops, changing resolution of the preferred loops, changing file type of the preferred loops, or matching characteristics of the preferred loops to foreground content.

27 . The method of claim 10 , further comprising modifying one or more of the preferred loops, the modification including matching characteristics of the preferred loops to foreground content.

28 . The method of claim 10 , further comprising generating the replacement content using a trained machine learning system.

29 . The method of claim 13 , further comprising modifying one or more of the preferred loops, the modification including dynamic splicing of the preferred loops.

30 . The method of claim 27 , wherein the modification of one or more of the preferred loops is performed in real-time in response to time varying characteristics of foreground content.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 11, 2025
From: SCHARER, ROCKWELL
To: MEDIABOOK, INC.
Reel/Frame 072222/0234 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 15, 2024
From: DROPKEY, INC.
To: MEDIABOOK, INC.
Reel/Frame 067416/0848 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 10, 2024
From: SCHARER, ROCKWELL L., III
To: DROPKEY, INC.
Reel/Frame 067379/0534 →
Continuity (6)
Continuation In Part PCTUS2022043264 · Sep 12, 2022
Continuation In Part 17752748 · May 24, 2022
Continuation In Part 17707545 · Mar 29, 2022
Provisional Application 63393209 · Jul 28, 2022
Provisional Application 63243057 · Sep 10, 2021
Related Publication 20240406467A1 · Dec 5, 2024
References Cited (28)
US 9230601B2 · Cohen · 2016 [cited by examiner]
US 9894423B1 · Spencer et al. · 2018 [cited by applicant]
US 12222980B2 · Slaney · 2025 [cited by examiner]
US 20060014585A1 · Neogi · 2006 [cited by examiner]
US 20060222076A1 · Ludvig · 2006 [cited by examiner]
US 20090151008A1 · Cohen · 2009 [cited by examiner]
US 20090271821A1 · Zalewski · 2009 [cited by examiner]
US 20100086277A1 · Craner · 2010 [cited by examiner]
US 20100250510A1 · Herberger et al. · 2010 [cited by applicant]
US 20120057850A1 · Klappert · 2012 [cited by examiner]
US 20150181288A1 · Song · 2015 [cited by examiner]
US 20150208023A1 · Boyle · 2015 [cited by examiner]
US 20150350594A1 · Mate · 2015 [cited by examiner]
US 20160173944A1 · Kilar · 2016 [cited by examiner]
US 20160373814A1 · Kellner · 2016 [cited by examiner]
US 20170220209A1 · Bae · 2017 [cited by examiner]
US 20170244908A1 · Flack · 2017 [cited by examiner]
US 20170330363A1 · Song · 2017 [cited by examiner]
US 20180204601A1 · Garrett · 2018 [cited by examiner]
US 20190294825A1 · Frederick · 2019 [cited by examiner]
US 20200090632A1 · Rein et al. · 2020 [cited by applicant]
US 20210185376A1 · Waterman · 2021 [cited by examiner]
US 20210368222A1 · Stelmar Netto · 2021 [cited by examiner]
US 20220044459A1 · Zacharia · 2022 [cited by examiner]
US 20220174358A1 · Zavesky · 2022 [cited by examiner]
US 20220264180A1 · Brannon · 2022 [cited by examiner]
US 20240045904A1 · Tiwari · 2024 [cited by examiner]
International Search Report and Written Opinion issued in relate PCT Application No. PCT/US2022/043264, mailed Jan. 9, 2023, 11 pages. [cited by applicant]