Zenilton K. G. Patrocínio, S. Guimarães, H. B. D. Paula
{"title":"视频片段定位的二部图匹配","authors":"Zenilton K. G. Patrocínio, S. Guimarães, H. B. D. Paula","doi":"10.1109/SIBGRAPI.2007.35","DOIUrl":null,"url":null,"abstract":"Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.","PeriodicalId":434632,"journal":{"name":"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Bipartite graph matching for video clip localization\",\"authors\":\"Zenilton K. G. Patrocínio, S. Guimarães, H. B. D. Paula\",\"doi\":\"10.1109/SIBGRAPI.2007.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.\",\"PeriodicalId\":434632,\"journal\":{\"name\":\"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBGRAPI.2007.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI.2007.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bipartite graph matching for video clip localization
Video clip localization consists in identifying real positions of a specific video clip in a video stream. To cope with this problem, we propose a new approach considering the maximum cardinality matching of a bipartite graph to measure video clip similarity with a target video stream which has not been prep recessed. We show that our approach locates edited video clips, but it does not deal with insertion and removal of frames/shots, allowing only changes in the temporal order of frames/shots. All experiments performed in this work have achieved 100% of precision for two different video datasets. And according to those experiments, our method can achieve a global recall rate of 90%.