%0 Journal Article
%T THE EVOLVING GENERATION AND FAST ALGORITHMS OF SLANT TRANSFORM<br>斜变换ST的演化生成与快速算法
%A Shi Baochang
%A Wang Nengchao
%A <br>施保昌
%A 王能超
%J 计算数学
%D 2000
%I 
%X The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe two basic design techniques: copy and mutation, respectively. Then the relations between the four ordered slant transform matrices and the Walsh transform matrices, and on this basis, various fast algorithms for slant transform can be obtained. Here two fast algorithms for slant transform with bit-reversed Walsh order are given.
%K Slant transform
%K ordering
%K bisection evolution pattern
%K copy
%K mutation
%K fast algorithm<br>二分演化模式
%K 复制技术
%K 变异技术
%K 快速算法
%K 图像处理
%K WALSH变换
%K 斜变换ST
%K 演化生成
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=DC9E5D1C4134573A&yid=9806D0D4EAA9BED3&vid=BC12EA701C895178&iid=E158A972A605785F&sid=B40AD8FE6FA88DE9&eid=A6683C8C0EB9BCA7&journal_id=0254-7791&journal_name=计算数学&referenced_num=9&reference_num=14