{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:00:19Z","timestamp":1765357219364,"version":"3.37.3"},"reference-count":69,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62031013","61871154","62106063"],"award-info":[{"award-number":["62031013","61871154","62106063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515010819"],"award-info":[{"award-number":["2022A1515010819"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61906124"],"award-info":[{"award-number":["61906124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic and Applied Basic Research Fund of Guangdong Province","award":["2019A1515011307"],"award-info":[{"award-number":["2019A1515011307"]}]},{"name":"Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies","award":["2022B1212010005"],"award-info":[{"award-number":["2022B1212010005"]}]},{"name":"Shenzhen College Stability Support Plan","award":["GXWD20201230155427003-20200824113231001"],"award-info":[{"award-number":["GXWD20201230155427003-20200824113231001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tmm.2022.3207922","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T19:58:17Z","timestamp":1663617497000},"page":"6371-6383","source":"Crossref","is-referenced-by-count":6,"title":["Bilateral Fast Low-Rank Representation With Equivalent Transformation for Subspace Clustering"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3564-6042","authenticated-orcid":false,"given":"Qiangqiang","family":"Shen","sequence":"first","affiliation":[{"name":"School of Electronics and Information Engineering, Harbin Institute of Technology Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4771-6105","authenticated-orcid":false,"given":"Shuangyan","family":"Yi","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Shenzhen Institute of Information Technology, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0891-5577","authenticated-orcid":false,"given":"Yongsheng","family":"Liang","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Harbin Institute of Technology Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1970-1993","authenticated-orcid":false,"given":"Yongyong","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Information Technology, Harbin Institute of Technology, Shenzhen, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"12416","article-title":"Selective sampling-based scalable sparse subspace clustering","author":"matsushima","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3047405"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00421"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2021.3078327"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.62"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2192742"},{"key":"ref53","first-page":"1529","article-title":"Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","author":"hong","year":"0","journal-title":"Proc 34rd Int Conf Mach Learn"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.440"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1085"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ipr.2018.6596"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2007.07.005"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3112230"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2954874"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2021.3055625"},{"key":"ref18","first-page":"1874","article-title":"Subspace clustering via new low-rank model with discrete group structure constraint","author":"nie","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref51","first-page":"913","article-title":"Distributed matrix completion and robust factorization","volume":"16","author":"mackey","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref50","first-page":"8422","article-title":"Distributed low-rank matrix factorization with exact consensus","author":"zhu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2014.7032158"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2012.69"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2917857"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2878293"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-013-9686-z"},{"article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","year":"2009","author":"lin","key":"ref41"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9742-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/120896219"},{"key":"ref49","first-page":"1134","article-title":"Divide-and-conquer matrix factorization","author":"mackey","year":"0","journal-title":"Proc 24th Int Conf Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2985817"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.3010631"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.882016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3110098"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.461"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2746268"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2877660"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1049\/el.2014.1396"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.07.003"},{"journal-title":"A Method for Nonlinear Constraints in Minimization Problems","year":"1972","author":"powell","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299092"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9464"},{"article-title":"Matrix rank minimization with applications","year":"2002","author":"fazel","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2020.2975394"},{"key":"ref1","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"0","journal-title":"Proc 27rd Int Conf Mach Learn"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"ref38","first-page":"327","article-title":"On the solution of a class of non linear Dirichlet problems by a penalty-duality method and finite elements of order one","author":"glowinski","year":"0","journal-title":"Proc Optim Techn IFIP Tech Conf"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00528"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2013.6738777"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2021.3096218"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2020.3008367"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.114"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126422"},{"key":"ref64","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","article-title":"Fixed-point continuation for $\\ell _{1}$-Minimization: Methodology and convergence","volume":"19","author":"yin","year":"2008","journal-title":"SIAM J Optim"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.12.034"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2915593"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/34.291440"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995365"},{"key":"ref65","first-page":"178","article-title":"Learning generative visual models from few training examples: An incremental Bayesian approach tested on 101 object categories","author":"li","year":"0","journal-title":"Proc Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref27","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low-rank representation","author":"lin","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2886712"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_12"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/10016790\/09895324.pdf?arnumber=9895324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T20:02:55Z","timestamp":1701115375000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9895324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1109\/tmm.2022.3207922","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"type":"print","value":"1520-9210"},{"type":"electronic","value":"1941-0077"}],"subject":[],"published":{"date-parts":[[2023]]}}}