Abstract
We study the simultaneous cartoon and texture reconstruction problem. We propose a new model to approximate the cartoon and texture part by a sparse linear combination of some bases. A bivariate function is employed as the cost function. One of the variables is the decomposition image and the other is the sparse representation of the decomposition image. An alternating minimization algorithm is used to solve the minimization problem. We prove that the algorithm converges for both the l1-norm and the l0-norm. Numerical simulations are given to illustrate the efficiency of our method.
Original language | English |
---|---|
Pages (from-to) | 1275-1289 |
Number of pages | 15 |
Journal | Applicable Analysis |
Volume | 90 |
Issue number | 8 |
Early online date | 22 Sept 2010 |
DOIs | |
Publication status | Published - Aug 2011 |
Externally published | Yes |
Funding
Research supported in part by NSFC Grant No. 60702030, NSF of Guangdong Grant No. 9251064201000009, CUHK400508 and the Wavelets and Information Processing Programme of the Centre for Wavelets, Approximation and Information Processing and Temasek Laboratories, National University of Singapore, Singapore.
Keywords
- Cartoon
- Image
- Sparse
- Texture
- Total variation