{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:51:52Z","timestamp":1760241112729,"version":"build-2065373602"},"reference-count":58,"publisher":"MDPI AG","issue":"23","license":[{"start":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:00:00Z","timestamp":1575331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Key projects of natural science research in universities in Anhui Province","award":["KJ2019A0994"],"award-info":[{"award-number":["KJ2019A0994"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The rapid development of sensor technology gives rise to the emergence of huge amounts of tensor (i.e., multi-dimensional array) data. For various reasons such as sensor failures and communication loss, the tensor data may be corrupted by not only small noises but also gross corruptions. This paper studies the Stable Tensor Principal Component Pursuit (STPCP) which aims to recover a tensor from its corrupted observations. Specifically, we propose a STPCP model based on the recently proposed tubal nuclear norm (TNN) which has shown superior performance in comparison with other tensor nuclear norms. Theoretically, we rigorously prove that under tensor incoherence conditions, the underlying tensor and the sparse corruption tensor can be stably recovered. Algorithmically, we first develop an ADMM algorithm and then accelerate it by designing a new algorithm based on orthogonal tensor factorization. The superiority and efficiency of the proposed algorithms is demonstrated through experiments on both synthetic and real data sets.<\/jats:p>","DOI":"10.3390\/s19235335","type":"journal-article","created":{"date-parts":[[2019,12,4]],"date-time":"2019-12-04T04:30:35Z","timestamp":1575433835000},"page":"5335","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Stable Tensor Principal Component Pursuit: Error Bounds and Efficient Algorithms"],"prefix":"10.3390","volume":"19","author":[{"given":"Wei","family":"Fang","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, Huaibei Vocational and Technical College, Huaibei 235000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongxu","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Physics and Electronic Electrical Engineering, Huaiyin Normal University, Huaian 223300, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Zhang","sequence":"additional","affiliation":[{"name":"Mathematics Teaching and Research Group, Nanjing No.9 High School, Nanjing 210018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,12,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","article-title":"Tensor completion for estimating missing values in visual data","volume":"35","author":"Liu","year":"2013","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., and Yan, S. (2019). Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans. Pattern Anal. Mach. Intell.","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","article-title":"Parallel matrix factorization for low-rank tensor completion","volume":"9","author":"Xu","year":"2015","journal-title":"Inverse Probl. Imaging"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/LSP.2013.2245416","article-title":"An Efficient Matrix Factorization Method for Tensor Completion","volume":"20","author":"Liu","year":"2013","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"35112","DOI":"10.1109\/ACCESS.2018.2850324","article-title":"Noisy Low-Tubal-Rank Tensor Completion Through Iterative Singular Tube Thresholding","volume":"6","author":"Wang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.trc.2012.12.007","article-title":"A tensor-based method for missing traffic data completion","volume":"28","author":"Tan","year":"2013","journal-title":"Transp. Res. Part C"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.neucom.2016.05.113","article-title":"Discriminative extreme learning machine with supervised sparsity preserving for image classification","volume":"261","author":"Peng","year":"2017","journal-title":"Neurocomputing"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","article-title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis","volume":"32","author":"Cichocki","year":"2015","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MSP.2018.2826566","article-title":"Robust subspace learning: Robust PCA, robust subspace tracking, and robust subspace recovery","volume":"35","author":"Vaswani","year":"2018","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1561\/2200000059","article-title":"Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions","volume":"9","author":"Cichocki","year":"2016","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10208-015-9269-5","article-title":"On Tensor Completion via Nuclear Norm Minimization","volume":"16","author":"Yuan","year":"2016","journal-title":"Found. Comput. Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","article-title":"The power of convex relaxation: Near-optimal matrix completion","volume":"56","author":"Tao","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","first-page":"45","article-title":"Most Tensor Problems Are NP-Hard","volume":"60","author":"Hillar","year":"2009","journal-title":"J. ACM"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"6753","DOI":"10.1109\/TIT.2017.2724549","article-title":"Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion","volume":"63","author":"Yuan","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","unstructured":"Tomioka, R., and Suzuki, T. (2013, January 5\u201310). Convex tensor decomposition via structured schatten norm regularization. Proceedings of the Advances in Neural Information Processing Systems, Lake Tahoe, NV, USA."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1109\/TIP.2014.2305840","article-title":"Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography","volume":"23","author":"Semerci","year":"2014","journal-title":"IEEE Trans. Image Process."},{"key":"ref_17","unstructured":"Mu, C., Huang, B., Wright, J., and Goldfarb, D. (2014, January 21\u201326). Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery. Proceedings of the International Conference on Machine Learning, Beijing, China."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Meng, D., Kong, X., Xie, Q., Cao, W., Wang, Y., and Xu, Z. (2015, January 7\u201313). A Novel Sparsity Measure for Tensor Recovery. Proceedings of the IEEE International Conference on Computer Vision, Santiago, Chile.","DOI":"10.1109\/ICCV.2015.39"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"11559","DOI":"10.1109\/ACCESS.2018.2811396","article-title":"Tensor Completion Using Spectral (k, p) -Support Norm","volume":"6","author":"Wei","year":"2018","journal-title":"IEEE Access"},{"key":"ref_20","unstructured":"Tomioka, R., Hayashi, K., and Kashima, H. (2010). Estimation of low-rank tensors via convex optimization. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/TIT.2016.2633413","article-title":"Sensing tensors with Gaussian filters","volume":"63","author":"Chretien","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ghadermarzy, N., Plan, Y., and Y\u0131lmaz, \u00d6. (2017). Near-optimal sample complexity for convex tensor completion. arXiv.","DOI":"10.1093\/imaiai\/iay019"},{"key":"ref_23","unstructured":"Ghadermarzy, N., Plan, Y., and Y\u0131lmaz, \u00d6. (2018). Learning tensors from partial binary measurements. arXiv."},{"key":"ref_24","unstructured":"Liu, Y., Shang, F., Fan, W., Cheng, J., and Cheng, H. (2014, January 8\u201313). Generalized Higher-Order Orthogonal Iteration for Tensor Decomposition and Completion. Proceedings of the Advances in Neural Information Processing Systems, Montreal, QC, Canada."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Ely, G., Aeron, S., Hao, N., and Kilmer, M. (2014, January 23\u201328). Novel methods for multilinear data completion and de-noising based on tensor-SVD. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA.","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Lin, Z., and Yan, S. (2018, January 13\u201319). Exact Low Tubal Rank Tensor Recovery from Gaussian Measurements. Proceedings of the 28th International Joint Conference on Artificial Intelligence, Stockholm, Sweden.","DOI":"10.24963\/ijcai.2018\/347"},{"key":"ref_27","unstructured":"Jiang, J.Q., and Ng, M.K. (2017). Exact Tensor Completion from Sparsely Corrupted Observations via Convex Optimization. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1007\/s11263-018-1086-2","article-title":"On Unifying Multi-view Self-Representations for Clustering by Tensor Multi-rank Minimization","volume":"126","author":"Xie","year":"2018","journal-title":"Int. J. Comput. Vis."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"V83","DOI":"10.1190\/geo2014-0467.1","article-title":"5D seismic data completion and denoising using a novel class of tensor decompositions","volume":"80","author":"Ely","year":"2015","journal-title":"Geophysics"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2411","DOI":"10.1109\/TMC.2015.2505729","article-title":"Adaptive Sampling of RF Fingerprints for Fine-grained Indoor Localization","volume":"15","author":"Liu","year":"2016","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.neucom.2018.11.012","article-title":"Noisy low-tubal-rank tensor completion","volume":"330","author":"Wang","year":"2019","journal-title":"Neurocomputing"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1109\/LSP.2018.2819892","article-title":"Tensor Completion via Generalized Tensor Tubal Rank Minimization using General Unfolding","volume":"25","author":"Sun","year":"2018","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/110837711","article-title":"Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging","volume":"34","author":"Kilmer","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Liu, X.Y., Aeron, S., Aggarwal, V., and Wang, X. (2016). Low-tubal-rank tensor completion using alternating minimization. arXiv.","DOI":"10.1117\/12.2224039"},{"key":"ref_35","unstructured":"Liu, X.Y., and Wang, X. (2017). Fourth-order tensors with multidimensional discrete transforms. arXiv."},{"key":"ref_36","unstructured":"Gu, Q., Gui, H., and Han, J. (2014, January 8\u201313). Robust tensor decomposition with gross corruption. Proceedings of the Advances in Neural Information Processing Systems, Montreal, QC, Canada."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"107319","DOI":"10.1016\/j.sigpro.2019.107319","article-title":"Robust tensor decomposition via t-SVD: Near-optimal statistical guarantee and scalable algorithms","volume":"167","author":"Wang","year":"2020","journal-title":"Signal Process."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","article-title":"Exact Tensor Completion Using t-SVD","volume":"65","author":"Zhang","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/130905010","article-title":"Robust low-rank tensor recovery: Models and algorithms","volume":"35","author":"Goldfarb","year":"2014","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"5897","DOI":"10.1109\/TSP.2015.2458788","article-title":"Subspace identification for DOA estimation in massive\/full-dimension MIMO systems: Bad data mitigation and automatic source enumeration","volume":"63","author":"Cheng","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1109\/JSTSP.2019.2937392","article-title":"Irregular Array Manifold Aided Channel Estimation in Massive MIMO Communications","volume":"13","author":"Cheng","year":"2019","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TNNLS.2015.2423694","article-title":"Bayesian robust tensor factorization for incomplete multiway data","volume":"27","author":"Zhao","year":"2016","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"ref_44","unstructured":"Zhou, Y., and Cheung, Y. (2019). Bayesian Low-Tubal-Rank Robust Tensor Factorization with Multi-Rank Determination. IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Li, X., Wright, J., Candes, E., and Ma, Y. (2010, January 12\u201318). Stable principal component pursuit. Proceedings of the 2010 IEEE International Symposium on Information Theory, Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513535"},{"key":"ref_46","first-page":"11","article-title":"Robust principal component analysis?","volume":"58","author":"Li","year":"2011","journal-title":"J. ACM"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., and Yan, S. (2016, January 27\u201330). Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA.","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref_48","first-page":"1","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd","year":"2011","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"8859","DOI":"10.1007\/s11042-016-3510-3","article-title":"Robust structured sparse representation via half-quadratic optimization for face recognition","volume":"76","author":"Peng","year":"2017","journal-title":"Multimed. Tools Appl."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"3371","DOI":"10.1162\/NECO_a_00369","article-title":"Active subspace: Toward scalable low-rank learning","volume":"24","author":"Liu","year":"2012","journal-title":"Neural Comput."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Wang, A., Jin, Z., and Yang, J. (2019). A Factorization Strategy for Tensor Robust PCA, ResearchGate.","DOI":"10.1007\/978-3-030-41404-7_30"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Jiang, Q., and Ng, M. (2019, January 10\u201316). Robust Low-Tubal-Rank Tensor Completion via Convex Optimization. Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao, China.","DOI":"10.24963\/ijcai.2019\/368"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.laa.2015.07.021","article-title":"Tensor\u2013tensor products with invertible linear transforms","volume":"485","author":"Kernfeld","year":"2015","journal-title":"Linear Algebra Its Appl."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Lu, C., Peng, X., and Wei, Y. (2019, January 16\u201320). Low-Rank Tensor Completion With a New Tensor Nuclear Norm Induced by Invertible Linear Transforms. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA.","DOI":"10.1109\/CVPR.2019.00615"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Liu, X.Y., Aeron, S., Aggarwal, V., and Wang, X. (2016, January 17\u201321). Low-tubal-rank tensor completion using alternating minimization. Proceedings of the SPIE Defense+ Security, Baltimore, MD, USA.","DOI":"10.1117\/12.2224039"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","article-title":"Tensor Factorization for Low-Rank Tensor Completion","volume":"27","author":"Zhou","year":"2018","journal-title":"IEEE Trans. Image Process."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"A474","DOI":"10.1137\/110841229","article-title":"An Order-p Tensor Factorization with Applications in Imaging","volume":"35","author":"Martin","year":"2013","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_58","unstructured":"Wang, A., and Jin, Z. (2019, December 03). Orientation Invariant Tubal Nuclear Norms Applied to Robust Tensor Decomposition. Available online: https:\/\/www.researchgate.net\/publication\/329116872_Orientation_Invariant_Tubal_Nuclear_Norms_Applied_to_Robust_Tensor_Decomposition."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/23\/5335\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:39:55Z","timestamp":1760189995000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/23\/5335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,3]]},"references-count":58,"journal-issue":{"issue":"23","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["s19235335"],"URL":"https:\/\/doi.org\/10.3390\/s19235335","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2019,12,3]]}}}