Hyperspectral image destriping is a challenging and promising theme in remote sensing. Striping noise is a ubiquitous phenomenon in hyperspectral imagery, which may severely degrade the visual quality. A variety of methods have been proposed to effectively alleviate the effects of the striping noise. However, most of them fail to take full advantage of the high spectral correlation between the observation subimages in distinct bands and consider the local manifold structure of the hyperspectral data space. In order to remedy this drawback, in this paper, a novel graph-regularized low-rank representation (LRR) destriping algorithm is proposed by incorporating the LRR technique. To obtain desired destriping performance, two sides of performing destriping are included: 1) To exploit the high spectral correlation between the observation subimages in distinct bands, the technique of LRR is first utilized for destriping, and 2) to preserve the intrinsic local structure of the original hyperspectral data, the graph regularizer is incorporated in the objective function. The experimental results and quantitative analysis demonstrate that the proposed method can both remove striping noise and achieve cleaner and higher contrast reconstructed results.

Graph-Regularized Low-Rank Representation for Destriping of Hyperspectral Images

Long-term and fine-scale satellite monitoring of the urban heat island effect by the fusion of multi-temporal and multi-sensor remote sensed data: A 26-year case study of the city of Wuhan in China

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.

/pdf/a-map-based-algorithm-for-destriping-and-inpainting-of-23oz2qxiaj.pdf

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

Hyperspectral remote sensing is based on measuring the scattered and reflected electromagnetic signals from the Earth’s surface emitted by the Sun. The received radiance at the sensor is usually degraded by atmospheric effects and instrumental (sensor) noises which include thermal (Johnson) noise, quantization noise, and shot (photon) noise. Noise reduction is often considered as a preprocessing step for hyperspectral imagery. In the past decade, hyperspectral noise reduction techniques have evolved substantially from two dimensional bandwise techniques to three dimensional ones, and varieties of low-rank methods have been forwarded to improve the signal to noise ratio of the observed data. Despite all the developments and advances, there is a lack of a comprehensive overview of these techniques and their impact on hyperspectral imagery applications. In this paper, we address the following two main issues; (1) Providing an overview of the techniques developed in the past decade for hyperspectral image noise reduction; (2) Discussing the performance of these techniques by applying them as a preprocessing step to improve a hyperspectral image analysis task, i.e., classification. Additionally, this paper discusses about the hyperspectral image modeling and denoising challenges. Furthermore, different noise types that exist in hyperspectral images have been described. The denoising experiments have confirmed the advantages of the use of low-rank denoising techniques compared to the other denoising techniques in terms of signal to noise ratio and spectral angle distance. In the classification experiments, classification accuracies have improved when denoising techniques have been applied as a preprocessing step.

https://www.mdpi.com/2072-4292/10/3/482/pdf

Noise Reduction in Hyperspectral Imagery: Overview and Application

Multispectral remote sensing images often suffer from the common problem of stripe noise, which greatly degrades the imaging quality and limits the precision of the subsequent processing. The conventional destriping approaches usually remove stripe noise band by band, and show their limitations on different types of stripe noise. In this paper, we tentatively categorize the stripes in remote sensing images in a more comprehensive manner. We propose to treat the multispectral images as a spectral-spatial volume and pose an anisotropic spectral-spatial total variation regularization to enhance the smoothness of solution along both the spectral and spatial dimension. As a result, a more comprehensive stripes and random noise are perfectly removed, while the edges and detail information are well preserved. In addition, the split Bregman iteration method is employed to solve the resulting minimization problem, which highly reduces the computational load. We extensively validate our method under various stripe categories and show comparison with other approaches with respect to result quality, running time, and quantitative assessments.

Anisotropic Spectral-Spatial Total Variation Model for Multispectral Remote Sensing Image Destriping

Image destriping is necessary due to sensor-to-sensor variation within instruments. This has most often been done by assuming that each sensor views a statistically similar subimage, and a histogram of each sensor's response is made to match the overall histogram. Histogram matching shows sensitivity to violations of the similarity assumption. An alternative algorithm is suggested which matches the gain and offset of each sensor to typical values, and which is resistant to the effects of outliers. Tests on a sample image show the moment matching algorithm reduces the variance between sensors to a greater degree than histogram matching.

F. L. Gadallah

Papers

Destriping multisensor imagery with moment matching