{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T06:41:35Z","timestamp":1721803295205},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2015CB351703","2015CB351706"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1613223","6157021026","61305033"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&D Program of China","award":["2017YFB1302300"]},{"name":"Fundamental Research Funds for Central Universities","award":["ZYGX2014Z009"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. Video Technol."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/tcsvt.2018.2856827","type":"journal-article","created":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T15:19:24Z","timestamp":1531927164000},"page":"1946-1961","source":"Crossref","is-referenced-by-count":11,"title":["Robust High-Order Manifold Constrained Sparse Principal Component Analysis for Image Representation"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0434-6231","authenticated-orcid":false,"given":"Nan","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Yuanhua","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1710-3818","authenticated-orcid":false,"given":"Badong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"xu","year":"2014","journal-title":"A globally convergent algorithm for nonconvex optimization based on block coordinate update"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.12.008"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.09.002"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.57"},{"key":"ref31","first-page":"1633","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","volume":"19","author":"zhou","year":"2006","journal-title":"Proc NIPS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2190083"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2015.12.011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.4310\/AMSA.2016.v1.n1.a2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/34.120331"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143880"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-014-0074-y"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.114"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.07.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.896065"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.01.002"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.448"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2204435"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2428713"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2539127"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2319308"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2008.918957"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.63"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2013.11.002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2009.2028255"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.25"},{"key":"ref8","first-page":"739","article-title":"Robust l1 norm factorization in the presence of outliers and missing data by alternative convex programming","volume":"1","author":"ke","year":"2005","journal-title":"Proc Comput Vis Pattern Recognit"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015408"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2103949"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1037\/h0071325"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-107"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553526"},{"key":"ref22","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"},{"key":"ref21","first-page":"2504","article-title":"$L_{2}$\n, 1 regularized correntropy for robust feature selection","author":"he","year":"2012","journal-title":"Proc IEEE Comput Vis Pattern Recognit"},{"key":"ref42","first-page":"487","article-title":"Proximal methods for sparse hierarchical dictionary learning","author":"jenatton","year":"2010","journal-title":"Proc 27th Int Conf Mach Learn (ICML)"},{"key":"ref24","first-page":"915","article-title":"Spectral bounds for sparse PCA: Exact and greedy algorithms","author":"moghaddam","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","author":"chen","year":"2011","journal-title":"Projection onto A Simplex"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref44","volume":"26","author":"silverman","year":"1986","journal-title":"Density Estimation for Statistics and Data Analysis"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401971"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/wics.101"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.89"}],"container-title":["IEEE Transactions on Circuits and Systems for Video Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/76\/8751741\/08412267.pdf?arnumber=8412267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:56:27Z","timestamp":1657745787000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8412267\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":45,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcsvt.2018.2856827","relation":{},"ISSN":["1051-8215","1558-2205"],"issn-type":[{"value":"1051-8215","type":"print"},{"value":"1558-2205","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}