By Topic

An efficient method to find area clusters with constraints using grid index structure

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
$33 $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

4 Author(s)
Kwang-Su Yang ; Sch. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Ruixin Yang ; Jiang Tang ; Kafatos, M.

This work presents an efficient method to find area clusters satisfying certain constraints. The method uses a grid index structure to find them by examining five cell, 8-connected neighborhood. The hierarchical clustering technique is applied for preprocessing the grid with similar value distribution into the same clusters. This preprocessing helps reduce the computational time and eliminate the possible outlier grid cells. The constraints are average value range, minimum area size and minimum missing data ratio. The method is implemented for a remote sensing data, MOD08_M3, which is MODIS (MODerate resolution Imaging Spectroradiometer) level 3 monthly atmospheric product.

Published in:

Scientific and Statistical Database Management, 2004. Proceedings. 16th International Conference on

Date of Conference:

21-23 June 2004