KFCE: A dictionary generation algorithm for sparse representation

Signal Processing

Volumn 89, Issue 10, 2009, Pages 2072-2077

  Xie, Zongbo ^a   Feng, Jiuchao ^a  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Dictionary generation; Kernel fuzzy codebook estimation; Sparse representation

Indexed keywords

CODEBOOK; DICTIONARY GENERATION; GENERATION ALGORITHM; KERNEL FUZZY CODEBOOK ESTIMATION; KERNEL TRICK; LINEAR COMBINATIONS; OVERCOMPLETE DICTIONARIES; REAL IMAGE DATA; SPARSE REPRESENTATION;

ATOMS; CLUSTERING ALGORITHMS; ESTIMATION; VECTOR QUANTIZATION;

FUZZY CLUSTERING;

EID: 67349161881     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2009.04.001     Document Type: Article

References (19)

1. Donoho D.L., Elad M., and Temlyakov V. Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inf. Theory 52 1 (2006) 6-18
2. Akcakaya M., and Tarokh V. Performance of sparse representation algorithms using randomly generated frames. IEEE Signal Process. Lett. 14 11 (2007) 777-780
3. Mitianoudis N., and Stathaki T. Overcomplete source separation using Laplacian mixture models. IEEE Signal Process. Lett. 12 4 (2005) 277-280
4. Chartrand R. Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14 10 (2007) 707-710
5. Mallat S., and Zhang Z. Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41 12 (1993) 3397-3415
6. Tropp J.A. Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50 10 (2004) 2231-2242
7. Chen S.S., Donoho D.L., and Saunders M.A. Atomic decomposition by basis pursuit. SIAM Rev. 43 1 (2001) 129-159
8. Rao B.D., and Kreutz-Delgado K. An affine scaling methodology for best basis selection. IEEE Trans. Signal Process. 47 1 (1999) 187-200
9. Lewicki M.S., and Olshausen B.A. A probabilistic framework for the adaptation and comparison of image codes. J. Opt. Soc. Am. A 16 7 (1999) 1587-1601
10. Engan K., Aase S.O., and Husoy J.H. Multi-frame compression: theory and design. Signal Processing 80 10 (2000) 2121-2140
11. Delgado K.K., Murray J.F., Rao B.D., Engan K., Lee T., and Sejnowski T.J. Dictionary learning algorithms for sparse representation. Neural Comput. 15 2 (2003) 349-396
12. Lesage S., Gribonval R., Bimbot F., and Benaroya L. Learning unions of orthonormal bases with thresholded singular value decomposition. IEEE International Conference on Acoustics, Speech, Signal Processing vol. 5 (2005) 293-296
13. Aharon M., Elad M., and Bruckstein A. K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54 11 (2006) 4311-4322
14. Muller K.R., Mika S., Ratsch G., Tsuda K., and Scholkopf B. An introduction to kernel-based learning algorithms. IEEE Trans. Neural Network 12 2 (2001) 181-202
15. Girolami M. Mercer kernel-based clustering in feature space. IEEE Trans. Neural Network 13 3 (2002) 780-784
16. Aronszajn N. Theory of reproducing kernels. Trans. Am. Math. Soc. 68 3 (1950) 337-404
17. Sim T., Baker S., and Bsat M. The CMU pose, illumination, and expression database. IEEE Trans. Pattern Anal. Mach. Intell. 25 12 (2003) 1615-1618
18. Hjelmas E., and Low B.K. Face detection: a survey. Comput. Vision Image Understanding 83 3 (2001) 236-274
19. Nocedal J., and Wright S.J. Numerical Optimization. second ed. (2006), Springer, Berlin