A Fast Implementation of the ISOCLUS Algorithm

Nargess Memarsadeghi, David M. Mount, Nathan S. Netanyahu, Jacqueline Le Moigne

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

The efficiency of implementation of the ISOCLUS algorithms was analyzed. The analysis was based on the use of kd-tree data structure and filtering algorithms. The speed-ups in running times on synthetic clustered data and landsat image data ranged from 10 to 30 and 3 to 6 respectively.

Original languageEnglish
Pages2057-2059
Number of pages3
StatePublished - 2003
Event2003 IGARSS: Learning From Earth's Shapes and Colours - Toulouse, France
Duration: 21 Jul 200325 Jul 2003

Conference

Conference2003 IGARSS: Learning From Earth's Shapes and Colours
Country/TerritoryFrance
CityToulouse
Period21/07/0325/07/03

Fingerprint

Dive into the research topics of 'A Fast Implementation of the ISOCLUS Algorithm'. Together they form a unique fingerprint.

Cite this