{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T10:43:53Z","timestamp":1766486633616,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100002661","name":"F.R.S.-FNRS Incentive Grant for Scientific Research","doi-asserted-by":"publisher","award":["F.4501.16"],"award-info":[{"award-number":["F.4501.16"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"ERC Starting","doi-asserted-by":"publisher","award":["579515"],"award-info":[{"award-number":["579515"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1109\/tip.2017.2753400","type":"journal-article","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T18:07:54Z","timestamp":1505758074000},"page":"24-37","source":"Crossref","is-referenced-by-count":21,"title":["A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6423-6897","authenticated-orcid":false,"given":"Nicolas","family":"Gillis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6960-9656","authenticated-orcid":false,"given":"Robert","family":"Luce","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2279177"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1117\/12.818245"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2014.2352857"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0003702816662600"},{"key":"ref11","first-page":"257","article-title":"The why and how of nonnegative matrix factorization","author":"gillis","year":"2014","journal-title":"Regularization Optimization Kernels and Support Vector Machines"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2005.844293"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(01)00119-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.226"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2190081"},{"key":"ref16","first-page":"1223","article-title":"Factoring nonnegative matrices with linear programs","author":"bittorf","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2498523"},{"key":"ref19","first-page":"1249","article-title":"Robust near-separable nonnegative matrix factorization using linear optimization","volume":"15","author":"gillis","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.1994.399740"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2279731"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/130946782"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSTARS.2012.2194696"},{"key":"ref6","first-page":"280","article-title":"A practical algorithm for topic modeling with provable guarantees","volume":"28","author":"arora","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1117\/12.366289"},{"key":"ref5","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization","volume":"28","author":"kumar","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.928937"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247852"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2011.2160276"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6737093"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"journal-title":"Numerical Optimization","year":"1999","author":"wright","key":"ref21"},{"key":"ref24","first-page":"1202","article-title":"Topic discovery through data dependent and random projections","author":"ding","year":"2013","journal-title":"Proc ICML"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00256"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2410763"},{"key":"ref25","first-page":"945","article-title":"Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matrices","author":"benson","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/8071125\/08039248.pdf?arnumber=8039248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:03:01Z","timestamp":1642006981000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8039248\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tip.2017.2753400","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"type":"print","value":"1057-7149"},{"type":"electronic","value":"1941-0042"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}