Searching for the best matching atoms based on multi-swarm co-operative PSO

Authors:
Luoxia Liu;Bendu Bai
Affiliations:
Science and Technology on Electro-optic Control Laboratory, Luo Yang, China;School of Telecommunication and Information Engineering, Xi'an University of Posts and Telecommunications, Xi'an, China
Venue:
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Year:
2011

Citing 4
Cited 0

Robust Face Recognition via Sparse Representation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Closed-form MMSE estimation for signal denoising under sparse representation modeling over a unitary dictionary

IEEE Transactions on Signal Processing
Matching pursuits with time-frequency dictionaries

IEEE Transactions on Signal Processing
Blind Audiovisual Source Separation Based on Sparse Redundant Representations

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

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.