From high definition image to low space optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6667 LNCS, Issue , 2012, Pages 459-470

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

^a TEL AVIV UNIVERSITY   (Israel)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

coresets; dictionary learning; K SVD; Sparsity

Indexed keywords

ACTIVE FIELD; COMPUTATIONAL APPROACH; COMPUTATIONAL TIME; CORE SET; DICTIONARY LEARNING; GAIN FACTORS; GEOMETRIC PROBLEMS; HIGH DEFINITION; K-SVD; LINEAR COMBINATIONS; NEW FORMS; NONUNIFORM SAMPLING; SIGNAL AND IMAGE PROCESSING; SPARSE REPRESENTATION; SPARSITY;

COMPUTER VISION; OPTIMIZATION;

ATOMS;

EID: 84855669298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24785-9_39     Document Type: Conference Paper

References (14)

1. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. Journal of the ACM 51(4), 606-635 (2004)
2. Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximations via coresets. Combinatorial and Computational Geometry - MSRI Publications 52, 1-30 (2005)
3. Aharon, M., Elad, M., Bruckstein, A.: K-SVD: An Algorithm for Designing Over-complete Dictionaries for Sparse Representation. IEEE Transactions on Signal Processing 54(11), 4311-4322 (2006)
4. Czumaj, A., Sohler, C.: Sublinear-time approximation algorithms for clustering via random sampling. Random Struct. Algorithms (RSA) 30(1-2), 226-256 (2007)
5. Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Processing 15(12), 3736-3745 (2006)
6. 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-26 (2007)
7. Feldman, D., Langberg, M.: A unified framework for approximating and clustering data (submitted, 2010) manuscript
8. 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)
9. Har-Peled, S.: Low rank matrix approximation in linear time (2006) manuscript
10. 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 15(2), 349-396 (2003)
11. 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. 5, IEEE, Los Alamitos (2005)
12. 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-44. IEEE, Los Alamitos (2002)
13. Rubinstein, R.: Technical report, http://www.cs.technion.ac.il/~ronrubin/ software/ksvdbox13.zip
14. Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16(2), 264-280 (1971)