位置:成果数据库 > 期刊 > 期刊详情页
Fast Non-Local Means Algorithm Based onKrawtchouk Moments
  • ISSN号:1006-4982
  • 期刊名称:《天津大学学报:英文版》
  • 时间:0
  • 分类:G4[文化科学—教育学;文化科学—教育技术学]
  • 作者机构:[1]College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics,, Nanjing 210016, China, [2]State Key Laboratory of Marine Geology, Tongji University, Shanghai 200092, China, [3]State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation, Southwest Petroleum University,, Chengdu 610500, China, [4]Jiangsu Key Laboratory of Quality Control and Further Processing of Cereals and Oils,, Nanjing University of Finance Economics, Nanjing 210046, China
  • 相关基金:Supported by the Open Fund of State Key Laboratory of Marine Geology,Tongji University(No.MGK1412);Open Fund(No.PLN1303)of State Key Laboratory of Oil and Gas Reservoir Geology and Exploitation(Southwest Petroleum University);Open Fund of Jiangsu Key Laboratory of Quality Control and Further Processing of Cereals and Oils,Nanjing University of Finance Economics(No.LYPK201304);Foundation of Graduate Innovation Center in NUAA(No.kfjj201430);Fundamental Research Funds for the Central Universities
中文摘要:

Non-local means (NLM)method is a state-of-the-art denoising algorithm, which replaces each pixel with aweighted average of all the pixels in the image. However, the huge computational complexity makes it impractical forreal applications. Thus, a fast non-local means algorithm based on Krawtchouk moments is proposed to improve thedenoising performance and reduce the computing time. Krawtchouk moments of each image patch are calculated andused in the subsequent similarity measure in order to perform a weighted averaging. Instead of computing the Euclideandistance of two image patches, the similarity measure is obtained by low-order Krawtchouk moments, which canreduce a lot of computational complexity. Since Krawtchouk moments can extract local features and have a good antinoiseability, they can classify the useful information out of noise and provide an accurate similarity measure. Detailedexperiments demonstrate that the proposed method outperforms the original NLM method and other moment-basedmethods according to a comprehensive consideration on subjective visual quality, method noise, peak signal to noiseratio (PSNR), structural similarity (SSIM) index and computing time. Most importantly, the proposed method isaround 35 times faster than the original NLM method.

英文摘要:

Non-local means (NLM) method is a state-of-the-art denoising algorithm, which replaces each pixel with a weighted average of all the pixels in the image. However, the huge computational complexity makes it impractical for real applications. Thus, a fast non-local means algorithm based on Krawtchouk moments is proposed to improve the denoising performance and reduce the computing time. Krawtchouk moments of each image patch are calculated and used in the subsequent similarity measure in order to perform a weighted averaging. Instead of computing the Euclidean distance of two image patches, the similarity measure is obtained by low-order Krawtchouk moments, which can reduce a lot of computational complexity. Since Krawtchouk moments can extract local features and have a good antinoise ability, they can classify the useful information out of noise and provide an accurate similarity measure. Detailed experiments demonstrate that the proposed method outperforms the original NLM method and other moment-based methods according to a comprehensive consideration on subjective visual quality, method noise, peak signal to noise ratio (PSNR), structural similarity (SSIM) index and computing time. Most importantly, the proposed method is around 35 times faster than the original NLM method.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《天津大学学报:英文版》
  • 主管单位:中华人民共和国教育部
  • 主办单位:天津大学
  • 主编:龚克
  • 地址:天津市南开区卫津路92号天津大学第19教学桉东配楼
  • 邮编:300072
  • 邮箱:trans@tju.edu.cn
  • 电话:022-27400281
  • 国际标准刊号:ISSN:1006-4982
  • 国内统一刊号:ISSN:12-1248/T
  • 邮发代号:6-128
  • 获奖情况:
  • 天津市一级期刊,被国内外十余家检索机构收录
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国化学文摘(网络版),荷兰文摘与引文数据库,美国工程索引,英国英国皇家化学学会文摘
  • 被引量:153