Multilevel thresholding method based on aggressive particle swarm optimization

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The multilevel thresholding problem based on Otsu criterion is examined in this paper. The problem is the computational time of Otsu method increases exponentially according to number of thresholds dimension. A new variant of PSO namely AgPSO is proposed. The contribution to the original PSO is highlighted by introducing an aggressive behavior to the movement rule. The proposed algorithm performance was evaluated based on three natural images. The experimental results showed the proposed PSO variant was more efficient according to other PSO variants. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Akbar, H., Suryana, N., & Sahib, S. (2011). Multilevel thresholding method based on aggressive particle swarm optimization. In Communications in Computer and Information Science (Vol. 179 CCIS, pp. 747–757). https://doi.org/10.1007/978-3-642-22170-5_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free