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...
Saved in:
Main Authors: | Duan, Yuping, Tai, Xue Cheng |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/98057 http://hdl.handle.net/10220/12328 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
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) -
GRAPH CUT METHODS FOR MINIMIZING CURVATURE DEPENDENT FUNCTIONS
by: TAY JUN WEN
Published: (2021) -
Convergence rate analysis of an asynchronous space decomposition method for convex minimization
by: Tai, Xue Cheng, et al.
Published: (2009) -
Efficient total variation minimization methods for color image restoration
by: Wen, Y.-W., et al.
Published: (2014)