Abstract
Linear approaches to the problem of unsupervised data dimensionality reduction consist in finding a suitable set of factors, which is usually called dictionary, on the basis of which data can be represented as a linear combination of the dictionary elements. In recent years there have been relevant efforts for searching data representation which are based on sparse dictionary elements or a sparse linear combination of the dictionary elements. Here we investigate the possibility to combine the advantages of both sparse dictionary elements and sparse linear combination. Notably, we also impose a structure on the dictionary elements. We compare our algorithm with two other different approaches presented in literature which impose either sparse structured dictionary elements or sparse linear combination. These (preliminary) results suggests that our approach presents some promising advantages, in particular a greater possibility of interpreting the data representation.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Aharon, M., Elad, M., Bruckstein, A.: K-svd: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing 54(11), 4311–4322 (2006)
Basso, C., Santoro, M., Verri, A., Villa, S.: Paddle: Proximal algorithm for dual dictionaries learning (2010), CoRR, abs/1011.3728
Bredies, K., Lorenz, D.: Linear Convergence of Iterative Soft-Thresholding. J. Fourier Anal. Appl. 14(5-6), 813–837 (2008)
Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing 20(1), 33–61 (1998)
Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics 57(11), 1413–1457 (2004)
Engan, K., Aase, S.O., Hakon Husoy, J.: Method of optimal directions for frame design. In: Proc. of ICASSP 1999, vol. 5, pp. 2443–2446. IEEE Computer Society, Los Alamitos (1999)
Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning: Data Mining, Inference and Prediction, corrected edition. Springer, Heidelberg (2003)
Jenatton, R., Audibert, J.Y., Bach, F.: Structured variable selection with sparsity-inducing norms. Technical report, arXiv:0904.3523 (2009)
Jenatton, R., Obozinski, G., Bach, F.: Structured sparse principal component analysis. In: International Conference on AISTATS (2010)
Micchelli, C.A., Pontil, M.: Learning the kernel function via regularization. Journal of Machine Learning Research 6, 1099–1125 (2005)
Tropp, J.A.: Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50, 2231–2242 (2004)
Vinjamuri, R., Lee, H.N., Mao, Z.H.: Dimensionality reduction in control and coordination of the human hand. IEEE Trans. Biomed. Eng. 57(2), 284–295 (2010)
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T.S., Yan, S.: Sparse Representation for Computer Vision and Pattern Recognition. Proceedings of the IEEE 98(6), 1031–1044 (2010)
Zou, H., Hastie, T., Tibshirani, R.: Sparse Principal Component Analysis. Journal of Computational and Graphical Statistics 15 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tessitore, G., Prevete, R. (2011). Designing Structured Sparse Dictionaries for Sparse Representation Modeling. In: Burduk, R., Kurzyński, M., Woźniak, M., Żołnierek, A. (eds) Computer Recognition Systems 4. Advances in Intelligent and Soft Computing, vol 95. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20320-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-20320-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20319-0
Online ISBN: 978-3-642-20320-6
eBook Packages: EngineeringEngineering (R0)