Отрывок: Iterative multi-quadratic procedure As described in the previoussection, we can find such a cut of the graph G that it gets resolved into two trees. Then, it will be possible to a...
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Thang, P.C. | - |
dc.contributor.author | Kopylov, A.V. | - |
dc.date.accessioned | 2018-11-13 15:52:12 | - |
dc.date.available | 2018-11-13 15:52:12 | - |
dc.date.issued | 2018 | - |
dc.identifier | Dspace\SGAU\20181111\72375 | ru |
dc.identifier.citation | Thang PC, Kopylov AV. Tree-serial parametric dynamic programming with flexible prior model for image denoising. Computer Optics 2018; 42(5): 838-845. DOI: 10.18287/2412-6179-2018-42-5-838-845. | ru |
dc.identifier.uri | https://dx.doi.org/10.18287/2412-6179-2018-42-5-838-845 | - |
dc.identifier.uri | http://repo.ssau.ru/handle/Zhurnal-Komputernaya-optika/Treeserial-parametric-dynamic-programming-with-flexible-prior-model-for-image-denoising-72375 | - |
dc.description.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. | ru |
dc.language.iso | rus | ru |
dc.publisher | Новая техника | ru |
dc.relation.ispartofseries | 42;5 | - |
dc.subject | Image denoising | ru |
dc.subject | Dynamic programming | ru |
dc.subject | Bayesian optimization | ru |
dc.subject | Markov random fields (MRFs) | ru |
dc.subject | Gauss-Seidel iteration method | ru |
dc.title | Tree-serial parametric dynamic programming with flexible prior model for image denoising | ru |
dc.type | Article | ru |
dc.textpart | Iterative multi-quadratic procedure As described in the previoussection, we can find such a cut of the graph G that it gets resolved into two trees. Then, it will be possible to a... | - |
dc.classindex.scsti | 28.23.15 | - |
Располагается в коллекциях: | Журнал "Компьютерная оптика" |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
420515.pdf | 375.19 kB | Adobe PDF | Просмотреть/Открыть |
Показать базовое описание ресурса
Просмотр статистики
Поделиться:
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.