Multiplicative Noise and Blur Removal by Framelet Decomposition and -Based L-Curve Method
This paper proposes a framelet-based convex optimization model for multiplicative noise and blur removal problem. The main idea is to employ framelet expansion to represent the original image and use the variable decomposition to solve the problem. Because of the nature of multiplicative noise, we d...
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 25(2016), 9 vom: 01. Sept., Seite 4222-4232 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2016
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Schlagworte: | Journal Article |
| Zusammenfassung: | This paper proposes a framelet-based convex optimization model for multiplicative noise and blur removal problem. The main idea is to employ framelet expansion to represent the original image and use the variable decomposition to solve the problem. Because of the nature of multiplicative noise, we decompose the observed data into the original image variable and the noise variable to obtain the resulting model. The original image variable is represented by framelet, and it is determined by using l1-norm in the selection and shrinkage of framelet coefficients. The noise variable is measured by using the mean and the variance of the underlying probability distribution. This framelet setting can be applied to analysis, synthesis, and balanced approaches, and the resulting optimization models are convex, such that they can be solved very efficiently by the alternating direction of a multiplier method. An another contribution of this paper is to propose to select the regularization parameter by using the l1-based L-curve method for these framelet based models. Numerical examples are presented to illustrate the effectiveness of these models and show that the performance of the proposed method is better than that by the existing methods |
|---|---|
| Beschreibung: | Date Revised 20.11.2019 published: Print-Electronic Citation Status PubMed-not-MEDLINE |
| ISSN: | 1941-0042 |
| DOI: | 10.1109/TIP.2016.2583793 |