{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:13:54Z","timestamp":1740132834503,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"New Generation AI Major Project of Ministry of Science and Technology of China","award":["2018AAA0102501"],"award-info":[{"award-number":["2018AAA0102501"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61825601","61532009"],"award-info":[{"award-number":["61825601","61532009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SenseTime Research Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/lsp.2020.3008043","type":"journal-article","created":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T20:08:36Z","timestamp":1594238916000},"page":"1265-1269","source":"Crossref","is-referenced-by-count":1,"title":["Selecting Optimal Completion to Partial Matrix via Self-Validation"],"prefix":"10.1109","volume":"27","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9428-4387","authenticated-orcid":false,"given":"Guangcan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wayne","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5512-6984","authenticated-orcid":false,"given":"Qingshan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1412","article-title":"Scaled gradients on grassmann manifolds for matrix completion","author":"ngo","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2586753"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2937869"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2708750"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2685518"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.2970306"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.141"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458205"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12521"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2005.1530344"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"article-title":"Recovey of future data via convolution nuclear norm minimization","year":"2019","author":"liu","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835895"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref20","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref21","first-page":"785","article-title":"A new theory for matrix completion","author":"liu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/8966529\/09136847.pdf?arnumber=9136847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:47:50Z","timestamp":1651070870000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9136847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/lsp.2020.3008043","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"type":"print","value":"1070-9908"},{"type":"electronic","value":"1558-2361"}],"subject":[],"published":{"date-parts":[[2020]]}}}