Algorithm for image restoration based on variation and its convergence
被引:0
作者:
Zhang, Yong-Ping
论文数: 0引用数: 0
h-index: 0
机构:
Dept. of Math., Shanxi Normal Univ., Xi'an 710062, China
Dept. of Comp. Sci., Northwestern Polytech. Univ., Xi'an 710072, ChinaDept. of Math., Shanxi Normal Univ., Xi'an 710062, China
Zhang, Yong-Ping
[1
,3
]
Zheng, Nan-Ning
论文数: 0引用数: 0
h-index: 0
机构:
Inst. of Artificial Intelligence, Xi'an Jiaotong Univ., Xi'an 710049, ChinaDept. of Math., Shanxi Normal Univ., Xi'an 710062, China
Zheng, Nan-Ning
[2
]
Zhao, Rong-Chun
论文数: 0引用数: 0
h-index: 0
机构:
Dept. of Comp. Sci., Northwestern Polytech. Univ., Xi'an 710072, ChinaDept. of Math., Shanxi Normal Univ., Xi'an 710062, China
Zhao, Rong-Chun
[3
]
机构:
[1] Dept. of Math., Shanxi Normal Univ., Xi'an 710062, China
[2] Inst. of Artificial Intelligence, Xi'an Jiaotong Univ., Xi'an 710049, China
[3] Dept. of Comp. Sci., Northwestern Polytech. Univ., Xi'an 710072, China
Algorithms - Convergence of numerical methods - Optimization;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
A new algorithm for edge-preserving image restoration is presented in this paper. The variation based method can be effectively used in the process of non-convex optimization for solving the linear inverse problem. By analyzing the properties of regularization functions and the corresponding energy functional, an optimal expression of regularization function and a new energy functional with binary variables are introduced. Thus the non-convex optimization problem is transformed into a sequence of essentially convex one. The local optimal solution of no-convex optimization problem is then obtained by using a relaxation iterative algorithm. Such algorithm is shown to be globally convergent. Finally, the proposed method is tested on real and synthetic images.