59 research outputs found
Adaptive Regularized Low-Rank Tensor Decomposition for Hyperspectral Image Denoising and Destriping
Hyperspectral images (HSIs) are inevitably degraded by a mixture of various
types of noise, such as Gaussian noise, impulse noise, stripe noise, and dead
pixels, which greatly limits the subsequent applications. Although various
denoising methods have already been developed, accurately recovering the
spatial-spectral structure of HSIs remains a challenging problem to be
addressed. Furthermore, serious stripe noise, which is common in real HSIs, is
still not fully separated by the previous models. In this paper, we propose an
adaptive hyperLaplacian regularized low-rank tensor decomposition (LRTDAHL)
method for HSI denoising and destriping. On the one hand, the stripe noise is
separately modeled by the tensor decomposition, which can effectively encode
the spatial-spectral correlation of the stripe noise. On the other hand,
adaptive hyper-Laplacian spatial-spectral regularization is introduced to
represent the distribution structure of different HSI gradient data by
adaptively estimating the optimal hyper-Laplacian parameter, which can reduce
the spatial information loss and over-smoothing caused by the previous total
variation regularization. The proposed model is solved using the alternating
direction method of multipliers (ADMM) algorithm. Extensive simulation and
real-data experiments all demonstrate the effectiveness and superiority of the
proposed method
Revisiting Nonlocal Self-Similarity from Continuous Representation
Nonlocal self-similarity (NSS) is an important prior that has been
successfully applied in multi-dimensional data processing tasks, e.g., image
and video recovery. However, existing NSS-based methods are solely suitable for
meshgrid data such as images and videos, but are not suitable for emerging
off-meshgrid data, e.g., point cloud and climate data. In this work, we revisit
the NSS from the continuous representation perspective and propose a novel
Continuous Representation-based NonLocal method (termed as CRNL), which has two
innovative features as compared with classical nonlocal methods. First, based
on the continuous representation, our CRNL unifies the measure of
self-similarity for on-meshgrid and off-meshgrid data and thus is naturally
suitable for both of them. Second, the nonlocal continuous groups can be more
compactly and efficiently represented by the coupled low-rank function
factorization, which simultaneously exploits the similarity within each group
and across different groups, while classical nonlocal methods neglect the
similarity across groups. This elaborately designed coupled mechanism allows
our method to enjoy favorable performance over conventional NSS methods in
terms of both effectiveness and efficiency. Extensive multi-dimensional data
processing experiments on-meshgrid (e.g., image inpainting and image denoising)
and off-meshgrid (e.g., climate data prediction and point cloud recovery)
validate the versatility, effectiveness, and efficiency of our CRNL as compared
with state-of-the-art methods
A Comparison of Image Denoising Methods
The advancement of imaging devices and countless images generated everyday
pose an increasingly high demand on image denoising, which still remains a
challenging task in terms of both effectiveness and efficiency. To improve
denoising quality, numerous denoising techniques and approaches have been
proposed in the past decades, including different transforms, regularization
terms, algebraic representations and especially advanced deep neural network
(DNN) architectures. Despite their sophistication, many methods may fail to
achieve desirable results for simultaneous noise removal and fine detail
preservation. In this paper, to investigate the applicability of existing
denoising techniques, we compare a variety of denoising methods on both
synthetic and real-world datasets for different applications. We also introduce
a new dataset for benchmarking, and the evaluations are performed from four
different perspectives including quantitative metrics, visual effects, human
ratings and computational cost. Our experiments demonstrate: (i) the
effectiveness and efficiency of representative traditional denoisers for
various denoising tasks, (ii) a simple matrix-based algorithm may be able to
produce similar results compared with its tensor counterparts, and (iii) the
notable achievements of DNN models, which exhibit impressive generalization
ability and show state-of-the-art performance on various datasets. In spite of
the progress in recent years, we discuss shortcomings and possible extensions
of existing techniques. Datasets, code and results are made publicly available
and will be continuously updated at
https://github.com/ZhaomingKong/Denoising-Comparison.Comment: In this paper, we intend to collect and compare various denoising
methods to investigate their effectiveness, efficiency, applicability and
generalization ability with both synthetic and real-world experiment
Interpretable Hyperspectral AI: When Non-Convex Modeling meets Hyperspectral Remote Sensing
Hyperspectral imaging, also known as image spectrometry, is a landmark
technique in geoscience and remote sensing (RS). In the past decade, enormous
efforts have been made to process and analyze these hyperspectral (HS) products
mainly by means of seasoned experts. However, with the ever-growing volume of
data, the bulk of costs in manpower and material resources poses new challenges
on reducing the burden of manual labor and improving efficiency. For this
reason, it is, therefore, urgent to develop more intelligent and automatic
approaches for various HS RS applications. Machine learning (ML) tools with
convex optimization have successfully undertaken the tasks of numerous
artificial intelligence (AI)-related applications. However, their ability in
handling complex practical problems remains limited, particularly for HS data,
due to the effects of various spectral variabilities in the process of HS
imaging and the complexity and redundancy of higher dimensional HS signals.
Compared to the convex models, non-convex modeling, which is capable of
characterizing more complex real scenes and providing the model
interpretability technically and theoretically, has been proven to be a
feasible solution to reduce the gap between challenging HS vision tasks and
currently advanced intelligent data processing models
Image Restoration for Remote Sensing: Overview and Toolbox
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.Comment: This paper is under review in GRS
Tensor singular spectral analysis for 3D feature extraction in hyperspectral images.
Due to the cubic structure of a hyperspectral image (HSI), how to characterize its spectral and spatial properties in three dimensions is challenging. Conventional spectral-spatial methods usually extract spectral and spatial information separately, ignoring their intrinsic correlations. Recently, some 3D feature extraction methods are developed for the extraction of spectral and spatial features simultaneously, although they rely on local spatial-spectral regions and thus ignore the global spectral similarity and spatial consistency. Meanwhile, some of these methods contain huge model parameters which require a large number of training samples. In this paper, a novel Tensor Singular Spectral Analysis (TensorSSA) method is proposed to extract global and low-rank features of HSI. In TensorSSA, an adaptive embedding operation is first proposed to construct a trajectory tensor corresponding to the entire HSI, which takes full advantage of the spatial similarity and improves the adequate representation of the global low-rank properties of the HSI. Moreover, the obtained trajectory tensor, which contains the global and local spatial and spectral information of the HSI, is decomposed by the Tensor singular value decomposition (t-SVD) to explore its low-rank intrinsic features. Finally, the efficacy of the extracted features is evaluated using the accuracy of image classification with a support vector machine (SVM) classifier. Experimental results on three publicly available datasets have fully demonstrated the superiority of the proposed TensorSSA over a few state-of-the-art 2D/3D feature extraction and deep learning algorithms, even with a limited number of training samples
A General Destriping Framework for Remote Sensing Images Using Flatness Constraint
This paper proposes a general destriping framework using flatness
constraints, where we can handle various regularization functions in a unified
manner. Removing stripe noise, i.e., destriping, from remote sensing images is
an essential task in terms of visual quality and subsequent processing. Most of
the existing methods are designed by combining a particular image
regularization with a stripe noise characterization that cooperates with the
regularization, which precludes us to examine different regularizations to
adapt to various target images. To resolve this, we formulate the destriping
problem as a convex optimization problem involving a general form of image
regularization and the flatness constraints, a newly introduced stripe noise
characterization. This strong characterization enables us to consistently
capture the nature of stripe noise, regardless of the choice of image
regularization. For solving the optimization problem, we also develop an
efficient algorithm based on a diagonally preconditioned primal-dual splitting
algorithm (DP-PDS), which can automatically adjust the stepsizes. The
effectiveness of our framework is demonstrated through destriping experiments,
where we comprehensively compare combinations of image regularizations and
stripe noise characterizations using hyperspectral images (HSI) and infrared
(IR) videos.Comment: submitted to IEEE Transactions on Geoscience and Remote Sensin
- …