local regularization
Recently Published Documents


TOTAL DOCUMENTS

78
(FIVE YEARS 10)

H-INDEX

16
(FIVE YEARS 0)

2021 ◽  
Vol 120 (3) ◽  
pp. 193a
Author(s):  
Adithan Kandasamy ◽  
Yi-Ting Yeh ◽  
Amy B. Schwartz ◽  
Juan C. Lasheras ◽  
Juan C. del Alamo

Author(s):  
Huilin Xu ◽  
Xiaoyan Xiang ◽  
Yanling He

The local regularization method for solving the first-order numerical differentiation problem is considered in this paper. The a-priori and a-posteriori selection strategy of the regularization parameter is introduced, and the convergence rate of local regularization solution under some assumption of the exact derivative is also given. Numerical comparison experiments show that the local regularization method can reflect sharp variations and oscillations of the exact derivative while suppress the noise of the given data effectively.


Algorithms ◽  
2020 ◽  
Vol 13 (9) ◽  
pp. 226
Author(s):  
Laura Antonelli ◽  
Valentina De Simone ◽  
Daniela di Serafino

We present a total-variation-regularized image segmentation model that uses local regularization parameters to take into account spatial image information. We propose some techniques for defining those parameters, based on the cartoon-texture decomposition of the given image, on the mean and median filters, and on a thresholding technique, with the aim of preventing excessive regularization in piecewise-constant or smooth regions and preserving spatial features in nonsmooth regions. Our model is obtained by modifying a well-known image segmentation model that was developed by T. Chan, S. Esedoḡlu, and M. Nikolova. We solve the modified model by an alternating minimization method using split Bregman iterations. Numerical experiments show the effectiveness of our approach.


Entropy ◽  
2019 ◽  
Vol 21 (11) ◽  
pp. 1108
Author(s):  
Natalya Denisova

The Bayesian approach Maximum a Posteriori (MAP) provides a common basis for developing statistical methods for solving ill-posed image reconstruction problems. MAP solutions are dependent on a priori model. Approaches developed in literature are based on prior models that describe the properties of the expected image rather than the properties of the studied object. In this paper, such models have been analyzed and it is shown that they lead to global regularization of the solution. Prior models that are based on the properties of the object under study are developed and conditions for local and global regularization are obtained. A new reconstruction algorithm has been developed based on the method of local statistical regularization. Algorithms with global and local regularization were compared in numerical simulations. The simulations were performed close to the real oncologic single photon emission computer tomography (SPECT) study. It is shown that the approach with local regularization produces more accurate images of ‘hot spots’, which is especially important to tumor diagnostics in nuclear oncology.


2019 ◽  
Vol 8 (2S11) ◽  
pp. 1063-1067

Image restoration aims to restore an image from a degraded image. The degradation may occur during image acquisition or image transmission. Image degradation lowers the quality of the image. In this paper additive Gaussian noise is considered for degrading the original image. For restoring the image from degraded image the proposed method used both local and non-local similarity patterns. The restoration problem is modeled with regression model. Two regularization terms are considered for representing prior image information. One regularization term is for local patterns and other is for non-local similarity patterns. The additive local regularization term is used to restore the edges. The non-local regularization term works best for local smoothness and edge information will be lost. The proposed algorithm took a clean image of size 256x256 and added with Gaussian noise with different levels of noise levels. A self-adaptive dictionary is trained for a particular window of image with local and non-local patterns and stacked to three dimensional matrix. The patch size considered for training the dictionary is 10x10. For restoring each patch it searches best atoms form the trained dictionary. The efficiency of the algorithm is estimated by parameters mean square error, root mean square error, PSNR and FSIM. The algorithm is also tested for different images like cameraman, house, Barbara, Lena and parrot. The proposed algorithm is tested with conventional algorithms. .


Sign in / Sign up

Export Citation Format

Share Document