快速15x15变换图像和视频编码应用程序

2009 Data Compression Conference Pub Date : 2009-03-16 DOI:10.1109/DCC.2009.81

Y. Reznik, R. Chivukula

{"title":"快速15x15变换图像和视频编码应用程序","authors":"Y. Reznik, R. Chivukula","doi":"10.1109/DCC.2009.81","DOIUrl":null,"url":null,"abstract":"We derive factorization of DCT-II transform of size 15 which requires only 14 multiplications, 67 additions, and 3 multiplications by rational dyadic constants (implementable by shifts). This transform is significantly less complex than DCT-II of nearest dyadic size (16), and we suggest considering it for future image and video coding applications that can benefit from using larger (than 8x8) block sizes.","PeriodicalId":377880,"journal":{"name":"2009 Data Compression Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Fast 15x15 Transform for Image and Video Coding Applications\",\"authors\":\"Y. Reznik, R. Chivukula\",\"doi\":\"10.1109/DCC.2009.81\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We derive factorization of DCT-II transform of size 15 which requires only 14 multiplications, 67 additions, and 3 multiplications by rational dyadic constants (implementable by shifts). This transform is significantly less complex than DCT-II of nearest dyadic size (16), and we suggest considering it for future image and video coding applications that can benefit from using larger (than 8x8) block sizes.\",\"PeriodicalId\":377880,\"journal\":{\"name\":\"2009 Data Compression Conference\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.2009.81\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2009.81","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们推导了大小为15的DCT-II变换的因式分解，它只需要14次乘法，67次加法和3次有理二元常数的乘法(可通过移位实现)。这种变换比最接近二进大小(16)的DCT-II要简单得多，我们建议在未来的图像和视频编码应用中考虑使用它，这些应用可以从使用更大(大于8x8)的块大小中受益。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast 15x15 Transform for Image and Video Coding Applications

We derive factorization of DCT-II transform of size 15 which requires only 14 multiplications, 67 additions, and 3 multiplications by rational dyadic constants (implementable by shifts). This transform is significantly less complex than DCT-II of nearest dyadic size (16), and we suggest considering it for future image and video coding applications that can benefit from using larger (than 8x8) block sizes.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 Data Compression Conference

自引率

0.00%

发文量