Block Decomposition Methods for Total Variation by Primal-Dual Stitching

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 257
  • Download : 0
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
Publisher
SPRINGER/PLENUM PUBLISHERS
Issue Date
2016-07
Language
English
Article Type
Article
Keywords

SUBSPACE CORRECTION METHODS; LINEAR INVERSE PROBLEMS; DOMAIN DECOMPOSITION; IMAGE-RESTORATION; DESCENT METHOD; MINIMIZATION; NONSMOOTH; CONVERGENCE; ALGORITHMS; MODEL

Citation

JOURNAL OF SCIENTIFIC COMPUTING, v.68, no.1, pp.273 - 302

ISSN
0885-7474
DOI
10.1007/s10915-015-0138-9
URI
http://hdl.handle.net/10203/212390
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0