摘要
In this paper,we propose a generalized penalization technique and a convex constraint minimization approach for the p-harmonic flow problem following the ideas in[Kang&March,IEEE T.Image Process.,16(2007),2251–2261].We use fast algorithms to solve the subproblems,such as the dual projection methods,primal-dual methods and augmented Lagrangian methods.With a special penalization term,some special algorithms are presented.Numerical experiments are given to demonstrate the performance of the proposed methods.We successfully show that our algorithms are effective and efficient due to two reasons:the solver for subproblem is fast in essence and there is no need to solve the subproblem accurately(even 2 inner iterations of the subproblem are enough).It is also observed that better PSNR values are produced using the new algorithms.
基金
The authors’research was supported by MOE IDM project NRF2007IDM-IDM002-010,Singapore
The first author was partially supported by PHD Program Scholarship Fund of ECNU with Grant No.2010026
Overseas Research Fund of East China Normal University,China.Discussions with Dr.Zhifeng Pang,Dr.Haixia Liang and Dr.Yuping Duan are helpful.
