{"title":"一种新的基于位图的MPEG视频编码匹配准则","authors":"A. Sharifinejad, H. Mehrpour","doi":"10.1109/ICON.2001.962311","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient matching criterion algorithm, which reduces the computation time. In this algorithm we developed a binary format of a given frame and after integrating the pixels' value in a block; the difference of target block and candidate are taken as the measure of match. This value must be no less than the pre-setup threshold value. It was found that the new algorithm required less computation than any other matching criteria and this was justified by our experimental results using an MPEG encoder.","PeriodicalId":178842,"journal":{"name":"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel bitmap based matching criterion for MPEG video coding\",\"authors\":\"A. Sharifinejad, H. Mehrpour\",\"doi\":\"10.1109/ICON.2001.962311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an efficient matching criterion algorithm, which reduces the computation time. In this algorithm we developed a binary format of a given frame and after integrating the pixels' value in a block; the difference of target block and candidate are taken as the measure of match. This value must be no less than the pre-setup threshold value. It was found that the new algorithm required less computation than any other matching criteria and this was justified by our experimental results using an MPEG encoder.\",\"PeriodicalId\":178842,\"journal\":{\"name\":\"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Ninth IEEE International Conference on Networks, ICON 2001.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2001.962311\",\"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. Ninth IEEE International Conference on Networks, ICON 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2001.962311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel bitmap based matching criterion for MPEG video coding
This paper presents an efficient matching criterion algorithm, which reduces the computation time. In this algorithm we developed a binary format of a given frame and after integrating the pixels' value in a block; the difference of target block and candidate are taken as the measure of match. This value must be no less than the pre-setup threshold value. It was found that the new algorithm required less computation than any other matching criteria and this was justified by our experimental results using an MPEG encoder.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
