Please use this identifier to cite or link to this item:
|dc.title||A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems|
|dc.identifier.citation||Krishnan, D., Pham, Q.V., Yip, A.M. (2009-10). A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems. Advances in Computational Mathematics 31 (1-3) : 237-266. ScholarBank@NUS Repository. https://doi.org/10.1007/s10444-008-9101-8|
|dc.description.abstract||In this paper, we propose a fast primal-dual algorithm for solving bilaterally constrained total variation minimization problems which subsume the bilaterally constrained total variation image deblurring model and the two-phase piecewise constant Mumford-Shah image segmentation model. The presence of the bilateral constraints makes the optimality conditions of the primal-dual problem semi-smooth which can be solved by a semi-smooth Newton's method superlinearly. But the linear system to solve at each iteration is very large and difficult to precondition. Using a primal-dual active-set strategy, we reduce the linear system to a much smaller and better structured one so that it can be solved efficiently by conjugate gradient with an approximate inverse preconditioner. Locally superlinear convergence results are derived for the proposed algorithm. Numerical experiments are also provided for both deblurring and segmentation problems. In particular, for the deblurring problem, we show that the addition of the bilateral constraints to the total variation model improves the quality of the solutions. © 2008 Springer Science+Business Media, LLC.|
|dc.subject||Semi-smooth Newton's method|
|dc.description.sourcetitle||Advances in Computational Mathematics|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Jan 24, 2022
WEB OF SCIENCETM
checked on Jan 17, 2022
checked on Jan 20, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.