Abstract

In this paper, a new total generalized variational(TGV) model for restoring images with multiplicative noise is proposed, which contains a nonconvex fidelity term and a TGV term. We use a difference of convex functions algorithm (DCA) to deal with the proposed model. For multiplicative noise removal, there exist many models and algorithms, most of which focus on convex approximation so that numerical algorithms with guaranteed convergence can be designed. Unlike these algorithms, we use the DCA algorithm to remove multiplicative noise. By numerical experiments, it is shown that the proposed approach leads to a better solution compared with the gradient projection algorithm for solving the classic multiplicative noise removal models. We prove that the sequence generated by the DCA algorithm converges to a stationary point, which satisfies the first order optimality condition. Finally, we demonstrate the performance of our whole scheme by numerical examples. A comparison with other methods is provided as well. Numerical results demonstrate that the proposed algorithm significantly outperforms some previous methods for multiplicative Gamma noise removal.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.