Hanzhang Wang

Hanzhang Wang

Auto-generated profile, based on publicly available information

Hanzhang Wang

School of Science, Harbin Institute of Technology (Shenzhen), Shenzhen, Guangdong, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
17 January 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
QSQiangqiang Shen
Qiangqiang Shen
ZGZihou Guo
Zihou Guo
HWHanzhang Wang
Hanzhang Wang
YXYanhui Xu
Yanhui Xu
YCYongyong Chen
Yongyong Chen
YLYongsheng Liang
Yongsheng Liang
Under large-scale data with missing views, fast incomplete multi-view clustering (IMVC) with anchor learning is of critical importance due to its linear complexity O(n). However, existing anchor-based methods only explore the column orthogonality of anchor points, where their arbitrary column orthogonal basis vectors have weak constraint relationships with real samples and significant deviations from more representative anchors, thereby impeding the precise representation of sample similarities. To solve this issue, we propose a Reliable Entropy-induced anchor learning for incomplete Multi-view subspace Clustering (REMC), which performs an entropy approximation term to learn more representative anchors, and we prove that the information entropy minimization can be relaxed into the ℓ2, 1-norm paradigm. Specifically, the proposed REMC first integrates anchor learning and subspace clustering to produce multiple view-specific bipartite graphs and capture the high-order correlations by imposing these bipartite graphs with the tensor nuclear norm. Then, we fuse all the view-specific bipartite graphs to build a consensus bipartite graph with entropy approximation regularization, and hence the proposed REMC can produce a more discriminative similarity graph, preserving each non-zero element in its column close to 1, while the other elements are approaching 0. Besides, an efficient algorithm is designed to solve the proposed REMC. Numerous results show the superior performance of our method on both the complete and incomplete data.

17 July 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
QSQiangqiang Shen
Qiangqiang Shen
HWHanzhang Wang
Hanzhang Wang
YZYin-Ping Zhao
Yin-Ping Zhao
YCYongyong Chen
Yongyong Chen
YLYongsheng Liang
Yongsheng Liang
XLXuelong Li
Xuelong Li
Benefiting from the powerful tensor techniques, the tensor low-rank representation has been proposed to construct sophisticated subspace clustering models. Existing tensor low-rank representation methods predominantly rely on a single low-rank prior to reconstruct the row space, which is instrumental in determining the subspace membership of samples by the row space information. However, this strategy neglects the column space and would lead to a subspace information loss. To address this issue, we propose a Dual Tensor Low-Rank Representation method (DTLRR), the first subspace clustering framework to theoretically recover both row and column subspaces simultaneously. Particularly, not simply formulating a dual self-representation model, we instead prove the recovery of both row and column spaces via a unified theoretical framework. Then, we impose low-rank constraints on the two corresponding affinity tensors to effectively capture high-order correlations. Meanwhile, we theoretically demonstrate the existence of compact dictionary tensors within the dual self-representation framework, which effectively eliminates the null spaces of the affinity tensors and significantly reduces computational complexity. Furthermore, an efficient Alternating Direction Method of Multipliers (ADMM) algorithm is designed to solve the proposed DTLRR model with guaranteed convergence. Extensive experiments validate the superior performance of the proposed DTLRR in data clustering, hyperspectral image denoising, and hyperspectral anomaly detection.

30 December 2024 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
QSQiangqiang Shen
Qiangqiang Shen
ZLZonglin Liu
Zonglin Liu
HWHanzhang Wang
Hanzhang Wang
YXYanhui Xu
Yanhui Xu
YCYongyong Chen
Yongyong Chen
YLYongsheng Liang
Yongsheng Liang
Hyperspectral anomaly detection (HAD) approaches with tensor low-rank representation (TLRR) have shown engaging performance, which are capable of capturing abundant spectral and spatial information, and hence extracting sparse anomalies from the low-rank background without ruining the intrinsic geometric structures of tensor data. However, existing HAD approaches construct the low-rank representation by a handcrafted dictionary that still contains the anomalies, resulting in an invalid representation. To this end, we propose a Deep Denoising Dictionary Tensor for Hyperspectral Anomaly Detection (D3T), which can balance performance and interpretability by fusing two intuitive priors, i.e., low-rankness and deep denoising, into the dictionary tensor and coefficient tensor. In particular, the proposed D3T first designs a tensor recovery module for dividing the low-rank background and sparse anomalies, where the background is optimized as a denoising dictionary tensor by the joint low-rankness and deep denoising. Following that, we build the TLRR model based on the denoising dictionary tensor to explore the latent representation of the input HSIs, and hence each background pixel is represented by the other clear background pixels in place of the anomaly pixels. Meanwhile, the coefficient tensor in TLRR is also optimized by the two priors to fully explore the spatial and spectral correlations in the background, and hence the anomalies can be accurately detected. Numerous experimental results from various real-world datasets validate the effectiveness of our D3T.

7 November 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
HWHanzhang Wang
Hanzhang Wang
ZLZonglin Liu
Zonglin Liu
ZZZhiwei Zhong
Zhiwei Zhong
QSQiangqiang Shen
Qiangqiang Shen
YLYongsheng Liang
Yongsheng Liang
YCYongyong Chen
Yongyong Chen
Multi-view clustering (MVC) has emerged as a powerful approach for integrating diverse sources of information from complex datasets. Nevertheless, existing methods struggle to accurately capture the global correlations and high-order structures in the data, and employ anchor-based techniques within a single dimension, limiting their representation. To address these issues, we propose an Anchor-induced Serial Tensor Representation (ASTR) framework, which effectively harnesses serial tensor representation to capture comprehensive multi-view information while reducing approximation errors and enhancing clustering performance. Specifically, ASTR begins with projection learning to explore low-dimensional latent spaces in multi-view data. Then, we introduce multi-anchor learning, where multiple anchor configurations are generated within the latent spaces, yielding a set of corresponding bipartite graphs. Besides, we organize these bipartite graphs into a sequence of global tensors, forming the serial tensor representation that encapsulates high-order inter- and intra-view relationships. Furthermore, we introduce the Laplace function to achieve a more accurate tensor rank approximation, complemented by a thorough theoretical analysis. Finally, a one-step clustering process, guided by adaptive weights, directly fuses the learned graphs to produce the final clustering indicator matrix. Experimental results demonstrate that ASTR possesses superior clustering accuracy and comparable efficiency.

21 May 2026 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
QSQiangqiang Shen
Qiangqiang Shen
ZLZonglin Liu
Zonglin Liu
HWHanzhang Wang
Hanzhang Wang
YLYongsheng Liang
Yongsheng Liang
YCYongyong Chen
Yongyong Chen
SWShiqi Wang
Shiqi Wang
To balance deep learning performance and interpretability, convolutional sparse coding (CSC) has successfully incorporated differentiable optimization layers in place of the standard convolutional layers of traditional deep neural networks (DNN). However, CSC models prefer to fall into local sparsity under the ℓ1-norm, whose optimization shows limitations in preserving the geometric structure and global sparsity of tensor data. In this paper, we propose a Linearized Tensor Low-Rank Convolutional Network (LTLRCNet) to refresh the differentiable optimization layers for DNN (e.g., ResNet and UNet), which instead optimizes the tensor low-rank minimization problem for global sparsity without ruining the intrinsic structure of data. Specifically, instead of simply replacing the ℓ1-norm with a tensor low-rank regularizer, we first propose a linearized tensor lowrank representation (LTLRR) model optimized by a linearized alternating direction method to decouple the dictionary and code coefficient without introducing an auxiliary variable, whose convergence is proved theoretically. Subsequently, we extend the LTLRR model into a deep unfolding network, such as the LTLRCNet, by engineering a convolutional dictionary that functions as a differentiable optimization layer, effectively substituting the conventional convolutional layer. To match the deep unfolding framework and avoid the gradient explosion, we apply a rank-one tactic bearing the Frank-Wolfe algorithm to solve the tensor low-rank minimization problem instead of conducting the cumbersome full-rank tensor singular value decomposition. Experimental results on image classification and segmentation show the potential of our LTLRCNet with its modeling-based layers to maintain significant performance and interpretability.