{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:57:09Z","timestamp":1780088229539,"version":"3.54.0"},"reference-count":48,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Big Data"],"abstract":"<jats:p>Low-rank tensor completion (LRTC), which aims to complete missing entries from tensors with partially observed terms by utilizing the low-rank structure of tensors, has been widely used in various real-world issues. The core tensor nuclear norm minimization (CTNM) method based on Tucker decomposition is one of common LRTC methods. However, the CTNM methods based on Tucker decomposition often have a large computing cost due to the fact that the general factor matrix solving technique involves multiple singular value decompositions (SVDs) in each loop. To address this problem, this article enhances the method and proposes an effective CTNM method based on thin QR decomposition (CTNM-QR) with lower computing complexity. The proposed method extends the CTNM by introducing tensor versions of the auxiliary variables instead of matrices, while using the thin QR decomposition to solve the factor matrix rather than the SVD, which can save the computational complexity and improve the tensor completion accuracy. In addition, the CTNM-QR method's convergence and complexity are analyzed further. Numerous experiments in synthetic data, real color images, and brain MRI data at different missing rates demonstrate that the proposed method not only outperforms in terms of completion accuracy and visualization, but also conducts more efficiently than most state-of-the-art LRTC methods.<\/jats:p>","DOI":"10.3389\/fdata.2024.1382144","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T15:22:07Z","timestamp":1719933727000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient enhancement of low-rank tensor completion via thin QR decomposition"],"prefix":"10.3389","volume":"7","author":[{"given":"Yan","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunzhi","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1965","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chemolab.2010.08.004","article-title":"Scalable tensor factorizations for incomplete data","volume":"106","author":"Acar","year":"2011","journal-title":"Chemomet. Intell. Lab. Syst"},{"key":"B2","doi-asserted-by":"publisher","first-page":"107538","DOI":"10.1016\/j.patcog.2020.107538","article-title":"Decomvqanet: decomposing visual question answering deep network via tensor decomposition and regression","volume":"110","author":"Bai","year":"2021","journal-title":"Pattern Recognit"},{"key":"B3","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","article-title":"Efficient tensor completion for color image and video recovery: low-rank tensor train","volume":"26","author":"Bengua","year":"2017","journal-title":"IEEE Transact. Image Process"},{"key":"B4","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/moor.2019.1008","article-title":"The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates","volume":"45","author":"Bo\u0163","year":"2020","journal-title":"Math. Operat. Res"},{"key":"B5","doi-asserted-by":"crossref","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"Boumal","year":"2023"},{"key":"B6","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM J. Optimiz"},{"key":"B7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","article-title":"Exact matrix completion via convex optimization","volume":"55","author":"Candes","year":"2012","journal-title":"Commun. ACM"},{"key":"B8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02288739","article-title":"Parallel proportional profiles and other principles for determining the choice of factors by rotation","volume":"9","author":"Cattell","year":"1944","journal-title":"Psychometrika"},{"key":"B9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.3390\/jimaging7070110","article-title":"Hosvd-based algorithm for weighted tensor completion","volume":"7","author":"Chao","year":"2021","journal-title":"J. Imaging"},{"key":"B10","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","article-title":"A multilinear singular value decomposition","volume":"21","author":"De Lathauwer","year":"","journal-title":"SIAM J. Matrix Anal. Appl"},{"key":"B11","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","article-title":"On the best rank-1 and rank-(r1, r2,..., rn) approximation of higher-order tensors","volume":"21","author":"De Lathauwer","year":"","journal-title":"SIAM J. Matrix Anal. Appl"},{"key":"B12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s11045-013-0269-9","article-title":"Tucker factorization with missing data with application to low-n-rank tensor completion","volume":"26","author":"Filipovi\u0107","year":"2015","journal-title":"Multidimens. Syst. Signal Process"},{"key":"B13","doi-asserted-by":"publisher","first-page":"025010","DOI":"10.1088\/0266-5611\/27\/2\/025010","article-title":"Tensor completion and low-n-rank tensor recovery via convex optimization","volume":"27","author":"Gandy","year":"2011","journal-title":"Inverse Probl"},{"key":"B14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-94-017-9054-3_4","volume-title":"On Alternating Direction Methods of Multipliers: A Historical Perspective. Modeling, Simulation and Optimization for Science and Technology","author":"Glowinski","year":"2014"},{"key":"B15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40305-021-00368-3","article-title":"A survey on some recent developments of alternating direction method of multipliers","volume":"10","author":"Han","year":"2022","journal-title":"J. Operat. Res. Soc. China"},{"key":"B16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2512329","article-title":"Most tensor problems are np-hard","volume":"60","author":"Hillar","year":"2013","journal-title":"J. ACM"},{"key":"B17","first-page":"2114","article-title":"Tensor completion for estimating missing values in visual data","volume-title":"International Conference on Computer Vision","author":"Ji","year":"2009"},{"key":"B18","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TCSVT.2018.2841825","article-title":"Incremental tensor-based completion method for detection of stationary foreground objects","volume":"29","author":"Kajo","year":"2019","journal-title":"IEEE Transact. Circ. Syst. Video Technol"},{"key":"B19","first-page":"1012","article-title":"Low-rank tensor completion: a riemannian manifold preconditioning approach","volume-title":"Proceedings of the 33rd International Conference on Machine Learning, Vol. 48","author":"Kasai","year":"2016"},{"key":"B20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev"},{"key":"B21","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10543-013-0455-z","article-title":"Low-rank tensor completion by riemannian optimization","volume":"54","author":"Kressner","year":"2014","journal-title":"BIT Numer. Math"},{"key":"B22","doi-asserted-by":"publisher","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":"B23","volume-title":"Algorithm Research of Fast Low-Rank Matrix and Tensor Recovery","author":"Liu","year":"2013"},{"key":"B24","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/TCSVT.2019.2901311","article-title":"Low cp rank and tucker rank tensor completion for estimating missing components in image data","volume":"30","author":"Liu","year":"","journal-title":"IEEE Transact. Circ. Syst. Video Technol"},{"key":"B25","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TMM.2018.2859026","article-title":"Image completion using low tensor tree rank and total variation minimization","volume":"21","author":"Liu","year":"","journal-title":"IEEE Transact. Multim"},{"key":"B26","first-page":"866","article-title":"Factor matrix trace norm minimization for low-rank tensor completion","volume-title":"Proceedings of the 2014 SIAM International Conference on Data Mining (SDM)","author":"Liu","year":""},{"key":"B27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5555\/2968826.2969023","article-title":"Generalized higher-order orthogonal iteration for tensor decomposition and completion","volume":"27","author":"Liu","year":"","journal-title":"Adv. Neural Inf. Process. Syst"},{"key":"B28","doi-asserted-by":"publisher","first-page":"107505","DOI":"10.1016\/j.patcog.2020.107505","article-title":"Low-rank quaternion tensor completion for recovering color videos and images","volume":"107","author":"Miao","year":"2020","journal-title":"Pattern Recognit"},{"key":"B29","first-page":"73","article-title":"Square deal: lower bounds and improved relaxations for tensor recovery","volume-title":"Proceedings of the 31st International Conference on Machine Learning, Vol. 32","author":"Mu","year":"2014"},{"key":"B30","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","article-title":"Tensor-train decomposition","volume":"33","author":"Oseledets","year":"2011","journal-title":"SIAM J. Sci. Comp"},{"key":"B31","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/JPROC.2021.3074329","article-title":"Tensor methods in computer vision and deep learning","volume":"109","author":"Panagakis","year":"2021","journal-title":"Proc. IEEE"},{"key":"B32","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1109\/TNNLS.2022.3181378","article-title":"Noisy tensor completion via low-rank tensor ring","volume":"35","author":"Qiu","year":"2022","journal-title":"IEEE Transact. Neural Netw. Learn. Syst"},{"key":"B33","first-page":"2967","article-title":"A new convex relaxation for tensor completion","volume-title":"Proceedings of the 26th International Conference on Neural Information Processing Systems, Vol. 2","author":"Romera-Paredes","year":"2013"},{"key":"B34","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/TFUZZ.2017.2760287","article-title":"Fuzzy double trace norm minimization for recommendation systems","volume":"26","author":"Shang","year":"2017","journal-title":"IEEE Transact. Fuzzy Syst"},{"key":"B35","doi-asserted-by":"publisher","first-page":"3759","DOI":"10.12733\/jcis14329","article-title":"Low-rank tensor completion via tucker decompositions","volume":"11","author":"Shi","year":"2015","journal-title":"J. Comp. Inf. Syst"},{"key":"B36","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1145\/3132847.3132945","article-title":"Tensor rank estimation and completion via cp-based nuclear norm","volume-title":"Proceedings of the 2017 ACM on Conference on Information and Knowledge Management (CIKM)","author":"Shi","year":"2017"},{"key":"B37","volume-title":"Nuclear Norms for Tensors and Their Use for Convex Multilinear Estimation. Submitted to Linear Algebra and Its Applications","author":"Signoretto","year":"2010"},{"key":"B38","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ins.2022.10.061","article-title":"Iterative tensor eigen rank minimization for low-rank tensor completion","volume":"616","author":"Su","year":"2022","journal-title":"Inf. Sci"},{"key":"B39","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1108\/09534810210423008","article-title":"Implications of factor analysis of three-way matrices for measurement of change","volume":"15","author":"Tucker","year":"1963","journal-title":"Probl. Meas. Change"},{"key":"B40","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.ins.2021.07.035","article-title":"Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization","volume":"578","author":"Xu","year":"2021","journal-title":"Inf. Sci"},{"key":"B41","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.23919\/EUSIPCO.2018.8553013","article-title":"Independent low-rank tensor analysis for audio source separation","volume-title":"2018 26th European Signal Processing Conference (EUSIPCO)","author":"Yoshii","year":"2018"},{"key":"B42","doi-asserted-by":"publisher","first-page":"e2464","DOI":"10.1002\/nla.2464","article-title":"Low tucker rank tensor completion using a symmetric block coordinate descent method","volume":"30","author":"Yu","year":"2023","journal-title":"Numer. Linear Algebra Appl"},{"key":"B43","first-page":"9151","article-title":"Tensor ring decomposition with rank minimization on latent space: an efficient approach for tensor completion","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33","author":"Yuan","year":""},{"key":"B44","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-319-70087-8_24","article-title":"Completion of high order tensor data with missing entries via tensor-train decomposition","volume-title":"International Conference on Neural Information Processing","author":"Yuan","year":"2017"},{"key":"B45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.image.2018.11.012","article-title":"High-order tensor completion via gradient-based optimization under tensor train format","volume":"73","author":"Yuan","year":"","journal-title":"Signal Process. Image Commun"},{"key":"B46","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","article-title":"Exact tensor completion using t-svd","volume":"65","author":"Zhang","year":"2016","journal-title":"IEEE Transact. Signal Process"},{"key":"B47","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.neucom.2020.03.018","article-title":"Deep plug-and-play prior for low-rank tensor completion","volume":"400","author":"Zhao","year":"2020","journal-title":"Neurocomputing"},{"key":"B48","doi-asserted-by":"publisher","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 Transact. Image Process"}],"container-title":["Frontiers in Big Data"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2024.1382144\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T08:38:34Z","timestamp":1732351114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fdata.2024.1382144\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":48,"alternative-id":["10.3389\/fdata.2024.1382144"],"URL":"https:\/\/doi.org\/10.3389\/fdata.2024.1382144","relation":{},"ISSN":["2624-909X"],"issn-type":[{"value":"2624-909X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"article-number":"1382144"}}