Image Cartoon-texture Decomposition Research Articles

Low-Dose CT Denoising Algorithm Based on Image Cartoon Texture Decomposition

Low-Dose CT Denoising Algorithm Based on Image Cartoon Texture Decomposition

Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method

Image cartoon-texture decomposition is an important problem in image processing. In recent years, by exploiting low-rank priors of images, low-rank minimization methods have been widely adopted for image cartoon-texture decomposition. Since matrix rank minimization is an NP-hard problem, the convex nuclear norm is often used as a substitute for the matrix’s rank to realize the low-rank minimization methods. In this paper, we utilize a generalized non-convex surrogate of the matrix rank function to develop a novel low-rank minimization model for image cartoon-texture decomposition. We design a proximal alternating algorithm to solve the non-convex model and further demonstrate the global convergence of the algorithm. Numerical experiments illustrate that the proposed method can show much better performances than the existing state-of-the-art methods for image cartoon-texture decomposition.

Compressed sensing MRI based on image decomposition model and group sparsity

The image representation plays an important role in compressed sensing magnetic resonance imaging (CSMRI). However, how to adaptive sparsely represent images is a challenge for accurately reconstructing magnetic resonance (MR) images from highly undersampled data with noise. In order to further improve the reconstruction quality of the MR image, this paper first proposes tight frame-based group sparsity (TFGS) regularization that can capture the structure information of images appropriately, then TFGS regularization is employed to the image cartoon-texture decomposition model to construct CSMRI algorithm, termed cartoon-texture decomposition CSMRI algorithm (CD-MRI). CD-MRI effectively integrates the total variation and TFGS regularization into the image cartoon-texture decomposition framework, and utilizes the sparse priors of image cartoon and texture components to reconstruct MR images. Virtually, CD-MRI exploits the global sparse representations of image cartoon components by the total variation regularization, and explores group sparse representations of image texture components via the adaptive tight frame learning technique and group sparsity regularization. The alternating iterative method combining with the majorization-minimization algorithm is applied to solve the formulated optimization problem. Finally, simulation experiments demonstrate that the proposed algorithm can achieve high-quality MR image reconstruction from undersampled K-space data, and can remove noise in different sampling schemes. Compared to the previous CSMRI algorithms, the proposed approach can lead to better image reconstruction performance and better robustness to noise.

A Novel Multi-Exposure Image Fusion Method Based on Adaptive Patch Structure.

Multi-exposure image fusion methods are often applied to the fusion of low-dynamic images that are taken from the same scene at different exposure levels. The fused images not only contain more color and detailed information, but also demonstrate the same real visual effects as the observation by the human eye. This paper proposes a novel multi-exposure image fusion (MEF) method based on adaptive patch structure. The proposed algorithm combines image cartoon-texture decomposition, image patch structure decomposition, and the structural similarity index to improve the local contrast of the image. Moreover, the proposed method can capture more detailed information of source images and produce more vivid high-dynamic-range (HDR) images. Specifically, image texture entropy values are used to evaluate image local information for adaptive selection of image patch size. The intermediate fused image is obtained by the proposed structure patch decomposition algorithm. Finally, the intermediate fused image is optimized by using the structural similarity index to obtain the final fused HDR image. The results of comparative experiments show that the proposed method can obtain high-quality HDR images with better visual effects and more detailed information.

A novel multi-modality image fusion method based on image decomposition and sparse representation

Multi-modality image fusion is an effective technique to fuse the complementary information from multi-modality images into an integrated image. The additional information can not only enhance visibility to human eyes, but also mutually complement the limitations of each image. To preserve the structure information and perform the detailed information of source images, a novel image fusion scheme based on image cartoon-texture decomposition and sparse representation is proposed. In proposed image fusion method, source multi-modality images are decomposed into cartoon and texture components. For cartoon components a proper spatial-based method is presented for morphological structure preservation. An energy based fusion rule is used to preserve structure information of each source image. For texture components, a sparse-representation based method is proposed. A dictionary with strong representation ability is trained for the proposed sparse-representation based fusion method. Finally, according to the texture enhancement fusion rule, the fused cartoon and texture components are integrated. The experimentation results have clearly shown that the proposed method outperforms the state-of-art methods, in terms of visual and quantitative evaluations.

A novel multi-focus image fusion approach based on image decomposition

Multi-focus image fusion is an effective technique to integrate the relevant information from a set of images with the same scene, into a comprehensive image. The fused image would be more informative than any of the source images. In this paper, a novel fusion scheme based on image cartoon-texture decomposition is proposed. Multi-focus source images are decomposed into cartoon content and texture content by an improved iterative re-weighted decomposition algorithm. It can achieve rapid convergence and naturally approximates the morphological structure components. The proper fusion rules are constructed to fuse the cartoon content and the texture content, respectively. Finally, the fused cartoon and texture components are combined to obtain the all-in-focus image. This fusion processing can preserve morphological structure information from source images and performs few artifacts or additional noise. Our experimental results have clearly shown that the proposed algorithm outperforms many state-of-the-art methods, in terms of visual and quantitative evaluations.

Image Zooming Based on Cartoon and Texture Decomposition

A new algorithm for image zooming based on cartoon and texture decomposition is presented in this paper. The basic idea is to first decompose the image into cartoon and texture, and then zoom each part separately with different image zooming algorithms. Finally, the zoomed images will be synthesized into one image. The zoomed parts of the image are found by minimizing the different variational functional in the wavelet domain which use the Besov norm to measure the regularity of the parts. Unlike the traditional image zooming by interpolation, the variation model and image cartoon-texture decomposition is incorporated in the zooming algorithm. Experimental results have verified the validity of the new algorithm.

Image Zooming Based on Cartoon and Texture Decomposition

A new algorithm for image zooming based on cartoon and texture decomposition is presented in this paper. The basic idea is to first decompose the image into cartoon and texture, and then zoom each part separately with different image zooming algorithms. Finally, the zoomed images will be synthesized into one image. The zoomed parts of the image are found by minimizing the different variational functional in the wavelet domain which use the Besov norm to measure the regularity of the parts. Unlike the traditional image zooming by interpolation, the variation model and image cartoon-texture decomposition is incorporated in the zooming algorithm. Experimental results have verified the validity of the new algorithm.