30 April 2020 in IEEE Transactions on Geoscience and Remote Sensing
Hyperspectral image (HSI) super-resolution refers to enhancing the spatial resolution of a 3-D image with many spectral bands (slices). It is a seriously ill-posed problem when the low-resolution (LR) HSI is the only input. It is better solved by fusing the LR HSI with a high-resolution (HR) multispectral image (MSI) for a 3-D image with both high spectral and spatial resolution. In this article, we propose a novel nonnegative and nonlocal 4-D tensor dictionary learning-based HSI super-resolution model using group-block sparsity. By grouping similar 3-D image cubes into clusters and then conduct super-resolution cluster by cluster using 4-D tensor structure, we not only preserve the structure but also achieve sparsity within the cluster due to the collection of similar cubes. We use 4-D tensor Tucker decomposition and impose nonnegative constraints on the dictionaries and group-block sparsity. Numerous experiments demonstrate that the proposed model outperforms many state-of-the-art HSI super-resolution methods.
1 January 2020 in Inverse Problems and Imaging
Hyperspectral image (HSI) super-resolution is a technique to improve the spatial resolution of a HSI for better visual perception and down stream applications. This is a very ill-posed inverse problem and is often solved by fusing the low-resolution (LR) HSI with a high-resolution (HR) multispectral image (MSI). It is more challenging for blind HSI super-resolution, i.e., when the spatial degradation operators are completely unknown. In this paper, we propose a novel sparse tensor factorization model for the task of blind HSI super-resolution using the spatial non-local self-similarity and spectral global correlation of HSIs. Image clustering method is employed to collect some similar 3D cubes of HSIs which can be formed as some 4D image clusters with high correlation. We conduct cluster wise computation to not only save computation time but also to introduce a non-local regularity originated from the redundancy of cubes. By using the sparsity of tensor decomposition and the low-rank in non-local self-similarity direction underlying 4D similar clusters, we design a sparse tensor regularization term, which preserves the spatial-spectral structural correlation of HSIs. In addition, we present a proximal alternating direction method of multipliers (ADMM) based algorithm to efficiently solve the proposed model. Numerical experiments demonstrate that the proposed model outperforms many state-of-the-art HSI super-resolution methods.
1 January 2018 in Inverse Problems and Imaging
In this paper, we propose a novel image blocks based inpainting model using group sparsity and TV regularization. The block matching method is employed to collect similar image blocks which can be formed as sparse image groups. By reducing the redundant information in these groups, we can well restore textures missing in the inpainting areas. We built a variational framework based on a local SVD operator for block matching and group sparsity. In addition, TV regularization is naturally integrated in the model to reduce artificial effects which are caused by image blocks stacking in the block matching method. Besides, enforcing the sparsity of the representation, the SVD operators in our method are iteratively updated and play the role of dictionary learning. Thus it can greatly improve the quality of the restoration. Moreover, we mathematically show the existence of a minimizer for the proposed inpainting model. Convergence results of the proposed algorithm are also given in the paper. Numerical experiments demonstrate that the proposed model outperforms many benchmark methods such as BM3D based image inpainting.
22 September 2019 in arXiv
We consider the inpainting problem for noisy images. It is very challenge to suppress noise when image inpainting is processed. An image patches based nonlocal variational method is proposed to simultaneously inpainting and denoising in this paper. Our approach is developed on an assumption that the small image patches should be obeyed a distribution which can be described by a high dimension Gaussian Mixture Model. By a maximum a posteriori (MAP) estimation, we formulate a new regularization term according to the log-likelihood function of the mixture model. To optimize this regularization term efficiently, we adopt the idea of the Expectation Maximum (EM) algorithm. In which, the expectation step can give an adaptive weighting function which can be regarded as a nonlocal connections among pixels. Using this fact, we built a framework for non-local image inpainting under noise. Moreover, we mathematically prove the existence of minimizer for the proposed inpainting model. By using a spitting algorithm, the proposed model are able to realize image inpainting and denoising simultaneously. Numerical results show that the proposed method can produce impressive reconstructed results when the inpainting region is rather large.