Domain decomposition methods with graph cuts algorithms for total variation minimization
Recently, graph cuts algorithms have been used to solve variational image restoration problems, especially for noise removal and segmentation. Compared to time-marching PDE methods, graph cuts based methods are more efficient and able to obtain the global minimizer. However, for high resolution and...
Main Authors: | Duan, Yuping, Tai, Xue Cheng |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/98057 http://hdl.handle.net/10220/12328 |
Similar Items
-
A nonlinear multigrid method for total variation minimization from image restoration
by: Chen, Ke, et al.
Published: (2009) -
Augmented Lagrangian method for total variation based image restoration and segmentation over triangulated surfaces
by: Tai, Xue Cheng, et al.
Published: (2013) -
Convergence rate analysis of an asynchronous space decomposition method for convex minimization
by: Tai, Xue Cheng, et al.
Published: (2009) -
Domain decomposition methods--algorithms and theory /
by: 257391 Toselli, Andrea, et al.
Published: (2005) -
A projection-domain iterative algorithm for metal artifact reduction by minimizing the total-variation norm and the negative-pixel energy
by: Gengsheng L. Zeng
Published: (2022-01-01)