Quasi-Based Hierarchical Clustering for Land Cover Mapping Using Satellite Images

This paper presents an improved hierarchical clustering algorithm for land cover mapping problem using quasi-random distribution. Initially, Niche Particle Swarm Optimization (NPSO) with pseudo/quasi-random distribution is used for splitting the data into number of cluster centers by satisfying Bayesian Information Criteria (BIC). Themain objective is to search and locate the best possible number of cluster and its centers. NPSO which highly depends on the initial distribution of particles in search space is not been exploited to its full potential. In this study, we have compared more uniformly distributed quasi-random with pseudo-random distribution with NPSO for splitting data set. Here to generate quasi-random distribution, Faure method has been used. Performance of previously proposed methods namely K-means, Mean Shift Clustering (MSC) and NPSO with pseudo-random is compared with the proposed approach - NPSO with quasi distribution(Faure). These algorithms are used on synthetic data set and multi-spectral satellite image (Landsat 7 thematic mapper). From the result obtained we conclude that use of quasi-random sequence with NPSO for hierarchical clustering algorithm results in a more accurate data classification.

[1]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[3]  G. Schwarz Estimating the Dimension of a Model , 1978 .

[4]  H. Niederreiter Quasi-Monte Carlo methods and pseudo-random numbers , 1978 .

[5]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[6]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[7]  Silvio Galanti,et al.  Low-Discrepancy Sequences , 1997 .

[8]  Konstantinos E. Parsopoulos,et al.  PARTICLE SWARM OPTIMIZER IN NOISY AND CONTINUOUSLY CHANGING ENVIRONMENTS , 2001 .

[9]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

[10]  R. Brits,et al.  Solving systems of unconstrained equations using particle swarm optimization , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[11]  David A. Landgrebe,et al.  Hyperspectral Image Data Analysis as a High Dimensional Signal Processing Problem , 2002 .

[12]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Frans van den Bergh,et al.  A NICHING PARTICLE SWARM OPTIMIZER , 2002 .

[14]  David A. Landgrebe,et al.  Hyperspectral image data analysis , 2002, IEEE Signal Process. Mag..

[15]  Tao Jiang,et al.  The Regularized EM Algorithm , 2005, AAAI.

[16]  Shuhei Kimura,et al.  Genetic algorithms using low-discrepancy sequences , 2005, GECCO '05.

[17]  Nguyen Xuan Hoai,et al.  Initialising PSO with randomised low-discrepancy sequences: the comparative results , 2007, 2007 IEEE Congress on Evolutionary Computation.

[18]  Narasimhan Sundararajan,et al.  A sequential multi-category classifier using radial basis function networks , 2008, Neurocomputing.

[19]  V. Mani,et al.  Multi-spectral satellite image classification using Glowworm Swarm Optimization , 2011, 2011 IEEE International Geoscience and Remote Sensing Symposium.

[20]  V. Mani,et al.  Clustering using firefly algorithm: Performance study , 2011, Swarm Evol. Comput..

[21]  Jacek M. Zurada,et al.  Swarm and Evolutionary Computation , 2012, Lecture Notes in Computer Science.

[22]  V. Mani,et al.  Hierarchical Clustering Algorithm for Land Cover Mapping Using Satellite Images , 2012, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[23]  Sheldon M. Ross Chapter 3 – Random Numbers , 2013 .