{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:56Z","timestamp":1740169196072,"version":"3.37.3"},"reference-count":28,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3010974","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T20:48:06Z","timestamp":1595364486000},"page":"133974-133981","source":"Crossref","is-referenced-by-count":0,"title":["Enhanced PSSV for Incomplete Data Analysis"],"prefix":"10.1109","volume":"8","author":[{"given":"Weimin","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5220-9090","authenticated-orcid":false,"given":"Qin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"5104","article-title":"Factor group-sparse regularization for efficient low-rank matrix recovery","author":"fan","year":"2019","journal-title":"Proc NeurIPS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref12","article-title":"Weighted algorithms for compressed sensing and matrix completion","author":"gaiffas","year":"2011","journal-title":"arXiv 1107 1638"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/ast036"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.448"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.274"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465956"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.282"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0515-x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1096-9861(19960429)368:2<229::AID-CNE5>3.0.CO;2-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1991.139758"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/AFGR.2002.1004130"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.322"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143880"},{"key":"ref5","first-page":"739","article-title":"Robust $\\ell_{1}$\n norm factorization in the presence of outliers and missing data by alternative convex programming","author":"ke","year":"2005","journal-title":"Proc IEEE CVPR"},{"key":"ref8","first-page":"281","article-title":"Robust formulation for PCA: Avoiding mean calculation with $\\ell_{2,p}$\n-norm maximization","author":"liao","year":"2018","journal-title":"Proc AAAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2777184"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2712740"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2909686"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref22","first-page":"235","volume":"55","author":"horn","year":"2013","journal-title":"Matrix Analysis"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.07.038"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/070698920"},{"key":"ref23","first-page":"111","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"boyd","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2728181"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23222-5_57"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09145760.pdf?arnumber=9145760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:32Z","timestamp":1642003052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9145760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3010974","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}