Samsung Electronics Co., Ltd.

Isma Hadji

Allan Jepson

Mikita Andreevich Dvornik

Konstantinos Derpanis

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.

Grounding flow graphs in signals

A method is provided. The method includes receiving a first signal and a second signal, generating a first sequence based on the first signal by embedding at least one feature in the first signal, generating a second sequence based on the second signal by embedding at least one feature in the second signal, determining a minimum cost path of aligning the first sequence with the second sequence based on the embedded at least one feature in the first sequence and the embedded at least one feature in the second sequence, and aligning the first sequence with second sequence based on the determined minimum cost path.

Growing community of inventors

Toronto, Canada

Isma Hadji