US 11,928,145 B1
Creating a knowledge graph for a video
Yanfeng Shi, Beijing (CN); Hui Gao, Beijing (CN); Yue Chen, Beijing (CN); Yuan Yuan Ding, Shanghai (CN); Hai Jun Xu, Beijing (CN); and Huai Nan Zhou, Beijing (CN)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Dec. 9, 2022, as Appl. No. 18/063,717.
Int. Cl. G06F 3/0481 (2022.01); G06F 3/04842 (2022.01); G06F 16/41 (2019.01); G06F 16/435 (2019.01); G06F 16/45 (2019.01); G06F 16/48 (2019.01); G06V 20/40 (2022.01); G06V 20/62 (2022.01); G06V 30/10 (2022.01); G10L 15/08 (2006.01); G10L 15/22 (2006.01); G10L 25/57 (2013.01); G11B 27/10 (2006.01)
CPC G06F 16/41 (2019.01) [G06F 3/0481 (2013.01); G06F 3/04842 (2013.01); G06F 16/435 (2019.01); G06F 16/45 (2019.01); G06F 16/489 (2019.01); G06V 20/46 (2022.01); G06V 20/635 (2022.01); G06V 30/10 (2022.01); G10L 15/08 (2013.01); G10L 15/22 (2013.01); G10L 25/57 (2013.01); G11B 27/10 (2013.01); G10L 2015/088 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method for creating a knowledge graph of a video, the method comprising:
obtaining the video;
processing the video to extract audio information and video information;
storing the extracted audio information and video information with a timestamp corresponding its occurrence in the video;
creating a plurality of groups of the extracted audio information and video information based at least in part on the timestamps;
extracting two or more keywords from each of the plurality of groups;
identifying a relationship between the two or more keywords based on the extracted audio information and video information; and
creating a graph having a plurality of nodes and a plurality of links that connect a pair of nodes of the plurality of nodes, wherein each of the plurality of nodes corresponds to an extracted keyword and each of the plurality of links corresponds to the identified relationship between the pair of nodes.