科研之友
微信
新浪微博
Facebook
分享链接
摘要
A new majorization-minimization framework for - image restoration is presented. The solution is sought in a generalized Krylov subspace that is build up during the solution process. Proof of convergence to a stationary point of the minimized - functional is provided for both convex and nonconvex problems. Computed examples illustrate that high-quality restorations can be determined with a modest number of iterations and that the storage requirement of the method is not very large. A comparison with related methods shows the competitiveness of the method proposed.
- 出版日期2017-6
- 单位成都理工大学
