{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:16:22Z","timestamp":1764173782699},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247842"},{"type":"electronic","value":"9783642247859"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-24785-9_39","type":"book-chapter","created":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T14:54:55Z","timestamp":1325429695000},"page":"459-470","source":"Crossref","is-referenced-by-count":8,"title":["From High Definition Image to Low Space Optimization"],"prefix":"10.1007","author":[{"given":"Micha","family":"Feigin","sequence":"first","affiliation":[]},{"given":"Dan","family":"Feldman","sequence":"additional","affiliation":[]},{"given":"Nir","family":"Sochen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"39_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. Journal of the ACM\u00a051(4), 606\u2013635 (2004)","journal-title":"Journal of the ACM"},{"key":"39_CR2","first-page":"1","volume":"52","author":"P.K. Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximations via coresets. Combinatorial and Computational Geometry - MSRI Publications\u00a052, 1\u201330 (2005)","journal-title":"Combinatorial and Computational Geometry - MSRI Publications"},{"issue":"11","key":"39_CR3","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. IEEE Transactions on Signal Processing\u00a054(11), 4311\u20134322 (2006)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1-2","key":"39_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/rsa.20157","volume":"30","author":"A. Czumaj","year":"2007","unstructured":"Czumaj, A., Sohler, C.: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms (RSA)\u00a030(1-2), 226\u2013256 (2007)","journal-title":"Random Struct. Algorithms (RSA)"},{"issue":"12","key":"39_CR5","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"15","author":"M. Elad","year":"2006","unstructured":"Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Processing\u00a015(12), 3736\u20133745 (2006)","journal-title":"IEEE Trans. Image Processing"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, D., Fiat, A., Segev, D., Sharir, M.: Bi-criteria linear-time approximations for generalized k-mean\/median\/center. In: Proc. 23rd ACM Symp. on Computational Geometry (SOCG), pp. 19\u201326 (2007)","DOI":"10.1145\/1247069.1247073"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data (submitted, 2010) manuscript","DOI":"10.1145\/1993636.1993712"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, D., Monemizadeh, M., Sohler, C.: A PTAS for k-means clustering based on weak coresets. In: Proc. 23rd ACM Symp. on Computational Geometry (SoCG), pp. 11\u201318 (2007)","DOI":"10.1145\/1247069.1247072"},{"key":"39_CR9","unstructured":"Har-Peled, S.: Low rank matrix approximation in linear time (2006) manuscript"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1162\/089976603762552951","volume":"15","author":"K. Kreutz-Delgado","year":"2003","unstructured":"Kreutz-Delgado, K., Murray, J.F., Rao, B.D., Engan, K., Lee, T.W., Sejnowski, T.J.: Dictionary learning algorithms for sparse representation. Neural Computation\u00a015(2), 349\u2013396 (2003)","journal-title":"Neural Computation"},{"key":"39_CR11","volume-title":"IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2005","author":"S. Lesage","year":"2005","unstructured":"Lesage, S., Gribonval, R., Bimbot, F., Benaroya, L.: Learning unions of orthonormal bases with thresholded singular value decomposition. In: IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2005, vol.\u00a05, IEEE, Los Alamitos (2005)"},{"key":"39_CR12","first-page":"40","volume-title":"1993 Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers","author":"Y.C. Pati","year":"2002","unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In: 1993 Conference Record of The Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, pp. 40\u201344. IEEE, Los Alamitos (2002)"},{"key":"39_CR13","unstructured":"Rubinstein, R.: Technical report, \n                    \n                      http:\/\/www.cs.technion.ac.il\/~ronrubin\/software\/ksvdbox13.zip"},{"issue":"2","key":"39_CR14","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications\u00a016(2), 264\u2013280 (1971)","journal-title":"Theory of Probability and its Applications"}],"container-title":["Lecture Notes in Computer Science","Scale Space and Variational Methods in Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24785-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T16:37:48Z","timestamp":1556037468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24785-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642247842","9783642247859"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24785-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}