Abstract
We consider the task of image decomposition and we introduce a new model coined directional global three-part decomposition (DG3PD) for solving it. As key ingredients of the DG3PD model, we introduce a discrete multi-directional total variation norm and a discrete multi-directional G-norm. Using these novel norms, the proposed discrete DG3PD model can decompose an image into two parts or into three parts. Existing models for image decomposition by Vese and Osher, by Aujol and Chambolle, by Starck et al., and by Thai and Gottschlich are included as special cases in the new model. Decomposition of an image by DG3PD results in a cartoon image, a texture image and a residual image. Advantages of the DG3PD model over existing ones lie in the properties enforced on the cartoon and texture images. The geometric objects in the cartoon image have a very smooth surface and sharp edges. The texture image yields oscillating patterns on a defined scale which is both smooth and sparse. Moreover, the DG3PD method achieves the goal of perfect reconstruction by summation of all components better than the other considered methods. Relevant applications of DG3PD are a novel way of image compression as well as feature extraction for applications such as latent fingerprint processing and optical character recognition.
Highlights
Feature extraction, denoising, and image compression are key issues in computer vision and image processing
7.3 Compression Based on the DG3PD model, we propose a novel approach to image compression
8 Conclusions The DG3PD model is a novel method for three-part image decomposition
Summary
Feature extraction, denoising, and image compression are key issues in computer vision and image processing. Based on these observations, we define the following goals:. Efficient representations of the cartoon image u and texture image v exist We extend it into multi-direction L with the discrete directional gradient operator (1):
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have