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 |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2013
|
在線閱讀: | https://hdl.handle.net/10356/98057 http://hdl.handle.net/10220/12328 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
A nonlinear multigrid method for total variation minimization from image restoration
由: Chen, Ke, et al.
出版: (2009) -
Augmented Lagrangian method for total variation based image restoration and segmentation over triangulated surfaces
由: Tai, Xue Cheng, et al.
出版: (2013) -
GRAPH CUT METHODS FOR MINIMIZING CURVATURE DEPENDENT FUNCTIONS
由: TAY JUN WEN
出版: (2021) -
Convergence rate analysis of an asynchronous space decomposition method for convex minimization
由: Tai, Xue Cheng, et al.
出版: (2009) -
Efficient total variation minimization methods for color image restoration
由: Wen, Y.-W., et al.
出版: (2014)