{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:52:27Z","timestamp":1768722747218,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501351"],"award-info":[{"award-number":["11501351"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00521-020-05606-y","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T07:03:13Z","timestamp":1609657393000},"page":"8543-8553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Blind source separation for the analysis sparse model"],"prefix":"10.1007","volume":"33","author":[{"given":"Shuang","family":"Ma","sequence":"first","affiliation":[]},{"given":"Hongjuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhuoyun","family":"Miao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,3]]},"reference":[{"issue":"4","key":"5606_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/S0893-6080(00)00026-5","volume":"13","author":"A Hyv\u00e4rinen","year":"2000","unstructured":"Hyv\u00e4rinen A, Oja E (2000) Independent component analysis: algorithms and applications. Neural Netw 13(4):411\u2013430","journal-title":"Neural Netw"},{"issue":"6","key":"5606_CR2","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1162\/neco.1995.7.6.1129","volume":"7","author":"A Bell","year":"1995","unstructured":"Bell A, Sejnowski T (1995) An information-maximization approach to blind separation and blind deconvolution. Neural Comput 7(6):1129\u20131159","journal-title":"Neural Comput"},{"key":"5606_CR3","unstructured":"Gaeta M,\u00a0Lacoume JL (1990) Source separation without prior knowledge: the maximum likelihood solution. In: Proceeding EUSIPCO\u201990, pp 621\u2013624"},{"key":"5606_CR4","unstructured":"Belouchrani A, Cardoso JF (1994) Maximum likelihood source separation for discrete sources. In: Proceeding EUSIPCO\u201994, pp 768\u2013771"},{"key":"5606_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-53547-0_27","volume":"10169","author":"J Montoya-Mart\u00ednez","year":"2017","unstructured":"Montoya-Mart\u00ednez J, Cardoso JF, Gramfort A (2017) Caveats with stochastic gradient and maximum likelihood based ica for eeg. Lecture Note Computer Sci 10169:279\u2013289","journal-title":"Lecture Note Computer Sci"},{"key":"5606_CR6","doi-asserted-by":"crossref","unstructured":"Tillet P, Kung HT, Cox D (2017) Infomax-ica using hessian-free optimization. Proceeding ICASSP\u20192017, pp 2537\u20132541","DOI":"10.1109\/ICASSP.2017.7952614"},{"key":"5606_CR7","doi-asserted-by":"crossref","unstructured":"Zibulevsky M (2003) Sparse source separation with relative newton method. Proceeding ICA 2003:897\u2013902","DOI":"10.1117\/12.505053"},{"issue":"7","key":"5606_CR8","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1016\/j.neucom.2006.03.018","volume":"70","author":"H Choi","year":"2007","unstructured":"Choi H, Choi S (2007) A relative trust-region algorithm for independent component analysis. Neurocomputing 70(7):1502\u20131510","journal-title":"Neurocomputing"},{"issue":"5","key":"5606_CR9","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"R Byrd","year":"2003","unstructured":"Byrd R, Lu P, Nocedal J, Zhu C (2003) A limited memory algorithm for bound constrained optimization. SIAM J Sci Comput 16(5):1190\u20131208","journal-title":"SIAM J Sci Comput"},{"issue":"15","key":"5606_CR10","doi-asserted-by":"publisher","first-page":"4040","DOI":"10.1109\/TSP.2018.2844203","volume":"66","author":"P Ablin","year":"2018","unstructured":"Ablin P, Cardoso J, Gramfort A (2018) Faster independent component analysis by preconditioning with hessian approximations. IEEE Trans Signal Process 66(15):4040\u20134049","journal-title":"IEEE Trans Signal Process"},{"issue":"6755","key":"5606_CR11","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D Lee","year":"1999","unstructured":"Lee D, Seung H (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788\u2013791","journal-title":"Nature"},{"issue":"4","key":"5606_CR12","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1016\/j.patcog.2007.09.010","volume":"41","author":"C Boutsidis","year":"2008","unstructured":"Boutsidis C, Gallopoulos E (2008) Svd based initialization: a head start for nonnegative matrix factorization. Pattern Recognit 41(4):1350\u20131362","journal-title":"Pattern Recognit"},{"key":"5606_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00521-016-2352-2","volume":"29","author":"Z Deng","year":"2018","unstructured":"Deng Z, Zhang S, Yang L, Zong M, Cheng D (2018) Sparse sample self-representation for subspace clustering. Neural Comput Appl 29:43\u201349","journal-title":"Neural Comput Appl"},{"issue":"4","key":"5606_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1109\/TBDATA.2017.2735991","volume":"3","author":"X Zhu","year":"2017","unstructured":"Zhu X, Suk HI, Huang H, Shen D (2017) Low-rank graph-regularized structured sparse regression for identifying genetic biomarkers. IEEE Trans Big Data 3(4):405\u2013414","journal-title":"IEEE Trans Big Data"},{"issue":"11","key":"5606_CR15","doi-asserted-by":"publisher","first-page":"5304","DOI":"10.1109\/TNNLS.2018.2797060","volume":"29","author":"H Zhang","year":"2018","unstructured":"Zhang H, Wang S, Xu X, Chow TWS, Wu QMJ (2018) Tree2vector: learning a vectorial representation for tree-structured data. IEEE Trans Neural Netw Learn Syst 29(11):5304\u20135318","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"12","key":"5606_CR16","doi-asserted-by":"publisher","first-page":"6745","DOI":"10.1073\/pnas.96.12.6745","volume":"96","author":"U Alon","year":"1999","unstructured":"Alon U, Barkai N, Notterman D, Gish K, Ybarra S, Mack D, Levine A (1999) Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proc Natl Acad Sci United States of America 96(12):6745\u20136750","journal-title":"Proc Natl Acad Sci United States of America"},{"issue":"1","key":"5606_CR17","first-page":"68","volume":"8","author":"MA Shipp","year":"2002","unstructured":"Shipp MA et al (2002) Diffuse large b-cell lymphoma outcome prediction by gene-expressionprofilingandsupervisedmachinelearning. NatureMed 8(1):68\u201374","journal-title":"NatureMed"},{"key":"5606_CR18","doi-asserted-by":"publisher","first-page":"61782","DOI":"10.1109\/ACCESS.2018.2876034","volume":"6","author":"H Huang","year":"2018","unstructured":"Huang H, Zhao H, Li X, Ding S, Zhao L, Li Z (2018) An accurate and efficient device-free localization approach based on sparse coding in subspace. IEEE Access 6:61782\u201361799","journal-title":"IEEE Access"},{"issue":"4","key":"5606_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S1076-5670(04)32006-9","volume":"132","author":"JL Starck","year":"2004","unstructured":"Starck JL, Elad M, Donoho D (2004) Redundant multiscale transforms and their application for morphological component separation. Adv Imagin Electron Phys 132(4):287\u2013348","journal-title":"Adv Imagin Electron Phys"},{"issue":"7","key":"5606_CR20","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/LSP.2006.873141","volume":"13","author":"J Bobin","year":"2006","unstructured":"Bobin J, Moudden Y, Starck JL, Elad M (2006) Morphological diversity and source separation. IEEE Signal Process Lett 13(7):409\u2013412","journal-title":"IEEE Signal Process Lett"},{"issue":"11","key":"5606_CR21","doi-asserted-by":"publisher","first-page":"2662","DOI":"10.1109\/TIP.2007.906256","volume":"16","author":"J Bobin","year":"2007","unstructured":"Bobin J, Starck JL, Fadili J, Moudden Y (2007) Sparsity and morphological diversity in blind source separation. Image Process, IEEE Trans Image Process 16(11):2662\u20132674","journal-title":"Image Process, IEEE Trans Image Process"},{"issue":"6","key":"5606_CR22","doi-asserted-by":"publisher","first-page":"2921","DOI":"10.1109\/TIP.2012.2187530","volume":"21","author":"V Abolghasemi","year":"2012","unstructured":"Abolghasemi V, Ferdowsi S, Sanei S (2012) Blind separation of image sources via adaptive dictionary learning. IEEE Trans Image Process 21(6):2921\u20132930","journal-title":"IEEE Trans Image Process"},{"issue":"11","key":"5606_CR23","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon M, Elad M, Bruckstein A (2006) K-svd: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans Signal Process 54(11):4311\u20134322","journal-title":"IEEE Trans Signal Process"},{"key":"5606_CR24","unstructured":"Zhao X, Zhou G, Dai W, Xu T, Wang W (2013) Joint image separation and dictionary learning. Proceedings DSP\u20192013, pp 1\u20136"},{"issue":"12","key":"5606_CR25","doi-asserted-by":"publisher","first-page":"6340","DOI":"10.1109\/TSP.2012.2215026","volume":"60","author":"W Dai","year":"2011","unstructured":"Dai W, Xu T, Wang W (2011) Simultaneous codeword optimization (simco) for dictionary update and learning. IEEE Trans Signal Process 60(12):6340\u20136353","journal-title":"IEEE Trans Signal Process"},{"issue":"1","key":"5606_CR26","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.acha.2012.03.006","volume":"34","author":"S Nam","year":"2011","unstructured":"Nam S, Davies M, Elad M, Gribonval R (2011) The cosparse analysis model and algorithms. Appl Comput Harmonic Anal 34(1):30\u201356","journal-title":"Appl Comput Harmonic Anal"},{"issue":"1","key":"5606_CR27","first-page":"22","volume":"441","author":"R Giryes","year":"2012","unstructured":"Giryes R, Nam S, Elad M, Gribonval R, Davies M (2012) Greedylike algorithms for the cosparse analysis model. Linear Algebra Appl 441(1):22\u201360","journal-title":"Linear Algebra Appl"},{"issue":"3","key":"5606_CR28","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1088\/0266-5611\/23\/3\/007","volume":"23","author":"M Elad","year":"2007","unstructured":"Elad M, Milanfar P, Rubinstein R (2007) Analysis versus synthesis in signal priors. Inverse Probl 23(3):947","journal-title":"Inverse Probl"},{"issue":"13","key":"5606_CR29","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1049\/el.2016.0334","volume":"52","author":"W Fang","year":"2016","unstructured":"Fang W, Wang H, Xu B, Zhang Y (2016) Blind source separation using analysis sparse constraint. Electron Lett 52(13):1112\u20131114","journal-title":"Electron Lett"},{"issue":"3","key":"5606_CR30","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1109\/TSP.2012.2226445","volume":"61","author":"R Rubinstein","year":"2013","unstructured":"Rubinstein R, Peleg T, Elad M (2013) Analysis k-svd: a dictionary-learning algorithm for the analysis sparse model. IEEE Trans Signal Process 61(3):661\u2013677","journal-title":"IEEE Trans Signal Process"},{"key":"5606_CR31","unstructured":"Zhang Y, Wang H, Yu T, Wang W (2013) Subset pursuit for analysis dictionary learning. Proceeding EUSIPCO\u20192013, pp 1\u20135"},{"issue":"2","key":"5606_CR32","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/090753504","volume":"8","author":"JF Cai","year":"2009","unstructured":"Cai JF, Osher S, Shen Z (2009) Split bregman methods and frame based image restoration. Multiscale Model and Simul 8(2):337\u2013369","journal-title":"Multiscale Model and Simul"},{"issue":"2","key":"5606_CR33","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/TR.2018.2804922","volume":"67","author":"F Wu","year":"2018","unstructured":"Wu F, Jing X, Sun Y, Sun J, Huang L, Cui F, Sun Y (2018) Cross-project and within-project semisupervised software defect prediction: a unified approach. IEEE Trans Reliab 67(2):581\u2013587","journal-title":"IEEE Trans Reliab"},{"issue":"3","key":"5606_CR34","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1587\/transinf.2018EDL8107","volume":"D","author":"F Wu","year":"2019","unstructured":"Wu F, Xi W, Han L, Jing X, Ji Y (2019) Multi-view synthesis and analysis dictionaries learning for classification. IEICE Trans Inf Syst E102 D(3):659\u2013662","journal-title":"IEICE Trans Inf Syst E102"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05606-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05606-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05606-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T21:13:05Z","timestamp":1624396385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05606-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,3]]},"references-count":34,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5606"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05606-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,3]]},"assertion":[{"value":"23 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}