Abstract
The separation of image content into semantic parts plays a vital role in applications such as compression, enhancement, restoration, and more. In recent years, several pioneering works suggested such a separation be based on variational formulation and others using independent component analysis and sparsity. This paper presents a novel method for separating images into texture and piecewise smooth (cartoon) parts, exploiting both the variational and the sparsity mechanisms. The method combines the basis pursuit denoising (BPDN) algorithm and the total-variation (TV) regularization scheme. The basic idea presented in this paper is the use of two appropriate dictionaries, one for the representation of textures and the other for the natural scene parts assumed to be piecewise smooth. Both dictionaries are chosen such that they lead to sparse representations over one type of image-content (either texture or piecewise smooth). The use of the BPDN with the two amalgamed dictionaries leads to the desired separation, along with noise removal as a by-product. As the need to choose proper dictionaries is generally hard, a TV regularization is employed to better direct the separation process and reduce ringing artifacts. We present a highly efficient numerical scheme to solve the combined optimization problem posed by our model and to show several experimental results that validate the algorithm's performance.
Keywords
Affiliated Institutions
Related Publications
Stable recovery of sparse overcomplete representations in the presence of noise
Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in ...
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
We address the image denoising problem, where zero-mean white and homogeneous Gaussian additive noise is to be removed from a given image. The approach taken is based on sparse ...
Image Decomposition and Restoration Using Total Variation Minimization and the<i>H</i><sup>1</sup>
In this paper, we propose a new model for image restoration and image decomposition into cartoon and texture, based on the total variation minimization of Rudin, Osher, and Fate...
Dictionary Learning Algorithms for Sparse Representation
Algorithms for data-driven learning of domain-specific overcomplete dictionaries are developed to obtain maximum likelihood and maximum a posteriori dictionary estimates based o...
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single-image super-resolution, based on sparse signal representation. Research on image statistics suggests that image patches can be well-...
Publication Info
- Year
- 2005
- Type
- article
- Volume
- 14
- Issue
- 10
- Pages
- 1570-1582
- Citations
- 977
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/tip.2005.852206