RMSE AND SRE VALUES OF UNMIXING RESULTS FOR SD2 IN THE PRESENCE OF GAUSSIAN NOISE (RMSE×10 −3 ).

RMSE AND SRE VALUES OF UNMIXING RESULTS FOR SD2 IN THE PRESENCE OF GAUSSIAN NOISE (RMSE×10 −3 ).

Source publication
Article
Full-text available
Sparse hyperspectral unmixing aims at finding the sparse fractional abundance vector of a spectral signature present in a mixed pixel. However, there are several types of noise present in the hyperspectral images. These are called mixed noise including stripes, impulse noise and Gaussian noise which deteriorate the performance of sparse unmixing al...

Context in source publication

Context 1
... adjusted the parameters of SNDeUn-Un and all compared algorithms to their best performances in terms of the RMSE. Table 2 reports the SRE and RMSE values of SNDeUn-Un. It can be observed clearly that SNDeUn-Un has best performances at all noise levels. ...

Similar publications

Article
Full-text available
Hyperspectral images (HSIs) are a powerful tool to classify the elements from an area of interest by their spectral signature. In this paper, we propose an efficient method to classify hyperspectral data using Voronoi diagrams and strong patterns in the absence of ground truth. HSI processing consumes a great deal of computing resources because HSI...

Citations

... Ince et. al propose a coupled unmixing and denoising method [17] to enhance the unmixing performance. Joint-sparse blocks and low-rank unmixing (JSpBLRU) [18] divides the abundance matrix into blocks and solves a joint-sparse regression problem to enhance the sparsity of each block. ...
Preprint
We propose a superpixel weighted low-rank and sparse unmixing (SWLRSU) method for sparse unmixing. The proposed method consists of two steps. In the first step, we segment hyperspectral image into superpixels which are defined as the homogeneous regions with different shape and sizes according to the spatial structure. Then, an efficient method is proposed to obtain a spatial weight term using superpixels to capture the spatial structure of hyperspectral data. In the second step, we solve a superpixel guided low-rank and spatially weighted sparse approximation problem in which spatial weight term obtained in the first step is used as a weight term in sparsity promoting norm. This formulation exploits the spatial correlation of the pixels in the hyperspectral image efficiently, which yields satisfactory unmixing results. The experiments are conducted on simulated and real data sets to show the effectiveness of the proposed method.
... Therefore, some techniques extract endmembers from class averages defined by ground truth information [83] or from a library of endmembers [84]. Some methods were developed for performing the denoising and unmixing in a unified framework for boosting the performance of each other [85], [86]. Recently, Block-Gaussian-Mixture Priors have been proposed for both hyperspectral denoising and inpainting [87]. ...
Preprint
Full-text available
Remote sensing provides valuable information about objects or areas from a distance in either active (e.g., RADAR and LiDAR) or passive (e.g., multispectral and hyperspectral) modes. The quality of data acquired by remotely sensed imaging sensors (both active and passive) is often degraded by a variety of noise types and artifacts. Image restoration, which is a vibrant field of research in the remote sensing community, is the task of recovering the true unknown image from the degraded observed image. Each imaging sensor induces unique noise types and artifacts into the observed image. This fact has led to the expansion of restoration techniques in different paths according to each sensor type. This review paper brings together the advances of image restoration techniques with particular focuses on synthetic aperture radar and hyperspectral images as the most active sub-fields of image restoration in the remote sensing community. We, therefore, provide a comprehensive, discipline-specific starting point for researchers at different levels (i.e., students, researchers, and senior researchers) willing to investigate the vibrant topic of data restoration by supplying sufficient detail and references. Additionally, this review paper accompanies a toolbox to provide a platform to encourage interested students and researchers in the field to further explore the restoration techniques and fast-forward the community. The toolboxes are provided in https://github.com/ImageRestorationToolbox.
... Such data, however, are often contaminated by stripe noise, which is mainly due to differences in the nonuniform response of individual detectors, calibration error, dark currents, and so on [4]- [6]. Stripe noise not only degrades visual quality but also seriously affects subsequent processing, such as unmixing [7], [8], classification [9], [10], and target recognition [11]. Therefore, stripe noise removal, i.e., destriping, has been an important research topic in remote sensing and related fields. ...
Preprint
Full-text available
This paper proposes an effective and efficient destriping method based on zero-gradient constraints, which are compatible with various regularization functions. Removing stripe noise, i.e., destriping, from three-dimensional (3D) imaging data is an essential task in terms of visual quality and subsequent processing. Stripe noise has flat structures in the vertical and temporal directions, meaning that the vertical and temporal gradients are equal to zero. Exploiting this fact, we first propose a new model for characterizing stripe noise. Our model constrains the stripe noise gradient to be zero, which we name the zero-gradient constraint, leading to effective destriping regardless of what regularization is applied to imaging data. Then, we formulate two types of convex optimization problems involving the zero-gradient constraints for destriping and develop efficient solvers for the problems based on a diagonally preconditioned primal-dual splitting algorithm (DP-PDS). We demonstrate the advantages of our model through destriping experiments using hyperspectral images (HSI) and infrared (IR) videos.
... Some algorithms were developed to perform denoising and unmixing jointly in a unified framework, with the purpose of improving both. Both in [39,40], sparse representation frameworks were developed, where denoising and unmixing acted as constraints of each other. In most of the aforementioned studies, the performed experiments were small scale and rather anecdotal in nature. ...
... The combination of unmixing and denoising has been treated in some recent studies. Several research works [35,39,40] developed specific methods that could cope with noise and perform denoising and unmixing simultaneously. In [32][33][34], it was shown that denoising may help to boost the endmember extraction and the unmixing performance. ...
Article
Full-text available
Hyperspectral linear unmixing and denoising are highly related hyperspectral image (HSI) analysis tasks. In particular, with the assumption of Gaussian noise, the linear model assumed for the HSI in the case of low-rank denoising is often the same as the one used in HSI unmixing. However, the optimization criterion and the assumptions on the constraints are different. Additionally, noise reduction as a preprocessing step in hyperspectral data analysis is often ignored. The main goal of this paper is to study experimentally the influence of noise on the process of hyperspectral unmixing by: (1) investigating the effect of noise reduction as a preprocessing step on the performance of hyperspectral unmixing; (2) studying the relation between noise and different endmember selection strategies; (3) investigating the performance of HSI unmixing as an HSI denoiser; (4) comparing the denoising performance of spectral unmixing, state-of-the-art HSI denoising techniques, and the combination of both. All experiments are performed on simulated and real datasets.