Zhaoyue Wu

Zhaoyue Wu

Auto-generated profile, based on publicly available information

Zhaoyue Wu

Department of Technology of Computers and Communications, University of Extremadura, Cceres, Spain

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 January 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Xuanwen TaoXuanwen Tao
Xuanwen Tao
Mercedes E. PaolettiMercedes E. Paoletti
Mercedes E. Paoletti
ZWZhaoyue Wu
Zhaoyue Wu
JHJuan M. Haut
Juan M. Haut
Peng RenPeng Ren
Peng Ren
Antonio PlazaAntonio Plaza
Antonio Plaza
Hyperspectral unmixing is a vibrant research field that focuses on the task of decomposing mixed pixels into a collection of pure spectral signatures, known as endmembers, along with their corresponding fractional abundances. Conventional unmixing algorithms often need to combine two techniques, namely endmember extraction and abundance estimation, to accomplish the unmixing task. Recently, deep learning (DL) has succeeded in the field of hyperspectral unmixing due to its strong feature learning and data-fitting capabilities. By extracting the output and weight of a particular layer as abundance maps and endmember signatures, available DL methods can directly unmix hyperspectral images. However, to improve the performance of spectral unmixing, such available DL methods frequently employ the results of endmember extraction algorithms—in most cases, the well-known vertex component analysis (VCA)—as the initial weights, which leads to significant limitations in their performance: 1) the unmixing results are heavily dependent on the initialization given by VCA and 2) the randomness of VCA is passed to the unmixing network. In this article, we design a new method called abundance-guided spectral and spatial network (A2SN) that not only skips the weights to extract endmember features directly from the network, but also estimates the abundance maps and reconstructs images directly. In particular, the proposed A2SN employs different kernels to capture spectral and spatial information. We also propose an abundance-guided attention spectral and spatial attention network (A2SAN) for hyperspectral unmixing by integrating attention mechanisms into A2SN. As a result, A2SAN is a completely innovative unmixing method that employs attention and reconstruction directly for hyperspectral unmixing, rather than just as modules for information extraction. Most importantly, both A2SN and A2SAN use a weighted summation of the feature maps to reconstruct the image and increase the noise immunity of the network. Experimental results, conducted on both synthetic and real datasets, demonstrate the effectiveness and superiority of A2SN and A2SAN over state-of-the-art unmixing methods. Our full code is released at https://github.com/xuanwentao/A2SN-and-A2SAN for public evaluation.

12 July 2022 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ZWZhaoyue Wu
Zhaoyue Wu
HSHongjun Su
Hongjun Su
Xuanwen TaoXuanwen Tao
Xuanwen Tao
LHLirong Han
Lirong Han
Mercedes E. PaolettiMercedes E. Paoletti
Mercedes E. Paoletti
Antonio PlazaAntonio Plaza
Antonio Plaza
Anomaly detection has become an important remote sensing application due to the abundant spectral and spatial information contained in hyperspectral images. Recently, hyperspectral anomaly detection methods based on the collaborative representation (CR) model have attracted significant attention. Nevertheless, these methods have to face two main challenges: 1) all features (spectral signatures) are constrained to share the same representation coefficient, which ignores the differences among features and 2) existing dictionaries for pixel-by-pixel detection models are usually not reliable. To address these issues, this article proposes a new relaxed CR detector for hyperspectral anomaly detection by using a novel nonglobal dictionary. The proposed detector conducts CR on each feature dimension of the pixel under test and simultaneously constrains the coding vectors of different features to be similar. To the best of our knowledge, this is the first time that a detection model is built from each feature dimension. To adjust the contributions of each feature, an adaptive feature weight constrained version of the method is also proposed. The nonglobal dictionary is constructed by combining the ${k}$ -nearest neighbor method and an existing global dictionary, which is more reliable and practical than the widely used dual-window dictionary. In addition, this article also designs a band selection strategy for the proposed method. Experiments on five real datasets indicate that the proposed method suppresses background well and outperforms other classical and state-of-the-art methods.

22 August 2022 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
Xuanwen TaoXuanwen Tao
Xuanwen Tao
Mercedes E. PaolettiMercedes E. Paoletti
Mercedes E. Paoletti
LHLirong Han
Lirong Han
ZWZhaoyue Wu
Zhaoyue Wu
Peng RenPeng Ren
Peng Ren
JHJuan M. Haut
Juan M. Haut
Hyperspectral unmixing extracts pure spectral constituents (endmembers) and their corresponding abundance fractions from remotely sensed scenes. Most traditional hyperspectral unmixing methods require the results of other endmember extraction algorithms to complete the abundance estimation step. Due to the impressive learning and data fitting capabilities of convolutional neural networks (CNNs), deep learning (DL)-based hyperspectral unmixing technologies have rapidly developed in the literature. According to the procedure used to combine different layers (i.e., fully connected layers, convolution layers, and activation layers), these techniques are mainly divided into three main categories, i.e., those based on autoencoder networks, convolutional neural networks, and convolutional autoencoder networks. They usually extract the weight and output of a specific activation layer as endmember signatures and abundance maps, respectively. Moreover, most existing DL-based unmixing approaches usually use 2-D CNNs to learn the features contained in hyperspectral images, and very few approaches employ 3-D CNNs to extract spectral and spatial information. However, 2-D CNN-based techniques cannot capture good discriminative feature maps from the spectral viewpoint, and 3-D CNN-based techniques usually have high computational overload. In this work, to further exploit the feature extraction capability of CNNs, we combine 3- and 2-D convolutions to propose a cross-convolution unmixing network (CrossCUN) for hyperspectral unmixing. Simultaneously, to better illustrate the improvements of our proposed CrossCUN, we also build the corresponding 2-D convolution unmixing network (2-DCUN) and 3-D convolution unmixing network (3-DCUN). We evaluate the performance of our newly developed networks on two types of synthetic datasets and three real hyperspectral images. Experimental results show that the proposed networks not only obtain better results than other DL-based unmixing methods but also do not require any prior knowledge (e.g., the results of other endmember extraction algorithms) to estimate the abundance maps.

20 November 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ZWZhaoyue Wu
Zhaoyue Wu
Mercedes E. PaolettiMercedes E. Paoletti
Mercedes E. Paoletti
Hongjun SuHongjun Su
Hongjun Su
Xuanwen TaoXuanwen Tao
Xuanwen Tao
LHLirong Han
Lirong Han
Antonio PlazaAntonio Plaza
Antonio Plaza
Autoencoder-based hyperspectral anomaly detectors have received significant attention. The core of these detectors is to reconstruct backgrounds by optimizing autoencoders so that anomalies can be detected by reconstruction residuals. Nevertheless, existing methods are flawed in two aspects: 1) most of them reconstruct the background along with the anomalies, resulting in undesired performance for large target detection in complex backgrounds; 2) they only focus on the encoder optimization part, ignoring the decoder reconstruction quality of the background. Given the above, this paper proposes a background-guided deformable convolutional autoencoder (DCAE) network with three mutually supportive parts, including encoder, decoder, and background guidance modules. In the encoder, deformable convolution is introduced into regular convolution to build the adaptive spatial feature extractor to fit complex spatial structures, whilst a non-local convolution is introduced to build an external feature extractor to capture global spatial relationships. Further, a mask is designed to filter potential anomalous information, curbing the representation of high-frequency anomalies to focus on widespread backgrounds. In the decoder, a background guidance module (considering the physical meaning of linear reconstruction) is built, guiding the proposed network learning via two strategies. One is initializing the weight of the decoder, and another is adding a loss term. Notably, both the number of output channels of the encoder and the decoder construction are determined by the background guidance module, which creates a bridge between the network design and practical situations. A profound analysis demonstrates the outstanding performance of the proposed method, which outperforms traditional and deep learning methods, proving that the novel designs introduced in the network architecture are extremely effective.

16 July 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
LHLirong Han
Lirong Han
Mercedes E. PaolettiMercedes E. Paoletti
Mercedes E. Paoletti
Xuanwen TaoXuanwen Tao
Xuanwen Tao
ZWZhaoyue Wu
Zhaoyue Wu
JHJuan M. Haut
Juan M. Haut
Antonio PlazaAntonio Plaza
Antonio Plaza
In recent years, the rapid development of remote sensing (RS) technology has led to a drastic increase in the availability of RS images. This calls for the need to develop new methods able to effectively and efficiently retrieve the required instances from a massive amount of RS imagery. In retrieval tasks, finding the nearest-neighbor sample of the retrieval query is a fundamental research topic. Exhaustive comparison is the simplest method to accomplish this task. However, due to the involved computational complexity and memory limitations, this solution is no longer feasible in large data retrieval tasks. As an important branch of approximate nearest-neighbor retrieval (NNR), hash algorithms transform high-dimensional data into low-bit expressions (hash codes) with elements of 0 and 1 to reduce storage and computational costs. Hash algorithms aim to preserve the same nearest-neighbor relationship between the learned hash codes and the original data. Existing hash algorithms are divided into two classes: shallow and deep methods. Furthermore, deep hash algorithms can be divided into (semi-) supervised and unsupervised algorithms. In this article, representative hash-based RS image retrieval (HBRSIR) methods are reviewed, studying the application of hashing in other areas of the RS community and introducing available datasets and evaluation metrics for RS image retrieval (RSIR). The performance of representative and cross-modal hashing methods is validated using two common RSIR datasets (UCMerced and AID) and a cross-modal dataset (DSRSID). Prospects of future work summarizing HBRSIR are also provided.

10 February 2025 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ZWZhaoyue Wu
Zhaoyue Wu
HLHailiang Lu
Hailiang Lu
Mercedes E. PaolettiMercedes E. Paoletti
Mercedes E. Paoletti
Hongjun SuHongjun Su
Hongjun Su
WJWeipeng Jing
Weipeng Jing
JHJuan M. Haut
Juan M. Haut
Hyperspectral images capture numerous narrow spectral bands to provide detailed information to identify and locate targets, making them highly suitable for anomaly detection tasks. In recent years, deep learning techniques have demonstrated impressive capabilities and prospects in hyperspectral anomaly detection, primarily relying on multilayer perceptrons (MLPs) and convolutional neural networks (CNNs) to extract and represent nonlinear features. However, MLPs and CNNs often require deeper network architectures when dealing with complex high-dimensional data, resulting in a constrained generalization and limited representation of features. To address this issue, and inspired by the recent Kolmogorov-Arnold Network (KAN), this paper introduces a novel asymmetric convolutional autoencoder network by integrating KAN and CNN, named KACNet. Specifically, we design a spectral KAN block in the convolutional encoder and a spatial KAN block in the convolutional decoder, to simultaneously enhance the feature extraction and characterization capabilities of the network. Furthermore, to effectively utilize the limited prior information, a weight initialization mechanism based on Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) is developed to boost the background recovery. By combining KAN, CNN, and HDBSCAN, the proposed integration enhances the interpretability and reliability of hyperspectral anomaly detection. Extensive experiments are conducted on six public datasets, demonstrating that the KAN poses remarkable performance on background reconstruction, particularly, the proposed KACNet significantly outperforms the other state-of-the-art methods.