{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T15:37:16Z","timestamp":1750779436822,"version":"3.40.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s42979-022-01042-y","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T09:03:17Z","timestamp":1643878997000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cloud K-SVD for Image Denoising"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2520-3774","authenticated-orcid":false,"given":"Christian Marius","family":"Lillelund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henrik Bagger","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1266-5857","authenticated-orcid":false,"given":"Christian Fischer","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"1042_CR1","unstructured":"Taylor-Sakyi K. Big data: understanding big data. CoRR. 2016;8. arXiv:abs\/1601.04602."},{"key":"1042_CR2","doi-asserted-by":"publisher","unstructured":"Li C et\u00a0al. Distributed private online learning for social big data computing over data center networks. In: 2016 IEEE International conference on communications, ICC 2016, vol. 6, 2016. https:\/\/doi.org\/10.1109\/ICC.2016.7510723. arXiv:1602.06489.","DOI":"10.1109\/ICC.2016.7510723"},{"key":"1042_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7011-4","volume-title":"Sparse and redundant representations","author":"M Elad","year":"2010","unstructured":"Elad M. Sparse and redundant representations. 1st ed. New York: Springer; 2010.","edition":"1"},{"issue":"12","key":"1042_CR4","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"15","author":"M Elad","year":"2011","unstructured":"Elad M, Aharon M. Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans Image Process. 2011;15(12):3736\u201345.","journal-title":"IEEE Trans Image Process."},{"issue":"11","key":"1042_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. K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation michal. IEEE Trans Signal Process. 2006;54(11):4311\u201322. https:\/\/doi.org\/10.1109\/TSP.2006.881199.","journal-title":"IEEE Trans Signal Process."},{"issue":"4","key":"1042_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1109\/TPAMI.2011.156","volume":"34","author":"J Mairal","year":"2012","unstructured":"Mairal J, Bach F, Ponce J. Task-driven dictionary learning. IEEE Trans Pattern Anal Mach Intell. 2012;34(4):791\u2013804. https:\/\/doi.org\/10.1109\/TPAMI.2011.156arXiv:1009.5358.","journal-title":"IEEE Trans Pattern Anal Mach Intell."},{"key":"1042_CR7","volume-title":"Machine learning: a Bayesian and optimization perspective","author":"S Theodoridis","year":"2015","unstructured":"Theodoridis S. Machine learning: a Bayesian and optimization perspective. Amsterdam: Elsevier; 2015."},{"key":"1042_CR8","volume-title":"A wavelet tour of signal processing: the sparse way","author":"S Mallat","year":"2009","unstructured":"Mallat S. A wavelet tour of signal processing: the sparse way. 3rd ed. Amsterdam: Elsevier Inc.; 2009.","edition":"3"},{"key":"1042_CR9","doi-asserted-by":"crossref","unstructured":"Tosic I, Frossard P. Dictionary learning. Signal Process Mag IEEE. 2011;28(2): 27\u201338. arXiv:1402.1515v1 .","DOI":"10.1109\/MSP.2010.939537"},{"issue":"11","key":"1042_CR10","doi-asserted-by":"publisher","first-page":"7086","DOI":"10.1109\/TGRS.2014.2307354","volume":"52","author":"X Li","year":"2014","unstructured":"Li X, Shen H, Member S, Zhang L, Member S. Recovering quantitative remote sensing products contaminated by thick clouds and shadows using multitemporal dictionary learning. IEEE Trans Geosci Remote Sens. 2014;52(11):7086\u201398.","journal-title":"IEEE Trans Geosci Remote Sens."},{"key":"1042_CR11","doi-asserted-by":"publisher","unstructured":"Yan X, Yang B, Zhang W, Liu C, Wang Y. An improved denoising algorithm of feather and down image based on KSVD. In: Proceedings\u20142016 8th international conference on information technology in medicine and education, ITME 2016. 2017, pp. 419\u2013423. https:\/\/doi.org\/10.1109\/ITME.2016.0100.","DOI":"10.1109\/ITME.2016.0100"},{"issue":"1","key":"1042_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/TSP.2015.2472372","volume":"64","author":"H Raja","year":"2016","unstructured":"Raja H, Bajwa WU. Cloud K-SVD: a collaborative dictionary learning algorithm for big, distributed data. IEEE Trans Signal Process. 2016;64(1):173\u201388. https:\/\/doi.org\/10.1109\/TSP.2015.2472372.","journal-title":"IEEE Trans Signal Process."},{"issue":"2","key":"1042_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton C, Kantarcioglu M, Vaidya J, Lin X, Zhu MY. Tools for privacy preserving distributed data mining. ACM SIGKDD Explor Newsl. 2002;4(2):28\u201334. https:\/\/doi.org\/10.1145\/772862.772867.","journal-title":"ACM SIGKDD Explor Newsl."},{"key":"1042_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1049\/iet-ipr.2016.0331","volume":"11","author":"S Ghosh","year":"2017","unstructured":"Ghosh S, Mandal AK, Chaudhury KN. Pruned non-local means. IET Image Process. 2017;11:317\u201323. https:\/\/doi.org\/10.1049\/iet-ipr.2016.0331.","journal-title":"IET Image Process."},{"key":"1042_CR15","unstructured":"Lillelund CM, Jensen HB, Pedersen CF. Source code (2021). https:\/\/github.com\/thecml\/cloud-ksvd. Accessed 21 Oct 2021."},{"issue":"12","key":"1042_CR16","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"SG Mallat","year":"1993","unstructured":"Mallat SG, Zhang Z. Matching pursuits with time-frequency dictionaries. IEEE Trans Signal Process. 1993;41(12):3397\u2013415. https:\/\/doi.org\/10.1109\/78.258082.","journal-title":"IEEE Trans Signal Process."},{"key":"1042_CR17","volume-title":"Dictionary learning algorithms and applications","author":"D Bogdan","year":"2018","unstructured":"Bogdan D, Irofti P. Dictionary learning algorithms and applications. 1st ed. Berlin: Springer; 2018.","edition":"1"},{"key":"1042_CR18","unstructured":"Mairal J, Bach F, Ponce J, Sapiro G. Online learning for matrix factorization and sparse coding. J Mach Learn Res. 2010;11: 19\u201360. https:\/\/arxiv.org\/abs\/0908.0050."},{"key":"1042_CR19","doi-asserted-by":"publisher","unstructured":"Chen Y, Tron R, Terzis A, Vidal R. Corrective consensus with asymmetric wireless links. In: Proceedings of the IEEE conference on decision and control. 2011, pp. 6660\u20136665. https:\/\/doi.org\/10.1109\/CDC.2011.6161272.","DOI":"10.1109\/CDC.2011.6161272"},{"issue":"3","key":"1042_CR20","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.sigpro.2005.05.030","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp JA, Gilbert AC, Strauss MJ. Algorithms for simultaneous sparse approximation. Part I: greedy pursuit. Signal Process. 2006;86(3):572\u201388. https:\/\/doi.org\/10.1016\/j.sigpro.2005.05.030.","journal-title":"Signal Process."},{"key":"1042_CR21","unstructured":"Bm3d image database. https:\/\/webpages.tuni.fi\/foi\/GCF-BM3D\/. Accessed 8 Dec 2021."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01042-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T11:29:24Z","timestamp":1647602964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01042-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1042"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01042-y","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"25 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}],"article-number":"151"}}