{"title":"视频编码器中运动估计的计算复杂度管理","authors":"Yafan Zhao, I. Richardson","doi":"10.1109/DCC.2002.1000026","DOIUrl":null,"url":null,"abstract":"Summary form only given. The performance of software-only video codecs is often constrained by available processing power. Existing fast motion estimation algorithms are not designed to provide flexible, predictable control of computational complexity. We propose an adaptive algorithm, which maintains the computational complexity of the motion estimation function at various target levels by controlling the motion estimation search pattern.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Computational complexity management of motion estimation in video encoders\",\"authors\":\"Yafan Zhao, I. Richardson\",\"doi\":\"10.1109/DCC.2002.1000026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. The performance of software-only video codecs is often constrained by available processing power. Existing fast motion estimation algorithms are not designed to provide flexible, predictable control of computational complexity. We propose an adaptive algorithm, which maintains the computational complexity of the motion estimation function at various target levels by controlling the motion estimation search pattern.\",\"PeriodicalId\":420897,\"journal\":{\"name\":\"Proceedings DCC 2002. Data Compression Conference\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC 2002. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2002.1000026\",\"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 DCC 2002. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2002.1000026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computational complexity management of motion estimation in video encoders
Summary form only given. The performance of software-only video codecs is often constrained by available processing power. Existing fast motion estimation algorithms are not designed to provide flexible, predictable control of computational complexity. We propose an adaptive algorithm, which maintains the computational complexity of the motion estimation function at various target levels by controlling the motion estimation search pattern.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
