By Topic

An Improved General Particle Swarm Optimization Algorithm for Fast Infrared Image Segmentation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ni Chao ; Southeast Univ., Nanjing ; Li Qi ; Xia Liangzheng

The method of infrared image segmentation based on 2-D maximum fuzzy partition entropy is a typical integer programming problem with huge searching space and many local optima. In order to realize fast infrared image segmentation, an improved general particle swarm optimization algorithm is proposed. The algorithm is based on general particle swarm optimization, and it makes use of adaptive balance searching strategy. When the evolution stops, simulated annealing algorithm is introduced to select the current global optimum to be chaotic optimized for the sake of enhancing local searching ability and overcoming premature convergence. Experiment shows that the algorithm can get segmentation parameters quickly and accurately to realize fast infrared image segmentation.

Published in:

Control Conference, 2007. CCC 2007. Chinese

Date of Conference:

July 26 2007-June 31 2007