Analysis & Visualization of Multidimensional GIS Images Using Multi Objective Algorithm (MOA)
DOI:
https://doi.org/10.26438/ijcse/v6i8.460464Keywords:
Data Analysis, Cuckoo Search, Dragon Fly Optimization, Optimization, Levy flight, Visualization, K-Nearest NeighbourAbstract
Geographical data related to image processing, environmental monitoring and urban planning are beings collected and stored in various databases. Processing and managing these voluminous multidimensional data have become an important requirement and gained the researchers attention. For any application dealing with the multidimensional data analysis, efficient and effective data processing techniques are required to produce best results from these geographical data sets. The processing of these datasets in timed manner using appropriate techniques is the ultimate requirement while dealing with multidimensional data. There are number of optimization methods available but the Nature-inspired algorithms are among the most powerful algorithms for optimization. We proposed Multi Objective Algorithm (MOA) which is the combination of Dragon Fly (DF) Optimization and Cuckoo Search (CS) Algorithm for Visualization & Data Analysis of Geospatial database. We have compared the various parameters from MOA algorithm with the existing K-nearest neighbors (KNN) algorithm. Results indicate that the MOA algorithm is producing better output in term of classification compare to existing algorithm. Finally, the proposed algorithm provides a framework where image classification and interpretation can be possible for various types of GIS images
References
[1] F.S. Gharehchopogh, I. Maleki, S.R. Khaze, “A New Optimization Method for Dynamic Travelling Salesman Problem with Hybrid Ant Colony Optimization Algorithm and Particle Swarm Optimization”, International Journal of Advanced Research in Computer Engineering & Technology (IJARCET), Vol. 2, Issue 2, pp 352-358, February 2013.
[2] Xin-She Yang, Suash Deb, “Cuckoo Search via L ́evy Flights”, IEEE: pp 210-214, 2009.
[3] Ghodrati, A. and Lotfi, S. “A hybrid CS/PSO algorithm for global optimization”, in Intelligent Information and Database Systems, Lecture Notes in Computer Science, Vol. 7198, pp 89–98, Springer 2012.
[4] Pinar Civicioglu and Erkan Besdok, “A conceptual comparison of the Cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms”, © Springer Science+Business Media B.V.: pp 315-346, 2011.
[5] Ahmed, H. and Abdelhafid, H. “Cuckoo search optimization for linear antenna arrays synthesis”, Serbian Journal of Electrical Engineering, October, Vol. 10, No. 3, pp 371–380, 2013.
[6] Bhargava, V., Fateen, S. and Bonilla-Petriciolet, A. “Cuckoo search: a new nature-inspired optimization method for phase equilibrium calculations”, Fluid Phase Equilibria, Vol. 337, pp191–200, 2013.
[7] Cui Z, Alignment particle swarm optimization. In: Cognitive informatics, 2009. ICCI’09. 8th IEEE international conference on, pp 497–501, 2009.
[8] Reynolds CW, Flocks, herds and schools: a distributed behavioral model. ACM SIGGRAPH Comput Gr 21: pp25–34, 1987.
[9] Russell RW, May ML, Soltesz KL, Fitzpatrick JW Massive swarm migrations of dragonflies (Odonata) in eastern North America. Am Midl Nat 140: pp 325–342, 1998.
[10] J. Monteil, A. Beghdadi, New interpretation and improvement of the nonlinear anisotropic diffusion for image enhancement, IEEE Transactions on Pattern Analysis and Machine Intelligence 21(9) pp 940–946, 1999.
[11] K.Krissian, S. Aja-Fernandez, Noise-driven anisotropic diffusion filtering of MRI, IEEE Transactions on Image Processing, pp 2265–2274, 2009.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
