• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.855-870
• /
• 2019

In this paper, an adaptive iterative algorithm is proposed for motion deblurring by using the salient intensity prior. Based on the observation that the salient intensity of the clear image is sparse, and the salient intensity of the blurred image is less sparse during the image blurring process. The salient intensity prior is proposed to enforce the sparsity of the distribution of the saliency in the latent image, which guides the blind deblurring in various scenarios. Furthermore, an adaptive iteration strategy is proposed to adjust the number of iterations by evaluating the performance of the latent image and the similarity of the estimated blur kernel. The negative influence of overabundant iterations in each scale is effectively restrained in this way. Experiments on publicly available image deblurring datasets demonstrate that the proposed algorithm achieves state-of-the-art deblurring results with small computational costs.

• Journal of The Korean Association of Information Education
• /
• v.15 no.3
• /
• pp.517-524
• /
• 2011

This paper presents a fast blind deconvolution method that produces a deblurring result from a single image in only a few seconds. The high speed of our method is enabled by considering the Discrete Fourier Transform (DFT), and its relation to filtering and convolution, and fast computation of Moore-Penrose inverse matrix. How can we predict the behavior of an arbitrary filter, or even more to the point design a filter to achieve certain specifications. The idea is to study the frequency response of the filter. This concept leads to an useful convolution formula. A Matlab implementation of our method usually takes less than one minute to deblur an image of moderate size, while the deblurring quality is comparable.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.7
• /
• pp.1290-1294
• /
• 2008

We present a novel deblurring algorithm for bi-level images blurred by some parameterizable point spread function. The proposed method iteratively searches unknown parameters in the point spread function and noise-to-signal ratio by minimizing an objective function that is based on the binariness and the difference between two intensity values of restoring image. In simulations and experiments, the proposed method showed improved performance compared with the Wiener filtering based method in terms of bit error rate after segmentation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2366-2395
• /
• 2018

Multi-view super-resolution (MVSR) refers to the process of reconstructing a high-resolution (HR) image from a set of low-resolution (LR) images captured from different viewpoints typically by different cameras. These multi-view images are usually obtained by a camera array. In our previous work [1], we super-resolved multi-view LR images via image fusion (IF) and blind deblurring (BD). In this paper, we present a new MVSR method that jointly realizes IF and BD based on an integrated energy function optimization. First, we reformulate the MVSR problem into a multi-channel blind deblurring (MCBD) problem which is easier to be solved than the former. Then the depth map of the desired HR image is calculated. Finally, we solve the MCBD problem, in which the optimization problems with respect to the desired HR image and with respect to the unknown blur are efficiently addressed by the alternating direction method of multipliers (ADMM). Experiments on the Multi-view Image Database of the University of Tsukuba and images captured by our own camera array system demonstrate the effectiveness of the proposed method.

• Journal of radiological science and technology
• /
• v.45 no.2
• /
• pp.145-150
• /
• 2022

The main purpose of this work was to restore the blurry chest CT images by applying a blind deconvolution algorithm. In general, image restoration is the procedure of improving the degraded image to get the true or original image. In this regard, we focused on a blind deblurring approach with chest CT imaging by using digital image processing in MATLAB, which the blind deconvolution technique performed without any whole knowledge or information as to the fundamental point spread function (PSF). For our approach, we acquired 30 chest CT images from the public source and applied three type's PSFs for finding the true image and the original PSF. The observed image might be convolved with an isotropic gaussian PSF or motion blurring PSF and the original image. The PSFs are assumed as a black box, hence restoring the image is called blind deconvolution. For the 30 iteration times, we analyzed diverse sizes of the PSF and tried to approximate the true PSF and the original image. For improving the ringing effect, we employed the weighted function by using the sobel filter. The results was compared with the three criteria including mean squared error (MSE), root mean squared error (RMSE) and peak signal-to-noise ratio (PSNR), which all values of the optimal-sized image outperformed those that the other reconstructed two-sized images. Therefore, we improved the blurring chest CT image by using the blind deconvolutin algorithm for optimal approach.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5129-5152
• /
• 2016

Multi-view super-resolution (MVSR) aims to estimate a high-resolution (HR) image from a set of low-resolution (LR) images that are captured from different viewpoints (typically by different cameras). MVSR is usually applied in camera array imaging. Given that MVSR is an ill-posed problem and is typically computationally costly, we super-resolve multi-view LR images of the original scene via image fusion (IF) and blind deblurring (BD). First, we reformulate the MVSR problem into two easier problems: an IF problem and a BD problem. We further solve the IF problem on the premise of calculating the depth map of the desired image ahead, and then solve the BD problem, in which the optimization problems with respect to the desired image and with respect to the unknown blur are efficiently addressed by the alternating direction method of multipliers (ADMM). Our approach bridges the gap between MVSR and BD, taking advantages of existing BD methods to address MVSR. Thus, this approach is appropriate for camera array imaging because the blur kernel is typically unknown in practice. Corresponding experimental results using real and synthetic images demonstrate the effectiveness of the proposed method.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.6
• /
• pp.413-421
• /
• 2015

Regularized Blind Deconvolution is a problem applicable in degraded images in order to bring the original image out of blur. Multichannel blind Deconvolution considered as an optimization problem. Each step in the optimization is considered as variable splitting problem using an algorithm called Alternating Minimization Algorithm. Each Step in the Variable splitting undergoes Augmented Lagrangian method (ALM) / Bregman Iterative method. Regularization is used where an ill posed problem converted into a well posed problem. Two well known regularizers are Tikhonov class and Total Variation (TV) / L2 model. TV can be isotropic and anisotropic, where isotropic for L2 norm and anisotropic for L1 norm. Based on many probabilistic model and Fourier Transforms Image deblurring can be solved. Here in this paper to improve the performance, we have used an adaptive regularization filtering and isotropic TV model Lp norm. Image deblurring is applicable in the areas such as medical image sensing, astrophotography, traffic signal monitoring, remote sensors, case investigation and even images that are taken using a digital camera / mobile cameras.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.27-33
• /
• 2009

We propose an efficient method for single image motion deblurring using edge prediction. Previous methods for motion deblurring from a single image have been based on total variation or natural image statistics. In contrast, our method predicts sharp edges by applying bilateral and shock filters and manipulating image gradients directly, and estimates motion blur using the predicted sharp edges. Sharp edge prediction makes our method possible to deblur efficiently with less computation. Results show that our method can effectively and efficiently restore images degraded by large complex motion blur.

• Nuclear Engineering and Technology
• /
• v.55 no.12
• /
• pp.4591-4596
• /
• 2023

Single-photon emission computed tomography SPECT image reconstruction methods have a significant influence on image quality, with filtered back projection (FBP) and ordered subset expectation maximization (OSEM) being the most commonly used methods. In this study, we proposed newly-designed adaptive non-blind deconvolution with a structural similarity (SSIM) index that can take advantage of the FBP and OSEM image reconstruction methods. After acquiring brain SPECT images, the proposed image was obtained using an algorithm that applied the SSIM metric, defined by predicting the distribution and amount of blurring. As a result of the contrast to noise ratio (CNR) and coefficient of variation evaluation (COV), the resulting image of the proposed algorithm showed a similar trend in spatial resolution to that of FBP, while obtaining values similar to those of OSEM. In addition, we confirmed that the CNR and COV values of the proposed algorithm improved by approximately 1.69 and 1.59 times, respectively, compared with those of the algorithm involving an inappropriate deblurring process. To summarize, we proposed a new type of algorithm that combines the advantages of SPECT image reconstruction techniques and is expected to be applicable in various fields.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.1
• /
• pp.43-48
• /
• 2014

Usually, image deconvolution is applied as a preprocessing step in surveillance systems to reduce the effect of motion or out-of-focus blur problem. In this paper, we propose a blind-image deconvolution filtering approach based on genetic programming (GP). A numerical expression is developed using GP process for image restoration which optimally combines and exploits dependencies among features of the blurred image. In order to develop such function, first, a set of feature vectors is formed by considering a small neighborhood around each pixel. At second stage, the estimator is trained and developed through GP process that automatically selects and combines the useful feature information under a fitness criterion. The developed function is then applied to estimate the image pixel intensity of the degraded image. The performance of developed function is estimated using various degraded image sequences. Our comparative analysis highlights the effectiveness of the proposed filter.