An improved particle swarm optimisation for video image segmentation Online publication date: Sat, 27-Sep-2014
by Sheng-qiu Yi; Zhi-gao Zeng; Zhi-qiang Wen; Yan-hui Zhu; Wen-qiu Zhu
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 3, 2014
Abstract: Video image segmentation is the key step of objects classification and recognition. Threshold-based image segmentation algorithms, especially those based on the two-dimensional maximum entropy, have been studied by many scholars now. Although there are many algorithms that can get the entropy, they have their own weaknesses. For instances, the exhaustive search algorithm is time-consuming to implement the real-time image segmentation, the convergence rate of the traditional genetic algorithm is relatively slow, the standard particle swarm algorithm is prone to premature and difficult to get the optimal solution in the high-dimensional data space. In this paper, we proposed an improved particle swarm optimisation algorithm based on the law of universal gravitation to obtain the optimal entropy. Experimental results show that the improved algorithm is robust and obtain fast convergence rate.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook