Abstract

We propose a novel image decomposition method to decompose an image into its cartoon and texture components. To exploit the nonlocal self-similarity of cartoon-plus-texture images, we construct groups by stacking together similar image patches into 3-D arrays and consider group as the basic unit of decomposition. We decompose each group via a convex optimization model consisting of 3-D cartoon and texture priors. These priors characterize the local properties of the cartoon and texture components and the nonlocal similarity within each component in a unified and natural manner. We develop the alternating direction method of multipliers (ADMM) to efficiently solve the proposed model. For further improvement, we investigate an adaptive rule for the estimation of the regularization parameter. The proposed method is also extended to tackle noisy images. Numerical experiments confirm that the performance of the proposed method is competitive with some of the state-of-the-art schemes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.