Novel KNN-motivation-PSO and its application to image segmentation

  • Authors:
  • Madhumita Kedlaya;Harsha Bhatia;S. Ramachandran;K. Manikantan

  • Affiliations:
  • M S Ramaiah Institute of Technology, Bangalore, India;M S Ramaiah Institute of Technology, Bangalore, India;S J B Institute of Technology, Bangalore, India;M S Ramaiah Institute of Technology, Bangalore, India

  • Venue:
  • Proceedings of the CUBE International Information Technology Conference
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle Swarm Optimization (PSO), limited by the Exploration-Exploitation balance problem is challenging. Exploring more search space and fast convergence is an effective approach to solve this problem. In this paper, we propose a novel PSO algorithm called K-Nearest-Neighbour Motivation PSO, KNN-M-PSO, which provides a promising solution to this problem. KNN-M-PSO is a cascade of K-Nearest-Neighbour algorithm, a motivation factor and the basic PSO. This algorithm has been tested on standard benchmark functions and a real world image segmentation problem. It is used to find the optimum values of thresholds for an image, based on Tsallis Entropy method. The method gives better results in terms of increased objective values and PSNR values when compared with the basic PSO and other optimization algorithms such as Genetic Algorithm and Bacterial Foraging Algorithm.