Share Email Print
cover

Proceedings Paper

Possibilistic particle swarms for optimization
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We present a new approach for extending the particle swarm optimization algorithm to multi-optima problems by using ideas from possibility theory. An elastic constraint is used to let the particles dynamically explore the solution space in two phases. In the exploratory phase, particles explore the space in an effort to track the global minima while also traversing the local minima. In the exploitatory phase, particles disperse in the local neighborhoods to locate the best local minima. The proposed PPSO has been applied to data clustering and object detection. Our preliminary results indicate that the proposed approach is efficient and robust.

Paper Details

Date Published: 23 February 2005
PDF: 8 pages
Proc. SPIE 5673, Applications of Neural Networks and Machine Learning in Image Processing IX, (23 February 2005); doi: 10.1117/12.588353
Show Author Affiliations
Swarup Medasani, HRL Labs., LLC (United States)
Yuri Owechko, HRL Labs., LLC (United States)


Published in SPIE Proceedings Vol. 5673:
Applications of Neural Networks and Machine Learning in Image Processing IX
Nasser M. Nasrabadi; Syed A. Rizvi, Editor(s)

© SPIE. Terms of Use
Back to Top