Duo Qiu

Dr. Duo Qiu


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
12 September 2023 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
SXSijia Xia
Sijia Xia
DQDuo Qiu
Duo Qiu
Xiongjun ZhangXiongjun Zhang
Xiongjun Zhang

30 January 2025 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
DQDuo Qiu
Duo Qiu
SXSijia Xia
Sijia Xia
BYBei Yang
Bei Yang
BLBo Li
Bo Li
Xiongjun ZhangXiongjun Zhang
Xiongjun Zhang

16 July 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
HSHongyu Sun
Hongyu Sun
DQDuo Qiu
Duo Qiu
JZJiahui Zhao
Jiahui Zhao
Robust tensor completion aims to recover a clean tensor from noisy and incomplete observations, where the observed tensor is corrupted by Gaussian noise and sparse noise simultaneously. Existing methods only exploit one or two priors out of global tensor low-rankness, local properties, and nonlocal self-similarity, leading to suboptimal recovery performance. In this paper, we propose a nonconvex model combined with nonlocal self-similarity and tensor dictionary learning for robust tensor completion. Specifically, by partitioning the tensor into several overlapping cubes, the similar cubes are grouped together. Then, we unfold the cubes into matrices and stack these matrices into a third-order tensor. Subsequently, the minimax concave penalty (MCP) is employed on the singular values of all frontal slices of the sub-tensors in the transformed domain to explore the low-rankness of the underlying sub-tensor. The tensor dictionary learning based on Tucker decomposition is used to explore the local patterns of the underlying sub-tensor. Moreover, the MCP is employed onto each entry of the sparse noise tensor to explore the sparsity. A proximal alternating linearized minimization algorithm is adopted to solve the resulting model. Extensive numerical experiments demonstrate that the proposed method outperforms the competing state-of-the-art methods in both visual quality and quantitative metrics.

13 December 2022 in arXiv
Verified
Preprint
Open access
PDF file
SXSijia Xia
Sijia Xia
DQDuo Qiu
Duo Qiu
Xiongjun ZhangXiongjun Zhang
Xiongjun Zhang
In this paper, we study the problem of a batch of linearly correlated image alignment, where the observed images are deformed by some unknown domain transformations, and corrupted by additive Gaussian noise and sparse noise simultaneously. By stacking these images as the frontal slices of a third-order tensor, we propose to utilize the tensor factorization method via transformed tensor-tensor product to explore the low-rankness of the underlying tensor, which is factorized into the product of two smaller tensors via transformed tensor-tensor product under any unitary transformation. The main advantage of transformed tensor-tensor product is that its computational complexity is lower compared with the existing literature based on transformed tensor nuclear norm. Moreover, the tensor $\ell_p$ $(0<p<1)$ norm is employed to characterize the sparsity of sparse noise and the tensor Frobenius norm is adopted to model additive Gaussian noise. A generalized Gauss-Newton algorithm is designed to solve the resulting model by linearizing the domain transformations and a proximal Gauss-Seidel algorithm is developed to solve the corresponding subproblem. Furthermore, the convergence of the proximal Gauss-Seidel algorithm is established, whose convergence rate is also analyzed based on the Kurdyka-$\L$ojasiewicz property. Extensive numerical experiments on real-world image datasets are carried out to demonstrate the superior performance of the proposed method as compared to several state-of-the-art methods in both accuracy and computational time.