• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• Progress in Medical Physics
• /
• v.23 no.4
• /
• pp.252-260
• /
• 2012

The reduction of radiation dose from x-ray is a main concern in computed tomography (CT) imaging due to the side-effect of the dose on human body. Recently, the various methods for dose reduction have been studied in CT and one of the method is a iterative reconstruction based on total variation (TV) minimization at few-views data. In this paper, we evaluated the image quality between total variation (TV) minimization algorithm and Feldkam-Davis-kress (FDK) algorithm in micro computed tomography (CT). To evaluate the effect of TV minimization algorithm, we produced a cylindrical phantom including contrast media, water, air inserts. We can acquire maximum 400 projection views per rotation of the x-ray tube and detector. 20, 50, 90, 180 projection data were chosen for evaluating the level of image restoration by TV minimization. The phantom and mouse image reconstructed with FDK algorithm at 400 projection data used as a reference image for comparing with TV minimization and FDK algorithm at few-views. Contrast-to-noise ratio (CNR), Universal quality index (UQI) were used as a image evaluation metric. When projection data are not insufficient, our results show that the image quality of reconstructed with TV minimization is similar to reconstructed image with FDK at 400 view. In the cylindrical phantom study, the CNR of TV image was 5.86, FDK image was 5.65 and FDK-reference was 5.98 at 90-views. The CNR of TV image 0.21 higher than FDK image CNR at 90-views. UQI of TV image was 0.99 and FDK image was 0.81 at 90-views. where, the number of projection is 90, the UQI of TV image 0.18 higher than FDK image at 90-views. In the mouse study UQI of TV image was 0.91, FDK was 0.83 at 90-views. the UQI of TV image 0.08 higher than FDK image at 90-views. In cylindrical phantom image and mouse image study, TV minimization algorithm shows the best performance in artifact reduction and preserving edges at few view data. Therefore, TV minimization can potentially be expected to reduce patient dose in clinics.

• Progress in Medical Physics
• /
• v.29 no.4
• /
• pp.150-156
• /
• 2018

This study aims to develop an improved Feldkamp-Davis-Kress (FDK) reconstruction algorithm using anisotropic total variation (ATV) minimization to enhance the image quality of low-dose cone-beam computed tomography (CBCT). The algorithm first applies a filter that integrates the Shepp-Logan filter into a cosine window function on all projections for impulse noise removal. A total variation objective function with anisotropic penalty is then minimized to enhance the difference between the real structure and noise using the steepest gradient descent optimization with adaptive step sizes. The preserving parameter to adjust the separation between the noise-free and noisy areas is determined by calculating the cumulative distribution function of the gradient magnitude of the filtered image obtained by the application of the filtering operation on each projection. With these minimized ATV projections, voxel-driven backprojection is finally performed to generate the reconstructed images. The performance of the proposed algorithm was evaluated with the catphan503 phantom dataset acquired with the use of a low-dose protocol. Qualitative and quantitative analyses showed that the proposed ATV minimization provides enhanced CBCT reconstruction images compared with those generated by the conventional FDK algorithm, with a higher contrast-to-noise ratio (CNR), lower root-mean-square-error, and higher correlation. The proposed algorithm not only leads to a potential imaging dose reduction in repeated CBCT scans via lower mA levels, but also elicits high CNR values by removing noisy corrupted areas and by avoiding the heavy penalization of striking features.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.3
• /
• pp.156-184
• /
• 2022

In this article, we propose a novel variational model for restoring color images corrupted by mixed multiplicative Gamma noise and additive Gaussian noise. The model involves a data-fidelity term that characterizes the mixed noise as an infimal convolution of two noise distributions and the saturation-value total variation (SVTV) regularization. The data-fidelity term facilitates suitable separation of the multiplicative Gamma and Gaussian noise components, promoting simultaneous elimination of the mixed noise. Furthermore, the SVTV regularization enables adequate denoising of homogeneous regions, while maintaining edges and details and diminishing the color artifacts induced by noise. To solve the proposed nonconvex model, we exploit an alternating minimization approach, and then the alternating direction method of multipliers is adopted for solving subproblems. This contributes to an efficient iterative algorithm. The experimental results demonstrate the superior performance of the proposed model compared to other existing or related models, with regard to visual inspection and image quality measurements.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2271-2282
• /
• 2006

This paper is concerned with simulation issues arising in the PDE-based image restoration such as the total variation minimization(TVM) and its generalizations. In particular, we study the issues of staircasing and excessive dissipation of TVM-like smoothing operators. A strategy of scaling the algebraic system and a non-convex minimization are considered respectively for anti-staircasing and anti-diffusion. Furthermore, we introduce a variable constraint parameter to better preserve image edges. The resulting algorithm has been numerically verified to be efficient and reliable in denoising. Various numerical results are shown to confirm the claim.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.469-472
• /
• 2000

Replacement policy of a degradation of system is investigated by incorporating the loss function defined by the deviation of the value of quality characteristic from its target value, which determines the loss cost . Two cost minimization problems are formulated : 1)determination of an optimal inspection period given the state for the replacement and 2)determination of an optimal state for replacement under fixed inspect ion period. Simulation analysis is performed to observe the variation of total cost with respect to the variation of the parameters of loss function, inspection cost, respectively. As a result, parameters of loss function are seen to be the most sensitive to the total cost. On the contrary, inspect ion cost is observed to be insensitive.

• Journal of Applied Reliability
• /
• v.1 no.1
• /
• pp.35-46
• /
• 2001

Replacement policy of a degradation system is investigated by incorporating the loss function. Loss function is defined by the deviation of the value of quality characteristic from its target value, which determines the loss cost. Cost function is comprised of the inspection cost, replacement cost and loss cost. Two cost minimization problems are formulated : 1)determination of an optimal inspection period given the state for the replacement and 2)determination of an optimal state for replacement under fixed inspection period. Simulation analysis is performed to observe the variation of total cost with respect to the variation of the parameters of loss function and inspection cost, respectively As a result, parameters of loss function are seen to be the most sensitive to the total cost. On the contrary, inspection cost is observed to be insensitive. This study can be applied to the replacement policy of a degradation system which has to produce the quality critical product.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.09a
• /
• pp.217-221
• /
• 2003

Variation of decision variables for optimal remediation using the pump-and-treat method is examined to estimate the effect of the degree of concentration constraint. Simulation-optimization method using genetic algorithm is applied to minimize the total pumping volume. In total volume minimization strategy, the remediation time increases rapidly prior to significant increase in pumping rates. When the concentration constraint is set severer, the more wells are required and the well on the down-gradient direction from the plume hot-spot gives more efficient remediation performance than that on the hot-spot position. These results show that the more profitable strategy for remediation can be achieved by increasing the required remediation time than raising the pumping rate until the time reaches a certain limitation level. So, the remediation time has to be considered as one of the essential decision variables fer optimal remediation design.

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

• Journal of the Optical Society of Korea
• /
• v.20 no.6
• /
• pp.752-761
• /
• 2016

Hyperspectral images are often contaminated with stripe noise, which severely degrades the imaging quality and the precision of the subsequent processing. In this paper, a variational model is proposed by employing spectral-spatial adaptive unidirectional variation and a sparse representation. Unlike traditional methods, we exploit the spectral correction and remove stripes in different bands and different regions adaptively, instead of selecting parameters band by band. The regularization strength adapts to the spectrally varying stripe intensities and the spatially varying texture information. Spectral correlation is exploited via dictionary learning in the sparse representation framework to prevent spectral distortion. Moreover, the minimization problem, which contains two unsmooth and inseparable $l_1$-norm terms, is optimized by the split Bregman approach. Experimental results, on datasets from several imaging systems, demonstrate that the proposed method can remove stripe noise effectively and adaptively, as well as preserve original detail information.