https://scholars.lib.ntu.edu.tw/handle/123456789/123870
標題: | Fast Algorithms for Short Prime Length Fast Biased Polynomial Transform | 作者: | Wu, Ja-Ling Huang, Y.M. Hsu, S.H. |
公開日期: | 1988 | 起(迄)頁: | - | 來源出版物: | Telecom'88 | 摘要: | In the paper, fast algorithms for three short prime length fast biased polynomial transforms are presented, based on the strategy of the minimum number of rotations. These algorithms are of practical use in digital image processing. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0025404316&doi=10.1049%2fip-e.1990.0014&partnerID=40&md5=2bb539fe7e4efabdec6d8edc3337c53e | DOI: | 10.1049/ip-e.1990.0014 | SDG/關鍵字: | Image processing; Mathematical Techniques - Matrix Algebra; Mathematical transformations; Digital Image Processing; Fast Algorithms; Fast Biased Polynomial Transforms (FBPT); Polynomial Transforms; Computer programming |
顯示於: | 資訊網路與多媒體研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。