scholarly journals An Efficient Image Reconstruction Framework Using Total Variation Regularization with Lp-Quasinorm and Group Gradient Sparsity

Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 115 ◽  
Author(s):  
Fan Lin ◽  
Yingpin Chen ◽  
Lingzhi Wang ◽  
Yuqun Chen ◽  
Wei Zhu ◽  
...  
Keyword(s):  
Image Reconstruction ◽  
Total Variation ◽  
Random Noise ◽  
Matrix Multiplication ◽  
Structural Similarity ◽  
Total Variation Regularization ◽  
Reconstruction Method ◽  
Image Gradient ◽  
Large Matrix ◽  
Tv Regularization

The total variation (TV) regularization-based methods are proven to be effective in removing random noise. However, these solutions usually have staircase effects. This paper proposes a new image reconstruction method based on TV regularization with Lp-quasinorm and group gradient sparsity. In this method, the regularization term of the group gradient sparsity can retrieve the neighborhood information of an image gradient, and the Lp-quasinorm constraint can characterize the sparsity of the image gradient. The method can effectively deblur images and remove impulse noise to well preserve image edge information and reduce the staircase effect. To improve the image recovery efficiency, a Fast Fourier Transform (FFT) is introduced to effectively avoid large matrix multiplication operations. Moreover, by introducing accelerated alternating direction method of multipliers (ADMM) in the method to allow for a fast restart of the optimization process, this method can run faster. In numerical experiments on standard test images sourced form Emory University and CVG-UGR (Computer Vision Group, University of Granada) image database, the advantage of the new method is verified by comparing it with existing advanced TV-based methods in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and operational time.

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.

A new nonlinear reconstruction method based on total variation regularization of neutron penumbral imaging

2011 ◽  
Vol 82 (9) ◽  
pp. 093504 ◽  
Author(s):  
Weixin Qian ◽  
Shuangxi Qi ◽  
Wanli Wang ◽  
Jinming Cheng ◽  
Dongbing Liu
Keyword(s):  
Total Variation ◽  
Total Variation Regularization ◽  
Reconstruction Method ◽  
Penumbral Imaging

scholarly journals Image Compression Approach using Segmentation and Total Variation Regularization

2021 ◽  
Vol 15 ◽  
pp. 43-47
Author(s):  
Ahmad Shahin ◽  
Walid Moudani ◽  
Fadi Chakik
Keyword(s):  
Image Compression ◽  
Total Variation ◽  
Image Data ◽  
Smart Devices ◽  
Multimedia Content ◽  
Total Variation Regularization ◽  
Second Stage ◽  
Tv Regularization ◽  
Rof Model

In this paper we present a hybrid model for image compression based on segmentation and total variation regularization. The main motivation behind our approach is to offer decode image with immediate access to objects/features of interest. We are targeting high quality decoded image in order to be useful on smart devices, for analysis purpose, as well as for multimedia content-based description standards. The image is approximated as a set of uniform regions: The technique will assign well-defined members to homogenous regions in order to achieve image segmentation. The Adaptive fuzzy c-means (AFcM) is a guide to cluster image data. A second stage coding is applied using entropy coding to remove the whole image entropy redundancy. In the decompression phase, the reverse process is applied in which the decoded image suffers from missing details due to the coarse segmentation. For this reason, we suggest the application of total variation (TV) regularization, such as the Rudin-Osher-Fatemi (ROF) model, to enhance the quality of the coded image. Our experimental results had shown that ROF may increase the PSNR and hence offer better quality for a set of benchmark grayscale images.

Iterative image reconstruction for sparse-view CT via total variation regularization and dictionary learning

2019 ◽  
Vol 27 (3) ◽  
pp. 573-590
Author(s):  
Xianyu Zhao ◽  
Changhui Jiang ◽  
Qiyang Zhang ◽  
Yongshuai Ge ◽  
Dong Liang ◽  
...  
Keyword(s):  
Image Reconstruction ◽  
Total Variation ◽  
Dictionary Learning ◽  
Total Variation Regularization ◽  
Iterative Image Reconstruction

An Enhanced NAS-RIF Algorithm for Blind Image Restoration Based on Total Variation Regularization

2013 ◽  
Vol 423-426 ◽  
pp. 2522-2525
Author(s):  
Xin Ke Li ◽  
Chao Gao ◽  
Yong Cai Guo ◽  
Yan Hua Shao
Keyword(s):  
Image Restoration ◽  
Total Variation ◽  
Signal To Noise Ratio ◽  
Random Noise ◽  
Tikhonov Regularization Method ◽  
Total Variation Regularization ◽  
Inverse Filtering ◽  
Blind Image Restoration ◽  
Spatially Adaptive ◽  
Blind Image

In order to improve the quality of blind image restoration, we propose an algorithm which combines Non-negativity and Support constraint Recursive Inverse Filtering (NAS-RIF) and adaptive total variation regularization. In the proposed algorithm, the total variation regularization constraint term is added in the NAS-RIF algorithm cost function. The majorization-minimization approach and conjugate gradient iterative algorithm are adopted to improve the convergence speed. We do the simulation experiments for the blurred classic test image which is added additive random noise. Experimental results show that the restoration effect of our algorithm is better than the spatially adaptive Tikhonov regularization method and the NAS-RIF spatially adaptive regularization algorithm, while the value of improvement of signal to noise ratio (ISNR) has improved.

scholarly journals A Total Variation-Based Reconstruction Method for Dynamic MRI

2008 ◽  
Vol 9 (1) ◽  
pp. 69-80 ◽  
Author(s):  
Germana Landi ◽  
Elena Loli Piccolomini ◽  
Fabiana Zama
Keyword(s):  
Magnetic Resonance ◽  
Total Variation ◽  
Dynamic Mri ◽  
Magnetic Resonance Images ◽  
Dynamic Imaging ◽  
Test Problems ◽  
High Temporal Resolution ◽  
Reconstruction Method ◽  
Dynamic Magnetic Resonance ◽  
Tv Regularization

In recent years, total variation (TV) regularization has become a popular and powerful tool for image restoration and enhancement. In this work, we apply TV minimization to improve the quality of dynamic magnetic resonance images. Dynamic magnetic resonance imaging is an increasingly popular clinical technique used to monitor spatio-temporal changes in tissue structure. Fast data acquisition is necessary in order to capture the dynamic process. Most commonly, the requirement of high temporal resolution is fulfilled by sacrificing spatial resolution. Therefore, the numerical methods have to address the issue of images reconstruction from limited Fourier data. One of the most successful techniques for dynamic imaging applications is the reduced-encoded imaging by generalized-series reconstruction method of Liang and Lauterbur. However, even if this method utilizesa prioridata for optimal image reconstruction, the produced dynamic images are degraded by truncation artifacts, most notably Gibbs ringing, due to the spatial low resolution of the data. We use a TV regularization strategy in order to reduce these truncation artifacts in the dynamic images. The resulting TV minimization problem is solved by the fixed point iteration method of Vogel and Oman. The results of test problems with simulated and real data are presented to illustrate the effectiveness of the proposed approach in reducing the truncation artifacts of the reconstructed images.

Sign in / Sign up

Export Citation Format

Share Document