Close category search window
 

Parallel ISODATA Clustering of Remote Sensing Images Based on MapReduce

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)
Bo Li ; Inst. of Software Eng., East China Normal Univ., Shanghai, China ; Hui Zhao ; Zhenhua Lv

The ISODATA clustering algorithm is regarded as a common method in the field of analyzing remote sensing images. It is very effective to generate a preliminary overview of images. These kinds of clustering methods are currently done in personal computers. However, with the development of remote sensing technology, the spatial resolutions are increasing rapidly and the sizes of the data are becoming larger. Clustering large amounts of images is considerably time-consuming in personal computers because of the limitation of both hardware and software resources. Researchers have developed many kinds of variants of the ISODATA algorithm executing in parallel, and most of them are implemented by using MPI. Generally, writing programs in MPI requires sophisticated skills of the user. Different with the former studies, we propose in this paper to parallel ISODATA clustering algorithm on Map Reduce, another parallel programming model that is very easy to use. The algorithm is mainly divided into two steps defined by the framework of Map Reduce, and they are detailed by pseudo-codes. To improve the accuracies of the color values, the color space CIELAB is used instead of RGB. The experiment results demonstrates that our proposed algorithm possess a robust scalability and the computational time substantially reduced through increasing the number of nodes and it may inspire new solutions of other similar problems.

Published in:
Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2010 International Conference on

Date of Conference: 10-12 Oct. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.