|
This article is cited in 1 scientific paper (total in 1 paper)
IMAGE PROCESSING, PATTERN RECOGNITION
Tree-serial parametric dynamic programming with flexible prior model for image denoising
Ph. C. Thangab, A. V. Kopylovc a National Research University Higher School of Economics, 20Myasnitskaya Street, Moscow, Russia
b The University of Da Nang – University of Science and Technology, 54 Nguyen Luong Bang Street, Da Nang, Viet Nam
c Tula State University, pr. Lenina 92, Tula, Russia
Abstract:
We consider here image denoising procedures, based on computationally effective tree-serial parametric dynamic programming procedures, different representations of an image lattice by the set of acyclic graphs and non-convex regularization of a new type which allows to flexibly set a priori preferences. Experimental results in image denoising, as well as comparison with related methods, are provided. A new extended version of multi quadratic dynamic programming procedures for image denoising, proposed here, shows an improved accuracy for images of a different type.
Keywords:
Image denoising, Dynamic programming, Bayesian optimization, Markov random fields (MRFs), Gauss-Seidel iteration method.
Received: 27.11.2017 Accepted: 27.07.2018
Citation:
Ph. C. Thang, A. V. Kopylov, “Tree-serial parametric dynamic programming with flexible prior model for image denoising”, Computer Optics, 42:5 (2018), 838–845
Linking options:
https://www.mathnet.ru/eng/co568 https://www.mathnet.ru/eng/co/v42/i5/p838
|
Statistics & downloads: |
Abstract page: | 154 | Full-text PDF : | 82 | References: | 28 |
|