Hanling Zhang

Hanling Zhang


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
22 October 2022
Verified
Book Chapter
Closed access
PDF file
ZYZhaoyuan Yin
Zhaoyuan Yin
PWPichao WANG
Pichao WANG
FWFan Wang
Fan Wang
XXXianzhe Xu
Xianzhe Xu
HZHanling Zhang
Hanling Zhang
RJRong Jin
Rong Jin

20 February 2024 in Signal, Image and Video Processing
Verified
Journal Article
Closed access
PDF file
HZHe Zhang
He Zhang
LYLu Yin
Lu Yin
HZHanling Zhang
Hanling Zhang
XWXuesong Wu
Xuesong Wu

28 April 2022 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
XTXin Tian
Xin Tian
KXKun Xie
Kun Xie
HZHanling Zhang
Hanling Zhang
Image restoration is a long-standing problem in signal processing and low-level computer vision. Previous studies have shown that imposing a low-rank Tucker decomposition (TKD) constraint could produce impressive performances. However, the TKD-based schemes may lead to the overfitting/underfitting problem because of incorrectly predefined ranks. To address this issue, we prove that the $n$ -rank is upper bounded by the rank of each Tucker factor matrix. Using this relationship, we propose a formulation by imposing the nuclear norm regularization on the latent factors of TKD, which can avoid the burden of rank selection and reduce the computational cost when dealing with large-scale tensors. In this formulation, we adopt the Minimax Concave Penalty to remove the impulsive noise instead of the $l_{1}$ -norm which may deviate from both the data-acquisition model and the prior model. Moreover, we employ an anisotropic total variation regularization to explore the piecewise smooth structure in both spatial and spectral domains. To solve this problem, we design the symmetric Gauss-Seidel (sGS) based alternating direction method of multipliers (ADMM) algorithm. Compared to the directly extended ADMM, our algorithm can achieve higher accuracy since more structural information is utilized. Finally, we conduct experiments on the three kinds of datasets, numerical results demonstrate the superiority of the proposed method, especially, the average PSNR of the proposed method can improve about 1~5dB for each noise level of color images.

25 March 2014 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
MXMin Xu
Min Xu
HZHanling Zhang
Hanling Zhang

13 December 2023 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
XTXin Tian
Xin Tian
KXKun Xie
Kun Xie
HZHanling Zhang
Hanling Zhang
This paper studies the mixed noise removal problem for hyperspectral images (HSIs), which often suffer from Gaussian noise and sparse noise. Conventional denoising models mainly employ the $L_{1}$ -norm-based regularizers to remove sparse noise and ensure piecewise smoothness. However, the denoising performance is poor for highly structured images with severe noise since the $L_{1}$ -norm over-penalizes large entries. To tackle this limitation, we propose a denoising model that combines tensor decomposition with two kinds of $L_{0}$ -norm-based regularizers. Firstly, we use low-rank Tucker decomposition with the Stiefel manifold to characterize the global correlation of HSIs. Then, we utilize the $L_{0}$ -norm to leverage the intrinsic sparsity information of the corruption domain, thereby enhancing the effectiveness of sparse noise removal. Simultaneously, we introduce a weighted $L_{0}$ -norm regularizer on the gradient of each pixel to promote the local spectral-spatial smoothness. To solve the proposed model, we design a hard-thresholding-based alternating direction method of multipliers (ADMM) algorithm. Instead of spending time to find a proper rank in advance, we adopt a rank-increasing scheme to dynamically adjust the tensor rank during the optimization procedure. In this way, our algorithm avoids the rank selection burden and improves computational efficiency. Finally, we test the proposed method on both synthetic and real datasets. Numerical results demonstrate its superiority, especially, the improvements of our method over the best-compared results up to 2.07dB for mixed noise removal.

2 June 2016 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
RLRuihui Li
Ruihui Li
JCJianrui Cai
Jianrui Cai
HZHanling Zhang
Hanling Zhang
TWTaihong Wang
Taihong Wang