Number of the records: 1  

Notes on Performance of Bidiagonalization-Based Noise Level Estimator in Image Deblurring

  1. 1.
    SYSNO ASEP0458347
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleNotes on Performance of Bidiagonalization-Based Noise Level Estimator in Image Deblurring
    Author(s) Hnětynková, Iveta (UIVT-O) SAI, RID, ORCID
    Kubínová, Marie (UIVT-O) RID, ORCID
    Plešinger, Martin (UIVT-O) RID, SAI, ORCID
    Source TitleAlgoritmy 2016. - Bratislava : Slovak University of Technology, 2016 / Handlovičová A. ; Ševčovič D. - ISBN 978-80-227-4544-4
    Pagess. 333-342
    Number of pages10 s.
    Publication formPrint - P
    ActionALGORITMY 2016. Conference on Scientific Computing /20./
    Event date13.03.2016 - 18.03.2016
    VEvent locationVysoké Tatry - Podbanské
    CountrySK - Slovakia
    Event typeWRD
    Languageeng - English
    CountrySK - Slovakia
    Keywordsimage deblurring ; linear ill-posed problem ; noise ; noise level estimate ; Golub-Kahan iterative bidiagonalization
    Subject RIVBA - General Mathematics
    R&D ProjectsGA13-06684S GA ČR - Czech Science Foundation (CSF)
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000391175600034
    AnnotationImage deblurring represents one of important areas of image processing. When information about the amount of noise in the given blurred image is available, it can signifficantly improve the performance of image deblurring algorithms. The paper [11] introduced an iterative method for estimating the noise level in linear algebraic ill-posed problems contaminated by white noise. Here we study applicability of this approach to image deblurring problems with various types of blurring operators. White as well as data-correlated noise of various sizes is considered.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2017
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.