首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Fast Algorithm for Best Anisotropic Walsh Bases and Relatives
Abstract:We introduce a new family of Nlog Nbest basis search algorithms for functions of more than one variable. These algorithms search the collection of anisotropic wavelet packet and cosine packet bases and output a minimum entropy basis for a given function. These algorithms are constructed after treating the model problem of computing best Walsh packet bases. Several intermediate algorithms for conducting mixed isotropic/anisotropic best basis searches in the function's various coordinate directions are also presented.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号