Distributed Optimization of Quadratic Costs with a Group-Sparsity Regularization Via PDMM

Author(s):  
Kangwei Hu ◽  
Danqi Jin ◽  
Wen Zhang ◽  
Jie Chen
2021 ◽  
pp. 1-18
Author(s):  
Tiejun Yang ◽  
Lu Tang ◽  
Qi Tang ◽  
Lei Li

OBJECTIVE: In order to solve the blurred structural details and over-smoothing effects in sparse representation dictionary learning reconstruction algorithm, this study aims to test sparse angle CT reconstruction with weighted dictionary learning algorithm based on adaptive Group-Sparsity Regularization (AGSR-SART). METHODS: First, a new similarity measure is defined in which Covariance is introduced into Euclidean distance, Non-local image patches are adaptively divided into groups of different sizes as the basic unit of sparse representation. Second, the weight factor of the regular constraint terms is designed through the residuals represented by the dictionary, so that the algorithm takes different smoothing effects on different regions of the image during the iterative process. The sparse reconstructed image is modified according to the difference between the estimated value and the intermediate image. Last, The SBI (Split Bregman Iteration) iterative algorithm is used to solve the objective function. An abdominal image, a pelvic image and a thoracic image are employed to evaluate performance of the proposed method. RESULTS: In terms of quantitative evaluations, experimental results show that new algorithm yields PSNR of 48.20, the maximum SSIM of 99.06% and the minimum MAE of 0.0028. CONCLUSIONS: This study demonstrates that new algorithm can better preserve structural details in reconstructed CT images. It eliminates the effect of excessive smoothing in sparse angle reconstruction, enhances the sparseness and non-local self-similarity of the image, and thus it is superior to several existing reconstruction algorithms.


2015 ◽  
Vol 51 (10) ◽  
pp. 8607-8626 ◽  
Author(s):  
Azarang Golmohammadi ◽  
Mohammad‐Reza M. Khaninezhad ◽  
Behnam Jafarpour

2020 ◽  
Vol 10 (16) ◽  
pp. 5583 ◽  
Author(s):  
Jun Li ◽  
Yuanxi Peng ◽  
Tian Jiang ◽  
Longlong Zhang ◽  
Jian Long

A hyperspectral image (HSI) contains many narrow spectral channels, thus containing efficient information in the spectral domain. However, high spectral resolution usually leads to lower spatial resolution as a result of the limitations of sensors. Hyperspectral super-resolution aims to fuse a low spatial resolution HSI with a conventional high spatial resolution image, producing an HSI with high resolution in both the spectral and spatial dimensions. In this paper, we propose a spatial group sparsity regularization unmixing-based method for hyperspectral super-resolution. The hyperspectral image (HSI) is pre-clustered using an improved Simple Linear Iterative Clustering (SLIC) superpixel algorithm to make full use of the spatial information. A robust sparse hyperspectral unmixing method is then used to unmix the input images. Then, the endmembers extracted from the HSI and the abundances extracted from the conventional image are fused. This ensures that the method makes full use of the spatial structure and the spectra of the images. The proposed method is compared with several related methods on public HSI data sets. The results demonstrate that the proposed method has superior performance when compared to the existing state-of-the-art.


Optik ◽  
2017 ◽  
Vol 140 ◽  
pp. 392-404 ◽  
Author(s):  
Hongjuan Yu ◽  
Mingfeng Jiang ◽  
Hairong Chen ◽  
Jie Feng ◽  
Yaming Wang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document