乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:22Z","timestamp":1740133222226,"version":"3.37.3"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Hong Kong Scholars Program and the HK RGC GRF","award":["PolyU 5313\/13E"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402480","61432008","61472423","61502495","41401383","61373077"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/tip.2016.2599290","type":"journal-article","created":{"date-parts":[[2016,8,10]],"date-time":"2016-08-10T16:01:14Z","timestamp":1470844874000},"page":"4842-4857","source":"Crossref","is-referenced-by-count":331,"title":["Weighted Schatten <inline-formula> <tex-math notation=\"LaTeX\">$p$ <\/tex-math> <\/inline-formula>-Norm Minimization for Image Denoising and Background Subtraction"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6945-7437","authenticated-orcid":false,"given":"Yuan","family":"Xie","sequence":"first","affiliation":[]},{"given":"Shuhang","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Wangmeng","family":"Zuo","sequence":"additional","affiliation":[]},{"given":"Wensheng","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2078-4215","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2293425"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126278"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.34"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01647331"},{"key":"ref31","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"mohan","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2172799"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.836169"},{"article-title":"The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices","year":"2009","author":"lin","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/040619582"},{"key":"ref10","article-title":"Weighted low-rank approximations","author":"srebro","year":"2003","journal-title":"Proc IEEE Int Conf Mach Learn"},{"key":"ref40","article-title":"Robust principal component analysis with complex noise","author":"zhao","year":"2014","journal-title":"Proc IEEE Int Conf Mach Learn"},{"key":"ref11","first-page":"771","article-title":"Efficient computation of robust low-rank matrix approximations in the presence of missing data using the $L_{1}$ norm","author":"eriksson","year":"2010","journal-title":"Proc IEEE Comput Vis Pattern Recognit"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","article-title":"Robust principal component analysis?","volume":"58","author":"cand\u00e8s","year":"2009","journal-title":"J ACM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.118"},{"key":"ref14","first-page":"739","article-title":"Robust $L_{1}$ norm factorization in the presence of outliers and missing data by alternative convex programming","author":"ke","year":"2005","journal-title":"Proc IEEE Comput Vis Pattern Recognit"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33786-4_10"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2574748"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2458986"},{"article-title":"Matrix rank minimization with applications","year":"2002","author":"fazel","key":"ref19"},{"key":"ref28","first-page":"655","article-title":"Low-rank matrix recovery via efficient schatten p-norm minimization","author":"nie","year":"2012","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023709501986"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.901238"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2014.02.015"},{"key":"ref5","first-page":"1410","article-title":"Practical low-rank matrix approximation under robust $L_{1}$ norm","author":"zheng","year":"2012","journal-title":"Proc IEEE Comput Vis Pattern Recognit"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459452"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2221729"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995369"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2541318"},{"key":"ref1","first-page":"1","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.366"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-013-0645-9"},{"key":"ref24","first-page":"2192","article-title":"Matrix completion by truncated nuclear norm regularization","author":"zhang","year":"2012","journal-title":"Proc IEEE Comput Vis Pattern Recognit"},{"journal-title":"The Berkeley Segmentation Dataset and Benchmark","year":"2007","key":"ref41"},{"key":"ref23","first-page":"1805","article-title":"Generalized singular value thresholding","author":"lu","year":"2015","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2013.2258174"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2509418"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.25"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/7529254\/07539605.pdf?arnumber=7539605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:37Z","timestamp":1641987817000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7539605\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":44,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tip.2016.2599290","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}