Ziqiang Hua
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ziqiang Hua has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Xiaorun Li
College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
8 shared publications - Liaoying Zhao
Hangzhou Dianzi University
6 shared publications - Yufei Liu
Hangzhou Dianzi University
4 shared publications - Hongli Xu
School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui, China
2 shared publications - Huaqing Tu
School of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, China
2 shared publications - Shuhan Chen
College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
2 shared publications
Latest Publications
- 28 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (4) , 1091-1104
CADER: Cost-Efficient Cloud Application Deployment With Tenant Requirement Guarantee in Multi-Clouds
Motivated by the need to reduce vendor lock-in and address concerns regarding dedicated hardware availability, cloud applications have increasingly adopted a multi-cloud deployment strategy, in which cloud applications are deployed in different zones associated with various cloud service providers. When deploying cloud applications in multi-clouds, there are three crucial and coupled metrics: deployment cost, access delay and traffic demand. Unfortunately, existing works overlook either the data transfer cost in deployment cost or the access delay and traffic demand requirements, resulting in high operating costs or low user QoS. To bridge this gap, this paper proposes the Cost-Efficient Application Deployment Framework (CADER) with tenant requirement guarantee in multi-clouds environment. However, due to the challenges of service price heterogeneity, transfer cost diversity, and resource limitation, achieving cost-efficient cloud application deployment while satisfying all tenant requirements is not an easy task. To tackle this issue, we design an approximate algorithm based on the random rounding method and prove that its approximate ratio is $O(\log g)$, where $g$ is the number of cloud zones. Results of in-depth simulations indicate that CADER can reduce the application deployment cost ranging from 16% to 38% compared to commonly used alternatives while ensuring the satisfaction of tenant requirements.
- 28 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (4) , 1091-1104
CADER: Cost-Efficient Cloud Application Deployment With Tenant Requirement Guarantee in Multi-Clouds
Motivated by the need to reduce vendor lock-in and address concerns regarding dedicated hardware availability, cloud applications have increasingly adopted a multi-cloud deployment strategy, in which cloud applications are deployed in different zones associated with various cloud service providers. When deploying cloud applications in multi-clouds, there are three crucial and coupled metrics: deployment cost, access delay and traffic demand. Unfortunately, existing works overlook either the data transfer cost in deployment cost or the access delay and traffic demand requirements, resulting in high operating costs or low user QoS. To bridge this gap, this paper proposes the Cost-Efficient Application Deployment Framework (CADER) with tenant requirement guarantee in multi-clouds environment. However, due to the challenges of service price heterogeneity, transfer cost diversity, and resource limitation, achieving cost-efficient cloud application deployment while satisfying all tenant requirements is not an easy task. To tackle this issue, we design an approximate algorithm based on the random rounding method and prove that its approximate ratio is $O(\log g)$, where $g$ is the number of cloud zones. Results of in-depth simulations indicate that CADER can reduce the application deployment cost ranging from 16% to 38% compared to commonly used alternatives while ensuring the satisfaction of tenant requirements.
- 3 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4917-4932
Achieving Efficient SFC Proactive Reconfiguration Through Deep Reinforcement Learning in Programmable Networks
Service function chain (SFC) consists of multiple ordered network functions (e.g., firewall, load balancer) and plays an important role in improving network security and ensuring network performance. Offloading SFCs onto programmable switches can bring significant performance improvement, but it suffers from unbearable reconfiguration delays, making it hard to cope with network workload dynamics in a timely manner. To bridge the gap, this paper presents OptRec, an efficient SFC proactive reconfiguration optimization framework based on deep reinforcement learning (DRL). OptRec predicts future traffic and places SFCs on programmable switches in advance to ensure the timeliness of the SFC reconfiguration, which is a proactive approach. However, it is non-trivial to extract effective features from historical traffic information and global network states, while ensuring efficient and stable model training. To this end, OptRec introduces a multi-level feature extraction model for different types of features. Additionally, it combines reinforcement learning and autoregressive learning to enhance model efficiency and stability. Results of in-depth simulations based on real-world datasets show the average prediction error of OptRec is less than 3 can increase the system throughput by up to 69.6 compared with other alternatives.
- 3 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (5) , 4917-4932
Achieving Efficient SFC Proactive Reconfiguration Through Deep Reinforcement Learning in Programmable Networks
Service function chain (SFC) consists of multiple ordered network functions (e.g., firewall, load balancer) and plays an important role in improving network security and ensuring network performance. Offloading SFCs onto programmable switches can bring significant performance improvement, but it suffers from unbearable reconfiguration delays, making it hard to cope with network workload dynamics in a timely manner. To bridge the gap, this paper presents OptRec, an efficient SFC proactive reconfiguration optimization framework based on deep reinforcement learning (DRL). OptRec predicts future traffic and places SFCs on programmable switches in advance to ensure the timeliness of the SFC reconfiguration, which is a proactive approach. However, it is non-trivial to extract effective features from historical traffic information and global network states, while ensuring efficient and stable model training. To this end, OptRec introduces a multi-level feature extraction model for different types of features. Additionally, it combines reinforcement learning and autoregressive learning to enhance model efficiency and stability. Results of in-depth simulations based on real-world datasets show the average prediction error of OptRec is less than 3 can increase the system throughput by up to 69.6 compared with other alternatives.
- 14 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-15
Unidirectional Local-Attention Autoencoder Network for Spectral Variability Unmixing
Autoencoders (AEs) has demonstrated excellent performance in the field of hyperspectral unmixing, due to their self-supervised nature and ease of implementation. Recently proposed AE-based networks contend that local spatial information limits further improvement in unmixing accuracy and tend to explore and utilize global information, which improves unmixing accuracy at the expense of increased computational complexity. However, we believe that precise unmixing can be achieved by fully leveraging local information. In this paper, we propose a unidirectional local-attention autoencoder Network (ULA-Net) that explores spatial information pixel by pixel and achieves accurate spatial-spectral feature fusion. ULA-Net utilizes unidirectional local attention (ULA) module to calculate the correlation between neighboring pixels and the central pixel within local regions, extracting discriminative local information. Moreover, ULA-Net effectively extracts relevant spatial information and suppresses irrelevant information based on a double fusion strategy (DFS) module. This process achieves more accurate control over the contribution of spatial information by implementing information fusion in both the pixel and feature dimensions. To address spectral variability, we implement the extended linear mixing model (ELMM) in the decoder part to improve unmixing accuracy without increasing the number of parameters. We conduct ablation experiments to investigate the roles of each module. Experimental results on both synthetic and real datasets demonstrate the effectiveness of the proposed network.
- 14 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-15
Unidirectional Local-Attention Autoencoder Network for Spectral Variability Unmixing
Autoencoders (AEs) has demonstrated excellent performance in the field of hyperspectral unmixing, due to their self-supervised nature and ease of implementation. Recently proposed AE-based networks contend that local spatial information limits further improvement in unmixing accuracy and tend to explore and utilize global information, which improves unmixing accuracy at the expense of increased computational complexity. However, we believe that precise unmixing can be achieved by fully leveraging local information. In this paper, we propose a unidirectional local-attention autoencoder Network (ULA-Net) that explores spatial information pixel by pixel and achieves accurate spatial-spectral feature fusion. ULA-Net utilizes unidirectional local attention (ULA) module to calculate the correlation between neighboring pixels and the central pixel within local regions, extracting discriminative local information. Moreover, ULA-Net effectively extracts relevant spatial information and suppresses irrelevant information based on a double fusion strategy (DFS) module. This process achieves more accurate control over the contribution of spatial information by implementing information fusion in both the pixel and feature dimensions. To address spectral variability, we implement the extended linear mixing model (ELMM) in the decoder part to improve unmixing accuracy without increasing the number of parameters. We conduct ablation experiments to investigate the roles of each module. Experimental results on both synthetic and real datasets demonstrate the effectiveness of the proposed network.
- Open Access
- 25 November 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (23) , 5495
An Unsupervised Band Selection Method via Contrastive Learning for Hyperspectral Images
Band selection (BS) is an efficacious approach to reduce hyperspectral information redundancy while preserving the physical meaning of hyperspectral images (HSIs). Recently, deep learning-based BS methods have received widespread interest due to their ability to model the nonlinear relationship between bands, with existing methods typically relying on generative algorithms. However, the process of generating images with pixel-level detail required by generative algorithm-based BS methods is computationally expensive. To alleviate this issue, we propose a contrastive learning-based unsupervised BS architecture, termed ContrastBS, in this article. With the help of contrastive learning, the proposed architecture avoids the costly generation step in pixel space by learning to distinguish data at the abstract semantic level of the feature space. Specifically, ContrastBS combines an attention mechanism with contrastive learning to extract the importance of each band. Furthermore, we design a novel loss function, which is able to constrain the symmetric loss while ensuring attention to the most valuable bands, for the contrastive learning-based BS network. Experimental results indicate that ContrastBS has excellent classification performance and competitive time cost compared to the comparison methods.
- 25 November 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (23) , 5495
Open AccessAn Unsupervised Band Selection Method via Contrastive Learning for Hyperspectral Images
Band selection (BS) is an efficacious approach to reduce hyperspectral information redundancy while preserving the physical meaning of hyperspectral images (HSIs). Recently, deep learning-based BS methods have received widespread interest due to their ability to model the nonlinear relationship between bands, with existing methods typically relying on generative algorithms. However, the process of generating images with pixel-level detail required by generative algorithm-based BS methods is computationally expensive. To alleviate this issue, we propose a contrastive learning-based unsupervised BS architecture, termed ContrastBS, in this article. With the help of contrastive learning, the proposed architecture avoids the costly generation step in pixel space by learning to distinguish data at the abstract semantic level of the feature space. Specifically, ContrastBS combines an attention mechanism with contrastive learning to extract the importance of each band. Furthermore, we design a novel loss function, which is able to constrain the symmetric loss while ensuring attention to the most valuable bands, for the contrastive learning-based BS network. Experimental results indicate that ContrastBS has excellent classification performance and competitive time cost compared to the comparison methods.
- 21 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 20 (1545598X) , 1-5
BSFormer: Transformer-Based Reconstruction Network for Hyperspectral Band Selection
Band selection (BS) is an effective approach to alleviate the spectral redundancy of a hyperspectral image (HSI). The emerging deep learning-based BS methods have become a hot topic due to their ability to model nonlinear relationships between spectral bands. However, existing deep learning-based BS methods fail to accurately extract the representativeness of each band as a result of the limitation of interpretation networks. Moreover, existing deep learning methods cannot fully utilize the inter-band correlation and the spatial information of HSIs for BS. To solve these issues, in this letter, we propose a novel transformer reconstruction network for unsupervised BS, termed BSFormer. Specifically, the transformer reconstruction network, which contributes to leveraging the spectral-spatial information of the HSI, consists of a transformer-based band attention (TBA) module and a convolutional autoencoder-based reconstruction module. On this basis, we design a novel band evaluation criterion composed of representative metric and redundancy metric, which are interpreted with the help of the multi-head self-attention layer in the TBA module. The designed criterion can fully use the band representativeness and inter-band correlation for BS. Experimental results on three well-known hyperspectral data sets verify that the proposed BSFormer can yield better classification performance than the competitors.
- 21 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 20 (1545598X) , 1-5
BSFormer: Transformer-Based Reconstruction Network for Hyperspectral Band Selection
Band selection (BS) is an effective approach to alleviate the spectral redundancy of a hyperspectral image (HSI). The emerging deep learning-based BS methods have become a hot topic due to their ability to model nonlinear relationships between spectral bands. However, existing deep learning-based BS methods fail to accurately extract the representativeness of each band as a result of the limitation of interpretation networks. Moreover, existing deep learning methods cannot fully utilize the inter-band correlation and the spatial information of HSIs for BS. To solve these issues, in this letter, we propose a novel transformer reconstruction network for unsupervised BS, termed BSFormer. Specifically, the transformer reconstruction network, which contributes to leveraging the spectral-spatial information of the HSI, consists of a transformer-based band attention (TBA) module and a convolutional autoencoder-based reconstruction module. On this basis, we design a novel band evaluation criterion composed of representative metric and redundancy metric, which are interpreted with the help of the multi-head self-attention layer in the TBA module. The designed criterion can fully use the band representativeness and inter-band correlation for BS. Experimental results on three well-known hyperspectral data sets verify that the proposed BSFormer can yield better classification performance than the competitors.
- 30 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 19 (1545598X) , 1-5
A Band Selection Method With Masked Convolutional Autoencoder for Hyperspectral Image
Band selection (BS) is an effective means to solve the problems of spectral redundancy and Hughes phenomenon in hyperspectral images (HSIs). However, existing BS methods fail to consider the representativeness, redundancy, and information content of the selected bands simultaneously, and most of them lack consideration of the inherent nonlinear relationship between bands. To address these problems, we propose a novel unsupervised BS framework that can comprehensively consider band representativeness, redundancy, and information content (RRI) in this letter. The band representativeness is estimated by a convolutional autoencoder (AE), which can capture the inherent nonlinear relationship between the bands and leverage the spatial information of the HSI. The redundancy and the information content of a band subset are restricted and enhanced by the correlation coefficient and the information divergence (ID), respectively. Subsequently, RRI combines these three indicators as the subset evaluation criterion and utilizes an immune clone selection algorithm to search for the desired band subset. Experimental results verify that the proposed RRI method can provide higher classification accuracy than the competitors and is robust to noisy bands.
- 30 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 19 (1545598X) , 1-5
A Band Selection Method With Masked Convolutional Autoencoder for Hyperspectral Image
Band selection (BS) is an effective means to solve the problems of spectral redundancy and Hughes phenomenon in hyperspectral images (HSIs). However, existing BS methods fail to consider the representativeness, redundancy, and information content of the selected bands simultaneously, and most of them lack consideration of the inherent nonlinear relationship between bands. To address these problems, we propose a novel unsupervised BS framework that can comprehensively consider band representativeness, redundancy, and information content (RRI) in this letter. The band representativeness is estimated by a convolutional autoencoder (AE), which can capture the inherent nonlinear relationship between the bands and leverage the spatial information of the HSI. The redundancy and the information content of a band subset are restricted and enhanced by the correlation coefficient and the information divergence (ID), respectively. Subsequently, RRI combines these three indicators as the subset evaluation criterion and utilizes an immune clone selection algorithm to search for the desired band subset. Experimental results verify that the proposed RRI method can provide higher classification accuracy than the competitors and is robust to noisy bands.
- Open Access
- 9 September 2021
- Published by MDPI AG in Remote Sensing
- Vol. 13 (18) , 3602
EBARec-BS: Effective Band Attention Reconstruction Network for Hyperspectral Imagery Band Selection
Hyperspectral band selection (BS) is an effective means to avoid the Hughes phenomenon and heavy computational burden in hyperspectral image processing. However, most of the existing BS methods fail to fully consider the interaction between spectral bands and cannot comprehensively consider the representativeness and redundancy of the selected band subset. To solve these problems, we propose an unsupervised effective band attention reconstruction framework for band selection (EBARec-BS) in this article. The framework utilizes the EBARec network to learn the representativeness of each band to the original band set and measures the redundancy between the bands by calculating the distance of each unselected band to the selected band subset. Subsequently, by designing an adaptive weight to balance the influence of the representativeness metric and redundancy metric on the band evaluation, a final band scoring function is obtained to select a band subset that well represents the original hyperspectral image and has low redundancy. Experiments on three well-known hyperspectral data sets indicate that compared with the existing BS methods, the proposed EBARec-BS is robust to noise bands and can effectively select the band subset with higher classification accuracy and less redundant information.
- 9 September 2021
- Published by MDPI AG in Remote Sensing
- Vol. 13 (18) , 3602
Open AccessEBARec-BS: Effective Band Attention Reconstruction Network for Hyperspectral Imagery Band Selection
Hyperspectral band selection (BS) is an effective means to avoid the Hughes phenomenon and heavy computational burden in hyperspectral image processing. However, most of the existing BS methods fail to fully consider the interaction between spectral bands and cannot comprehensively consider the representativeness and redundancy of the selected band subset. To solve these problems, we propose an unsupervised effective band attention reconstruction framework for band selection (EBARec-BS) in this article. The framework utilizes the EBARec network to learn the representativeness of each band to the original band set and measures the redundancy between the bands by calculating the distance of each unselected band to the selected band subset. Subsequently, by designing an adaptive weight to balance the influence of the representativeness metric and redundancy metric on the band evaluation, a final band scoring function is obtained to select a band subset that well represents the original hyperspectral image and has low redundancy. Experiments on three well-known hyperspectral data sets indicate that compared with the existing BS methods, the proposed EBARec-BS is robust to noise bands and can effectively select the band subset with higher classification accuracy and less redundant information.
- Open Access
- 9 August 2021
- Published by MDPI AG in Remote Sensing
- Vol. 13 (16) , 3147
Gated Autoencoder Network for Spectral–Spatial Hyperspectral Unmixing
Convolution-based autoencoder networks have yielded promising performances in exploiting spatial–contextual signatures for spectral unmixing. However, the extracted spectral and spatial features of some networks are aggregated, which makes it difficult to balance their effects on unmixing results. In this paper, we propose two gated autoencoder networks with the intention of adaptively controlling the contribution of spectral and spatial features in unmixing process. Gating mechanism is adopted in the networks to filter and regularize spatial features to construct an unmixing algorithm based on spectral information and supplemented by spatial information. In addition, abundance sparsity regularization and gating regularization are introduced to ensure the appropriate implementation. Experimental results validate the superiority of the proposed method to the state-of-the-art techniques in both synthetic and real-world scenes. This study confirms the effectiveness of gating mechanism in improving the accuracy and efficiency of utilizing spatial signatures for spectral unmixing.
- 9 August 2021
- Published by MDPI AG in Remote Sensing
- Vol. 13 (16) , 3147
Open AccessGated Autoencoder Network for Spectral–Spatial Hyperspectral Unmixing
Convolution-based autoencoder networks have yielded promising performances in exploiting spatial–contextual signatures for spectral unmixing. However, the extracted spectral and spatial features of some networks are aggregated, which makes it difficult to balance their effects on unmixing results. In this paper, we propose two gated autoencoder networks with the intention of adaptively controlling the contribution of spectral and spatial features in unmixing process. Gating mechanism is adopted in the networks to filter and regularize spatial features to construct an unmixing algorithm based on spectral information and supplemented by spatial information. In addition, abundance sparsity regularization and gating regularization are introduced to ensure the appropriate implementation. Experimental results validate the superiority of the proposed method to the state-of-the-art techniques in both synthetic and real-world scenes. This study confirms the effectiveness of gating mechanism in improving the accuracy and efficiency of utilizing spatial signatures for spectral unmixing.
- 5 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 19 (1545598X) , 1-5
Dual Branch Autoencoder Network for Spectral-Spatial Hyperspectral Unmixing
Spatial information can play a supporting role in spectral unmixing. In this letter, we propose a dual branch autoencoder network to incorporate spatial-contextual information for spectral-spatial unmixing. The two branches leverage different architectures to efficiently extract spatial information and spectral information. In the first branch, we use fully connected layers to extract spectral information, where the neuron in each layer can capture all spectral features. In the second branch, 2-D convolution is adopted to exploit spatial features, which does not require hand-crafted assumptions compared with conventional methods. Then the extracted features are concatenated and propagated to generate the abundance and reconstruct the pixel. Moreover, to solve the drawbacks of the existing reconstruction functions, we propose a new function termed squared sine distance to improve the convergence quality of the proposed network. Experimental results reveal the effectiveness of our proposed method on both synthetic data and real-world data.
- 5 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 19 (1545598X) , 1-5
Dual Branch Autoencoder Network for Spectral-Spatial Hyperspectral Unmixing
Spatial information can play a supporting role in spectral unmixing. In this letter, we propose a dual branch autoencoder network to incorporate spatial-contextual information for spectral-spatial unmixing. The two branches leverage different architectures to efficiently extract spatial information and spectral information. In the first branch, we use fully connected layers to extract spectral information, where the neuron in each layer can capture all spectral features. In the second branch, 2-D convolution is adopted to exploit spatial features, which does not require hand-crafted assumptions compared with conventional methods. Then the extracted features are concatenated and propagated to generate the abundance and reconstruct the pixel. Moreover, to solve the drawbacks of the existing reconstruction functions, we propose a new function termed squared sine distance to improve the convergence quality of the proposed network. Experimental results reveal the effectiveness of our proposed method on both synthetic data and real-world data.
- 10 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 18 (9) , 1640-1644
Autoencoder Network for Hyperspectral Unmixing With Adaptive Abundance Smoothing
Autoencoder is an efficient technique for unsupervised feature learning, which can be applied to hyperspectral unmixing. In this letter, we present an autoencoder network with adaptive abundance smoothing (AAS) to solve the challenges of previous techniques. Specifically, the proposed method uses a multilayer encoder to obtain the abundance and a single-layer decoder to reconstruct the image. The AAS algorithm tackles the outliers by exploiting the spatial-contextual information and can be adaptive for each pixel. Moreover, the softmax function is used as the encoder output function with the help of L1/2 regularization to produce sparse output. Experimental results of the synthetic and real data reveal the superior performance of the proposed method against other competitors.
- 10 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 18 (9) , 1640-1644
Autoencoder Network for Hyperspectral Unmixing With Adaptive Abundance Smoothing
Autoencoder is an efficient technique for unsupervised feature learning, which can be applied to hyperspectral unmixing. In this letter, we present an autoencoder network with adaptive abundance smoothing (AAS) to solve the challenges of previous techniques. Specifically, the proposed method uses a multilayer encoder to obtain the abundance and a single-layer decoder to reconstruct the image. The AAS algorithm tackles the outliers by exploiting the spatial-contextual information and can be adaptive for each pixel. Moreover, the softmax function is used as the encoder output function with the help of L1/2 regularization to produce sparse output. Experimental results of the synthetic and real data reveal the superior performance of the proposed method against other competitors.