{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T06:25:32Z","timestamp":1775543132324,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100002855","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"publisher","award":["2015CB352303"],"award-info":[{"award-number":["2015CB352303"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"publisher","award":["2015CB352502"],"award-info":[{"award-number":["2015CB352502"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671027"],"award-info":[{"award-number":["61671027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61625301"],"award-info":[{"award-number":["61625301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61731018"],"award-info":[{"award-number":["61731018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61231002"],"award-info":[{"award-number":["61231002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005144","name":"Qualcomm","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tip.2017.2762595","type":"journal-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T18:15:09Z","timestamp":1507832109000},"page":"1152-1163","source":"Crossref","is-referenced-by-count":290,"title":["Tensor Factorization for Low-Rank Tensor Completion"],"prefix":"10.1109","volume":"27","author":[{"given":"Pan","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9542-8346","authenticated-orcid":false,"given":"Canyi","family":"Lu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1493-7569","authenticated-orcid":false,"given":"Zhouchen","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref32","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","author":"mu","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref31","author":"landsberg","year":"2012","journal-title":"Tensors Geometry and Applications"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/110841229"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5366-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2305840"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.003"},{"key":"ref27","first-page":"1","article-title":"Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization","volume":"29","author":"shen","year":"2012","journal-title":"Optim Methods Softw"},{"key":"ref29","first-page":"406","article-title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","author":"boumal","year":"2011","journal-title":"Proc Conf Neutral Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2245416"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2013.11.020"},{"key":"ref40","first-page":"41","volume":"87","author":"jolliffe","year":"2010","journal-title":"Principal Component Analysis"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.419"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref15","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011","journal-title":"Proc Conf Neutral Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2512329"},{"key":"ref17","first-page":"2519","article-title":"Tensor decomposition for fast parsing with latent-variable PCFGs","author":"collins","year":"2012","journal-title":"Proc Conf Neutral Inf Process Syst"},{"key":"ref18","first-page":"1284","article-title":"Learning context-sensitive word embeddings with neural tensor skip-Gram model","author":"liu","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref19","first-page":"1444","article-title":"Multilinear multitask learning","author":"romera-paredes","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","first-page":"2967","article-title":"A new convex relaxation for tensor completion","author":"romera-paredes","year":"2013","journal-title":"Proc Conf Neutral Inf Process Syst"},{"key":"ref3","first-page":"208","article-title":"Parallel matrix factorization for low-rank tensor completion","volume":"9","author":"xu","year":"2013","journal-title":"Inverse Problems Imag"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref5","first-page":"1","article-title":"Low-rank tensor completion: A Riemannian manifold preconditioning approach","author":"kasai","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1"},{"key":"ref7","first-page":"25010-1","article-title":"Tensor completion and low-n-rank tensor recovery via convex optimization","volume":"27","author":"gandy","year":"2010","journal-title":"Inverse Problems"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864727"},{"key":"ref46","first-page":"2761","article-title":"Beyond RPCA: Flattening complex noise in the frequency domain","author":"wang","year":"2017","journal-title":"Proc AAAI"},{"key":"ref45","first-page":"3143","article-title":"Exact recoverability of robust pca via outlier pursuit with tight recovery bounds","author":"zhang","year":"2015","journal-title":"Proc AAAI"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2678798"},{"key":"ref47","article-title":"Dictionary learning with structured noise","author":"zhou","year":"2017","journal-title":"Neurocomputing"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref41","author":"liu","year":"2016","journal-title":"Low-tubal-rank tensor completion using alternating minimization"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2623487"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2436951"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/8167422\/08066348.pdf?arnumber=8066348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:10Z","timestamp":1642004710000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8066348\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tip.2017.2762595","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}