{"title":"基于素数有限域的图像滤波新三角变换","authors":"J. Bandeira, R.M.C. de Souza","doi":"10.1109/ITS.2006.4433235","DOIUrl":null,"url":null,"abstract":"This paper introduces a complete family of trigonometric transforms over prime finite fields (FFTTs). Eight cosine transforms and eight sine transforms are defined, denoted FFCT and FFST, respectively. The property of symmetric convolution for these new tools is introduced. It is shown that the use of this operation, together with the development of fast algorithms, allows efficient computation of linear convolutions via FFTTs. A discussion concerning application of these transforms in the field of digital image processing is presented.","PeriodicalId":271294,"journal":{"name":"2006 International Telecommunications Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"New trigonometric transforms over prime finite fields for image filtering\",\"authors\":\"J. Bandeira, R.M.C. de Souza\",\"doi\":\"10.1109/ITS.2006.4433235\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a complete family of trigonometric transforms over prime finite fields (FFTTs). Eight cosine transforms and eight sine transforms are defined, denoted FFCT and FFST, respectively. The property of symmetric convolution for these new tools is introduced. It is shown that the use of this operation, together with the development of fast algorithms, allows efficient computation of linear convolutions via FFTTs. A discussion concerning application of these transforms in the field of digital image processing is presented.\",\"PeriodicalId\":271294,\"journal\":{\"name\":\"2006 International Telecommunications Symposium\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Telecommunications Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITS.2006.4433235\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Telecommunications Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITS.2006.4433235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New trigonometric transforms over prime finite fields for image filtering
This paper introduces a complete family of trigonometric transforms over prime finite fields (FFTTs). Eight cosine transforms and eight sine transforms are defined, denoted FFCT and FFST, respectively. The property of symmetric convolution for these new tools is introduced. It is shown that the use of this operation, together with the development of fast algorithms, allows efficient computation of linear convolutions via FFTTs. A discussion concerning application of these transforms in the field of digital image processing is presented.