High-order total bounded variation model and its fast algorithm for Poissonian image restoration (Q2298214)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: High-order total bounded variation model and its fast algorithm for Poissonian image restoration |
scientific article; zbMATH DE number 7170585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High-order total bounded variation model and its fast algorithm for Poissonian image restoration |
scientific article; zbMATH DE number 7170585 |
Statements
High-order total bounded variation model and its fast algorithm for Poissonian image restoration (English)
0 references
20 February 2020
0 references
Summary: In this paper, a new model for image restoration under Poisson noise based on a high-order total bounded variation is proposed. Existence and uniqueness of its solution are proved. To find the global optimal solution of our strongly convex model, a split Bregman algorithm is introduced. Furthermore, a rigorous convergence theory of the proposed algorithm is established. Experimental results are provided to demonstrate the effectiveness and efficiency of the proposed method over the classic total bounded variation-based model.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8897317051887512
0 references
0.8783479928970337
0 references
0.87581467628479
0 references
0.8661049604415894
0 references
0.8563857674598694
0 references