A primal-dual method for the Meyer model of cartoon and texture decomposition

You Wei Wen*, Hai Wei Sun, Kwok Po NG

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

In this paper, we study the original Meyer model of cartoon and texture decomposition in image processing. The model, which is a minimization problem, contains an l1-based TV-norm and an l-based G-norm. The main idea of this paper is to use the dual formulation to represent both TV-norm and G-norm. The resulting minimization problem of the Meyer model can be given as a minimax problem. A first-order primal-dual algorithm can be developed to compute the saddle point of the minimax problem. The convergence of the proposed algorithm is theoretically shown. Numerical results are presented to show that the original Meyer model can decompose better cartoon and texture components than the other testing methods.

Original languageEnglish
Article numbere2224
JournalNumerical Linear Algebra with Applications
Volume26
Issue number2
DOIs
Publication statusPublished - Mar 2019

Scopus Subject Areas

  • Algebra and Number Theory
  • Applied Mathematics

User-Defined Keywords

  • G-norm
  • image decomposition
  • Meyer's model
  • primal-dual algorithm
  • total variation

Fingerprint

Dive into the research topics of 'A primal-dual method for the Meyer model of cartoon and texture decomposition'. Together they form a unique fingerprint.

Cite this