期刊
INFORMATION SCIENCES
卷 295, 期 -, 页码 232-246出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2014.10.041
关键词
Image restoration; Convex optimization; Total variation; Overlapping group sparsity; ADMM; MM
资金
- 973 Program [2013CB329404]
- NSFC [61370147, 61170311, 61401172, 11401081]
- Sichuan Province Sci. and Tech. Research Project [2012GZX0080]
- Nature Science Foundation of Jiangsu Province [BK20131209]
- Excellent PhD Fund in UESTC for Overseas Training
Image restoration is one of the most fundamental issues in imaging science. Total variation regularization is widely used in image restoration problems for its capability to preserve edges. In the literature, however, it is also well known for producing staircase artifacts. In this work we extend the total variation with overlapping group sparsity, which we previously developed for one dimension signal processing, to image restoration. A convex cost function is given and an efficient algorithm is proposed for solving the corresponding minimization problem. In the experiments, we compare our method with several state-of-the-art methods. The results illustrate the efficiency and effectiveness of the proposed method in terms of PSNR and computing time. (C) 2014 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据