Abstract
Sparse signal decomposition can get sparse representation of signal. Given that the sparse decomposition has a large number of calculations and is almost impossible to meet the request of real time. A novel multi-swarm co-operative particle swarm optimization (PSO) algorithm to implement matching pursuit was developed, where multi-swarm was adopted to maintain the diversity of population, and the exploration ability of particle swarm optimization was elegantly combined with the exploitation of extremal optimization (EO) to prevent premature convergence. This method could reduce very time-consuming inner product times and improve decomposition accuracy in signal sparse decomposition, thereby, balancing very well search efficiency of time-frequency atoms and computer memory for storing the over-complete dictionary. The results of experiments indicated that the proposed algorithm can effectively speed up the convergence and lead to a preferable solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goyal, V.K., Fletcher, A.K., Rangan, S.: Compressive Sampling and Lossy Compression. Signal Processing 25, 48–56 (2008)
Protter, M., Yavneh, I., Elad, M.: Closed-Form MMSE Estimation for Signal Denoising Under Sparse Representation Modeling Over a Unitary Dictionary. Signal Processing 58, 3471–3484 (2010)
Llagostera Casanovas, A., Monaci, G., Vandergheynst, P., Gribonval, R.: Blind Audiovisual Source Separation Based on Sparse Redundant Representations. IEEE Transactions on Multimedia, 358–371 (2010)
Wright, J., Ganesh, A., Yang, A.Y., Ma, Y.: Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 31, 207–210 (2009)
Mallat, S., Zhang, Z.: Matching pursuit with time-frequency dictionaries. IEEE Trans. Signal Process. 41, 3397–3415 (1993)
Kennedy, J., Eberchart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)
El-Abd, M., Kamel, M.: Cooperative Particle Swarm Optimizers: A Power and Promising Approach. SCI, vol. 31, pp. 239–259. Springer, Heidelberg (2006)
Ruiz-Reyes, N., Vera-Candeas, P., Curpian-Alonso, J., Mata-Campos, R.: New matching pursuit-based algorithm for SNR improvement in ultrasonic NDT. NDT&E International 38, 453–458 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L., Bai, B. (2012). Searching for the Best Matching Atoms Based on Multi-swarm Co-operative PSO. In: Zhang, Y., Zhou, ZH., Zhang, C., Li, Y. (eds) Intelligent Science and Intelligent Data Engineering. IScIDE 2011. Lecture Notes in Computer Science, vol 7202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31919-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-31919-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31918-1
Online ISBN: 978-3-642-31919-8
eBook Packages: Computer ScienceComputer Science (R0)