检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈玲玲 周旭东[1] 谢傢成 刘乾 CHEN Ling-ling;ZHOU Xu-dong;XIE Jia-cheng;LIU Qian(School of Information Engineering,Yangzhou University,Yangzhou Jiangsu 225127,China)
出 处:《图学学报》2021年第5期762-766,共5页Journal of Graphics
基 金:国家自然科学基金项目(61801417)。
摘 要:针对仿射非局部均值(ANLM)算法对图像去噪过程中出现用时过长的问题,提出了一种快速仿射非局部均值去噪(F-ANLM)算法。通过对算法的研究和用时分析得知,仿射变换和关于仿射不变相似性度量的计算这2个模块占时最多,因此从这2个部分入手提出优化策略。算法首先使用仿射协变结构张量其特征向量的夹角代替尺寸不变特征变换(SIFT)算子的主方向,简化了仿射变换过程;然后将ANLM方法中的仿射不变相似性度量改写为离散卷积的形式,使用快速傅里叶变换减少卷积的运算量,加速仿射协变特征区域之间相似性度量的计算。实验证明,F-ANLM方法简化了仿射变换和仿射不变相似性度量的计算,与原来ANLM算法相比,速度得到很大的提升。To address the problem of high time consumption of the affine non-local mean(ANLM)algorithm in the denoising process,a fast affine non-local mean denoising(F-ANLM)algorithm was proposed.Through time analysis of the affine non-local mean algorithm,it was known that the two modules,the affine transformation and the calculation of the affine invariant similarity measure,were the most time-consuming.Therefore,the optimization strategy was proposed from these tworegards.The algorithm first employed the included angle of the feature vector of the affine covariant structure tensor instead of the main direction of the SIFT operator,and then rewrote the affine invariant similarity measure in the ANLM method into the form of discrete convolution.In addition,the Fast Fourier Transform was adopted to reduce the amount of convolution operation and accelerate the calculation of similarity measures between affine covariant feature regions.Experiments show that the F-ANLM algorithm can simplify the calculation of affine transformation and affine invariant similarity measures,and greatly increase the speed compared with the original ANLM algorithm.
关 键 词:非局部 结构张量 仿射不变 卷积 相似性度量 快速傅里叶
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.129.37