## Abstract The fundamental problem of denoising and deblurring images is addressed in this study. The great difficulty in this task is due to the ill‐posedness of the problem. We analyze multi‐channel images to gain robustness and regularize the process by the Polyakov action, which provides an an
Simultaneous total variation image inpainting and blind deconvolution
✍ Scribed by Tony F. Chan; Andy M. Yip; Frederick E. Park
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 476 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0899-9457
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We propose a total variation based model for simultaneous image inpainting and blind deconvolution. We demonstrate that the tasks are inherently coupled together and that solving them individually will lead to poor results. The main advantages of our model are that (i) boundary conditions for deconvolution required near the interface between observed and occluded regions are naturally generated through inpainting; (ii) inpainting results are enhanced through deconvolution (as opposed to inpainting blurry images). As a result, ringing effects due to imposing improper boundary conditions and errors due to imperfection of inpainting blurry images are reduced. Moreover, our model can also be used to generate boundary conditions for regular deconvolution problems that yields better results than previous methods.© 2005 Wiley Periodicals, Inc. © 2005 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 15, 92–102, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.20041
📜 SIMILAR VOLUMES
## Abstract This paper presents an adaptive autoregressive (AR) approach to the blind image deconvolution problem which has several advantages over standard adaptive FIR filters. There is no need to figure out the optimum filter support when using an AR deconvolution filter because it is the same a
## Abstract The reconstruction of artifact‐free images from radially encoded MRI acquisitions poses a difficult task for undersampled data sets, that is for a much lower number of spokes in k‐space than data samples per spoke. Here, we developed an iterative reconstruction method for undersampled r