基于截断核范数的低秩矩阵恢复算法研究
Low-Rank Matrix Recovery Algorithm Based on Truncated Nuclear Norm
DOI: 10.12677/pm.2026.166159, PDF,   
作者: 张志红*:太原师范学院数学与统计学院,山西 晋中;付亚茹#:太原师范学院数学与统计学院,山西 晋中;太原师范学院山西省智能优化计算与区块链技术重点实验室,山西 晋中
关键词: 低秩矩阵恢复截断核范数奇异值分解ALMLow-Rank Matrix Recovery Truncated Nuclear Norm Singular Value Decomposition ALM
摘要: 本文研究基于截断核范数(Truncated Nuclear Norm, TNN)的低秩矩阵恢复模型及其求解算法。传统核范数对所有奇异值施加均匀的软阈值惩罚,易造成大奇异值的过度收缩,影响图像主体结构的还原精度;截断核范数仅惩罚较小的奇异值,保留前r个主导奇异值不受惩罚,能更精准地刻画矩阵的低秩结构。本文针对稀疏随机噪声去除任务,构建了基于截断核范数的低秩矩阵恢复模型,并采用增广拉格朗日乘子法(ALM)设计了相应的求解算法Alg.1.在不同尺寸灰度图像上的实验结果表明,与基于标准核范数的ALM方法和加速近端梯度(APG)方法相比,本文所提算法在PSNR、SSIM与相对误差等指标上整体最优,视觉恢复效果更清晰。
Abstract: This paper investigates a low-rank matrix recovery model based on the Truncated Nuclear Norm (TNN) and its solution algorithm. The conventional nuclear norm imposes uniform soft-threshold shrinkage on all singular values, which easily causes excessive shrinkage of the dominant singular values and degrades the recovery accuracy of the principal image structure. In contrast, the truncated nuclear norm only penalizes the smaller singular values while keeping the first r leading singular values unaffected, thereby characterizing the low-rank structure more precisely. For the sparse random noise removal task, we construct a TNN-based low-rank recovery model and design a solution algorithm Alg.1 based on the Augmented Lagrange Multiplier (ALM) method. Numerical experiments on gray images of various sizes demonstrate that the proposed algorithm overall outperforms the standard nuclear-norm-based ALM and the Accelerated Proximal Gradient (APG) method in terms of PSNR, SSIM and relative error, producing clearer visual restoration.
文章引用:张志红, 付亚茹. 基于截断核范数的低秩矩阵恢复算法研究[J]. 理论数学, 2026, 16(6): 82-90. https://doi.org/10.12677/pm.2026.166159

参考文献

[1] Liu, J., Musialski, P., Wonka, P. and Ye, J. (2012) Tensor Completion for Estimating Missing Values in Visual Data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35, 208-220. [Google Scholar] [CrossRef] [PubMed]
[2] Komodakis, N. (2006) Image Completion Using Global Optimization. 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, New York, 17-22 June 2006, 442-452.
[3] Bengua, J.A., Phien, H.N., Tuan, H.D. and Do, M.N. (2017) Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train. IEEE Transactions on Image Processing, 26, 2466-2479. [Google Scholar] [CrossRef] [PubMed]
[4] Bertalmio, M., Bertozzi, A.L. and Sapiro, G. (2001) Navier-Stokes, Fluid Dynamics, and Image and Video Inpainting. Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Kauai, 8-14 December, 1, I-355-I-362. [Google Scholar] [CrossRef
[5] Candès, E.J. and Recht, B. (2009) Exact Matrix Completion via Convex Optimization. Foundations of Computational Mathematics, 9, 717-772. [Google Scholar] [CrossRef
[6] Cai, J.F., Candès, E.J. and Shen, Z. (2010) A Singular Value Thresholding Algorithm for Matrix Completion. SIAM Journal on Optimization, 20, 1956-1982. [Google Scholar] [CrossRef
[7] Toh, K.C. and Yun, S. (2010) An Accelerated Proximal Gradient Algorithm for Nuclear Norm Regularized Linear Least Squares Problems. Pacific Journal of Optimization, 6, 615-640.
[8] Lin, Z., Chen, M. and Ma, Y. (2010) The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices.
https://arxiv.org/abs/1009.5055
[9] Hu, Y., Zhang, D., Ye, J., Li, X. and He, X. (2013) Fast and Accurate Matrix Completion via Truncated Nuclear Norm Regularization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35, 2117-2130. [Google Scholar] [CrossRef] [PubMed]
[10] Oh, T.H., Tai, Y.W., Bazin, J.C., Kim, H. and Kweon, I.S. (2016) Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38, 744-758. [Google Scholar] [CrossRef] [PubMed]
[11] Cao, F., Chen, J., Ye, H., Zhao, J. and Zhou, Z. (2017) Recovering Low-Rank and Sparse Matrix Based on the Truncated Nuclear Norm. Neural Networks, 85, 10-20. [Google Scholar] [CrossRef] [PubMed]
[12] Golub, G.H. and Van Loan, C.F. (2013) Matrix Computations. 4th Edition, Johns Hopkins University Press.