Block Decomposition Methods for Total Variation by Primal–Dual Stitching

被引:1
|
作者
Chang-Ock Lee
Jong Ho Lee
Hyenkyun Woo
Sangwoon Yun
机构
[1] KAIST,Department of Mathematical Sciences
[2] Samsung SDS,Department of Mathematics Education
[3] School of Liberal Arts and HRD,undefined
[4] Korea University of Technology and Education,undefined
[5] Sungkyunkwan University,undefined
来源
关键词
Total variation; Block decomposition; Primal–dual stitching; Domain decomposition; Pseudo explicit method; Primal–dual optimization; 49M27; 65Y05; 65K10; 68U10;
D O I
暂无
中图分类号
学科分类号
摘要
Due to the advance of image capturing devices, huge size of images are available in our daily life. As a consequence the processing of large scale image data is highly demanded. Since the total variation (TV) is kind of de facto standard in image processing, we consider block decomposition methods for TV based variational models to handle large scale images. Unfortunately, TV is non-separable and non-smooth and it thus is challenging to solve TV based variational models in a block decomposition. In this paper, we introduce a primal–dual stitching (PDS) method to efficiently process the TV based variational models in the block decomposition framework. To characterize TV in the block decomposition framework, we only focus on the proximal map of TV function. Empirically, we have observed that the proposed PDS based block decomposition framework outperforms other state-of-art methods such as Bregman operator splitting based approach in terms of computational speed.
引用
收藏
页码:273 / 302
页数:29
相关论文
共 50 条