{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:00:37Z","timestamp":1740171637841,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["51705193"],"award-info":[{"award-number":["51705193"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the National Key R\\D Program of China","award":["2017YFD0700302"],"award-info":[{"award-number":["2017YFD0700302"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n              <jats:p>K-singular value decomposition (K-SVD) is a frequently used dictionary learning (DL) algorithm that iteratively works between sparse coding and dictionary updating. The sparse coding process generates sparse coefficients for each training sample, and the sparse coefficients induce clustering features. In the applications like image processing, the features of different clusters vary dramatically. However, all the atoms of dictionary jointly represent the features, regardless of clusters. This would reduce the accuracy of sparse representation. To address this problem, in this study, we develop the clustering K-SVD (CK-SVD) algorithm for DL and the corresponding greedy algorithm for sparse representation. The atoms are divided into a set of groups, and each group of atoms is employed to represent the image features of a specific cluster. Hence, the features of all clusters can be utilized and the number of redundant atoms are reduced. Additionally, two practical extensions of the CK-SVD are provided. Experimental results demonstrate that the proposed methods could provide more accurate sparse representation of images, compared to the conventional K-SVD and its existing extended methods. The proposed clustering DL model also has the potential to be applied to the online DL cases.<\/jats:p>","DOI":"10.1186\/s13634-019-0650-4","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T18:16:57Z","timestamp":1572027417000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Clustering K-SVD for sparse representation of images"],"prefix":"10.1186","volume":"2019","author":[{"given":"Jun","family":"Fu","sequence":"first","affiliation":[]},{"given":"Haikuo","family":"Yuan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0131-9542","authenticated-orcid":false,"given":"Rongqiang","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Luquan","family":"Ren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"issue":"6","key":"650_CR1","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/JPROC.2010.2040551","volume":"98","author":"R. Rubinstein","year":"2010","unstructured":"R. Rubinstein, A. M. Bruckstein, M. Elad, Dictionaries for sparse representation modeling. Proc. IEEE. 98(6), 1045\u20131057 (2010).","journal-title":"Proc. IEEE"},{"issue":"84","key":"650_CR2","first-page":"1","volume":"2016","author":"X. Lu","year":"2016","unstructured":"X. Lu, D. Wang, W. Shi, D. Deng, Group-based single image super-resolution with online dictionary learning. EURASIP J. Adv. Signal Process.2016(84), 1\u201312 (2016).","journal-title":"EURASIP J. Adv. Signal Process."},{"issue":"12","key":"650_CR3","first-page":"1","volume":"2018","author":"V. Naumova","year":"2018","unstructured":"V. Naumova, K. Schnass, Fast dictionary learning from incomplete data. EURASIP J. Adv. Signal Process.2018(12), 1\u201321 (2018).","journal-title":"EURASIP J. Adv. Signal Process."},{"issue":"3","key":"650_CR4","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1109\/TIP.2016.2516952","volume":"25","author":"L. Zhang","year":"2016","unstructured":"L. Zhang, W. Zuo, D. Zhang, LSDT: latent sparse domain transfer learning for visual adaptation. IEEE Trans. on Image Process.25(3), 1177\u20131191 (2016).","journal-title":"IEEE Trans. on Image Process."},{"issue":"2","key":"650_CR5","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.1016\/S0165-1684(00)00072-4","volume":"90","author":"K. Engan","year":"2000","unstructured":"K. Engan, S. O. Aase, J. H. Husy, Multi-frame compression: theory and design. EURASIP Signal Process.90(2), 2121\u20132140 (2000).","journal-title":"EURASIP Signal Process."},{"issue":"11","key":"650_CR6","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M. Aharon","year":"2006","unstructured":"M. Aharon, M. Elad, A. Bruckstein, The K-SVD: an algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process.54(11), 4311\u20134322 (2006).","journal-title":"IEEE Trans. Signal Process."},{"key":"650_CR7","first-page":"19","volume":"11","author":"J. Mairal","year":"2010","unstructured":"J. Mairal, F. Bach, J. Ponce, G. Sapiro, Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res.11:, 19\u201360 (2010).","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"650_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/LSP.2017.2657605","volume":"24","author":"B. Dumitrescu","year":"2017","unstructured":"B. Dumitrescu, P. Irofti, Regularized K-SVD. IEEE Signal Process. Lett.24(3), 309\u2013313 (2017).","journal-title":"IEEE Signal Process. Lett."},{"issue":"11","key":"650_CR9","doi-asserted-by":"publisher","first-page":"2059","DOI":"10.1109\/LSP.2015.2456071","volume":"22","author":"M. Nazzal","year":"2015","unstructured":"M. Nazzal, F. Yeganli, H. Ozkaramanli, A strategy for residual component-based multiple structured dictionary learning. IEEE Signal Process. Lett.22(11), 2059\u20132063 (2015).","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"650_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1109\/TBCAS.2013.2263459","volume":"8","author":"J. K. Pant","year":"2014","unstructured":"J. K. Pant, S. Krishnan, Compressive sensing of electrocardiogram signals by promoting sparsity on the second-order difference and by using dictionary learning. IEEE Trans. Biomed. Circuits Syst.8(2), 293\u2013302 (2014).","journal-title":"IEEE Trans. Biomed. Circuits Syst."},{"issue":"1","key":"650_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/LSP.2012.2229976","volume":"20","author":"L. N. Smith","year":"2013","unstructured":"L. N. Smith, M. Elad, Improving dictionary learning: multiple dictionary updates and coefficient reuse. IEEE Signal Process. Lett.20(1), 79\u201382 (2013).","journal-title":"IEEE Signal Process. Lett."},{"issue":"6","key":"650_CR12","doi-asserted-by":"publisher","first-page":"063013","DOI":"10.1117\/1.JEI.25.6.063013","volume":"25","author":"R. Zhao","year":"2016","unstructured":"R. Zhao, Q. Wang, Y. Shen, J. Li, Multidimensional dictionary learning algorithm for compressive sensing-based hyperspectral imaging. J. Electron. Imaging. 25(6), 063013 (2016).","journal-title":"J. Electron. Imaging"},{"issue":"4","key":"650_CR13","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.1109\/TSP.2010.2040671","volume":"58","author":"K. Skretting","year":"2010","unstructured":"K. Skretting, K. Engang, Recursive least squares dictionary learning algorithm. IEEE Trans. Signal Process.58(4), 2121\u20132130 (2010).","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"650_CR14","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J. A. Tropp","year":"2004","unstructured":"J. A. Tropp, Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory. 50(10), 2231\u20132242 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"650_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E. J. Cand\u00e8s","year":"2006","unstructured":"E. J. Cand\u00e8s, J. Romberg, T. Tao, Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory. 52(2), 489\u2013509 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"650_CR16","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E. J. Cand\u00e8s","year":"2005","unstructured":"E. J. Cand\u00e8s, T. Tao, Decoding by linear programming. IEEE Trans. Inf. Theory. 51(12), 4203\u20134215 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"650_CR17","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J. A. Tropp","year":"2007","unstructured":"J. A. Tropp, A. C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inf. Theory. 53(12), 4655\u20134666 (2007).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"650_CR18","first-page":"416","volume-title":"Proc. IEEE Int. Conf. Comput. Vis","author":"D. Martin","year":"2001","unstructured":"D. Martin, C. Fowlkes, D. Tal, J. Malik, in Proc. IEEE Int. Conf. Comput. Vis. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics (IEEEVancouver, 2001), pp. 416\u2013423."},{"issue":"4","key":"650_CR19","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D. L. Donoho","year":"2006","unstructured":"D. L. Donoho, Compressed sensing. IEEE Trans. Inf. Theory. 52(4), 1289\u20131306 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"650_CR20","first-page":"1433","volume":"3","author":"E. J. Cand\u00e8s","year":"2006","unstructured":"E. J. Cand\u00e8s, Compressive sampling. Int. Congress of Mathematicians, Madrid, Spain. 3:, 1433\u20131452 (2006).","journal-title":"Int. Congress of Mathematicians, Madrid, Spain"},{"issue":"1","key":"650_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/MAP.2015.2397092","volume":"57","author":"A. Massa","year":"2015","unstructured":"A. Massa, P. Rocca, G. Oliveri, Compressive sensing in electromagnetics - a review. IEEE Anten. Propag. Mag.57(1), 224\u2013238 (2015).","journal-title":"IEEE Anten. Propag. Mag."},{"issue":"2","key":"650_CR22","first-page":"539","volume":"19","author":"D. Craven","year":"2015","unstructured":"D. Craven, B. McGinley, L. Kilmartin, M. Glavin, E. Jones, Compressed sensing for bioelectric signals: a review. IEEE J. Biomed. Health Inf. 19(2), 539\u2013540 (2015).","journal-title":"IEEE J. Biomed. Health Inf"},{"key":"650_CR23","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1109\/ACCESS.2016.2569421","volume":"4","author":"Y. Zhang","year":"2016","unstructured":"Y. Zhang, L. Y. Zhang, et. al, A review of compressive sensing in information security field. IEEE Access. 4:, 2507\u20132519 (2016).","journal-title":"IEEE Access"},{"issue":"11","key":"650_CR24","doi-asserted-by":"publisher","first-page":"5693","DOI":"10.1109\/TSP.2010.2058802","volume":"58","author":"D. Nion","year":"2010","unstructured":"D. Nion, N. D. Sidiropoulos, Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar. IEEE Trans. Signal Process.58(11), 5693\u20134705 (2010).","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"650_CR25","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1109\/TIT.2009.2016006","volume":"55","author":"W. Dai","year":"2009","unstructured":"W. Dai, O. Milenkovic, Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans. Inf. Theory. 55(5), 2230\u20132249 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"650_CR26","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/TIT.2011.2173241","volume":"58","author":"D. L. Donoho","year":"2012","unstructured":"D. L. Donoho, Y. Tsaig, I. Drori, J. L. Starck, Sparse solution of underdetermined systems of linear equations by stagewise orthogonal matching pursuit. IEEE Trans. Inf. Theory. 58(2), 1094\u20131121 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"650_CR27","first-page":"403","volume-title":"Proc. IEEE Int. Conf. Digit. Signal Process","author":"L. Gan","year":"2007","unstructured":"L. Gan, in Proc. IEEE Int. Conf. Digit. Signal Process. Block compressed sensing of natural images (IEEEWales, 2007), pp. 403\u2013406."},{"key":"650_CR28","unstructured":"R. Rubinstein, M. Zibulevsky, M. Elad. Efficient Implementation of the K-SVD Algorithm Using Batch Orthogonal Matching Pursuit. Technical Report CS-2008-08 (Technion UniversityHaifa, 2008)."},{"issue":"1","key":"650_CR29","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/070697653","volume":"7","author":"J. Mairal","year":"2008","unstructured":"J. Mairal, G. Sapiro, M. Elad, Learning multi-scale sparse representations for image restoration. Multiscale Model. Simul.7(1), 214\u2013241 (2008).","journal-title":"Multiscale Model. Simul."},{"issue":"13","key":"650_CR30","doi-asserted-by":"publisher","first-page":"16267","DOI":"10.1007\/s11042-017-5198-4","volume":"77","author":"Y. Yi","year":"2018","unstructured":"Y. Yi, Y. Cheng, C. Xu, Visual tracking based on hierarchical framework and sparse representation. Multimed. Tools Appl.77(13), 16267\u201316289 (2018).","journal-title":"Multimed. Tools Appl."},{"key":"650_CR31","first-page":"10096","volume":"4","author":"S. Tariyal","year":"2016","unstructured":"S. Tariyal, A. Majumdar, R. Singh, M. Vatsa, Deep dictionary learning. Multimed. Tools Appl.4:, 10096\u201310109 (2016).","journal-title":"Multimed. Tools Appl."},{"issue":"12","key":"650_CR32","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"15","author":"M. Elad","year":"2006","unstructured":"M. Elad, M. Aharon, Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Process.15(12), 3736\u20133745 (2006).","journal-title":"IEEE Trans. Image Process."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-019-0650-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-019-0650-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-019-0650-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T23:10:54Z","timestamp":1603494654000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-019-0650-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,25]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1186\/s13634-019-0650-4","relation":{},"ISSN":["1687-6180"],"issn-type":[{"type":"electronic","value":"1687-6180"}],"subject":[],"published":{"date-parts":[[2019,10,25]]},"assertion":[{"value":"7 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This manuscript does not contain any individual person\u2019s data in any form.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"47"}}