{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:55:33Z","timestamp":1775325333052,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000266","name":"NGA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100001982","name":"BSF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100001982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ERC","award":["335491"],"award-info":[{"award-number":["335491"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2015,9,1]]},"DOI":"10.1109\/tpami.2015.2392779","type":"journal-article","created":{"date-parts":[[2015,1,15]],"date-time":"2015-01-15T19:56:42Z","timestamp":1421351802000},"page":"1821-1833","source":"Crossref","is-referenced-by-count":118,"title":["Learning Efficient Sparse and Low Rank Models"],"prefix":"10.1109","volume":"37","author":[{"given":"P.","family":"Sprechmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M.","family":"Bronstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Sapiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref33","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref31","first-page":"67","article-title":"Real-time online singing voice separation from monaural recordings using robust low-rank modeling","author":"sprechmann","year":"0","journal-title":"Proc 10th Int Soc Music Inf Retrieval Conf"},{"key":"ref30","first-page":"615","article-title":"Learning efficient structured sparse models","author":"sprechmann","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref37","article-title":"A note on the group lasso and a sparse group lasso","author":"friedman","year":"0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90224-C"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2279080"},{"key":"ref34","article-title":"Robust PCA as bilinear decomposition with outlier-sparsity regularization","author":"mateos","year":"2011"},{"key":"ref10","first-page":"599","article-title":"Rank, trace-norm and max-norm","author":"srebro","year":"0","journal-title":"Proc 18th Annu Conf Learn Theory"},{"key":"ref40","first-page":"177","article-title":"Large-scale machine learning with stochastic gradient descent","author":"bottou","year":"0","journal-title":"Proc 19th Int Conf Comput Statist"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173156"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s11460-011-0128-0"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref16","first-page":"399","article-title":"Learning fast approximations of sparse coding","author":"gregor","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1126\/science.1127647"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"$k$ -SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"IEEE Trans Signal Process"},{"key":"ref27","article-title":"Fast inference in sparse coding algorithms with applications to object recognition","author":"kavukcuoglu","year":"2010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/381607a0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"ref29","first-page":"646","article-title":"Measuring invariances in deep networks","author":"goodfellow","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref8","first-page":"2297","article-title":"Proximal methods for hierarchical sparse coding","volume":"12","author":"jenatton","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS584"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the LASSO","volume":"58","author":"tibshirani","year":"1996","journal-title":"J Roy Statist Soc Series B"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2157912"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6287816"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.3934\/ipi.2009.3.487","article-title":"Coordinate descent optimization for $\\ell _1$ minimization with application to compressed sensing; A greedy algorithm","volume":"3","author":"li","year":"2009","journal-title":"Inverse Problems Imag"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2009.2026503"},{"key":"ref48","first-page":"908","article-title":"Supervised sparse analysis and synthesis operators","author":"sprechmann","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSA.2005.858005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540138"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0534-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947683"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459469"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/34.761261"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995369"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/34\/7175116\/7010964-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7175116\/07010964.pdf?arnumber=7010964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T16:00:24Z","timestamp":1717689624000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7010964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,1]]},"references-count":48,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2015.2392779","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,1]]}}}