{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:21Z","timestamp":1740160281189,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26\u00b710950"],"award-info":[{"award-number":["26\u00b710950"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s13042-017-0649-9","type":"journal-article","created":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T03:56:49Z","timestamp":1490327809000},"page":"1351-1364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dictionary learning with the $${{\\ell }_{1\/2}}$$-regularizer and the coherence penalty and its convergence analysis"],"prefix":"10.1007","volume":"9","author":[{"given":"Zhenni","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takafumi","family":"Hayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuxue","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"key":"649_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representation","author":"M Elad","year":"2010","unstructured":"Elad M (2010) Sparse and redundant representation. Springer, Berlin"},{"issue":"6","key":"649_CR2","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/JPROC.2009.2037655","volume":"98","author":"M Elad","year":"2010","unstructured":"Elad M, Figueiredo M, Ma Y (2010) On the role of sparse and redundant representations in image processing. Proc IEEE 98(6):972\u2013982","journal-title":"Proc IEEE"},{"key":"649_CR3","unstructured":"Huang K, Aviyente S (2006) Sparse representation for signal classification. Proc Conf Neur Inf Process Syst 19:609\u2013616"},{"key":"649_CR4","first-page":"2443","volume":"5","author":"K Engan","year":"1999","unstructured":"Engan K, Aase S, Husoy J (1999). Method of optimal directions for frame design. Proc IEEE Int Conf Acoust Speech Signal Process (ICASSP) 5:2443\u20132446","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process (ICASSP)"},{"issue":"11","key":"649_CR5","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"},{"issue":"12","key":"649_CR6","doi-asserted-by":"publisher","first-page":"6340","DOI":"10.1109\/TSP.2012.2215026","volume":"60","author":"W Dai","year":"2012","unstructured":"Dai W, Xu T, Wang W (2012) Simultaneous codeword optimization (simco) for dictionary update and learning. IEEE Trans Signal Process 60(12):6340\u20136353","journal-title":"IEEE Trans Signal Process"},{"issue":"9","key":"649_CR7","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1162\/NECO_a_00763","volume":"27","author":"Z Li","year":"2015","unstructured":"Li Z, Ding S, Li Y (2015) A fast algorithm for learning overcomplete dictionary for sparse representation based on proximal operators. Neural Comput 27(9):1951\u20131982","journal-title":"Neural Comput"},{"key":"649_CR8","unstructured":"Bao C, Ji H, Quan Y, Shen Z (2014) $${{\\ell }_{o}}$$-norm-based dictionary learning by proximal methods with global convergence. IEEE Conf Comput Vis Pattern Recognit (CVPR) 3858\u20133865"},{"issue":"6","key":"649_CR9","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1109\/TSP.2009.2016257","volume":"57","author":"M Yaghoobi","year":"2013","unstructured":"Yaghoobi M, Blumensath T, Davies M (2013) Dictionary learning for sparse approximations with the majorization method. IEEE Trans Signal Process 57(6):2178\u20132191","journal-title":"IEEE Trans Signal Process"},{"issue":"10","key":"649_CR10","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp JA (2004) Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 50(10):2231\u20132242","journal-title":"IEEE Trans Inf Theory"},{"issue":"22","key":"649_CR11","doi-asserted-by":"publisher","first-page":"5495","DOI":"10.1109\/TSP.2013.2278158","volume":"61","author":"A Rakotomamonjy","year":"2013","unstructured":"Rakotomamonjy A (2013) Direct optimization of the dictionary learning problem. IEEE Trans Signal Process 61(22):5495\u20135506","journal-title":"IEEE Trans Signal Process"},{"key":"649_CR12","unstructured":"Li Z, Tang Z, Ding S (2013) Dictionary learning by nonnegative matrix factorization with $${{\\ell }_{1\/2}}$$-norm sparsity constraint. IEEE Int Conf Cybern (CYBCONF2) Lausanne Switz 63\u201367"},{"key":"649_CR13","doi-asserted-by":"crossref","unstructured":"Mailhe B, Barchiesi D, Plumbley MD (2012) INK-SVD: Learning incoherent dictionaries for sparse representations. IEEE Int Conf Acoust Speech Signal Process (ICASSP) 3573\u20133576","DOI":"10.1109\/ICASSP.2012.6288688"},{"issue":"8","key":"649_CR14","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1109\/TSP.2013.2245663","volume":"61","author":"D Barchiesi","year":"2013","unstructured":"Barchiesi D, Plumbley MD (2013) Learning incoherent dictionaries for sparse approximation using iterative projections and rotations. IEEE Trans Signal Process 61(8):2055\u20132065","journal-title":"IEEE Trans Signal Process"},{"key":"649_CR15","unstructured":"Lin T, Liu S, Zha H (2012) Incoherent dictionary learning for sparse representation. IEEE 21st International Conference on Pattern Recognition (ICPR), pp 1237\u20131240"},{"key":"649_CR16","first-page":"2897","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau JJ (1962) Fonctions convexes duales et points proximaux dans un espace Hilbertien. Comptes Rendues de lAcademie des Sciences de Paris 255:2897\u20132899","journal-title":"Comptes Rendues de lAcademie des Sciences de Paris"},{"key":"649_CR17","doi-asserted-by":"crossref","unstructured":"Combettes PL, Pesquet J (2010) Proximal splitting methods in signal processing. arXiv:0912.3522v4","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"12","key":"649_CR18","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"SG Mallat","year":"1993","unstructured":"Mallat SG, Zhang Z (1993) Matching pursuits with time\u2013frequency dictionaries. IEEE Trans Signal Process 41(12):3397\u20133415","journal-title":"IEEE Trans Signal Process"},{"issue":"1","key":"649_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen SS, Donoho DL, Saunders MA (2001) Atomic decomposition by basis pursuit. SIAM Rev 43(1):129\u2013159","journal-title":"SIAM Rev"},{"key":"649_CR20","doi-asserted-by":"crossref","unstructured":"Chartrand R, Yin W (2008) Iteratively reweighted algorithms for compressive sensing. Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP), pp 3869\u20133872","DOI":"10.1109\/ICASSP.2008.4518498"},{"issue":"11","key":"649_CR21","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies I, Defrise M, Mol CD (2004) An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm Pure Appl Math 57(11):1413\u20131457","journal-title":"Comm Pure Appl Math"},{"issue":"1","key":"649_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag Sci 2(1):183\u2013202","journal-title":"SIAM J Imag Sci"},{"key":"649_CR23","first-page":"1225","volume":"38","author":"ZB Xu","year":"2012","unstructured":"Xu ZB, Guo HL, Wang Y, Zhang H (2012) Representative of $${{\\ell }_{1\/2}}$$ regularization among (0\u2009<\u2009q\u2009\u2264\u20091) $${{\\ell }_{q}}$$ regularizations: an experimental study based on phase diagram. Acta Automatica Sinica 38:1225\u20131228","journal-title":"Acta Automatica Sinica"},{"issue":"1","key":"649_CR24","first-page":"2317","volume":"62","author":"J Lin","year":"2014","unstructured":"Lin J, Lin S, Wang Y, Xu ZB (2014) $${{\\ell }_{1\/2}}$$ Regularization: convergence of iterative half thresholding algorithm. IEEE Trans Signal Process 62(1):2317\u20132329","journal-title":"IEEE Trans Signal Process"},{"issue":"7","key":"649_CR25","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"ZB Xu","year":"2012","unstructured":"Xu ZB, Chang X, Xu F, Zhang H (2012) $${{\\ell }_{1\/2}}$$ Regularization: a thresholding representation theory and a fast solver. IEEE Trans Neur Networks Learning Syst 23(7):1013\u20131027","journal-title":"IEEE Trans Neur Networks Learning Syst"},{"key":"649_CR26","first-page":"2156","volume":"3","author":"M Fazel","year":"2003","unstructured":"Fazel M, Hindi H, Boyd SP (2003) Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices. Proc Am Control Conf 3:2156\u20132162","journal-title":"Proc Am Control Conf"},{"key":"649_CR27","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer PO (2004) Nonnegative matrix factorization with sparseness constraints. J Mach Learn Res 5:1457\u20131469","journal-title":"J Mach Learn Res"},{"issue":"1\u20132","key":"649_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semialgebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math Program Ser A 137(1\u20132):91\u2013129","journal-title":"Math Program Ser A"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-017-0649-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-017-0649-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-017-0649-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T18:24:36Z","timestamp":1589653476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-017-0649-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["649"],"URL":"https:\/\/doi.org\/10.1007\/s13042-017-0649-9","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2017,3,23]]},"assertion":[{"value":"17 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}