A number of previous papers have studied the problem of recovering low-rank matrices with noise, further combining the noisy and perturbed cases, we propose a nonconvex Schatten p-norm minimization method to deal with the recovery of fully perturbed low-rank matrices. By utilizing the p-null space property (p-NSP) and the p-restricted isometry property (p-RIP) of the matrix, sufficient conditions to ensure that the stable and accurate reconstruction for low-rank matrix in the case of full perturbation are derived, and two upper bound recovery error estimation ns are given. These estimations are characterized by two vital aspects, one involving the best r-approximation error and the other concerning the overall noise. Specifically, this paper obtains two new error upper bounds based on the fact that p-RIP and p-NSP are able to recover accurately and stably low-rank matrix, and to some extent improve the conditions corresponding to RIP.
References
[1]
Recht, B., Fazel, M. and Parrilo, P.A. (2010) Guaranteed Minimum Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization. SIAM Review, 52, 471-501. https://doi.org/10.1137/070697835
[2]
Chang, X., Zhong, Y., Wang, Y. and Lin, S. (2019) Unified Low-Rank Matrix Estimate via Penalized Matrix Least Squares Approximation. IEEE Transactions on Neural Networks and Learning Systems, 30, 474-485. https://doi.org/10.1109/TNNLS.2018.2844242
[3]
Batselier, K. (2022) Low-Rank Tensor Decompositions for Nonlinear System Identification: A Tutorial with Examples. IEEE Control Systems Magazine, 42, 54-74. https://doi.org/10.1109/MCS.2021.3122268
[4]
Dass, J., Wu, S., Shi, H., et al. (2023) Vitality: Unifying Low-Rank and Sparse Approximation for Vision Transformer Acceleration with a Linear Taylor Attention. 2023 IEEE International Symposium on High-Performance Computer Architecture (HPCA). Montreal, 25 February-01 March 2023, 415-428. https://doi.org/10.1109/HPCA56546.2023.10071081
[5]
Wang, Z., Qian, C., Guo, D., et al. (2022) One-Dimensional Deep Low-Rank and Sparse Network for Accelerated MRI. IEEE Transactions on Medical Imaging, 42, 79-90. https://doi.org/10.1109/TMI.2022.3203312
[6]
Wang, Y., Lin, L., Zhao, Q., et al. (2017) Compressive Sensing of Hyperspectral Images via Joint Tensor Tucker Decomposition and Weighted Total Variation Regularization. IEEE Geoscience and Remote Sensing Letters, 14, 2457-2461. https://doi.org/10.1109/LGRS.2017.2771212
[7]
Gundupalli, S.P., Hait, S. and Thakur, A. (2017) A Review on Automated Sorting of Source-Separated Municipal Solid Waste for Recycling. Waste Management, 60, 56-74. https://doi.org/10.1016/j.wasman.2016.09.015
[8]
Ye, G., Pan, C., Dong, Y., et al. (2021) A Novel Multi-Image Visually Meaningful Encryption Algorithm Based on Compressive Sensing and Schur Decomposition. Transactions on Emerging Telecommunications Technologies, 32, e4071. https://doi.org/10.1002/ett.4071
[9]
Chartrand, R. (2007) Exact Reconstruction of Sparse Signals via Nonconvex Minimization. IEEE Signal Processing Letters, 14, 707-710. https://doi.org/10.1109/LSP.2007.898300
[10]
Lai, M.J., Xu, Y. and Yin, W. (2013) Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed Minimization. SIAM Journal on Numerical Analysis, 51, 927-957. https://doi.org/10.1137/110840364
[11]
Wang, Y., Wang, J. and Xu, Z. (2014) Restricted P-Isometry Properties of Nonconvex Block-Sparse Compressed Sensing. Signal Processing, 104, 188-196. https://doi.org/10.1016/j.sigpro.2014.03.040
[12]
Wang, J., Zhang, J., Wang, W., et al. (2015) A Perturbation Analysis of Nonconvex Block-Sparse Compressed Sensing. Communications in Nonlinear Science and Numerical Simulation, 29, 416-426. https://doi.org/10.1016/j.cnsns.2015.05.022
[13]
Chartrand, R. (2007) Nonconvex Compressed Sensing and Error Correction. 2007 IEEE International Conference on Acoustics, Speech and Signal Processing-ICASSP’07. Honolulu, 15-20 April 2007, III-889-III-892. https://doi.org/10.1109/ICASSP.2007.366823
[14]
Candes, E.J. and Tao, T. (2005) Decoding by Linear Programming. IEEE Transactions on Information Theory, 51, 4203-4215. https://doi.org/10.1109/TIT.2005.858979
[15]
Kong, L.C. and Xiu, N.H. (2011) Exact Low-Rank Matrix Recovery via Nonconvex Mp-Minimization. Optimization.
[16]
Zhang, M., Huang, Z.H. and Zhang, Y. (2013) Restricted P-Isometry Properties of Nonconvex Matrix Recovery. IEEE Transactions on Information Theory, 59, 4316-4323. https://doi.org/10.1109/TIT.2013.2250577
[17]
Kong, L. and Xiu, N. (2013) Exact Low-Rank Matrix Recovery via Nonconvex Schatten P-Minimization. Asia-Pacific Journal of Operational Research, 30, Article 1340010. https://doi.org/10.1142/S0217595913400101
[18]
Gao, Y., Peng, J., Yue, S., et al. (2015) On the Null Space Property of lp-Minimization for 0<q≤1 in Compressed Sensing. Journal of Function Spaces, 2015, Article ID 579853. https://doi.org/10.1155/2015/579853
[19]
Herman, M.A. and Strohmer, T. (2010) General Deviants: An Analysis of Perturbations in Compressed Sensing. IEEE Journal of Selected Topics in Signal Processing, 4, 342-349. https://doi.org/10.1109/JSTSP.2009.2039170
[20]
Huang, J., Wang, J., Zhang, F., et al. (2021) Perturbation Analysis of Low-Rank Matrix Stable Recovery. International Journal of Wavelets, Multiresolution and Information Processing, 19, Article 2050091. https://doi.org/10.1142/S0219691320500915
