A convex total generalized variation regularized model for multiplicative noise and blur removal

详细信息    查看全文

• 作者：Mu-Ga Shama ^{1262406794@qq.com" class="auth_mail" title="E-mail the corresponding author} ; Ting-Zhu Huang ; ^{tingzhuhuang@126.com" class="auth_mail" title="E-mail the corresponding author} ; ^{tzhuang@uestc.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Jun Liu ; Si Wang
• 关键词：Convex optimization ; Total generalized variation ; Blur removal ; Multiplicative noise ; Primal-dual algorithm
• 刊名：Applied Mathematics and Computation
• 出版年：2016
• 出版时间：5 March 2016
• 年：2016
• 卷：276
• 期：Complete
• 页码：109-121
• 全文大小：3517 K

文摘

Multiplicative noise and blur corruptions usually happen in coherent imaging systems, such as the synthetic aperture radar. Total variation regularized multiplicative noise and blur removal models have been widely studied in the literature, which can preserve sharp edges of the recovered images. However, the images recovered from the total variation based models usually suffer from staircase effects. To overcome this deficiency, we propose a total generalized variation regularized convex optimization model. The resulting objective function involves the total generalized variation regularization term, the MAP based data fitting term and a quadratic penalty term which is based on the statistical property of the noise. Indeed, the MAP estimated data fitting term in the multiplicative noise and blur removal model is nonconvex. Under a mild condition, the quadratic penalty term makes the objective function convex. A primal-dual algorithm is developed to solve the minimization problem. Numerical experiments show that the proposed method outperforms some state-of-the-art methods.