• Communications for Statistical Applications and Methods
• /
• v.19 no.2
• /
• pp.225-235
• /
• 2012

Noise reduction is an important issue in the field of image processing because image noise worsens the quality of the input image. The basic difficulty is that the noise and the signal are not easy to distinguish. Simple moothing is one of the most basic and important procedures to remove the noise, however, it does not consider the level of noise. This method effectively reduces the noise but the feature area is simultaneously blurred. This paper considers the block approach to detect noise and image features of the input image so that noise reduction could be adaptively applied. Simulation results show that the proposed algorithm improves the overall quality of the image by removing the noise according to the noise level.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.164-165
• /
• 1979

Two dimensional kernels which reconstruct the tomographic image from the blurred one formed by simple back-projection are investigated and their performances are compared. These kernels are derived from tile point spread function of the tomographic system and have the form of a ramp filter modified by several window functions to suppress ringing in the reconstruction. Computer simulation using a computer generated phantom image data with different correction functions(kernels) has been carried out. In this simulation, filtering in frequency domain by 2-D FFT technique or in space domain by 2-D direct convolution is considered. It is found that the-computation time required for real space convolution technique is much larger than that of Fourier 2-D filtering technique in the pratical situation.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.353-363
• /
• 2013

A variant of the global conjugate gradient method for solving general linear systems with multiple right-hand sides is proposed. This method is called as the global conjugate gradient linear least squares (Gl-CGLS) method since it is based on the conjugate gradient least squares method(CGLS). We present how this method can be implemented for the image deblurring problems with Neumann boundary conditions. Numerical experiments are tested on some blurred images for the purpose of comparing the computational efficiencies of Gl-CGLS with CGLS and Gl-LSQR. The results show that Gl-CGLS method is numerically more efficient than others for the ill-posed problems.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.825-826
• /
• 2008

Focusing is the principal factor that decides the image quality. In the low illuminance condition, captured images with a digital camera usually blurred because the autofocus system of the camera fail to detect the in-focus position. The failure of focusing is due to thermal noise in the captured image. In this paper, we propose a new focus detection algorithm. The proposed algorithm use the new focusing index which is weighted sum of the high-frequency energy and mid-frequency energy. The weight is determined by the local variance of the image. The proposed algorithm performs stable focusing detection with in the low illuminance condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.91-99
• /
• 1994

We proposed the regularized iterative restoration method considering relaxation parameter and regularization paramenter in order to restore the noisy motion-blurred images. We used (i-H) as a regularization operator and these two kinds of constraints were applied while conventional regularization iterative restoration method proposed by Jan Biemond et al used the 2-D Laplacian filter and a predetermined regularization parameter value and relaxation parameter to 1. Through the experimental results, we showed better results compared with those by a conventional method and or regularized iterative restoration method just considering only a regularization parameter. These two kinds of constratints have good effects when applied into the regularized iterative restoration method for noisy motion-blurred images.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.10 s.113
• /
• pp.913-919
• /
• 2006

This paper presents a technique for motion compensation of ISAR(Inverse SAR) images for a moving target. If a simple fourier transform is employed to obtain ISAR image for a moving target, the image is usually blurred. These images blurring problem can be solved with the time-frequency transform. In this paper, motion compensation algorithms of ISAR image such as STFT(Short Time Fourier Transform), GWT(Gabor Wavelet Transform) are described. In order to show the performances of each algorithm, we use scattering wave of the ideal point scatterers and simulated MIG-25 to obtain motion compensated ISAR image, and display the resolution of STFT and GWT ISAR image.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.6
• /
• pp.75-80
• /
• 1983

When an image with spot noise is smoothed by smoothing filters, the noise is almost eliminated However, the image is blurred. The algorithm that reduces such an image blurring is proposed in this paper. In the algorithm, the difference between noisy image and median filtered noisy image is smoothed. As the re-smoothing method, the absolute value of the difference is median filtered and the sign of the difference is affixed on the result. It is shown that the proposed algorithm is quite effective for noise elimination and also for image blurring decrease at the same time. In this paper, the algorithm is compared with the other smoothing methods.

• Nuclear Engineering and Technology
• /
• v.53 no.7
• /
• pp.2371-2376
• /
• 2021

As the γ-ray energy increases, a reconstructed image becomes noisy and blurred due to the penetration of the γ-ray through the coded mask. Therefore, the thickness of the coded mask was increased for high energy regions, resulting in severely decreased the performance of the detection efficiency due to self-collimation by the mask. In order to overcome the limitation, a modified uniformly redundant array γ-ray imaging system using dual anti-mask method was developed, and its performance was compared and evaluated in high-energy radiation region. In the dual anti-mask method, the two shadow images, including the subtraction of background events, can simultaneously contribute to the reconstructed image. Moreover, the reconstructed images using each shadow image were integrated using a hybrid update maximum likelihood expectation maximization (h-MLEM). Using the quantitative evaluation method, the performance of the dual anti-mask method was compared with the previously developed collimation methods. As the shadow image which was subtracted the background events leads to a higher-quality reconstructed image, the reconstructed image of the dual anti-mask method showed high performance among the three collimation methods. Finally, the quantitative evaluation method proves that the performance of the dual anti-mask method was better than that of the previously reconstruction methods.

• 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 Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.320-328
• /
• 1999

The Laplacian operator is usually used as a regularization operator which may be used as any differential operator in the regularization iterative restoration. In this paper, several kinds of differential operator and 1-H operator that has been used in our lab as well, as a regularization operator, were compared with each other. In the restoration of noisy motion-blurred images, 1-H operator worked better than Laplacian operator in flat region, but in the edge the Laplacian operator operated better. For noisy gaussian-blurred image, 1-H operator worked better in the edge, while in flat region the Laplacian operator resulted better. In regularization, smoothing the noise and resorting the edges should be considered at the same time, so the regions divided into the flat, the middle, and the detailed, which were processed in separate and compared their MSE. Laplacian and 1-H operator showed to be suitable as the regularization operator, while the other differential operators appeared to be diverged as iterations proceeded.