scholarly journals Total Variation Regularization of Matrix-Valued Images

2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Oddvar Christiansen ◽  
Tin-Man Lee ◽  
Johan Lie ◽  
Usha Sinha ◽  
Tony F. Chan
Keyword(s):  
Total Variation ◽  
Diffusion Tensor ◽  
Natural Extension ◽  
Positive Definiteness ◽  
Total Variation Regularization ◽  
Diffusion Matrix ◽  
Proposed Model ◽  
Total Variation Model ◽  
Diffusion Tensor Images ◽  
Restoration Model

We generalize the total variation restoration model, introduced by Rudin, Osher, and Fatemi in 1992, to matrix-valued data, in particular, to diffusion tensor images (DTIs). Our model is a natural extension of the color total variation model proposed by Blomgren and Chan in 1998. We treat the diffusion matrixDimplicitly as the productD=LLT, and work with the elements ofLas variables, instead of working directly on the elements ofD. This ensures positive definiteness of the tensor during the regularization flow, which is essential when regularizing DTI. We perform numerical experiments on both synthetical data and 3D human brain DTI, and measure the quantitative behavior of the proposed model.

A new total variation model for restoring blurred and speckle noisy images

2017 ◽  
Vol 15 (02) ◽  
pp. 1750009 ◽  
Author(s):  
Jian Lu ◽  
Yupeng Chen ◽  
Yuru Zou ◽  
Lixin Shen
Keyword(s):  
Total Variation ◽  
Speckle Noise ◽  
Variational Model ◽  
Total Variation Regularization ◽  
Penalty Term ◽  
Proposed Model ◽  
Total Variation Model ◽  
Data Fidelity ◽  
Blurred Images ◽  
Uniqueness Of A Solution

In coherent imaging systems, such as the synthetic aperture radar (SAR), the observed images are affected by multiplicative speckle noise. This paper proposes a new variational model based on I-divergence for restoring blurred images with speckle noise. The model minimizes the sum of an I-divergence data fidelity term, a new quadratic penalty term based on the statistical property of the noise and the total-variation regularization term. The existence and uniqueness of a solution of the proposed model with some other characteristics are analyzed. Furthermore, an iterative algorithm is introduced to solve the proposed variational model. Our numerical experiments indicate that the proposed method performs favorably.

scholarly journals Image Restoration by a Mixed High-Order Total Variation and l1 Regularization Model

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Jianguang Zhu ◽  
Kai Li ◽  
Binbin Hao
Keyword(s):  
Total Variation ◽  
High Order ◽  
Variational Model ◽  
Total Variation Regularization ◽  
Current State ◽  
Model Combining ◽  
Alternating Direction ◽  
Proposed Model ◽  
Sharp Edges ◽  
Thresholding Algorithm

Total variation regularization is well-known for recovering sharp edges; however, it usually produces staircase artifacts. In this paper, in order to overcome the shortcoming of total variation regularization, we propose a new variational model combining high-order total variation regularization and l1 regularization. The new model has separable structure which enables us to solve the involved subproblems more efficiently. We propose a fast alternating method by employing the fast iterative shrinkage-thresholding algorithm (FISTA) and the alternating direction method of multipliers (ADMM). Compared with some current state-of-the-art methods, numerical experiments show that our proposed model can significantly improve the quality of restored images and obtain higher SNR and SSIM values.

scholarly journals Combined total variation of first and fractional orders for Poisson noise removal in digital images

2021 ◽  
pp. 10-19
Author(s):  
Cong Pham ◽  
Thi Thu Tran ◽  
Minh Pham ◽  
Thanh Cong Nguyen
Keyword(s):  
Image Reconstruction ◽  
Image Restoration ◽  
Total Variation ◽  
Fractional Order ◽  
Optimization Problem ◽  
Poisson Noise ◽  
Experimental Results ◽  
First Order ◽  
Proposed Model ◽  
Total Variation Model

Introduction: Many methods have been proposed to handle the image restoration problem with Poisson noise. A popular approach to Poissonian image reconstruction is the one based on Total Variation. This method can provide significantly sharp edges and visually fine images, but it results in piecewise-constant regions in the resulting images. Purpose: Developing an adaptive total variation-based model for the reconstruction of images contaminated by Poisson noise, and an algorithm for solving the optimization problem. Results: We proposed an effective way to restore images degraded by Poisson noise. Using the Bayesian framework, we proposed an adaptive model based on a combination of first-order total variation and fractional order total variation. The first-order total variation model is efficient for suppressing the noise and preserving the keen edges simultaneously. However, the first-order total variation method usually causes artifact problems in the obtained results. To avoid this drawback, we can use high-order total variation models, one of which is the fractional-order total variation-based model for image restoration. In the fractional-order total variation model, the derivatives have an order greater than or equal to one. It leads to the convenience of computation with a compact discrete form. However, methods based on the fractional-order total variation may cause image blurring. Thus, the proposed model incorporates the advantages of two total variation regularization models, having a significant effect on the edge-preserving image restoration. In order to solve the considered optimization problem, the Split Bregman method is used. Experimental results are provided, demonstrating the effectiveness of the proposed method.  Practical relevance: The proposed method allows you to restore Poissonian images preserving their edges. The presented numerical simulation demonstrates the competitive performance of the model proposed for image reconstruction. Discussion: From the experimental results, we can see that the proposed algorithm is effective in suppressing noise and preserving the image edges. However, the weighted parameters in the proposed model were not automatically selected at each iteration of the proposed algorithm. This requires additional research.

scholarly journals Local and Nonlocal Steering Kernel Weighted Total Variation Model for Image Denoising

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 329 ◽  
Author(s):  
Rui Lai ◽  
Yiguo Mo ◽  
Zesheng Liu ◽  
Juntao Guan
Keyword(s):  
Image Denoising ◽  
Total Variation ◽  
Noise Suppression ◽  
Nonlocal Symmetry ◽  
Visual Appearance ◽  
Quantitative Indices ◽  
Proposed Model ◽  
Total Variation Model ◽  
Weighted Total Variation ◽  
Tv Model

To eliminate heavy noise and retain more scene details, we propose a structure-oriented total variation (TV) model based on data dependent kernel function and TV criterion for image denoising application. The innovative model introduces the weights produced from the local and nonlocal symmetry features involved in the image itself to pick more precise solutions in the TV denoising process. As a result, the proposed local and nonlocal steering kernel weighted TV model yields excellent noise suppression and structure-preserving performance. The experimental results verify the validity of the proposed model in objective quantitative indices and subjective visual appearance.

scholarly journals Image Denoising Using Total Variation Model Guided by Steerable Filter

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Wenxue Zhang ◽  
Yongzhen Cao ◽  
Rongxin Zhang ◽  
Yuanquan Wang
Keyword(s):  
Diffusion Process ◽  
Total Variation ◽  
Noise Removal ◽  
Edge Preserving ◽  
Linear Diffusion ◽  
Proposed Model ◽  
Total Variation Model ◽  
Adaptive Total Variation ◽  
Steerable Filter ◽  
Tv Model

We propose an adaptive total variation (TV) model by introducing the steerable filter into the TV-based diffusion process for image filtering. The local energy measured by the steerable filter can effectively characterize the object edges and ramp regions and guide the TV-based diffusion process so that the new model behaves like the TV model at edges and leads to linear diffusion in flat and ramp regions. This way, the proposed model can provide a better image processing tool which enables noise removal, edge-preserving, and staircase suppression.

scholarly journals An Improved Particle Swarm Optimization Based on Total Variation Regularization and Projection Constraint with Applications in Ground-Penetrating Radar Inversion: A Model Simulation Study

2021 ◽  
Vol 13 (13) ◽  
pp. 2514
Author(s):  
Qianwei Dai ◽  
Hao Zhang ◽  
Bin Zhang
Keyword(s):  
Particle Swarm Optimization ◽  
Total Variation ◽  
Ground Penetrating Radar ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Total Variation Regularization ◽  
Interface Model ◽  
Swarm Optimization ◽  
Tv Regularization ◽  
Ground Penetrating

The chaos oscillation particle swarm optimization (COPSO) algorithm is prone to binge trapped in the local optima when dealing with certain complex models in ground-penetrating radar (GPR) data inversion, because it inherently suffers from premature convergence, high computational costs, and extremely slow convergence times, especially in the middle and later periods of iterative inversion. Considering that the bilateral connections between different particle positions can improve both the algorithmic searching efficiency and the convergence performance, we first develop a fast single-trace-based approach to construct an initial model for 2-D PSO inversion and then propose a TV-regularization-based improved PSO (TVIPSO) algorithm that employs total variation (TV) regularization as a constraint technique to adaptively update the positions of particles. B by adding the new velocity variations and optimal step size matrices, the search range of the random particles in the solution space can be significantly reduced, meaning blindness in the search process can be avoided. By introducing constraint-oriented regularization to allow the optimization search to move out of the inaccurate region, the premature convergence and blurring problems can be mitigated to further guarantee the inversion accuracy and efficiency. We report on three inversion experiments involving multilayered, fluctuated terrain models and a typical complicated inner-interface model to demonstrate the performance of the proposed algorithm. The results of the fluctuated terrain model show that compared with the COPSO algorithm, the fitness error (MAE) of the TVIPSO algorithm is reduced from 2.3715 to 1.0921, while for the complicated inner-interface model the fitness error (MARE) of the TVIPSO algorithm is reduced from 1.9539 to 1.5674.

scholarly journals Remote Sensing Image Stripe Detecting and Destriping Using the Joint Sparsity Constraint with Iterative Support Detection

2019 ◽  
Vol 11 (6) ◽  
pp. 608 ◽  
Author(s):  
Yun-Jia Sun ◽  
Ting-Zhu Huang ◽  
Tian-Hui Ma ◽  
Yong Chen
Keyword(s):  
Remote Sensing ◽  
Real Data ◽  
Total Variation Regularization ◽  
Joint Sparsity ◽  
Alternating Direction ◽  
Proposed Model ◽  
Comparison Results ◽  
Wide Range ◽  
Image Edges ◽  
Full Consideration

Remote sensing images have been applied to a wide range of fields, but they are often degraded by various types of stripes, which affect the image visual quality and limit the subsequent processing tasks. Most existing destriping methods fail to exploit the stripe properties adequately, leading to suboptimal performance. Based on a full consideration of the stripe properties, we propose a new destriping model to achieve stripe detection and stripe removal simultaneously. In this model, we adopt the unidirectional total variation regularization to depict the directional property of stripes and the weighted ℓ 2 , 1 -norm regularization to depict the joint sparsity of stripes. Then, we combine the alternating direction method of multipliers and iterative support detection to solve the proposed model effectively. Comparison results on simulated and real data suggest that the proposed method can remove and detect stripes effectively while preserving image edges and details.

Sign in / Sign up

Export Citation Format

Share Document