Huanfeng Shen

Hyperspectral Image Denoising Employing a Spectral–Spatial Adaptive Total Variation Model

The amount of noise included in a hyperspectral image limits its application and has a negative impact on hyperspectral image classification, unmixing, target detection, and so on. In hyperspectral images, because the noise intensity in different bands is different, to better suppress the noise in the high-noise-intensity bands and preserve the detailed information in the low-noise-intensity bands, the denoising strength should be adaptively adjusted with the noise intensity in the different bands. Meanwhile, in the same band, there exist different spatial property regions, such as homogeneous regions and edge or texture regions; to better reduce the noise in the homogeneous regions and preserve the edge and texture information, the denoising strength applied to pixels in different spatial property regions should also be different. Therefore, in this paper, we propose a hyperspectral image denoising algorithm employing a spectral-spatial adaptive total variation (TV) model, in which the spectral noise differences and spatial information differences are both considered in the process of noise reduction. To reduce the computational load in the denoising process, the split Bregman iteration algorithm is employed to optimize the spectral-spatial hyperspectral TV model and accelerate the speed of hyperspectral image denoising. A number of experiments illustrate that the proposed approach can satisfactorily realize the spectral-spatial adaptive mechanism in the denoising process, and superior denoising results are produced.

Hyperspectral Image Restoration Using Low-Rank Matrix Recovery

Hyperspectral images (HSIs) are often degraded by a mixture of various kinds of noise in the acquisition process, which can include Gaussian noise, impulse noise, dead lines, stripes, and so on. This paper introduces a new HSI restoration method based on low-rank matrix recovery (LRMR), which can simultaneously remove the Gaussian noise, impulse noise, dead lines, and stripes. By lexicographically ordering a patch of the HSI into a 2-D matrix, the low-rank property of the hyperspectral imagery is explored, which suggests that a clean HSI patch can be regarded as a low-rank matrix. We then formulate the HSI restoration problem into an LRMR framework. To further remove the mixed noise, the “Go Decomposition” algorithm is applied to solve the LRMR problem. Several experiments were conducted in both simulated and real data conditions to verify the performance of the proposed LRMR-based HSI restoration method.

A Total Variation Regularization Based Super-Resolution Reconstruction Algorithm for Digital Video

Super-resolution (SR) reconstruction technique is capable of producing a high-resolution image from a sequence of low-resolution images. In this paper, we study an efficient SR algorithm for digital video. To effectively deal with the intractable problems in SR video reconstruction, such as inevitable motion estimation errors, noise, blurring, missing regions, and compression artifacts, the total variation (TV) regularization is employed in the reconstruction model. We use the fixed-point iteration method and preconditioning techniques to efficiently solve the associated nonlinear Euler-Lagrange equations of the corresponding variational problem in SR. The proposed algorithm has been tested in several cases of motion and degradation. It is also compared with the Laplacian regularization-based SR algorithm and other TV-based SR algorithms. Experimental results are presented to illustrate the effectiveness of the proposed algorithm.

A MAP-Based Algorithm for Destriping and Inpainting of Remotely Sensed Images

Remotely sensed images often suffer from the common problems of stripe noise and random dead pixels. The techniques to recover a good image from the contaminated one are called image destriping (for stripes) and image inpainting (for dead pixels). This paper presents a maximum a posteriori (MAP)-based algorithm for both destriping and inpainting problems. The main advantage of this algorithm is that it can constrain the solution space according to a priori knowledge during the destriping and inpainting processes. In the MAP framework, the likelihood probability density function (PDF) is constructed based on a linear image observation model, and a robust Huber-Markov model is used as the prior PDF. The gradient descent optimization method is employed to produce the desired image. The proposed algorithm has been tested using moderate resolution imaging spectrometer images for destriping and China-Brazil Earth Resource Satellite and QuickBird images for simulated inpainting. The experiment results and quantitative analyses verify the efficacy of this algorithm.

A super-resolution reconstruction algorithm for surveillance images

In many surveillance video applications, it is of interest to recognize a region of interest (ROI), which often occupies a small portion of a low-resolution, noisy video. This paper proposes an edge-preserving maximum a posteriori (MAP) estimation based super-resolution algorithm using a weighted directional Markov image prior model for a ROI from more than one low-resolution surveillance image. Conjugate gradient (CG) optimization based on standard operations on images is then developed to improve the computational efficiency of the algorithm. The proposed algorithm is tested on different series of surveillance images. The experimental results indicate that the proposed algorithm has considerable effectiveness in terms of both objective measurements and visual evaluation.

A super-resolution reconstruction algorithm for hyperspectral images

The spatial resolution of a hyperspectral image is often coarse because of the limitations of the imaging hardware. Super-resolution reconstruction (SRR) is a promising signal post-processing technique for hyperspectral image resolution enhancement. This paper proposes a maximum a posteriori (MAP) based multi-frame super-resolution algorithm for hyperspectral images. Principal component analysis (PCA) is utilized in both parts of the proposed algorithm: motion estimation and image reconstruction. A simultaneous motion estimation method with the first few principal components, which contain most of the information of a hyperspectral image, is proposed to reduce computational load and improve motion field accuracy. In the image reconstruction part, different image resolution enhancement techniques are applied to different groups of components, to reduce computational load and simultaneously remove noise. The proposed algorithm is tested on both synthetic images and real image sequences. The experimental results and comparative analyses verify the effectiveness of this algorithm.

Multiframe Super-Resolution Employing a Spatially Weighted Total Variation Model

Total variation (TV) has been used as a popular and effective image prior model in regularization-based image processing fields, such as denoising, deblurring, super-resolution (SR), and others, because of its ability to preserve edges. However, as the TV model favors a piecewise constant solution, the processing results in the flat regions of the image being poor, and it cannot automatically balance the processing strength between different spatial property regions in the image. In this paper, we propose a spatially weighted TV image SR algorithm, in which the spatial information distributed in different image regions is added to constrain the SR process. A newly proposed and effective spatial information indicator called difference curvature is used to identify the spatial property of each pixel, and a weighted parameter determined by the difference curvature information is added to constrain the regularization strength of the TV regularization at each pixel. Meanwhile, a majorization-minimization algorithm is used to optimize the proposed spatially weighted TV SR model. Finally, a significant amount of simulated and real data experimental results show that the proposed spatially weighted TV SR algorithm not only efficiently reduces the “artifacts” produced with a TV model in fat regions of the image, but also preserves the edge information, and the reconstruction results are less sensitive to the regularization parameters than the TV model, because of the consideration of the spatial information constraint.

Total-Variation-Regularized Low-Rank Matrix Factorization for Hyperspectral Image Restoration

In this paper, we present a spatial spectral hyperspectral image (HSI) mixed-noise removal method named total variation (TV)-regularized low-rank matrix factorization (LRTV). In general, HSIs are not only assumed to lie in a low-rank subspace from the spectral perspective but also assumed to be piecewise smooth in the spatial dimension. The proposed method integrates the nuclear norm, TV regularization, and L1-norm together in a unified framework. The nuclear norm is used to exploit the spectral low-rank property, and the TV regularization is adopted to explore the spatial piecewise smooth structure of the HSI. At the same time, the sparse noise, which includes stripes, impulse noise, and dead pixels, is detected by the L1-norm regularization. To tradeoff the nuclear norm and TV regularization and to further remove the Gaussian noise of the HSI, we also restrict the rank of the clean image to be no larger than the number of endmembers. A number of experiments were conducted in both simulated and real data conditions to illustrate the performance of the proposed LRTV method for HSI restoration.

Adjustable Model-Based Fusion Method for Multispectral and Panchromatic Images

In this paper, an adjustable model-based image fusion method for multispectral (MS) and panchromatic (PAN) images is developed. The relationships of the desired high spatial resolution (HR) MS images to the observed low-spatial-resolution MS images and HR PAN image are formulated with image observation models. The maximum a posteriori framework is employed to describe the inverse problem of image fusion. By choosing particular probability density functions, the fused HR MS images are solved using a gradient descent algorithm. In particular, two functions are defined to adaptively determine most regularization parameters using the partially fused results at each iteration, retaining one parameter to adjust the tradeoff between the enhancement of spatial information and the maintenance of spectral information. The proposed method has been tested using QuickBird and IKONOS images and compared to several known fusion methods using quantitative evaluation indices. The experimental results verify the efficacy of this method.

A Practical Compressed Sensing-Based Pan-Sharpening Method

High-resolution multispectral (HRM) images are widely used in many remote sensing applications. Using the pan-sharpening technique, a low-resolution multispectral (LRM) image and a high-resolution panchromatic (HRP) image can be fused to an HRM image. This letter proposes a new compressed sensing (CS)-based pan-sharpening method which views the image observation model as a measurement process in the CS theory and constructs a joint dictionary from LRM and HRP images in which the HRM is sparse. The novel joint dictionary makes the method practical in fusing real remote sensing images, and a tradeoff parameter is added in the image observation model to improve the results. The proposed algorithm is tested on simulated and real IKONOS images, and it results in improved image quality compared to other well-known methods in terms of both objective measurements and visual evaluation.