{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T18:35:59Z","timestamp":1791225359810,"version":"4.1.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/tsp.2013.2250968","type":"journal-article","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T18:45:47Z","timestamp":1366051547000},"page":"2341-2355","source":"Crossref","is-referenced-by-count":88,"title":["Constrained Overcomplete Analysis Operator Learning for Cosparse Signal Modelling"],"prefix":"10.1109","volume":"61","author":[{"given":"Mehrdad","family":"Yaghoobi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sangnam","family":"Nam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Remi","family":"Gribonval","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mike E.","family":"Davies","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","author":"geng","year":"2011","journal-title":"On the Local Correctness of L1 Minimization for Dictionary Learning"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021323312367"},{"key":"ref33","article-title":"Learning analysis sparsity priors","author":"peyre","year":"2011","journal-title":"SAMPTA'11"},{"key":"ref32","article-title":"Sequential minimal eigenvalues&#x2014;An approach to analysis dictionary learning","author":"ophir","year":"0","journal-title":"EUSIPCO"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947680"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6289144"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"3523","DOI":"10.1109\/TIT.2010.2048466","article-title":"Dictionary identification&#x2014;sparse matrix-factorization via <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell_{1}$<\/tex> <\/formula> minimization","volume":"56","author":"gribonval","year":"2010","journal-title":"IEEE Trans Inf Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6289143"},{"key":"ref34","article-title":"K-SVD dictionary-learning for analysis sparse models","author":"elad","year":"2011","journal-title":"Workshop Signal Process Adapt Sparse Structured Representations (SPARS)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.03.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20078"},{"key":"ref29","article-title":"Analysis operator learning for overcomplete cosparse representations","author":"yaghoobi","year":"0","journal-title":"EUSIPCO"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511730344"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2038076"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.939537"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2005.1416298"},{"key":"ref21","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762552951"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.760624"},{"key":"ref26","article-title":"Regularized dictionary learning for sparse approximation","author":"yaghoobi","year":"2008","journal-title":"EUSIPCO"},{"key":"ref25","article-title":"Efficient sparse coding algorithms","volume":"19","author":"lee","year":"2007","journal-title":"Adv Neural Inf Process Syst (NIPS)"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.2307\/2337118"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","article-title":"Acquiring linear subspaces for face recognition under variable lighting","volume":"27","author":"lee","year":"2005","journal-title":"PAMI"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495206"},{"key":"ref56","volume":"317","author":"rockafellar","year":"1997","journal-title":"Variational Analysis Grundlehren der Mathematischen Wissensschaften"},{"key":"ref55","first-page":"418","article-title":"Smallbox&#x2014;an evaluation framework for sparse representations and dictionary learning algorithms","volume":"10","author":"damnjanovic","year":"2010","journal-title":"LVA\/ICA"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2006.881969"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030471"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2012.03.006"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2047910"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/23\/3\/007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.10.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2233859"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015826"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s003650010032"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2026610"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2040551"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"ref6","author":"davis","year":"1994","journal-title":"Adaptive nonlinear approximations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827596304010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914346"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/0312021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013003"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2009.08.015"},{"key":"ref48","author":"setzer","year":"2009","journal-title":"Split Bregman Algorithm Douglas-Rachford Splitting and Frame Shrinkage"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/080725891"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839492"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016257"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/6492148\/06473916.pdf?arnumber=6473916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:55:59Z","timestamp":1638219359000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6473916\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":57,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2013.2250968","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}