• Title/Summary/Keyword: total variation regularization

Search Result 19, Processing Time 0.019 seconds

An Unified Bayesian Total Variation Regularization Method and Application to Image Restoration (통합 베이즈 총변이 정규화 방법과 영상복원에 대한 응용)

  • Yoo, Jae-Hung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.1
    • /
    • pp.41-48
    • /
    • 2022
  • This paper presents the unified Bayesian Tikhonov regularization method as a solution to total variation regularization. The integrated method presents a formula for obtaining the regularization parameter by transforming the total variation term into a weighted Tikhonov regularization term. It repeats until the reconstructed image converges to obtain a regularization parameter and a new weighting factor based on it. The experimental results show the effectiveness of the proposed method for the image restoration problem.

Regularization Parameter Selection for Total Variation Model Based on Local Spectral Response

  • Zheng, Yuhui;Ma, Kai;Yu, Qiqiong;Zhang, Jianwei;Wang, Jin
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1168-1182
    • /
    • 2017
  • In the past decades, various image regularization methods have been introduced. Among them, total variation model has drawn much attention for the reason of its low computational complexity and well-understood mathematical behavior. However, regularization parameter estimation of total variation model is still an open problem. To deal with this problem, a novel adaptive regularization parameter selection scheme is proposed in this paper, by means of using the local spectral response, which has the capability of locally selecting the regularization parameters in a content-aware way and therefore adaptively adjusting the weights between the two terms of the total variation model. Experiment results on simulated and real noisy image show the good performance of our proposed method, in visual improvement and peak signal to noise ratio value.

Performance Comparison of Regularization Methods in Electrical Resistance Tomography (전기 저항 단층촬영법에서의 조정기법 성능비교)

  • Kang, Suk-In;Kim, Kyung-Youn
    • Journal of IKEEE
    • /
    • v.20 no.3
    • /
    • pp.226-234
    • /
    • 2016
  • Electrical resistance tomography (ERT) is an imaging technique where the internal resistivity distribution inside an object is reconstructed. The ERT image reconstruction is a highly nonlinear ill-posed problem, so regularization methods are used to achieve desired image. The reconstruction outcome is dependent on the type of regularization method employed such as l2-norm, l1-norm, and total variation regularization method. That is, use of an appropriate regularization method considering the flow characteristics is necessary to attain good reconstruction performance. Therefore, in this paper, regularization methods are tested through numerical simulations with different flow conditions and the performance is compared.

Resistivity Image Reconstruction Using Interacting Dual-Mode Regularization (상호작용 이중-모드 조정방법을 이용한 저항률 영상 복원)

  • Kang, Suk-In;Kim, Kyung-Youn
    • Journal of IKEEE
    • /
    • v.20 no.2
    • /
    • pp.152-162
    • /
    • 2016
  • Electrical resistivity tomography (ERT) is a technique to reconstruct the internal resistivity distribution using the measured voltages on the surface electrodes. ERT inverse problem suffers from ill-posedness nature, so regularization methods are used to mitigate ill-posedness. The reconstruction performance varies depending on the type of regularization method. In this paper, an interacting dual-mode regularization method is proposed with two different regularization methods, L1-norm regularization and total variation (TV) regularization, to achieve robust reconstruction performance. The interacting dual-mode regularization method selects the suitable regularization method and combines the regularization methods based on computed mode probabilities depending on the actual conditions. The proposed method is tested with numerical simulations and the results demonstrate an improved reconstruction performance.

MULTIGRID METHOD FOR TOTAL VARIATION IMAGE DENOISING

  • HAN, MUN S.;LEE, JUN S.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.6 no.2
    • /
    • pp.9-24
    • /
    • 2002
  • Total Variation(TV) regularization method is effective for reconstructing "blocky", discontinuous images from contaminated image with noise. But TV is represented by highly nonlinear integro-differential equation that is hard to solve. There have been much effort to obtain stable and fast methods. C. Vogel introduced "the Fixed Point Lagged Diffusivity Iteration", which solves the nonlinear equation by linearizing. In this paper, we apply multigrid(MG) method for cell centered finite difference (CCFD) to solve system arise at each step of this fixed point iteration. In numerical simulation, we test various images varying noises and regularization parameter $\alpha$ and smoothness $\beta$ which appear in TV method. Numerical tests show that the parameter ${\beta}$ does not affect the solution if it is sufficiently small. We compute optimal $\alpha$ that minimizes the error with respect to $L^2$ norm and $H^1$ norm and compare reconstructed images.

  • PDF

Segmentation of binary sequence via minimizing least square error with total variation regularization

  • Jeungju Kim;Johan Lim
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.5
    • /
    • pp.487-496
    • /
    • 2024
  • In this paper, we propose a data-driven procedure to segment a binary sequence as an alternative to the popular hidden Markov model (HMM) based procedure. Unlike the HMM, our procedure does not make any distributional or model assumption to the data. To segment the sequence, we suggest to minimize the least square distance from the observations under total variation regularization to the solution, and develop a polynomial time algorithm for it. Finally, we illustrate the algorithm using a toy example and apply it to the Gemini boat race data between Oxford and Cambridge University. Further, we numerically compare the performance of our procedure to the HMM based segmentation through these examples.

FIXED-POINT-LIKE METHOD FOR A NEW TOTAL VARIATION-BASED IMAGE RESTORATION MODEL

  • WON, YU JIN;YUN, JAE HEON
    • Journal of applied mathematics & informatics
    • /
    • v.38 no.5_6
    • /
    • pp.519-532
    • /
    • 2020
  • In this paper, we first propose a new total variation-based regularization model for image restoration. We next propose a fixed-point-like method for solving the new image restoration model, and then we provide convergence analysis for the fixed-point-like method. To evaluate the feasibility and efficiency of the fixed-point-like method for the new proposed total variation-based regularization model, we provide numerical experiments for several test problems.

SATURATION-VALUE TOTAL VARIATION BASED COLOR IMAGE DENOISING UNDER MIXED MULTIPLICATIVE AND GAUSSIAN NOISE

  • JUNG, MIYOUN
    • 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.

Sparse-View CT Image Recovery Using Two-Step Iterative Shrinkage-Thresholding Algorithm

  • Chae, Byung Gyu;Lee, Sooyeul
    • 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.

Compressive Sensing Recovery of Natural Images Using Smooth Residual Error Regularization (평활 잔차 오류 정규화를 통한 자연 영상의 압축센싱 복원)

  • Trinh, Chien Van;Dinh, Khanh Quoc;Nguyen, Viet Anh;Park, Younghyeon;Jeon, Byeungwoo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.6
    • /
    • pp.209-220
    • /
    • 2014
  • Compressive Sensing (CS) is a new signal acquisition paradigm which enables sampling under Nyquist rate for a special kind of signal called sparse signal. There are plenty of CS recovery methods but their performance are still challenging, especially at a low sub-rate. For CS recovery of natural images, regularizations exploiting some prior information can be used in order to enhance CS performance. In this context, this paper addresses improving quality of reconstructed natural images based on Dantzig selector and smooth filters (i.e., Gaussian filter and nonlocal means filter) to generate a new regularization called smooth residual error regularization. Moreover, total variation has been proved for its success in preserving edge objects and boundary of reconstructed images. Therefore, effectiveness of the proposed regularization is verified by experimenting it using augmented Lagrangian total variation minimization. This framework is considered as a new CS recovery seeking smoothness in residual images. Experimental results demonstrate significant improvement of the proposed framework over some other CS recoveries both in subjective and objective qualities. In the best case, our algorithm gains up to 9.14 dB compared with the CS recovery using Bayesian framework.