{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:56:23Z","timestamp":1760597783229},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/waspaa.2017.8170034","type":"proceedings-article","created":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T14:38:44Z","timestamp":1513175924000},"source":"Crossref","is-referenced-by-count":14,"title":["Deep recurrent NMF for speech separation by unfolding iterative thresholding"],"prefix":"10.1109","author":[{"given":"Scott","family":"Wisdom","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Powers","sequence":"additional","affiliation":[]},{"given":"James","family":"Pitton","sequence":"additional","affiliation":[]},{"given":"Les","family":"Atlas","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","article-title":"Theano: A Python framework for fast computation of mathematical expressions","year":"2016","journal-title":"arXiv 1605 02688"},{"key":"ref32","author":"chollet","year":"2015","journal-title":"Keras"},{"key":"ref31","article-title":"Adam: A Method for Stochastic Optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref30","author":"vincent","year":"0","journal-title":"BSS Eval toolbox version 3 0"},{"key":"ref10","first-page":"577","article-title":"Dis-criminatively trained recurrent neural networks for single-channel speech separation","author":"weninger","year":"2014","journal-title":"Proc GlobalSIP"},{"key":"ref11","first-page":"91","article-title":"Speech enhancement with LSTM recurrent neural networks and its application to noise-robust ASR","author":"weninger","year":"2015","journal-title":"Proc LVA\/ICA"},{"key":"ref12","article-title":"Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures","author":"hershey","year":"2014","journal-title":"arXiv 1409 2574"},{"key":"ref13","article-title":"Deep NMF for Speech Enhancement","author":"le roux","year":"2015","journal-title":"Proc ICASSP"},{"key":"ref14","first-page":"399","article-title":"Learning fast approximations of sparse coding","author":"gregor","year":"2010","journal-title":"Proc ICML"},{"key":"ref15","article-title":"Discriminative recurrent sparse auto-encoders","author":"rolfe","year":"0","journal-title":"arXiv 1301 3775 2013"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2708040"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2548245"},{"key":"ref18","article-title":"Learning MMSE Optimal Thresholds for FISTA","author":"kamilov","year":"2016","journal-title":"Proc ITWIST"},{"key":"ref19","article-title":"Learning Convolutional Proximal Filters","author":"kamilov","year":"2017","journal-title":"Proc SPARS"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ASRU.2013.6707723"},{"key":"ref4","article-title":"Sparse NMF-half-baked or well done?","author":"le roux","year":"2015","journal-title":"MERL Technical Report"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6637625"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638240"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSA.2005.858005"},{"key":"ref5","first-page":"427","article-title":"Convolutive nonnegative matrix factorisation with a sparseness constraint","author":"o'grady","year":"2006","journal-title":"Proc MLSP"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960364"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297715"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2004.1381036"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6853860"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.04-08-771"},{"key":"ref20","article-title":"Interpretable Recurrent Neural Networks Using Sequential Sparse Recovery","author":"wisdom","year":"2016","journal-title":"NIPS Workshop on Interpretable Machine Learning for Complex Systems"},{"key":"ref22","first-page":"556","article-title":"Algorithms for Non-negative Matrix Factorization","author":"lee","year":"2001","journal-title":"Advances in Neural Information Processing Systems 13"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952977"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/83.661182"},{"key":"ref26","first-page":"315","article-title":"Deep sparse rectifier neural networks","author":"glorot","year":"2011","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"}],"event":{"name":"2017 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA)","location":"New Paltz, NY","start":{"date-parts":[[2017,10,15]]},"end":{"date-parts":[[2017,10,18]]}},"container-title":["2017 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (WASPAA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8125199\/8169982\/08170034.pdf?arnumber=8170034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T18:13:24Z","timestamp":1516212804000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8170034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/waspaa.2017.8170034","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}