Grounding flow graphs in signals
AssigneeSamsung Electronics Co., Ltd.
InventorsMikita Dvornik, Isma Hadji, Allan Douglas Jepson
Life of this patent
Estimating the term…
Abstract
A first graph which is a flow graph is converted into a second graph using a first algorithm. The second graph, combined with a second algorithm using a dynamic programming recursion, is compared with a video and a best matching thread, with respect to the video, is found through the second graph. The best matching thread may then be used for a user-assistance function. The dynamic programming recursion reduces computational effort needed by the computer performing the matching.
Claims18
An apparatus comprising:
- one or more processors;
- and
- one or more memories storing instructions, wherein an execution by the one or more processors of the instructions is configured to cause the apparatus to:
- obtain a second graph, wherein the second graph is formed from a first graph, wherein the first graph is a flow graph and the second graph encodes topological sorts of the first graph;
- align the second graph to a video, wherein the aligning obtains a start time and an end time of an event in the video;
- and
- perform a user-assistance function based on the start time and the end time of the event.
A non-transitory computer readable medium storing instructions for execution by a computer, wherein the execution by the computer of the instructions is configured to cause the computer to:
- obtain a second graph, wherein the second graph is formed from a first graph, wherein the first graph is a flow graph and the second graph encodes topological sorts of the first graph;
- align the second graph to a video, wherein the aligning obtains a start time and an end time of an event in the video;
- and
- perform a user-assistance function based on the start time and the end time of the event.
Dependencies are inferred from the claim text.