{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:31:16Z","timestamp":1729650676373,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/icassp.2017.7953008","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:35:36Z","timestamp":1497980136000},"page":"4501-4505","source":"Crossref","is-referenced-by-count":4,"title":["Sample complexity bounds for dictionary learning of tensor data"],"prefix":"10.1109","author":[{"given":"Zahra","family":"Shakeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Waheed U.","family":"Bajwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand D.","family":"Sarwate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854345"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.377"},{"key":"ref12","first-page":"1","article-title":"A tensor-based dictionary learning approach to tomographic image reconstruction","author":"sara","year":"2015","journal-title":"Bit Numerical Mathematics"},{"key":"ref13","first-page":"122","article-title":"Implications of factor analysis of three-way matrices for measurement of change","author":"ledyard","year":"1963","journal-title":"Problems in Measuring Change"},{"journal-title":"Introduction to Nonparametric Estimation","year":"2009","author":"alexandre","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref16","first-page":"1","article-title":"Learning sparsely used overcomplete dictionaries","volume":"35","author":"agarwal","year":"2014","journal-title":"Proc 27th Annu Conf Learn Theory"},{"journal-title":"A clustering approach to learn sparsely-used overcomplete dictionaries","year":"2014","author":"agarwal","key":"ref17"},{"key":"ref18","first-page":"1","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","volume":"35","author":"arora","year":"2014","journal-title":"Proc 25th Annu Conf Learn Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.01.005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.156"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273592"},{"article-title":"Denoising and completion of 3D data via multidimensional dictionary learning","year":"2015","author":"zhang","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.06.035"},{"key":"ref8","first-page":"438","article-title":"Sep-arable dictionary learning","author":"hawe","year":"2013","journal-title":"Proc IEEE Conf Comput Vision and Pattern Recognition (CVPR)"},{"key":"ref7","first-page":"493","article-title":"K-CPD: Learning of overcomplete dictionaries for tensor sparse coding","author":"duan","year":"2012","journal-title":"Proc IEEE 21 st Int Conf Pattern Recognition (ICPR)"},{"key":"ref2","article-title":"Shift-invariant sparse coding for audio classification","author":"grosse","year":"2007","journal-title":"Proc 23rd Conf Uncertainty in Artificial Intelligence"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2013.6622725"},{"key":"ref1","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":"ref20","first-page":"1211","article-title":"Local identification of overcomplete dictionaries","volume":"16","author":"schnass","year":"2015","journal-title":"J Machine Learning Research"},{"key":"ref22","first-page":"765","article-title":"Per-formance limits of dictionary learning for sparse coding","author":"alexandra","year":"2014","journal-title":"Proc IEEE 22nd European Signal Process Conf (EUSIPCO)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472522"},{"key":"ref24","first-page":"1148","article-title":"Minimax lower bounds for Kronecker-structured dictionary learning","author":"zahra","year":"2016","journal-title":"Proc 2016 IEEE Int Symp Inf Theory"},{"key":"ref23","first-page":"1501","article-title":"On the minimax risk of dictionary learning","volume":"62","author":"alexander","year":"2015","journal-title":"IEEE Trans Inf Theory"},{"journal-title":"Min-imax lower bounds on dictionary learning for tensor data","year":"2016","author":"zahra","key":"ref25"}],"event":{"name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2017,3,5]]},"location":"New Orleans, LA","end":{"date-parts":[[2017,3,9]]}},"container-title":["2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7943262\/7951776\/07953008.pdf?arnumber=7953008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T07:22:58Z","timestamp":1569482578000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7953008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/icassp.2017.7953008","relation":{},"subject":[],"published":{"date-parts":[[2017,3]]}}}