A Fast FFT-Based Iterative Algorithm for Image Deblurring With Anti-Reflective Boundary Conditions

DOI

10.2991/ncce-18.2018.68How to use a DOI?

Keywords

PSFs; FFT; Anti-Reflective

Abstract

In this paper we consider the image deploring problem with space invariant PSFs under anti-reflecting boundary conditions. Under the assumption that PSFs are strongly symmetric and boundary values of image are homogeneous, the image deploring problem is transformed to the circular DE convolution problem by odd periodic extension. A fast Landseer iterative algorithm based on the FFT is pro- posed for the 1D and 2D DE convolution problem. In case boundary values of image are nonhomogeneous, due to the anti-reflecting boundary conditions, the bound- ray values of image can be restored by solving a 1D problem, then the boundary values of image can be homogeneous by subtracting a term related with the re- stored boundary values. If PSFs are not strongly symmetric, the image deploring problem can be transformed to one with strongly symmetric PSFs by re-blurring approach. Numerical experiments show that the efficiency of our algorithm is fast and effective

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xun Chen
AU  - Qi Zhu
PY  - 2018/05
DA  - 2018/05
TI  - A Fast FFT-Based Iterative Algorithm for Image Deblurring With Anti-Reflective Boundary Conditions
BT  - Proceedings of the 2018 International Conference on Network, Communication, Computer Engineering (NCCE 2018)
PB  - Atlantis Press
SP  - 431
EP  - 441
SN  - 1951-6851
UR  - https://doi.org/10.2991/ncce-18.2018.68
DO  - 10.2991/ncce-18.2018.68
ID  - Chen2018/05
ER  -