• 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.

• Journal of KIISE:Software and Applications
• /
• v.33 no.10
• /
• pp.862-867
• /
• 2006

To restore image degraded by blur and additive noise in the optical and electrical system, a regularized iterative restoration is used. A regularization operator is usually applied to all over the image without considering the local characteristics of image in conventional method. As a result, ringing artifacts appear in edge regions and the noise is amplified in flat regions. To solve these problems we propose an adaptive regularization iterative restoration considering the characteristic of edge and flat regions using directional regularization operator. Experimental results show that the proposed method suppresses the noise amplification in flat regions, and restores the edge more sharply in edge regions.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.489-492
• /
• 2003

In this paper, we propose an iterative mixed norm image restoration algorithm using multi regularization parameters. A functional which combines the regularized l$_2$ norm functional and the regularized l$_4$ functional is proposed. The smoothness of each functional is determined by the regularization parameters. Also, a regularization parameter is used to determine the relative importance between the regularized l$_2$ functional and the regularized l$_4$ functional. An iterative algorithm is utilized for obtaining a solution and its convergence is analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11C
• /
• pp.1073-1078
• /
• 2007

In this paper, we propose an iterative mixed norm image restoration algorithm using multi regularization parameters. A functional which combines the regularized $l_2$ norm functional and the regularized $l_4$ norm functional is proposed to efficiently remove arbitrary noise. The smoothness of each functional is determined by the regularization parameters. Also, a regularization parameter is used to determine the relative importance between the regularized $l_2$ norm functional and the regularized $l_4$ norm functional using kurtosis. An iterative algorithm is utilized for obtaining a solution and its convergence is analyzed. Experimental results demonstrate the capability of the proposed algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.107-112
• /
• 1997

This paper proposes the regularized constrained iterative image restoration algorithms which apply new space-adaptive methods to degraded image signals, and analyzes the convergence condition of the proposed algorithm. First, we introduce space-adaptive regularization operators which change according to edge characteristics of local images in order to effectively prevent the restored edges and boundaries from reblurring. And, pseudo projection operator is used to reduce the ringing artifact which results from extensive amplification of noise components in the restoration process. The analysed algorithm is stable convergent to the fixed point. According to the experimental results for various signal-to-noise ratios(SNR) and blur models, the proposed algorithms other methods and is robust to noise effects and edge reblurring by regularization especially.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9B
• /
• pp.1588-1595
• /
• 2000

To restore image degraded by out-of-focus blur and additivie noise a regularized iterative restoration is used. In concentional method, regularization is usually applied to all over the image without considering the local characteristics of image. As a result, ringing artifacts appear in edge regions and the noise amplification is introduced in flat regions. To solve this problem we propose an adaptive regularization iterative restoration using directional regularization operator considering edges in four directions and the regularization operator with on direction for flat regions. We verified that the proposed method show better results in the suppression of the noise amplification in flat regions, and introduced less ringing artifacts in edge regions. As a result it showed visually better image and improved better ISNR further than the conventional methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.965-970
• /
• 2010

In this paper, a iterative image restoration method is proposed to restore for noisy-blurred images. In conventional method, regularization is usually applied to all over the without considering the local characteristics of image. As a result, ringing artifacts appear in edge regions and the noise amplification is introduced in flat regions. To solvethis problem we proposed an adaptive regularization iterative restoration using directional regularization operator considering edges in four directions and the regularization operator with no direction for flat regions. We verified that the proposed methods showed better results in the suppression of the noise amplification in flat regions, and introduced less ringing artifacts in edge regions. As a result it showed visually better image and improved better ISNR further than the conventional methods.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1251-1258
• /
• 2015

We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.

• Journal of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.719-734
• /
• 2018

An image restoration problem with Poisson noise arises in many applications of medical imaging, astronomy, and microscopy. To overcome ill-posedness, Total Variation (TV) model is commonly used owing to edge preserving property. Since staircase artifacts are observed in restored smooth regions, higher-order TV regularization is introduced. However, sharpness of edges in the image is also attenuated. To compromise benefits of TV and higher-order TV, the weighted sum of the non-convex TV and non-convex higher order TV is used as a regularizer in the proposed variational model. The proposed model is non-convex and non-smooth, and so it is very challenging to solve the model. We propose an iterative reweighted algorithm with the proximal linearized alternating direction method of multipliers to solve the proposed model and study convergence properties of the algorithm.

• 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.