Learning big (image) data via coresets for dictionaries

Journal of Mathematical Imaging and Vision

Volumn 46, Issue 3, 2013, Pages 276-291

  Feldman, Dan ^a   Feigin, Micha ^b   Sochen, Nir ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Coresets; Dictionary learning; K SVD; Sparsity

Indexed keywords

APPROXIMATION ERRORS; COMPUTATIONAL APPROACH; CORE SET; DICTIONARY LEARNING; K-SVD; SIGNAL AND IMAGE PROCESSING; SPARSITY; TRADITIONAL APPROACHES;

APPROXIMATION ALGORITHMS; IMAGE PROCESSING;

COMPUTATIONAL GEOMETRY;

EID: 84879461502     PISSN: 09249907     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10851-013-0431-x     Document Type: Article

References (40)

1. Ackermann, M.R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., Sohler, C.: Streamkm++: a clustering algorithm for data streams. ACM J. Exp. Algorithmics 4, 2 (2012)
2. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606-635 (2004)
3. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximations via coresets. Comb. Comput. Geom. 52, 1-30 (2005). MSRI Publications
4. Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311-4322 (2006) (Pubitemid 44637761)
5. Aharon, M., Elad, M., Bruckstein, A.: K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311-4322 (2006) (Pubitemid 44637761)
6. Aharon, M., Elad, M., Bruckstein, A.M.: K-SVD and its non-negative variant for dictionary design. In: Proceedings of the SPIE conference wavelets, vol. 5914, p. 591411 (2005)
7. Bentley, J.L., Saxe, J.B.: Decomposable searching problems I. Static-to-dynamic transformation*1. J. Algorithms 1(4), 301-358 (1980)
8. Cesar, R.M., Costa, L.F.: Shape Analysis and Classification. CRC Press, Boca Raton (2001)
9. Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: 12th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 642-651 (2001)
10. 1-regression. In: 16th Annu. ACM-SIAM Symp. on Discrete algorithms (SODA), pp. 257-266 (2005)
11. p -regression. In: Proc. 19th Annu. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 932-941 (2008)
12. Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. In: 10th Int. Workshop on Randomization and Computation (RANDOM), pp. 292-303 (2006) (Pubitemid 44577539)
13. Dryden, I.L., Mardia, K.V.: Statistical Shape Analysis. Wiley, San Diego (1998)
14. Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Process. 15(12), 3736-3745 (2006) (Pubitemid 44811686)
15. Feldman, D., Fiat, A., Kaplan, H., Nissim, K.: Private coresets. In: Proc. 41st Annu. ACM Symp. on Theory of Computing (STOC), pp. 361-370 (2009)
16. Feldman, D., Fiat, A., Segev, D., Sharir, M.: Bi-criteria linear-time approximations for generalized k-mean/median/center. In: 23rd ACM Symp. on Computational Geometry (SOCG), pp. 19-26 (2007) (Pubitemid 47582036)
17. Feldman, D., Fiat, A., Sharir, M.: Coresets for weighted facilities and their applications. In: Proc. 47th IEEE Annu. Symp. on Foundations of Computer Science (FOCS), pp. 315-324 (2006) (Pubitemid 351175520)
18. Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: Proc. 41th Ann. ACM Symp. on Theory of Computing (STOC) (2010). Full version in arXiv:1106.1379
19. Feldman, D., Monemizadeh, M., Sohler, C.: A PTAS for k-means clustering based on weak coresets. In: 23rd ACM Symp. on Computational Geometry (SoCG), pp. 11-18 (2007) (Pubitemid 47582035)
20. 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-18 (2007) (Pubitemid 47582035)
21. Feldman, D., Schulman, L.J.: Data reduction for weighted and outlier-resistant clustering. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1343-1354. SIAM, Philadelphia (2012)
22. Feldman, D., Faulkner, M., Krause, A.: Scalable training of mixture models via coresets. In: Proc. Neural Information Processing Systems (NIPS) (2011)
23. Frahling, G., Sohler, C.: A fast k-means implementation using coresets. In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, pp. 135-143. ACM, New York (2006) (Pubitemid 44300781)
24. Har-Peled, S., Kushal, A.: Smaller coresets for k-median and k-means clustering. Discrete Comput. Geom. 37(1), 3-19 (2007)
25. Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: 36th Annu. ACM Symp. on Theory of Computing (STOC), pp. 291-300 (2004)
26. Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proc. 36th Annu. ACM Symp. on Theory of Computing (STOC), pp. 291-300 (2004)
27. Haussler, D.: Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inf. Comput. 100(1), 78-150 (1992)
28. Kreutz-Delgado, K., Murray, J.F., Rao, B.D., Engan, K., Lee, T.W., Sejnowski, T.J.: Dictionary learning algorithms for sparse representation. Neural Comput. 15(2), 349-396 (2003) (Pubitemid 37049825)
29. Langberg, M., Schulman, L.J.: Universal ε approximators for integrals. In: proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA) (2010)
30. Lesage, S., Gribonval, R., Bimbot, F., Benaroya, L.: Learning unions of orthonormal bases with thresholded singular value decomposition. In: Acoustics, Speech, and Signal Processing. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'05), vol. 5. IEEE, New York (2005)
31. Li, Y., Long, P.M., Srinivasan, A.: Improved bounds on the sample complexity of learning. J. Comput. Syst. Sci. 62 (2001)
32. Li, Y., Long, P.M., Srinivasan, A.: Improved bounds on the sample complexity of learning. In: Symp. on Discrete Algorithms, pp. 309-318 (2000) (Pubitemid 30549274)
33. Mulmuley, K.: Computational Geometry, an Introduction through Randomized Algorithms. Prentice Hall, New York (1993)
34. Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Signals, Systems and Computers. 1993 Conference Record of the Twenty-Seventh Asilomar Conference on, pp. 40-44. IEEE, New York (2002)
35. Rubinstein, R.: Ksvd-box v13. Technical report
36. Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York (1995)
37. Shawe-Taylor, J., Bartlett, P.L., Williamson, R.C., Anthony, M.: Structural risk minimization over data-dependent hierarchies. IEEE Trans. Inf. Theory 44(5), 1926-1940 (1998) (Pubitemid 128738561)
38. Shen, B., Hu, W., Zhang, Y., Zhang, Y.J.: Image inpainting via sparse representation. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2009), pp. 697-700. IEEE, New York (2009)
39. Vainsencher, D., Mannor, S., Bruckstein, A.M.: The sample complexity of dictionary learning. Arxiv preprint (2010). arXiv:1011.5395
40. Varadarajan, K., Xiao, X.: A near-linear algorithm for projective clustering integer points. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'12, pp. 1329-1342. SIAM, Philadelphia (2012)