RUS  ENG
Full version
JOURNALS // Computer Optics // Archive

Computer Optics, 2018 Volume 42, Issue 5, Pages 838–845 (Mi co568)

This article is cited 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

Language: English

DOI: 10.18287/2412-6179-2018-42-5-838-845



© Steklov Math. Inst. of RAS, 2024