Multiplicative denoising based on linearized alternating direction method using discrepancy function constraint (Q474952)

From MaRDI portal
Revision as of 00:21, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Multiplicative denoising based on linearized alternating direction method using discrepancy function constraint
scientific article

    Statements

    Multiplicative denoising based on linearized alternating direction method using discrepancy function constraint (English)
    0 references
    0 references
    0 references
    25 November 2014
    0 references
    This paper considers the problem of recovering the original image from the observed image contaminated by a multiplicative noise. The objective function is a weighted sum of two terms: the 1-divergence as the data-fidelity term and the total variation regularization term. The authors develop a linearized alternating direction minimization algorithm with auto-adjusting of the regularization parameter for the gamma noise removal. In each iteration, one quadratic term of the augmented Lagrangian function is linearized and the regularization parameter is updated to satisfy the convex discrepancy function constraint. The global convergence of the algorithm is established. The efficiency of the proposed algorithm is illustrated by some numerical results.
    0 references
    multiplicative noise
    0 references
    linearized alternating minimization
    0 references
    regularization parameter
    0 references
    convex discrepancy function
    0 references
    total variation
    0 references
    image reconstruction
    0 references
    global convergence
    0 references
    numerical result
    0 references

    Identifiers