Segmentation and Classification using Heuristic HRSPSO

  • Behera H
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a Heuristic Hybrid Rough Set Particle Swarm optimization (HRSPSO) Algorithm is proposed for partitioning a digital image into different segments that is more meaningful and easier to analyze segmentation and Classification. The heuristic HRSPSO algorithm has been implemented with a novel method in MATLAB platform considering 50 iterations and 20 particles. The experimental study and performance evaluation show that Heuristic HRSPSO optimization Algorithm is observed to be having optimal solution with smallest DB (Davies-Bouldin) index and it converges after fifteenth iterations.

Cite

CITATION STYLE

APA

Behera, H. S. (2011). Segmentation and Classification using Heuristic HRSPSO. International Journal of Soft Computing and Engineering (IJSCE), 1(3), 66–69. Retrieved from https://pdfs.semanticscholar.org/02e5/80ead9b3852ee05631c4d41f5069cf7d1c63.pdf

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