CFP last date
20 December 2024
Reseach Article

Online Dictionary Learning using Biogeography-based Optimization for Sparse Representation

by Morteza Kolali Khormuji, Mehdi Sadeghzadeh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 101 - Number 4
Year of Publication: 2014
Authors: Morteza Kolali Khormuji, Mehdi Sadeghzadeh
10.5120/17672-8492

Morteza Kolali Khormuji, Mehdi Sadeghzadeh . Online Dictionary Learning using Biogeography-based Optimization for Sparse Representation. International Journal of Computer Applications. 101, 4 ( September 2014), 1-6. DOI=10.5120/17672-8492

@article{ 10.5120/17672-8492,
author = { Morteza Kolali Khormuji, Mehdi Sadeghzadeh },
title = { Online Dictionary Learning using Biogeography-based Optimization for Sparse Representation },
journal = { International Journal of Computer Applications },
issue_date = { September 2014 },
volume = { 101 },
number = { 4 },
month = { September },
year = { 2014 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume101/number4/17672-8492/ },
doi = { 10.5120/17672-8492 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:30:47.351756+05:30
%A Morteza Kolali Khormuji
%A Mehdi Sadeghzadeh
%T Online Dictionary Learning using Biogeography-based Optimization for Sparse Representation
%J International Journal of Computer Applications
%@ 0975-8887
%V 101
%N 4
%P 1-6
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Computational visual attention modeling is a topic of increasing importance in machine understanding of images. The model with the `-0 norm as constraint is an NP hard problem. How to find the global optimal solution is a difficult point of this area. For Biogeography-based optimization (BBO) is good at solving NP hard problem, a dictionary learning method based on it is proposed in this paper. Biogeography-based optimization (BBO) algorithm is a new category of optimization technique based on biogeography concept. This population-based algorithm uses the idea of the migration strategy of animals or other species for solving optimization problems. The samples are first classified randomly for generate original population and residual of approximate the sample class with a rank-1 matrix as habitat suitability index (HSI) is calculated. Then, select better individuals using league matches. After that new individuals are generated from migration operators and mutation and the residual of the representation is used as data samples for training the dictionary for the next layer. The experimental results show the algorithm are effective.

References
  1. H. Lee, A. Battle, R. Raina, A. Y. Ng, Efficient sparse coding algorithms, in: NIPS, NIPS, 2007, pp. 801-808.
  2. J. Mairal, F. Bach, J. Ponce, G. Sapiro, Online learning for matrix factorization and sparse coding, Journal of Machine Learning Research 11 (2010) 19-60.
  3. J. Sun, Q. Zhuo, C. Ma, W. Wang, Sparse image coding with clustering property and its application to face recognition, Pattern Recognition 34 (2001) 1883- 1884.
  4. G. Sivaram, S. Nemala, M. Elhilali, T. Tran, H. Hermansky, Sparse coding for speech recognition, in: Proceedings 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2010, Signal Process. Soc. , 2010, pp. 4346-4349.
  5. M. Zheng, J. Bu, C. Chen, C. Wang, L. Zhang, G. Qiu, D. Cai, Graph regularized sparse coding for image representation, IEEE Transactions on Image Processing 20 (5) (2011) 1327-1336.
  6. S. Avidan, "Ensemble tracking," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 29, no. 2, pp. 261-271, feb. 2007.
  7. B. Olshausen and D. Field, "Sparse coding with an overcomplete basis set: A strategy employed by vi" Vision research, vol. 37, no. 23, pp. 3311-3325, 1997.
  8. I. Ramirez, P. Sprechmann, and G. Sapiro, "Classification and clustering via dictionary learning with structured incoherence and shared features," in Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on, june 2010, pp. 3501 -3508.
  9. X. Mei and H. Ling, "Robust visual tracking and vehicle classification via sparse representation," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 33, no. 11, pp. 2259-2272, nov. 2011.
  10. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 31, no. 2, pp. 210-227, feb. 2009.
  11. R. Rigamonti, M. Brown, and Y. Lepetit, "Are sparse representations really relevant for image classification" in Computer Vision and Pattern Recognition (CVPR), 2011 IEEE Conference on, june 2011, pp. 1545-1552.
  12. R. Rubinstein, A. M. Bruckstein, and M. Elad, "Dictionaries for Sparse Representation Modeling," 2010. 98(6): p. 1045- 1057.
  13. M. Aharon, M. Elad, and A. Bruckstein, "k-svd: An algorithm for designing overcomplete dictionaries for sparse representation," Signal P rocessing, IEEE Transactions on, vol. 54, no. 11, pp. 4311-4322, nov. 2006.
  14. M. Aharon, M. Elad, and A. Bruckstein, "On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them," Linear Algebra and its Applications, vol. 416(1): pp. 48- 67,2006.
  15. D. Simon, Biogeography-based optimization, IEEE Transactions on Evolutionary Computation 12 (6) (2008) 702713.
  16. Minqiang Li, Jisong Kou, Basis theory of genetic algorithm and its application, 2002.
Index Terms

Computer Science
Information Sciences

Keywords

Biogeography-based optimization Sparse Representation Dictionary Learning