PARAMETRIC BLIND IMAGE DEBLURRING WITH GRADIENT BASED SPECTRAL KURTOSIS MAXIMIZATION

IF 0.8 4区 计算机科学 Q4 IMAGING SCIENCE & PHOTOGRAPHIC TECHNOLOGY Image Analysis & Stereology Pub Date : 2018-12-06 DOI:10.5566/IAS.1887
Aftab Khan, Hujun Yin
{"title":"PARAMETRIC BLIND IMAGE DEBLURRING WITH GRADIENT BASED SPECTRAL KURTOSIS MAXIMIZATION","authors":"Aftab Khan, Hujun Yin","doi":"10.5566/IAS.1887","DOIUrl":null,"url":null,"abstract":"Blind image deconvolution/deblurring (BID) is a challenging task due to lack of prior information about the blurring process and image. Noise and ringing artefacts resulted during the restoration process further deter fine restoration of the pristine image. These artefacts mainly arise from using a poorly estimated point spread function (PSF) combined with an ineffective restoration filter. This paper presents a BID scheme based on the steepest descent in kurtosis maximization. Assuming uniform blur, the PSF can be modelled by a parametric form. The scheme tries to estimate the blur parameters by maximizing kurtosis of the deblurred image. The scheme is devised to handle any type of blur that can be framed into a parametric form such as Gaussian, motion and out-of-focus. Gradients for the blur parameters are computed and optimized in the direction of increasing kurtosis value using a steepest descent scheme. The algorithms for several common blurs are derived and the effectiveness has been corroborated through a set of experiments. Validation has also been carried out on various real examples. It is shown that the scheme optimizes on the parameters in a close vicinity of the true parameters. Results of both benchmark and real images are presented. Both full-reference and non-reference image quality measures have been used in quantifying the deblurring performance. The results show that the proposed method offers marked improvements over the existing methods.","PeriodicalId":49062,"journal":{"name":"Image Analysis & Stereology","volume":"11 1","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2018-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Image Analysis & Stereology","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.5566/IAS.1887","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"IMAGING SCIENCE & PHOTOGRAPHIC TECHNOLOGY","Score":null,"Total":0}
引用次数: 1

Abstract

Blind image deconvolution/deblurring (BID) is a challenging task due to lack of prior information about the blurring process and image. Noise and ringing artefacts resulted during the restoration process further deter fine restoration of the pristine image. These artefacts mainly arise from using a poorly estimated point spread function (PSF) combined with an ineffective restoration filter. This paper presents a BID scheme based on the steepest descent in kurtosis maximization. Assuming uniform blur, the PSF can be modelled by a parametric form. The scheme tries to estimate the blur parameters by maximizing kurtosis of the deblurred image. The scheme is devised to handle any type of blur that can be framed into a parametric form such as Gaussian, motion and out-of-focus. Gradients for the blur parameters are computed and optimized in the direction of increasing kurtosis value using a steepest descent scheme. The algorithms for several common blurs are derived and the effectiveness has been corroborated through a set of experiments. Validation has also been carried out on various real examples. It is shown that the scheme optimizes on the parameters in a close vicinity of the true parameters. Results of both benchmark and real images are presented. Both full-reference and non-reference image quality measures have been used in quantifying the deblurring performance. The results show that the proposed method offers marked improvements over the existing methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于梯度的光谱峰度最大化参数盲图像去模糊
由于缺乏模糊过程和图像的先验信息,盲图像反卷积/去模糊(BID)是一项具有挑战性的任务。在恢复过程中产生的噪声和振铃伪影进一步阻碍了原始图像的精细恢复。这些伪影主要是由于使用了估计不佳的点扩展函数(PSF)和无效的恢复滤波器。本文提出了一种基于峰度最大化最陡下降的BID方案。假设均匀模糊,可以用参数形式对PSF进行建模。该方案试图通过最大化去模糊图像的峰度来估计模糊参数。该方案的设计是为了处理任何类型的模糊,可以框架成一个参数形式,如高斯,运动和失焦。计算了模糊参数的梯度,并采用最陡下降法沿峰度值增加的方向进行了优化。推导了几种常见模糊的算法,并通过一组实验验证了算法的有效性。并对各种实例进行了验证。结果表明,该方案在接近真实参数的范围内对参数进行了优化。给出了基准图像和真实图像的测试结果。全参考和非参考图像质量度量都被用于量化去模糊性能。结果表明,该方法与现有方法相比有明显改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Image Analysis & Stereology
Image Analysis & Stereology MATERIALS SCIENCE, MULTIDISCIPLINARY-MATHEMATICS, APPLIED
CiteScore
2.00
自引率
0.00%
发文量
7
审稿时长
>12 weeks
期刊介绍: Image Analysis and Stereology is the official journal of the International Society for Stereology & Image Analysis. It promotes the exchange of scientific, technical, organizational and other information on the quantitative analysis of data having a geometrical structure, including stereology, differential geometry, image analysis, image processing, mathematical morphology, stochastic geometry, statistics, pattern recognition, and related topics. The fields of application are not restricted and range from biomedicine, materials sciences and physics to geology and geography.
期刊最新文献
PU-NET DEEP LEARNING ARCHITECTURE FOR GLIOMAS BRAIN TUMOUR SEGMENTATION IN MAGNETIC RESONANCE IMAGES Sample-balanced and IoU-guided anchor-free visual tracking Existence and approximation of densities of chord length- and cross section area distributions IMPROVEMENT PROCEDURE FOR IMAGE SEGMENTATION OF FRUITS AND VEGETABLES BASED ON THE OTSU METHOD. A Completed Multiply Threshold Encoding Pattern for Texture Classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1