{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T12:07:17Z","timestamp":1783685237655,"version":"3.55.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["18RICOR029"],"award-info":[{"award-number":["18RICOR029"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1808582"],"award-info":[{"award-number":["1808582"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2955134","type":"journal-article","created":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T20:38:32Z","timestamp":1576787912000},"page":"178454-178465","source":"Crossref","is-referenced-by-count":35,"title":["L1-Norm Tucker Tensor Decomposition"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6464-0723","authenticated-orcid":false,"given":"Dimitris G.","family":"Chachlakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4272-423X","authenticated-orcid":false,"given":"Ashley","family":"Prater-Bennette","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9686-779X","authenticated-orcid":false,"given":"Panos P.","family":"Markopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1065807:1","article-title":"Robust decomposition of 3-way tensors based on L1-norm","volume":"10658","author":"chachlakis","year":"2018","journal-title":"Proc SPIE"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2009.2020337"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/130905010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2469642"},{"key":"ref31","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1261097"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/RADAR.2017.7944501"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2514848"},{"key":"ref35","first-page":"1225","article-title":"L1-fusion: Robust linear-time image recovery from few severely corrupted copies","author":"markopoulos","year":"2015","journal-title":"Proc IEEE Int Conf Image Process"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2338077"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646385"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1587\/nolta.1.37"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1117\/12.2520140"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.32"},{"key":"ref64","author":"smith","year":"2017","journal-title":"FROSTT The formidable repository of open sparse tensors and tools"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-3561-6"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.304"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2005.06.041"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869677"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/090764189"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/110836067"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53547-0_15"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2478396"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2017.8280968"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2017.8313191"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2708023"},{"key":"ref51","first-page":"1433","article-title":"Robust principal component analysis with non-greedy \n$\\ell_{1}$\n-norm maximization","author":"nie","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref59","first-page":"195","article-title":"Least squares optimization with L1-norm regularization","volume":"504","author":"schmidt","year":"2005"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/WNYIPW.2018.8576447"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2821641"},{"key":"ref56","first-page":"985708:1","article-title":"Video background tracking and foreground extraction via L1-subspace updates","volume":"9857","author":"pierantozzi","year":"2016","journal-title":"Proc SPIE"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2874165"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2886742"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS636"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.114"},{"key":"ref10","article-title":"One time is not enough: Iterative tensor decomposition for neural network compression","author":"gusak","year":"2019","journal-title":"arXiv 1903 09973"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461839"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2904063"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.285"},{"key":"ref14","article-title":"Low-rank tucker approximation of a tensor from streaming data","author":"sun","year":"2019","journal-title":"arXiv 1904 10951"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.67"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-018-9622-8"},{"key":"ref17","first-page":"10096","article-title":"Low-rank tucker decomposition of large tensors using tensorsketch","author":"malik","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018721"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.917929"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/VTCSpring.2017.8108241"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2298533"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2885227"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908207"},{"key":"ref8","first-page":"925","article-title":"TensorLy: Tensor learning in Python","volume":"20","author":"kossaifi","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2915921"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198510581.001.0001"},{"key":"ref9","article-title":"Tucker tensor layer in fully connected neural networks","author":"calvi","year":"2019","journal-title":"arXiv 1903 06133"},{"key":"ref46","first-page":"2496","article-title":"Robust PCA via outlier pursuit","author":"xu","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/nsr\/nwt032"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2015.7351663"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2018.2790901"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2017.1391743"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/8600701\/8910610-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08910610.pdf?arnumber=8910610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:49Z","timestamp":1649444029000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8910610\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2955134","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}