Journal
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS
Volume 26, Issue 2, Pages -Publisher
WILEY
DOI: 10.1002/nla.2224
Keywords
G-norm; image decomposition; Meyer's model; primal-dual algorithm; total variation
Categories
Funding
- NSFC [11871210]
- Construct Program of the Key Discipline in Hunan Province
- Scientific Research Fund of Hunan Provincial Education Department [17A128]
- HKRGC GRF [1202715, 12306616, 12200317, 12300218, HKBU RC-ICRS/16-17/03]
Ask authors/readers for more resources
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 l(1)-based TV-norm and an l(infinity)-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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available