{"title":"基于插值的视频摘要优化方案","authors":"N. Doulamis, A. Doulamis, K. Ntalianis","doi":"10.1109/ICME.2002.1035777","DOIUrl":null,"url":null,"abstract":"In this paper, an optimal and efficient algorithm for video summarization is proposed by exploiting temporal variations of video visual content. In particular, the most characteristic frames/shots (key-frames/shots) are extracted by estimating appropriate points on the feature vector curve, which represent in an optimal way the corresponding trajectory. This is performed by minimizing the approximation error of the feature vector curve and the respective curve formed by the estimated points using an interpolation scheme. A genetic algorithm is used for the minimization task, since the complexity of an exhaustive search is too large to be implemented. Furthermore, a fast technique for increasing the number of extracted key-frames/shots is presented.","PeriodicalId":90694,"journal":{"name":"Proceedings. IEEE International Conference on Multimedia and Expo","volume":"13 1","pages":"297-300 vol.1"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An optimal interpolation-based scheme for video summarization\",\"authors\":\"N. Doulamis, A. Doulamis, K. Ntalianis\",\"doi\":\"10.1109/ICME.2002.1035777\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an optimal and efficient algorithm for video summarization is proposed by exploiting temporal variations of video visual content. In particular, the most characteristic frames/shots (key-frames/shots) are extracted by estimating appropriate points on the feature vector curve, which represent in an optimal way the corresponding trajectory. This is performed by minimizing the approximation error of the feature vector curve and the respective curve formed by the estimated points using an interpolation scheme. A genetic algorithm is used for the minimization task, since the complexity of an exhaustive search is too large to be implemented. Furthermore, a fast technique for increasing the number of extracted key-frames/shots is presented.\",\"PeriodicalId\":90694,\"journal\":{\"name\":\"Proceedings. IEEE International Conference on Multimedia and Expo\",\"volume\":\"13 1\",\"pages\":\"297-300 vol.1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE International Conference on Multimedia and Expo\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2002.1035777\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE International Conference on Multimedia and Expo","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2002.1035777","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An optimal interpolation-based scheme for video summarization
In this paper, an optimal and efficient algorithm for video summarization is proposed by exploiting temporal variations of video visual content. In particular, the most characteristic frames/shots (key-frames/shots) are extracted by estimating appropriate points on the feature vector curve, which represent in an optimal way the corresponding trajectory. This is performed by minimizing the approximation error of the feature vector curve and the respective curve formed by the estimated points using an interpolation scheme. A genetic algorithm is used for the minimization task, since the complexity of an exhaustive search is too large to be implemented. Furthermore, a fast technique for increasing the number of extracted key-frames/shots is presented.