Skip to main content

Using Dynamic Multi-Swarm Particle Swarm Optimizer to Improve the Image Sparse Decomposition Based on Matching Pursuit

  • Conference paper
Intelligent Computing Theories and Technology (ICIC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7996))

Included in the following conference series:

Abstract

In this paper, with projection value being considered as fitness value, the Dynamic Multi-Swarm Particle Swarm Optimizer (DMS-PSO) is applied to improve the best atom searching problem in the Sparse Decomposition of image based on the Matching Pursuit (MP) algorithm. Furthermore, Discrete Coefficient Mutation (DCM) strategy is introduced to enhance the local searching ability of DMS-PSO in the MP approach over the anisotropic atom dictionary. Experimental results indicate the superiority of DMS-PSO with DCM strategy in contrast with other popular versions of PSO.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mallat, S.G., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Transactions on Signal Processing 41(12), 3397–3415 (1993)

    Article  MATH  Google Scholar 

  2. Davis, G., Mallat, S., Avellaneda, M.: Greedy adap-tive approximation. Journal of Constructive Approximation 13(1), 57–98 (1997)

    MathSciNet  MATH  Google Scholar 

  3. Gilbert, S., Muthukrishnan, M., Strauss, J.: Tropp: Improved sparse approximation over quasi-coherent dictionaries. In: Proceedings of IEEE International Conference on Image Processing, Barcelona, vol. 1, pp. 37–40 (2003)

    Google Scholar 

  4. Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Review 43(1), 129–159 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Figueras, Ventura, I., Pierre, V.: Matching Pursuit through Genetic Algorithms. Technical report, Ecublens (2001)

    Google Scholar 

  6. Shen, C.J., Wang, Y.M., Zhou, F.J., Sun, F.R.: Pipe defect sizing with matching pursuit based on modified dynamic differential evolution algorithm to recognize guided wave signal. In: 2011 10th International Conference on Electronic Measurement & Instruments (ICEMI), August 16-19, vol. 4, pp. 324–327 (2011)

    Google Scholar 

  7. Storn, R., Price, K.: Differential Evolution - a simple and efficient Heuristic for global optimization over continuous spaces. Journal Global Optimization 11, 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  8. Liang, J.J., Suganthan, P.N.: Dynamic multi-swarm particle swarm optimizer. In: Proceedings 2005 IEEE Swarm Intelligence Symposium, SIS 2005, June 8-10, vol. 129, pp. 124–129 (2005)

    Google Scholar 

  9. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (November/December 1995)

    Google Scholar 

  10. Sun, J., Feng, B., Xu, W.B.: Particle swarm optimization with particles having quantum behavior. In: Congress on Evolutionary Computation, CEC 2004, June 19-23, vol. 1, pp. 325–331 (2004)

    Google Scholar 

  11. Parsopoulos, K.E., Vrahatis, M.N.: UPSO - A unified particle swarm optimization scheme. Lecture Series on Computational Sciences, pp. 868–873 (2004)

    Google Scholar 

  12. Bergh, F.V.D., Engelbrecht, A.P.: A Cooperative Approach to Particle Swarm Optimization. IEEE Trans. Evol. Comput. 8, 225–239 (2004)

    Article  Google Scholar 

  13. Vandergheynst, P., Frossard, P.: Efficient image representation by anisotropic refinement in matching pursuit. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2001), vol. 3, pp. 1757–1760 (2001)

    Google Scholar 

  14. Shi, Y.H., Eberhart, R.: A modified particle swarm optimizer. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, May 4-9, pp. 69–73 (1998)

    Google Scholar 

  15. Niu, B., Wang, H., Chai, Y.J.: Bacterial Colony Optimization. Discrete Dynamics in Nature and Society, 1–28 (2012)

    Google Scholar 

  16. Niu, B., Fan, Y., Xiao, H., Xue, B.: Bacterial Foraging-Based Approaches to Portfolio Optimization with Liquidity Risk. Neurocomputing 98(3), 90–100 (2012)

    Article  Google Scholar 

  17. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation 10(3), 281–295

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, C., Liang, J.J., Qu, B.Y., Niu, B. (2013). Using Dynamic Multi-Swarm Particle Swarm Optimizer to Improve the Image Sparse Decomposition Based on Matching Pursuit. In: Huang, DS., Jo, KH., Zhou, YQ., Han, K. (eds) Intelligent Computing Theories and Technology. ICIC 2013. Lecture Notes in Computer Science(), vol 7996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39482-9_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39482-9_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39481-2

  • Online ISBN: 978-3-642-39482-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics