{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:46:45Z","timestamp":1759042005395,"version":"3.37.3"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602413","61873240","U1509207"],"award-info":[{"award-number":["61602413","61873240","U1509207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["Y19F030047"],"award-info":[{"award-number":["Y19F030047"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Royal Society-Newton Mobility","award":["IE151018"],"award-info":[{"award-number":["IE151018"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2870371","type":"journal-article","created":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T18:31:41Z","timestamp":1537209101000},"page":"51693-51707","source":"Crossref","is-referenced-by-count":10,"title":["Iterative Reconstrained Low-Rank Representation via Weighted Nonconvex Regularizer"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6017-0552","authenticated-orcid":false,"given":"Jianwei","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengyong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","volume":"1","author":"li","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1137\/080716542"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TPAMI.2016.2535218"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1016\/j.neucom.2017.03.071"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TIP.2018.2825647"},{"key":"ref30","first-page":"3547","article-title":"Robust subspace segmentation by simultaneously learning data representations and their affinity matrix","author":"guo","year":"2015","journal-title":"Proc Int Conf Artif Intell"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1109\/TPAMI.2010.220","article-title":"Maximum correntropy criterion for robust face recognition","volume":"33","author":"he","year":"2011","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/TIP.2017.2681841"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TPAMI.2017.2689021"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/s11263-013-0611-6"},{"key":"ref28","first-page":"2300","article-title":"Towards faster rates and oracle property for low-rank matrix estimation","author":"gui","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIP.2016.2599290"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TKDE.2017.2650229"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TSP.2017.2684746"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TPAMI.2012.88"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TPAMI.2015.2462360"},{"key":"ref22","first-page":"97","article-title":"An efficient truncated nuclear norm constrained matrix completion for image inpainting","author":"zheng","year":"2018","journal-title":"Proc Comput Graph Int"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/TNNLS.2016.2608834"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/j.neucom.2018.03.035"},{"key":"ref23","first-page":"1081","article-title":"Analysis of multi-stage convex relaxation for sparse regularization","volume":"11","author":"zhang","year":"2010","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/s11263-016-0930-5"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIP.2015.2511584"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1016\/j.cosrev.2016.11.001"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/CVPR.2014.495"},{"year":"2013","author":"vila","article-title":"Parametric region-based foreground segmentation in planar and multi-view sequences","key":"ref52"},{"key":"ref10","first-page":"347","article-title":"Robust and efficient subspace segmentation via least squares regression","author":"lu","year":"2012","journal-title":"Proc Eur Conf Comput Vis"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TPAMI.2013.57"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref12","first-page":"211","article-title":"Robust PCA via nonconvex rank approximation","author":"kang","year":"2015","journal-title":"Proc IEEE Conf Data Mining"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TCYB.2016.2623638"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TCYB.2016.2536752"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/LSP.2016.2573159"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TCYB.2013.2286106"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIP.2012.2235849"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TIP.2016.2642784"},{"key":"ref19","first-page":"1874","article-title":"Subspace clustering via new low-rank model with discrete group structure constraint","author":"nie","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/j.ins.2017.09.047"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TIP.2018.2806279"},{"key":"ref6","article-title":"Transfer hashing: From shallow to deep","author":"zhou","year":"0","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref5","first-page":"1925","article-title":"Deep subspace clustering with sparsity prior","author":"peng","year":"2016","journal-title":"Proc 25th Int Conf Artif Intell"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIP.2017.2691557"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/CVPR.2014.484"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1109\/TPAMI.2017.2677440"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIP.2015.2472277"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1137\/090771806"},{"key":"ref45","first-page":"1805","article-title":"Generalized singular value thresholding","author":"lu","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"year":"2017","author":"li","journal-title":"A fast implementation of singular value thresholding algorithm using recycling rank revealing randomized singular value decomposition","key":"ref48"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1137\/15M1026080"},{"key":"ref42","first-page":"575","article-title":"Nuclear norm minimization via active subspace selection","author":"hsieh","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref41","first-page":"3308","article-title":"Efficient inexact proximal gradient algorithm for nonconvex problems","author":"yao","year":"2017","journal-title":"Proc Int Conf Artif Intell"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1137\/080738970"},{"key":"ref43","first-page":"539","article-title":"Fast low-rank matrix learning with nonconvex regularization","author":"yao","year":"2015","journal-title":"Proc Int Conf Data Mining"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08466962.pdf?arnumber=8466962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:36Z","timestamp":1642004136000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8466962\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2870371","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}